| Publication | Date of Publication | Type |
|---|
Linear versus centred chromatic numbers
(available as arXiv preprint) | N/A | 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 |
Connected Dominating Sets in Triangulations
(available as arXiv preprint) | N/A | Paper |
Grid Minors and Products
(available as arXiv preprint) | N/A | Paper |
Patricia's Bad Distributions
(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 |
Free Sets in Planar Graphs: History and Applications
(available as arXiv preprint) | N/A | Paper |
Vertex Ranking of Degenerate Graphs
(available as arXiv preprint) | N/A | Paper |
On \(k\)-planar graphs without short cycles
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
Linear versus centred colouring via pseudogrids
Journal of Graph Theory | 2026-09-14 | Paper |
Separation number and treewidth, revisited
Discrete Mathematics | 2026-09-08 | Paper |
Erdös-Pósa property of cycles that are far apart
Journal of the London Mathematical Society. Second Series | 2026-09-03 | Paper |
| Cops and robbers for graphs on surfaces with crossings | 2026-08-05 | Paper |
| Local certification of geometric graph classes | 2026-05-12 | Paper |
| Patricia's bad distributions | 2026-01-30 | Paper |
The Grid-Minor theorem revisited
Combinatorica | 2026-01-20 | Paper |
Tight bound for the Erdős-Pósa property of tree minors
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| On k-planar graphs without short cycles | 2025-10-07 | Paper |
| Proof of the clustered Hadwiger conjecture | 2025-08-15 | Paper |
| Adjacency labelling for planar graphs (and beyond) | 2025-08-12 | Paper |
| Planar graphs have bounded queue-number | 2025-08-12 | Paper |
Grid minors and products
The Electronic Journal of Combinatorics | 2025-05-30 | Paper |
| Layered separators for queue layouts, 3D graph drawing and nonrepetitive coloring | 2025-05-20 | 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 |
The excluded tree minor theorem revisited
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Min-k-planar drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | 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 |
| Min-\(k\)-planar drawings of graphs | 2024-06-21 | Paper |
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
Stabbing pairwise intersecting disks by four points
Discrete & Computational Geometry | 2023-12-21 | 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 |
| Local certification of geometric graph classes | 2023-11-28 | Paper |
Graph product structure for non-minor-closed classes
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
| The grid-minor theorem revisited | 2023-07-06 | Paper |
| Proof of the Clustered Hadwiger Conjecture | 2023-06-09 | Paper |
Separating layered treewidth and row treewidth
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
Clustered 3-colouring graphs of bounded degree
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Dual circumference and collinear sets
Discrete & Computational Geometry | 2023-01-23 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | 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 |
Geodesic obstacle representation of graphs
Computational Geometry | 2022-11-16 | Paper |
Drawing graphs as spanners
Discrete & Computational Geometry | 2022-09-16 | Paper |
2 n grids have unbounded anagram-free chromatic number
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Dual circumference and collinear sets
(available as arXiv preprint) | 2022-07-18 | Paper |
Stack-number is not bounded by queue-number
Combinatorica | 2022-06-30 | Paper |
| Odd Colourings of Graph Products | 2022-02-25 | Paper |
| An Optimal Algorithm for Product Structure in Planar Graphs | 2022-02-17 | Paper |
Approximating maximum diameter-bounded subgraph in unit disk graphs
Discrete & Computational Geometry | 2021-11-18 | Paper |
Geodesic obstacle representation of graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Every collinear set in a planar graph is free
Discrete & Computational Geometry | 2021-04-29 | Paper |
A fast algorithm for the product structure of planar graphs
Algorithmica | 2021-04-19 | Paper |
Two results on layered pathwidth and linear layouts
Journal of Graph Algorithms and Applications | 2021-01-19 | Paper |
Planar graphs have bounded queue-number
Journal of the ACM | 2020-11-11 | Paper |
Stack-number is not bounded by queue-number
(available as arXiv preprint) | 2020-11-09 | Paper |
Minor-Closed Graph Classes with Bounded Layered Pathwidth
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2020-08-18 | Paper |
| Asymptotically Optimal Vertex Ranking of Planar Graphs | 2020-07-13 | Paper |
A Fast Algorithm for the Product Structure of Planar Graphs
(available as arXiv preprint) | 2020-04-06 | Paper |
Clustered 3-Colouring Graphs of Bounded Degree
(available as arXiv preprint) | 2020-02-26 | Paper |
Notes on growing a tree in a graph
Random Structures & Algorithms | 2019-11-07 | Paper |
Every collinear set in a planar graph is free
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the average number of edges in theta graphs
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
A characterization of the degree sequences of 2-trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
| scientific article; zbMATH DE number 7051217 (Why is no real title available?) | 2019-05-06 | Paper |
| Succinct geometric indexes supporting point location queries | 2019-05-06 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
EPG-representations with Small Grid-Size
Lecture Notes in Computer Science | 2019-02-20 | Paper |
| Queue Layouts of Graphs with Bounded Degree and Bounded Genus | 2019-01-16 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | Paper |
Corrigendum: Orthogonal Tree Decompositions of Graphs
SIAM Journal on Discrete Mathematics | 2018-12-19 | Paper |
Anagram-free chromatic number is not pathwidth-bounded
(available as arXiv preprint) | 2018-11-22 | Paper |
Dual Circumference and Collinear Sets
(available as arXiv preprint) | 2018-11-08 | Paper |
Array layouts for comparison-based searching
ACM Journal of Experimental Algorithmics | 2018-08-06 | Paper |
| scientific article; zbMATH DE number 6876065 (Why is no real title available?) | 2018-05-29 | Paper |
Orthogonal tree decompositions of graphs
SIAM Journal on Discrete Mathematics | 2018-04-11 | Paper |
A note on interference in random networks
Computational Geometry | 2018-02-12 | Paper |
Anagram-Free Chromatic Number is not Pathwidth-Bounded
(available as arXiv preprint) | 2018-02-05 | Paper |
New bounds for facial nonrepetitive colouring
Graphs and Combinatorics | 2017-10-11 | Paper |
Compatible connectivity-augmentation of planar disconnected graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Layered separators in minor-closed graph classes with applications
Journal of Combinatorial Theory. Series B | 2017-09-29 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The price of order
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Biased predecessor search
Algorithmica | 2016-12-21 | Paper |
Encoding Arguments
(available as arXiv preprint) | 2016-03-29 | Paper |
Reprint of: Approximating majority depth
Computational Geometry | 2016-01-29 | Paper |
Towards tight bounds on theta-graphs: more is not always better
Theoretical Computer Science | 2016-01-21 | Paper |
Compatible connectivity augmentation of planar disconnected graphs
Discrete & Computational Geometry | 2015-12-02 | Paper |
The price of order
Algorithms and Computation | 2015-09-11 | Paper |
Visibility-monotonic polygon deflation
(available as arXiv preprint) | 2015-08-28 | Paper |
On obstacle numbers
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
On obstacle numbers
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Average stretch factor: how low does it go?
Discrete & Computational Geometry | 2015-04-16 | Paper |
The \(\varTheta_5\)-graph is a spanner
Computational Geometry | 2015-03-06 | Paper |
Robust geometric spanners
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Randomized rendezvous with limited memory
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
