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 an 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 master's, I was also a research intern at Sorbonne University, Paris, where I was advised by Dr. Vincent Cohen-Addad.

Research

I'm broadly interested in combinatorics and computational complexity. My current research focuses on Hamiltonicity in vertex-transitive graphs and the exhaustive generation of various combinatorial objects in Gray code order. I am interested in studying such generation problems from a computational complexity perspective. I am also fascinated by patterns in objects like permutations, lattice paths, set partitions, trees, etc.

Publications

1. Kneser graphs are Hamiltonian

 Arturo MerinoLink opens in a new window, Torsten Mütze, and Namrata (STOC 2023, EUROCOMB 2023, arXiv)

2. Pattern-avoiding binary trees-generation, counting, and bijections

 Petr Gregor, Torsten Mütze, and Namrata (ISAAC 2023, arXiv)

3. Fairness of Linear Regression in Decision Making

 Vincent Cohen-Addad, Karthik C. S., Surya Teja Gavva, Claire Mathieu, and Namrata

To appear in International Journal of Data Science and Analytics 

Talks, conferences, and workshops

Talk: Kneser graphs are Hamiltonian

• Scottish combinatorial meeting (May 2023)
• STOC (June 2023)
• University of Birmingham, Combinatorics seminar (invited speaker, Oct 2023)
• Queen Mary, University of London, Combinatorics seminar ( invited speaker, Oct 2023)

Talk: On Hamilton cycles in Kneser graphs K(n, k) when n is prime.

• WPCCS (Dec 2021)
• British Early Career Mathematicians' Colloquium (Jul 2021)
• British Combinatorial Conference (Jul 2021)

• FoCS Theory DayLink opens in a new window (organizer) (Jun 2021)

Talk: Exhaustive generation of Pattern-avoiding binary trees.

• British Combinatorial Conference (Jul 2022)
• Permutation Patterns (Jun 2022)
• FoCS Theory Day (May 2022)

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

Structural Graph Theory Bootcamp (Sep 2023)

Workshop: 'Combinatorics, Algorithms, and Geometry' (Sep 2022, Aug 2021)

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

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

Teaching

2023/24:

• CS260 Algorithms
• CS130Link opens in a new window Mathematics for Computer Scientists 1

2022/23:

• CS260 Algorithms
• CS262Link opens in a new window Logic and Verification

2021/22:

• CS260 Algorithms
• CS419Link opens in a new window Quantum Computing

2020/21:

• CS254-15 Algorithmic Graph Theory

Links

• A=BLink opens in a new window

namrata at warwick dot ac dot uk

Office : CS 2.18, Department of Computer Science