| Publication | Date of Publication | Type |
|---|
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 |
Vertex Ranking of Degenerate Graphs
(available as arXiv preprint) | N/A | Paper |
Quickly excluding an apex-forest
(available as arXiv preprint) | N/A | Paper |
Erdös-Pósa property of cycles that are far apart
Journal of the London Mathematical Society. Second Series | 2026-09-03 | Paper |
| Centered colorings in minor-closed graph classes | 2026-07-13 | Paper |
Planar graphs in blowups of fans
Advances in Combinatorics | 2026-07-07 | Paper |
| Weak coloring numbers of minor-closed graph classes | 2026-07-03 | Paper |
| Planar graphs in blowups of fans | 2026-07-03 | Paper |
Shallow brambles
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
Quickly excluding an apex-forest
SIAM Journal on Discrete Mathematics | 2026-04-01 | 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 |
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
Discrete Mathematics | 2026-01-15 | Paper |
A coarse Gallai theorem
(available as arXiv preprint) | 2026-01-01 | Paper |
Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
(available as arXiv preprint) | 2026-01-01 | Paper |
Cops and robber in graphs with bounded vertex cover number
(available as arXiv preprint) | 2026-01-01 | Paper |
Tree decompositions whose trees are subgraphs: An application of Simon's factorization
(available as arXiv preprint) | 2026-01-01 | Paper |
Centered colorings and weak coloring numbers in minor-closed graph classes
(available as arXiv preprint) | 2026-01-01 | Paper |
Sample compression schemes for balls in structurally sparse graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Adjacency labelling for proper minor-closed graph classes
(available as arXiv preprint) | 2026-01-01 | Paper |
Planarity and dimension II
(available as arXiv preprint) | 2026-01-01 | Paper |
Far-apart Erdős--Pósa property of long cycles
(available as arXiv preprint) | 2026-01-01 | Paper |
Row pathwidth of complete binary trees
(available as arXiv preprint) | 2026-01-01 | Paper |
Product structure of graphs excluding a topological minor
(available as arXiv preprint) | 2026-01-01 | Paper |
Superlinear separation between linear and centered colorings
(available as arXiv preprint) | 2026-01-01 | Paper |
Relative Dimension of Posets
(available as arXiv preprint) | 2026-01-01 | Paper |
Strong coloring numbers of grids
(available as arXiv preprint) | 2026-01-01 | Paper |
Asymptotic dimension of graphs excluding an induced or fat minor
(available as arXiv preprint) | 2026-01-01 | Paper |
On dimension of posets excluding a standard example
(available as arXiv preprint) | 2026-01-01 | Paper |
Invitation to torso parameters of annotated graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Tight bound for the Erdős-Pósa property of tree minors
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| Adjacency labelling for planar graphs (and beyond) | 2025-08-12 | Paper |
| Planar graphs have bounded queue-number | 2025-08-12 | Paper |
Boolean dimension of a Boolean lattice
Order | 2025-06-30 | Paper |
Shallow brambles
(available as arXiv preprint) | 2025-01-01 | Paper |
Planarity and dimension I
(available as arXiv preprint) | 2025-01-01 | 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 |
Dimension is polynomial in height for posets with planar cover graphs
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Weak coloring numbers of minor-closed graph classes
(available as arXiv preprint) | 2024-01-01 | Paper |
Planar graphs in blowups of fans
(available as arXiv preprint) | 2024-01-01 | Paper |
Centered colorings in minor-closed graph classes
(available as arXiv preprint) | 2024-01-01 | Paper |
Erdős-Pósa property of cycles that are far apart
(available as arXiv preprint) | 2024-01-01 | Paper |
Treedepth vs circumference
Combinatorica | 2023-10-04 | Paper |
| Cliquewidth and dimension | 2023-08-23 | Paper |
Reconfiguring Independent Sets on Interval Graphs
(available as arXiv preprint) | 2023-08-08 | Paper |
Colouring bottomless rectangles and arborescences
Computational Geometry | 2023-07-31 | Paper |
| Boolean dimension of a Boolean lattice | 2023-07-31 | Paper |
| The grid-minor theorem revisited | 2023-07-06 | 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 |
| Boolean dimension and dim-boundedness: Planar cover graph with a zero | 2022-06-14 | Paper |
Improved bounds for weak coloring numbers
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Boolean dimension and dim-boundedness: Planar cover graph with a zero
(available as arXiv preprint) | 2022-01-01 | Paper |
Improved bounds for centered colorings
Advances in Combinatorics | 2021-11-05 | Paper |
Tight bounds on the clique chromatic number
The Electronic Journal of Combinatorics | 2021-09-28 | Paper |
Seymour's conjecture on 2-connected graphs of large pathwidth
Combinatorica | 2021-04-16 | Paper |
Erdös-Hajnal properties for powers of sparse graphs
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Boolean dimension and tree-width
Combinatorica | 2021-03-20 | Paper |
Improved bounds for centered colorings
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Planar graphs have bounded queue-number
Journal of the ACM | 2020-11-11 | Paper |
Boolean dimension, components and blocks
Order | 2020-07-17 | Paper |
Tight Bounds on the Clique Chromatic Number
(available as arXiv preprint) | 2020-06-19 | Paper |
| Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets | 2020-04-15 | Paper |
Excluding a ladder
(available as arXiv preprint) | 2020-02-02 | Paper |
Nowhere dense graph classes and dimension
Combinatorica | 2020-01-17 | Paper |
| Planar cubic graphs of small diameter | 2019-08-15 | Paper |
Separating tree-chromatic number from path-chromatic number
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Making octants colorful and related covering decomposition problems
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
The queue-number of posets of bounded width or height
(available as arXiv preprint) | 2019-02-15 | Paper |
Sparsity and dimension
Combinatorica | 2019-02-01 | Paper |
Planar cubic graphs of small diameter
(available as arXiv preprint) | 2019-01-01 | Paper |
Sparsity and dimension
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Burling graphs, chromatic number, and orthogonal tree-decompositions
The Electronic Journal of Combinatorics | 2018-02-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 |
Topological minors of cover graphs and dimension
Journal of Graph Theory | 2017-12-01 | Paper |
On-line coloring between two lines
(available as arXiv preprint) | 2017-10-10 | 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 |
Graph sharing game and the structure of weighted graphs with a forbidden subdivision
Journal of Graph Theory | 2017-06-30 | Paper |
An on-line competitive algorithm for coloring bipartite graphs without long induced paths
Algorithmica | 2017-05-02 | Paper |
Making triangles colorful
(available as arXiv preprint) | 2017-03-09 | 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 |
A note on concurrent graph sharing games
Integers | 2016-10-28 | Paper |
A note on concurrent graph sharing games
Integers | 2016-10-28 | Paper |
Lower bounds for on-line graph colorings
Algorithms and Computation | 2015-09-11 | Paper |
An on-line competitive algorithm for coloring P₈-free bipartite graphs
Algorithms and Computation | 2015-09-11 | Paper |
Making Octants Colorful and Related Covering Decomposition Problems
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Coloring intersection graphs of arc-connected sets in the plane
Discrete & Computational Geometry | 2014-10-29 | Paper |
An extremal problem on crossing vectors.
Journal of Combinatorial Theory. Series A | 2014-10-07 | Paper |
Triangle-free intersection graphs of line segments with large chromatic number
Journal of Combinatorial Theory. Series B | 2014-08-27 | Paper |
| Coloring intersection graphs of arcwise connected sets in the plane | 2014-06-11 | Paper |
Outerplanar graph drawings with few slopes
Computational Geometry | 2014-04-09 | Paper |
