Papers

Also see Google Scholar and arXiv.
Preprints
  • Odd coloring graphs with linear neighborhood complexity. [arXiv]
    With James Davies, Meike Hatzel, Kolja Knauer, and Torsten Ueckerdt.
  • The Erdős-Pósa property for circle graphs as vertex-minors. [arXiv]
    With Rutger Campbell, J. Pascal Gollin, Meike Hatzel, O-joung Kwon, Sang-il Oum, and Sebastian Wiederrecht. Accepted to SODA, 2026.
  • Fat minors cannot be thinned (by quasi-isometries). [arXiv]
    With James Davies, Robert Hickingbotham, and Freddie Illingworth.
  • Universality for graphs with bounded density. [arXiv]
    With Noga Alon, Natalie Dodson, Carmen Jackson, Rajko Nenadov, and Lani Southern.
Published
  • The Structural Complexity of Matrix-Vector Multiplication. [conference, arXiv]
    NeurIPS, 2025. With Emile Anand and Jan van den Brand.
  • Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. [journal, arXiv]
    SIDMA, 2025. With Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Martin Milanič, Paweł Rzążewski, and Bartosz Walczak.
  • Prime and polynomial distances in colourings of the plane. [journal, arXiv]
    Israel Journal of Mathematics, 2025. With James Davies and Michał Pilipczuk.
  • Girth in GF(q)-representable matroids. [journal, arXiv]
    Bull. LMS, 2025. With James Davies, Meike Hatzel, Kolja Knauer, and Torsten Ueckerdt.
  • A survey of degree-boundedness. [journal, arXiv]
    European Journal of Combinatorics, 2025. With Xiying Du.
  • Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs. [conference, arXiv]
    SoCG, 2025. With James Davies, Agelos Georgakopoulos, and Meike Hatzel.
  • Induced C_4-free subgraphs with large average degree. [journal, arXiv]
    JCTB, 2025. With Xiying Du, António Girão, Zach Hunter, and Alex Scott.
  • Decomposing a signed graph into rooted circuits. [journal, arXiv]
    Advances in Combinatorics, 2024.
  • First-order model checking on monadically stable graph classes. [conference, arXiv]
    FOCS, 2024. With Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Michał Pilipczuk, and Szymon Toruńczyk.
  • On classes of bounded tree rank, their interpretations, and efficient sparsification. [conference, arXiv]
    ICALP, Track B, 2024. With Jakub Gajarský.
  • On tree decompositions whose trees are minors. [journal, arXiv]
    Journal of Graph Theory (JGT), 2024. With Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, and Freddie Illingworth.
  • Sparse induced subgraphs in P_6-free graphs. [conference, journal, arXiv]
    SODA, 2024 and ACM Transactions on Algorithms, 2025. With Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski.
  • Grounded L-graphs are polynomially Chi-bounded. [journal, arXiv]
    Discrete and Computational Geometry, 2023. With James Davies, Tomasz Krawczyk, and Bartosz Walczak.
  • Geometric graphs with unbounded flip-width. [conference, arXiv]
    CCCG, 2023. With David Eppstein.
  • Flipper games for monadically stable graph classes. [conference, arXiv]
    ICALP, 2023. With Jakub Gajarský, Nikolas Mählmann, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski, and Szymon Toruńczyk.
  • Colouring polygon visibility graphs and their generalizations. [journal, conference, arXiv]
    SoCG, 2021 and JCTB, 2023. With James Davies, Tomasz Krawczyk, and Bartosz Walczak.
  • Dense induced subgraphs of dense bipartite graphs. [journal, arXiv]
    SIDMA, 2021.
  • Obstructions for bounded shrub-depth and rank-depth. [journal, arXiv]
    JCTB, 2021. With O-joung Kwon, Sang-il Oum, and Paul Wollan.
  • Sublinear separators in intersection graphs of convex shapes. [journal, arXiv]
    SIDMA, 2021. With Zdeněk Dvořák and Sergey Norin.
  • Circle graphs are quadratically Chi-bounded. [journal, arXiv]
    Bull. LMS, 2020. With James Davies.
  • The grid theorem for vertex-minors. [journal, arXiv]
    JCTB, 2020. With Jim Geelen, O-joung Kwon, and Paul Wollan.
  • 7-Connected Graphs are 4-Ordered. [journal, arXiv]
    JCTB, 2020. With Yan Wang and Xingxing Yu.
  • The extremal function for bipartite linklessly embeddable graphs. [journal, arXiv]
    Combinatorica, 2019. With Robin Thomas.
  • The extremal function and Colin de Verdière graph parameter. [journal]
    The Electronic Journal of Combinatorics, 2018.
Manuscripts
  • Quantum Graph States: Bridging Classical Theory and Quantum Innovation, Workshop Summary. [arXiv]
    2025. With Eric Chitambar, Kenneth Goodenough, Otfried Gühne, Simon Perdrix, Vito Scarola, Shuo Sun, and Quntao Zhang
Thesis