Skip to main content Skip to navigation

Namrata .

About Me

I am a PhD student in the Division of Theory and Foundations (FoCS) and the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. I am fortunate to be advised by Dr. Torsten M├╝tze. My research is supported by the Chancellor's International Scholarship 2020.

Before joining Warwick, I graduated with a MSc degree in Theoretical Computer Science from Chennai Mathematical InstituteLink opens in a new window, India, where I was advised by Dr. Partha Mukhopadhyay. During my masters, I was also a research intern at Sorbonne University, Paris, where I was advised by Dr. Vincent Cohen-Addad.


I'm broadly interested in enumerative combinatorics and computational complexity. My current research include studying Hamiltonicity in vertex-transitive graphs and exhaustive generation of objects in a Gray code order. I like to study generation problems from the lens of complexity. I am also interested in pattern-avoidance in different combinatorial objects and proving bijections between them.

  1. Kneser graphs are Hamiltonian (arXiv)

Talks, conferences, and workshops

1. Talk : On Hamilton cycles in Kneser graphs

2. Talk : Exhaustive generation of Pattern-avoiding binary trees.

3. Guest researcher (Charles University, host : Petr Gregor, Dec 2022)

4. Workshop : 'Combinatorics, Algorithms, and Geometry' (Sep 2022)

5. Workshop : 'Combinatorics, Algorithms, and Geometry' (Aug 2021)

6. Summer school : Foundations and Frontiers of Probabilistic Proofs (Jul-Aug 2021)

7. Conferences : WEPA 22, BECMC 22, BCC 22, HALG 22, BECMC 21, BCC 21, SODA 21





  • CS254-15 Algorithmic Graph Theory (Associate Tutor and marker)



namrata at warwick dot ac dot uk

Office : CS 2.18, Department of Computer Science