| Publication | Date of Publication | Type |
|---|
Integer programs with bounded subdeterminants and two nonzeros per row
Journal of the ACM | 2026-02-24 | Paper |
The Grid-Minor theorem revisited
Combinatorica | 2026-01-20 | Paper |
Cliquewidth and dimension
Proceedings of the London Mathematical Society. Third Series | 2026-01-16 | Paper |
Tight bound for the Erdős-Pósa property of tree minors
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
A Caro-Wei bound for induced linear forests in graphs
SIAM Journal on Discrete Mathematics | 2025-08-21 | Paper |
| Integer programs with bounded subdeterminants and two nonzeros per row | 2025-08-13 | Paper |
| Adjacency labelling for planar graphs (and beyond) | 2025-08-12 | Paper |
| Planar graphs have bounded queue-number | 2025-08-12 | Paper |
Neighborhood complexity of planar graphs
Combinatorica | 2025-01-14 | Paper |
Corrigendum to: ``Orthogonal tree-decompositions of graphs''
SIAM Journal on Discrete Mathematics | 2025-01-08 | Paper |
| The Grid-Minor theorem revisited | 2024-11-28 | Paper |
| Cliquewidth and dimension | 2024-11-28 | Paper |
The excluded tree minor theorem revisited
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Bounded-degree planar graphs do not have bounded-degree product structure
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
Product structure extension of the Alon-Seymour-Thomas theorem
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Pathwidth vs Cocircumference
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
Edge separators for graphs excluding a minor
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
| scientific article; zbMATH DE number 7788455 (Why is no real title available?) | 2024-01-15 | Paper |
Sparse universal graphs for planarity
Journal of the London Mathematical Society | 2023-12-02 | Paper |
Sparse universal graphs for planarity
Journal of the London Mathematical Society | 2023-12-02 | Paper |
Approximating Pathwidth for Graphs of Small Treewidth
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Treedepth vs circumference
Combinatorica | 2023-10-04 | Paper |
| Cliquewidth and dimension | 2023-08-23 | Paper |
Subgraph densities in a surface
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| Neighborhood complexity of planar graphs | 2023-02-24 | Paper |
| Tight bound on treedepth in terms of pathwidth and longest path | 2023-02-06 | Paper |
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM | 2022-12-08 | Paper |
| Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure | 2022-12-05 | Paper |
Excluding a ladder
Combinatorica | 2022-11-09 | Paper |
Improved bounds for weak coloring numbers
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Notes on graph product structure theory
(available as arXiv preprint) | 2021-12-10 | Paper |
Tight bounds on the clique chromatic number
The Electronic Journal of Combinatorics | 2021-09-28 | Paper |
Packing and covering balls in graphs excluding a minor
Combinatorica | 2021-08-03 | Paper |
Unavoidable minors for graphs with large \(\ell_p\)-dimension
Discrete & Computational Geometry | 2021-07-02 | Paper |
Seymour's conjecture on 2-connected graphs of large pathwidth
Combinatorica | 2021-04-16 | Paper |
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Two lower bounds for \(p\)-centered colorings
(available as arXiv preprint) | 2021-01-05 | Paper |
| Two lower bounds for \(p\)-centered colorings | 2021-01-05 | Paper |
Progress on the adjacent vertex distinguishing edge coloring conjecture
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Planar graphs have bounded queue-number
Journal of the ACM | 2020-11-11 | Paper |
Minor-Closed Graph Classes with Bounded Layered Pathwidth
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Erdős-Pósa from ball packing
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Planar graphs have bounded nonrepetitive chromatic number
Advances in Combinatorics | 2020-10-20 | Paper |
Large independent sets in triangle-free cubic graphs: beyond planarity
Advances in Combinatorics | 2020-10-20 | Paper |
A tight Erdős-Pósa function for planar minors
Advances in Combinatorics | 2020-10-20 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
Tight Bounds on the Clique Chromatic Number
(available as arXiv preprint) | 2020-06-19 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
Algorithmica | 2020-02-28 | Paper |
Excluding a ladder
(available as arXiv preprint) | 2020-02-02 | Paper |
Nowhere dense graph classes and dimension
Combinatorica | 2020-01-17 | Paper |
A tight Erdős-Pósa function for planar minors
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Information-theoretic lower bounds for quantum sorting | 2019-02-18 | Paper |
Sparsity and dimension
Combinatorica | 2019-02-01 | Paper |
Corrigendum: Orthogonal Tree Decompositions of Graphs
SIAM Journal on Discrete Mathematics | 2018-12-19 | Paper |
A tight Erdős-Pósa function for wheel minors
SIAM Journal on Discrete Mathematics | 2018-09-14 | Paper |
Sparsity and dimension
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Orthogonal tree decompositions of graphs
SIAM Journal on Discrete Mathematics | 2018-04-11 | Paper |
Burling graphs, chromatic number, and orthogonal tree-decompositions
The Electronic Journal of Combinatorics | 2018-02-22 | Paper |
\(K_4\)-minor-free induced subgraphs of sparse connected graphs
SIAM Journal on Discrete Mathematics | 2018-01-22 | Paper |
Burling graphs, chromatic number, and orthogonal tree-decompositions
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Planar Posets Have Dimension at Most Linear in Their Height
SIAM Journal on Discrete Mathematics | 2018-01-04 | Paper |
On the dimension of posets with cover graphs of treewidth 2
Order | 2017-10-06 | Paper |
Tree-width and dimension
Combinatorica | 2017-08-25 | Paper |
Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
Discrete & Computational Geometry | 2017-05-11 | Paper |
Nonrepetitive colouring via entropy compression
Combinatorica | 2017-04-25 | Paper |
The excluded minors for isometric realizability in the plane
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Lecture Notes in Computer Science | 2016-08-10 | Paper |
scientific article; zbMATH DE number 6515828 (Why is no real title available?)
(available as arXiv preprint) | 2015-12-03 | Paper |
| scientific article; zbMATH DE number 6515828 (Why is no real title available?) | 2015-12-03 | Paper |
Empty pentagons in point sets with collinearities
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
The cops and robber game on graphs with forbidden (induced) subgraphs
(available as arXiv preprint) | 2015-07-24 | Paper |
Hitting all maximal independent sets of a bipartite graph
Algorithmica | 2015-07-10 | Paper |
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Hitting and harvesting pumpkins
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Sorting under partial information (without the ellipsoid algorithm)
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Colouring planar graphs with three colours and no large monochromatic components
Combinatorics, Probability and Computing | 2014-08-06 | Paper |
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
A note on the cops and robber game on graphs embedded in non-orientable surfaces
Graphs and Combinatorics | 2014-03-24 | Paper |
Sorting under partial information (without the ellipsoid algorithm).
Combinatorica | 2014-03-17 | Paper |
Excluded Forest Minors and the Erdős–Pósa Property
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Boxicity of graphs on surfaces
Graphs and Combinatorics | 2013-06-26 | Paper |
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
Complete graph minors and the graph minor structure theorem
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
An improved bound for first-fit on posets without two long incomparable chains
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Trees with given stability number and minimum number of stable sets
Graphs and Combinatorics | 2012-12-27 | Paper |
Minimum entropy combinatorial optimization problems
Theory of Computing Systems | 2012-12-07 | Paper |
Approximating the balanced minimum evolution problem
Operations Research Letters | 2012-07-06 | Paper |
Small minors in dense graphs
European Journal of Combinatorics | 2012-06-18 | Paper |
Nordhaus-Gaddum for treewidth
European Journal of Combinatorics | 2012-05-04 | Paper |
Disproof of the list Hadwiger conjecture
The Electronic Journal of Combinatorics | 2012-03-06 | Paper |
Disproof of the list Hadwiger conjecture
The Electronic Journal of Combinatorics | 2012-03-06 | Paper |
First-Fit is linear on posets excluding two long incomparable chains
Order | 2011-12-13 | Paper |
On the maximum number of cliques in a graph embedded in a surface
European Journal of Combinatorics | 2011-11-29 | Paper |
Hitting and harvesting pumpkins
Lecture Notes in Computer Science | 2011-09-16 | Paper |
An efficient algorithm for partial order production
SIAM Journal on Computing | 2011-04-04 | Paper |
Stackelberg network pricing is hard to approximate
Networks | 2011-03-16 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
Minimum entropy combinatorial optimization problems
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Hitting diamonds and growing cacti
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Irreducible triangulations are small
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Well-balanced orientations of mixed graphs
Information Processing Letters | 2010-04-19 | Paper |
Minimum entropy coloring
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
Discrete Optimization | 2009-04-17 | Paper |
On a theorem of Sewell and Trotter
European Journal of Combinatorics | 2009-03-04 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Minimum entropy orientations
Operations Research Letters | 2009-01-09 | Paper |
Tight results on minimum entropy set cover
Algorithmica | 2008-05-27 | Paper |
Turán's theorem and <i>k</i>‐connected graphs
Journal of Graph Theory | 2008-05-14 | Paper |
Tight Results on Minimum Entropy Set Cover
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
On a weighted generalization of α-critical graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
Journal of Mathematical Psychology | 2006-08-04 | Paper |
Product structure extension of the Alon--Seymour--Thomas theorem
(available as arXiv preprint) | N/A | Paper |
The Excluded Tree Minor Theorem Revisited
(available as arXiv preprint) | N/A | Paper |
Tight bound for the Erd\H{o}s-P\'osa property of tree minors
(available as arXiv preprint) | N/A | Paper |
A Caro-Wei bound for induced linear forests in graphs
(available as arXiv preprint) | N/A | Paper |
