| Publication | Date of Publication | Type |
|---|
| On connectivity in random graph models with limited dependencies | 2025-01-14 | Paper |
Finding dense minors using average degree
Journal of Graph Theory | 2024-11-24 | Paper |
On an induced version of Menger's theorem
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
On the choosability of \(H\)-minor-free graphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Colouring non-even digraphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Linear size universal point sets for classes of planar graphs | 2024-10-16 | Paper |
| A logarithmic bound for simultaneous embeddings of planar graphs | 2024-10-14 | Paper |
Hadwiger's conjecture and topological bounds
European Journal of Combinatorics | 2024-09-30 | Paper |
Coloring circle arrangements: new 4-chromatic planar graphs
European Journal of Combinatorics | 2024-09-30 | Paper |
| Coloring circle arrangements: new 4-chromatic planar graphs | 2024-09-13 | Paper |
On connectivity in random graph models with limited dependencies
Random Structures & Algorithms | 2024-09-02 | Paper |
| Exact matching in graphs of bounded independence number | 2024-08-06 | Paper |
Coloring hypergraphs with excluded minors
European Journal of Combinatorics | 2024-07-08 | Paper |
Chromatic number is not tournament-local
Journal of Combinatorial Theory. Series B | 2024-07-01 | Paper |
| Edge partitions of complete geometric graphs | 2024-05-14 | Paper |
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Tight bounds for divisible subdivisions
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
| Twin-width of sparse random graphs | 2023-12-06 | Paper |
| Vertex-critical graphs far from edge-criticality | 2023-10-19 | Paper |
Topological drawings meet classical theorems from convex geometry
Discrete & Computational Geometry | 2023-10-12 | Paper |
| A note on digraph splitting | 2023-10-12 | Paper |
| On an induced version of Menger's theorem | 2023-09-14 | Paper |
| Clustered Colouring of Odd-$H$-Minor-Free Graphs | 2023-08-29 | Paper |
| Size-Ramsey numbers of structurally sparse graphs | 2023-07-22 | Paper |
| Finding dense minors using average degree | 2023-07-03 | Paper |
Hat Guessing Numbers of Strongly Degenerate Graphs
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
| A logarithmic bound for simultaneous embeddings of planar graphs | 2023-05-30 | Paper |
| Chromatic number is not tournament-local | 2023-05-24 | Paper |
| On Connectivity in Random Graph Models with Limited Dependencies | 2023-05-04 | Paper |
| On the choosability of $H$-minor-free graphs | 2023-04-09 | Paper |
| Linear Size Universal Point Sets for Classes of Planar Graphs | 2023-02-28 | Paper |
Matching theory and Barnette's conjecture
Discrete Mathematics | 2022-11-23 | Paper |
Even circuits in oriented matroids
Combinatorial Theory | 2022-11-21 | Paper |
Colouring non-even digraphs
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
Colorings of oriented planar graphs avoiding a monochromatic subgraph
Discrete Applied Mathematics | 2022-08-24 | Paper |
| Coloring hypergraphs with excluded minors | 2022-06-27 | Paper |
| Coloring circle arrangements: New $4$-chromatic planar graphs | 2022-05-17 | Paper |
| Exact Matching in Graphs of Bounded Independence Number | 2022-02-24 | Paper |
Coloring drawings of graphs
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
| Disproof of a Conjecture by Woodall | 2022-01-22 | Paper |
The star dichromatic number
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
| Edge Partitions of Complete Geometric Graphs (Part 2) | 2021-12-15 | Paper |
Topological Drawings Meet Classical Theorems from Convex Geometry
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Flip distances between graph orientations
Algorithmica | 2021-02-01 | Paper |
| Complete minors in digraphs with given dichromatic number | 2021-01-12 | Paper |
On the average complexity of the $k$-level
(available as arXiv preprint) | 2020-11-12 | Paper |
On the complexity of digraph colourings and vertex arboricity
(available as arXiv preprint) | 2020-10-28 | Paper |
A note on universal point sets for planar graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
A note on coloring digraphs of large girth
Discrete Applied Mathematics | 2020-10-14 | Paper |
A Note on Universal Point Sets for Planar Graphs
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| Oriented cycles in digraphs of large outdegree | 2020-08-30 | Paper |
Parameterized algorithms for directed modular width
(available as arXiv preprint) | 2020-07-21 | Paper |
Complete acyclic colorings
The Electronic Journal of Combinatorics | 2020-06-04 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
| Equiangular polygon contact representations | 2018-11-22 | Paper |
Pentagon contact representations
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Pentagon contact representations
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Hadwiger's conjecture and topological bounds
(available as arXiv preprint) | N/A | Paper |
Resolution of the Kohayakawa-Kreuter conjecture
(available as arXiv preprint) | N/A | Paper |
