For a full list of publications, please see Google Scholar. Here I list some publications by research area.
My Erdos number is 3, as for the following collaborations: DV -- Anuj Dawar -- Laszlo Babai -- Paul Erdos as well as DV -- Andrei Krokhin -- Pavol Hell -- Paul Erdos.
Complexity of constraint satisfaction problems. Specifically, promise CSPs - an area ripe for discovery for researchers from all realms, with enthusiasm and creativity being the main requirements.
Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard, with Krokhin, A.Â
Graph isomorphism & group isomorphism. I started my PhD the year Laci Babai announced the quasi-polynomial time algorithm for graph isomorphism, so by some touch of fate, this topic has become my passion, obsession, curse... you name it.
Generalisations of higher dimensional Weisfeiler-Leman stabilisation, with Dawar, A. (Combinatorics and Number Theory)
On the relative power of linear algebraic approximations of graph isomorphism, with Dawar, A. (Mathematical Foundations of Computer Science 2021, Tallin)
A parallel between the descriptive complexities of finite groups and Latin Square graphs, with Dawar, A. (Discrete Mathematics Days 2022, Santander)
Variations on the Theme of Higher Dimensional Weisfeiler-Leman Algorithms, my PhD thesis.
Three hardness results for graph similarity problems, with Sun, H. (Discrete Mathematics and Theoretical Computer Science, also presented at EUROCOMB 2025, Budapest)