First-order model checking on monadically stable graph classes. [ arXiv]
With Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Michał Pilipczuk, and Szymon Toruńczyk.
Sparse universal graphs for sparse graph families. [ arXiv]
With Noga Alon, Natalie Dodson, Carmen Jackson, and Lani Southern.
Prime and polynomial distances in colourings of the plane. [ arXiv]
With James Davies and Michał Pilipczuk.
Decomposing a signed graph into rooted circuits. [ arXiv]
Induced C_4-free subgraphs with high average degree. [ arXiv]
With Xiying Du, António Girão, Zach Hunter, and Alex Scott.
On tree decompositions whose trees are minors. [ arXiv]
With Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, and Freddie Illingworth.
Sparse induced subgraphs in P_6-free graphs. [ arXiv]
To appear at SODA 2024. With Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski.
Grounded L-graphs are polynomially Chi-bounded. [ journal, arXiv]
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]
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,
JCTB, 2020. With Yan Wang and Xingxing Yu.
The extremal function for bipartite linklessly embeddable graphs. [ journal,
Combinatorica, 2019. With Robin Thomas.
The extremal function and Colin de Verdière graph parameter. [ journal]
The Electronic Journal of Combinatorics, 2018.