Pawan Aurora

According to our database, Pawan Aurora authored at least 8 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation.

Pawan Aurora, Shashank K. Mehta

J. Comb. Optim., 2020

On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope.

Pawan Aurora, Hans Raj Tiwary

Proceedings of the Combinatorial Optimization and Applications, 2020

2018

The QAP-polytope and the graph isomorphism problem.

Pawan Aurora, Shashank K. Mehta

J. Comb. Optim., 2018

2016

Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs.

Pawan Aurora, Sumit Singh, Shashank K. Mehta

J. Comb. Optim., 2016

Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem.

Pawan Aurora, Monalisa Jena, Rajiv Raman

Proceedings of the Combinatorial Optimization and Applications, 2016

2014

A Geometric Approach to Graph Isomorphism.

Pawan Aurora, Shashank K. Mehta

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Completely Positive formulation of the Graph Isomorphism Problem

Shashank K. Mehta, Pawan Aurora

CoRR, 2013

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.

Pawan Aurora, Sumit Singh, Shashank K. Mehta

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013