Publications

1. Succinct preferential attachment graphs (with Ziad Ismaili Alaoui and Sebastian Wild) WG 2025

2. Simple Approximation Algorithms for Polyamorous Scheduling (with Sebastian Wild, Yuriy Biktairov, Benjamin Smith, Wanchote Po Jiamjitrak and Leszek Gasieniec) SOSA 2025

3. Kneser graphs are Hamiltonian [Preprint] [Video] [Animation] (with Torsten Mütze and Arturo Merino)  

For integers k ≥ 1 and n ≥ 2k + 1, the Kneser graph K(n, k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle, with one notable exception, namely the Petersen graph K(5, 2). The main contribution of this paper is to prove the conjecture in full generality. 

To appear in  Advances in Mathematics

Extended abstract in Proceedings of the 55th Annual ACM Symposium on the Theory of Computing (STOC 2023), 963-970.

Extended abstract in Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2023), 731-739

4. Combinatorial generation via permutation languages. VI. Binary trees [Preprint] [Code] (with Torsten Mütze and Petr Gregor)  

To appear in European Journal of Combinatorics 

Extended abstract in Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023), 19 pp.

5. Hamiltonicity of Schrijver graphs and stable Kneser graphs [Preprint] [Code] (with Torsten Mütze)  

To appear in European Journal of Combinatorics 

6. On the hardness of Gray Code Problems for Combinatorial Objects [Preprint] (with Arturo Merino and Aaron Williams)

Extended abstract in Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)  

7. Fairness of Linear Regression in Decision Making (with Vincent Cohen-Addad, Karthik C.S., Surya Teja Gavva, Claire Mathieu)

To appear in International Journal of Data Science and Analytics                                                            

Theses

1. Hamiltonicity in Flip Graphs: Set Systems, Pattern Avoidance, and Hardness, PhD Thesis, University of Warwick, 2024

2. Study of Efficient Search via Quantum Walks, Master's thesis, Chennai Mathematical Institute, 2020