Department of Electrical Engineering and Computer Science,

410, Academic Building I

IISER Bhopal

Phone: (O) +91-755-269-1285

- Graph Algorithms
- Combinatorial Optimization

- ECS 202: Data Structures and Algorithms, Semester-II, 2018-19.
- ECS 407/607: Approximation Algorithms, Semester-I, 2018-19.
- ECS 304: Data Structures and Algorithms, Semester-II, 2017-18.
- ECS 411: Algorithms, Semester-I, 2017-18.
- ECS 304/MTH 307: Data Structures and Algorithms, Semester-II, 2016-17.
- CS 101: Introduction to Computers, Semester-I, 2016-17.

- The QAP-polytope and the graph isomorphism problem. With Shashank K. Mehta. Journal of Combinatorial Optimization, Volume 36(3): 965-1006, 2018. (Special issue of ISCO 2016)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. With Monalisa Jena and Rajiv Raman. Journal of Combinatorial Optimization, Volume 36(4): 1243-1261, 2018.
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem. With Monalisa Jena and Rajiv Raman. Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA 2016), Hong Kong, China, December 16-18, 2016.
- Partial Degree Bounded Edge Packing Problem for Graphs and
*k*-Uniform Hypergraphs. With Sumit Singh and Shashank K. Mehta. Journal of Combinatorial Optimization, Volume 32(1): 159-173, 2016. - A Geometric Approach to Graph Isomorphism. With Shashank K. Mehta. Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Jeonju, Korea, December 15-17, 2014.
- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. With Sumit Singh and Shashank K. Mehta. Proceedings of the third Joint International Conference (FAW-AAIM 2013), Dalian, China, June 26-28, 2013.

- Eigenvalues and Eigenvectors of the Matrix of Permutation Counts. With Shashank K. Mehta. Arxiv
- Completely Positive Formulation of the Graph Isomorphism Problem. With Shashank K. Mehta. Arxiv

- Approximation Algorithms for the Partial Degree Bounded Edge Packing Problem. Short Term Training Program on Discrete Mathematical Structures, MANIT, Bhopal, October 2016.
- Second-order Birkhoff Polytope and the Problem of Graph Isomorphism Detection. PhD-Thesis Defense. Department of CSE, IIT Kanpur, December 2015.
- A Geometric Approach to Graph Isomorphism. ISAAC 2014, Jeonju, Korea, December 2014.
- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. FAW-AAIM 2013, Dalian, China, June 2013.
- Coloring 3-colorable Graphs. Sate-of-the-art Seminar, Department of CSE, IIT Kanpur, September 2010.
- Hashing. Comprehensive Examination, Department of CSE, IIT Kanpur, March 2009.

- PhD, IIT Kanpur, Department of Computer Science and Engineering, 2015

Thesis: Second-order Birkhoff Polytope and the Problem of Graph Isomorphism Detection - MS, University of Florida, Gainesville, Department of Computer and Information Science and
Engineering, 2007

Thesis: Multi-level Graph Partitioning