Preprints:
Flip-packability: uniform characterisations of tame graph claseses [arXiv]
Submitted.
Publications:
Model-theoretic aspects of structural and algorithmic graph theory [DOI]
PhD Thesis, University of Cambridge, 2026.
Separability properties of monadically dependent graph claseses [arXiv, DOI]
(with Édouard Bonnet. Sam Braunfeld, Colin Genniet, Nikolas Mählmann, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk)
Proceedings of the 52nd International Colloquium on Automata, Languages and Programming (ICALP 2025).
Extension preservation on dense graph classes [arXiv, DOI]
Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025).
Winner of the Helena Rasiowa Award.
Preservation theorems on sparse classes revisited [arXiv, DOI]
(with Anuj Dawar)
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024),
Invited to special issue of Information and Computation.
First-order model checking on monadically stable graph classes [arXiv, DOI]
(with Jan Dreier, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, and Szymon Toruńczyk)
Proceedings of the 65th IEEE Symposium on Foundations of Computer Science (FOCS 2024).
Universal slices of the category of graphs [arXiv, DOI]
Algebra Universalis, 85, 42, 2024.
Algebraically universal categories of relational structures [arXiv, DOI]
Journal of Pure and Applied Algebra, 107984, 2025.
Monadic NIP in monotone classes of relational structures [arXiv, DOI]
(with Sam Braunfeld, Anuj Dawar, and Aris Papadopoulos)
Proceedings of the 50th International Colloquium on Automata, Languages and Programming (ICALP 2023).
The cumulative hierarchy in Homotopy Type Theory [arXiv]
Proceedings of the ESSLLI 2021 student session, M. Young Pedersen and A. Pavlova, Eds., 2021, pp. 24–33