Pawan Aurora

11 papers B 1C 2Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2020 J jnl
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation.
J. Comb. Optim.
Pawan Aurora, Shashank K. Mehta
2020 C conf
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope.
COCOA
Pawan Aurora, Hans Raj Tiwary
2020 J jnl
On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope.
CoRR
Pawan Aurora, Hans Raj Tiwary
2018 J jnl
Constant factor approximation for the weighted partial degree bounded edge packing problem.
J. Comb. Optim.
Pawan Aurora, Monalisa Jena, Rajiv Raman
2018 J jnl
The QAP-polytope and the graph isomorphism problem.
J. Comb. Optim.
Pawan Aurora, Shashank K. Mehta
2016 C conf
Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem.
COCOA
Pawan Aurora, Monalisa Jena, Rajiv Raman
2016 J jnl
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs.
J. Comb. Optim.
Pawan Aurora, Sumit Singh, Shashank K. Mehta
2014 B conf
A Geometric Approach to Graph Isomorphism.
ISAAC
Pawan Aurora, Shashank K. Mehta
2013 J jnl
Completely Positive formulation of the Graph Isomorphism Problem
CoRR
Shashank K. Mehta, Pawan Aurora
2013 — conf
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.
FAW-AAIM
Pawan Aurora, Sumit Singh, Shashank K. Mehta
2012 J jnl
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
CoRR
Pawan Aurora, Sumit Singh, Shashank K. Mehta