Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. - Pawan Aurora; Sumit Singh 002; Shashank K. Mehta (FAW-AAIM, 2013)

Completely Positive formulation of the Graph Isomorphism Problem - Shashank K. Mehta; Pawan Aurora (CoRR, 2013)

A Geometric Approach to Graph Isomorphism. - Pawan Aurora; Shashank K. Mehta (ISAAC, 2014)

Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. - Pawan Aurora; Sumit Singh 002; 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 001 (J. Comb. Optim., 2018)

The QAP-polytope and the graph isomorphism problem. - Pawan Aurora; Shashank K. Mehta (J. Comb. Optim., 2018)

On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope. - Pawan Aurora; Hans Raj Tiwary (COCOA, 2020)

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. - Pawan Aurora; Shashank K. Mehta (J. Comb. Optim., 2020)