(With Katie Clinch, Matthew Drescher and Abdallah Saffidine)
Constructions, bounds, and algorithms for peaceable queens
Submitted 2024 (arXiv, blog by Richard Green)
(With J. Pascal Gollin, Kevin Hendrey, Hao Huang, Bojan Mohar, Sang-il Oum, Ningyuan Yang, Wei-Hsuan Yu, and Xuding Zhu)
Sharing tea on a graph
Submitted 2024 (arXiv)
(With Patrick Hompe)
Aharoni's rainbow cycle conjecture holds up to an additive constant
(With Bojan Mohar, Robert Šámal, Carsten Thomassen and David R. Wood)
Universality in minor-closed graph classes
Submitted 2021 (arXiv, talk, talk by David Wood)
43. (With Sandra Albrechtsen, Raphael W. Jacobs, Paul Knappe and Paul Wollan)
A Menger-type theorem for two induced paths
SIAM Journal on Discrete Mathematics (arXiv, journal)
42. (With O-joung Kwon)
On the Erdős-Pósa property for long holes in C_4-free graphs
SIAM Journal on Discrete Mathematics (arXiv, journal)
41. (With Katie Clinch, Jackson Goerner and Freddie Illingworth)
Notes on Aharoni's rainbow cycle conjecture
2020-21 MATRIX Annals (arXiv, book)
40. (With Rutger Campbell, Katie Clinch, Mark Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Freddie Illingworth, Youri Tamitegama, Jane Tane and David R. Wood)
Product structure of graph classes with bounded treewidth
Combinatorics, Probability, and Computing (arXiv, journal)
Extended abstract in 2020-21 MATRIX Annals (book)
39. (With Manuel Aprile, Matthew Drescher and Samuel Fiorini)
A simple 7/3-approximation algorithm for feedback vertex set in tournaments
Discrete Applied Mathematics (arXiv, journal, talk by Samuel Fiorini)
38. (With Mark Distel, Robert Hickingbotham and David R. Wood)
Improved product structure for graphs on surfaces
Discrete Mathematics & Theoretical Computer Science (arXiv, journal)
37. (With Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini and Marco Macchia)
Slack matrices, k-products, and 2-level polytopes
Discrete Applied Mathematics (arXiv, journal)
36. (With Gwenaël Joret and David R. Wood)
Subgraph densities in a surface
Combinatorics, Probability and Computing 31.5 (2022): 812-839 (arXiv, journal, YouTube, toot by David Eppstein)
35. (With Manuel Aprile, Samuel Fiorini, Gwenaël Joret and David R. Wood)
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Electronic Journal of Combinatorics 28(2021), no. 4, Paper 4.27, 16 pp.(arXiv, journal)
34. (With David R. Wood)
Tree densities in sparse graph classes
Canadian Journal of Mathematics 74.5 (2022): 1385-1404 (arXiv, journal)
33. (With Matthew Drescher and Samuel Fiorini)
A simple (2+ε)-approximation algorithm for split vertex deletion
European Journal of Combinatorics (journal)
Extended abstract in European Conference on Combinatorics, Graph Theory and Applications 2021 (arXiv, EUROCOMB 2021)
32. (With Gwenaël Joret, Piotr Micek, Michał T. Seweryn and Paul Wollan)
Excluding a ladder
Combinatorica, 42 (2022): 405-432 (arXiv, journal)
31. (With Manuel Aprile, Matthew Drescher and Samuel Fiorini)
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
Mathematical Programming (journal, talk by Matthew Drescher)
Extended abstract in 22nd Conference on Integer Programming and Combinatorial Optimization, pp. 340-353 (arXiv, IPCO 2021)
30. (With Samuel Fiorini, Gwenaël Joret and Carole Muller)
Unavoidable minors for graphs with large ℓ𝑝-dimension
Discrete & Computational Geometry 66.1 (2021): 301-343 (arXiv, journal)
29. (With Samuel Fiorini and Stefan Weltge)
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Mathematical Programming 190 (2021): 467-482 (arXiv, journal)
28. (With Zdeněk Dvořák, Gwenaël Joret, Chun-Hung Liu and David R. Wood)
Notes on Graph Product Structure Theory
2019-20 MATRIX Annals. MATRIX Book Series, Vol. 4, 513–533, 2021 (arXiv, book)
27. (With Bruce Reed, David R. Wood and Liana Yepremyan)
Notes on Tree- and Path-chromatic Number
2019-20 MATRIX Annals. MATRIX Book Series, Vol. 4, 489–498, 2021 (arXiv, book)
26. (With Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Bojan Mohar and Amanda Montejano)
Short rainbow cycles in graphs and matroids
Journal of Graph Theory 96.2 (2021): 192-202 (blog, arXiv, journal)
25. (With Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini and Marco Macchia)
Recognizing Cartesian products of matrices and polytopes
Extended abstract in 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2020 (arXiv, conference)
24. (With Gwenaël Joret, Piotr Micek and David R. Wood)
Seymour's conjecture on 2-connected graphs of large pathwidth
Combinatorica, 40 (2020): 839-868 (arXiv, journal)
23. (With Michele Conforti, Samuel Fiorini and Stefan Weltge)
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Mathematical Programming 192.1 (2022): 547-566 (journal)
Extended abstract in 21st Conference on Integer Programming and Combinatorial Optimization, pp. 104-116 (arXiv, IPCO 2020, talk by Samuel Fiorini)
22. (With Ahmad Abdi, Gérard Cornuéjols and Dabeen Lee)
Idealness of k-wise intersecting families
Mathematical Programming 192.1-2 (2022): 29-50 (journal, erratum)
Extended abstract in 21st Conference on Integer Programming and Combinatorial Optimization, pp. 1-12 (arXiv, IPCO 2020, YouTube, talk by Ahmad Abdi)
21. (With Peter Nelson) The matroid secretary problem for minor-closed classes and random matroids
SIAM Journal on Discrete Mathematics, Vol. 34, Issue 1, pp. 163-176, 2020 (arXiv, journal)
20. (With Michele Conforti, Samuel Fiorini, Gwenaël Joret and Stefan Weltge)
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms 2020, pp. 2896-2915 (arXiv, SODA 2020, YouTube)
19. (With Krystal Guo and Marco Macchia)
The biclique covering number of grids
Electronic Journal of Combinatorics 26(2019), no. 4, Paper 4.27, 12 pp. (arXiv, journal)
18. (With Oswin Aichholzer, Jean Cardinal, Kolja Knauer, Torsten Mütze, Raphael Steiner and Birgit Vogtenhuber)
Flip distances between graph orientations
Algorithmica 83.1 (2021): 116-143 (journal, arXiv, talk by Jean Cardinal)
Extended abstract in WG 2019: Graph-Theoretic Concepts in Computer Science pp. 120-134 (conference)
17. (With Wouter Cames van Batenburg, Gwenaël Joret and Jean-Florent Raymond)
A tight Erdős-Pósa function for planar minors
Advances in Combinatorics, 2019:2, 33 pages. (arXiv)
Extended abstract in Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms 2019, pp. 1485-1500 (SODA 2019)
16. (With Pierre Aboulker, Samuel Fiorini, Marco Macchia and Johanna Seif)
Extension complexity of the correlation polytope
Operations Research Letters, 47.1 (2019): 47-51 (arXiv, journal)
15. (With Pierre Aboulker, Samuel Fiorini, Gwenaël Joret, Jean-Florent Raymond and Ignasi Sau)
A tight Erdős-Pósa function for wheel minors
SIAM Journal on Discrete Mathematics, Vol. 32, Issue 3, pp. 2302 - 2312, 2018 (arXiv, journal)
14. (With Felix Joos and Paul Wollan) A unified Erdős-Pósa theorem for constrained cycles
Combinatorica, 39.1 (2019): 91-133 (arXiv, journal)
13. (With Jim Geelen and R. Bruce Richter) Explicit bounds for graph minors
Journal of Combinatorial Theory, Series B, Vol. 132, Sept. 2018, Pages 80-106 (arXiv, journal, YouTube)
12. (With Spencer Backman) Transfinite Ford-Fulkerson on a finite network
Computability, Vol. 7, No. 4, pp. 341-347, 2018 (arXiv, journal)
11. (With Yohann Benchetrit, Samuel Fiorini and Stefan Weltge)
Characterizing polytopes contained in the 0/1-cube with bounded Chvátal-Gomory rank
Mathematics of Operations Research, 43.3 (2018): 718-725 (arXiv, journal, YouTube)
10. (With Manuel Aprile, Yuri Faenza, Samuel Fiorini and Marco Macchia)
Extension complexity of stable set polytopes of bipartite graphs
WG 2017: Graph-Theoretic Concepts in Computer Science pp. 75-87 (arXiv, conference)
9. (With Patrick Bennett, Ilario Bonacina, Nicola Galesi, Mike Molloy and Paul Wollan)
Space proof complexity for random 3-CNFs
Information and Computation, Vol. 255, 2017, Pages 165-176 (arXiv, ECCC, journal, YouTube)
8. (With Samuel Fiorini, Gwenaël Joret and Antonios Varvitsiotis)
The excluded minors for isometric realizability in the plane
SIAM Journal on Discrete Mathematics, Vol. 31, Issue 1, pp. 438 - 453, 2017 (arXiv, journal)
7. (With Sang-il Oum and Maryam Verdian-Rizi) Even cycle decompositions of graphs with no odd-K_4-minor
European Journal of Combinatorics, Vol. 65, Oct. 2017, Pages 1-14 (arXiv, journal)
6. (With Ringi Kim) Tree-chromatic number is not equal to path-chromatic number
Journal of Graph Theory, Vol. 86, Issue 2, Oct. 2017, Pages 213–222 (arXiv, journal)
5. (With Samuel Fiorini, Gwenaël Joret and Kanstantsin Pashkovich)
Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
Discrete & Computational Geometry, April 2017, Vol. 57, Issue 3, pp 757-761 (arXiv, journal)
4. (With Andrew King, Sang-il Oum and Maryam Verdian-Rizi) Strongly even-cycle decomposable graphs
Journal of Graph Theory, Vol. 84, Issue 2, Feb. 2017, Pages 158–175 (arXiv, journal)
3. (With Tanmay Deshpande and Luis Goddyn) On Hilbert bases of cuts
Discrete Mathematics, Vol. 339, Issue 2, 2016, Pages 721–728 (blog, arXiv, journal)
2. Extremal problems for subset divisors
Electronic Journal of Combinatorics 21(2014), no. 1, Paper 1.42, 10 pp. (arXiv, journal)
1. (With Stefan van Zwam) Intertwining connectivities in representable matroids
SIAM Journal on Discrete Mathematics, Vol. 28, Issue 1, pp. 188 - 196, 2014 (arXiv, journal, YouTube)
0. The linkage problem for group-labelled graphs
PhD Thesis, University of Waterloo (2009) (PDF)
(With Jim Geelen) Colouring graphs with no odd-K_n minor
Not submitted for publication (2002) (PDF)
(With Jim Geelen, Bert Gerards and Stefan van Zwam) Generating k-connected matroids
In preparation