| Publication | Date of Publication | Type |
|---|
Quickly excluding an apex-forest
SIAM Journal on Discrete Mathematics | 2026-04-01 | Paper |
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
The Grid-Minor theorem revisited
Combinatorica | 2026-01-20 | Paper |
The -binding function of d-directional segment graphs
Discrete & Computational Geometry | 2026-01-06 | Paper |
Boolean dimension of a Boolean lattice
Order | 2025-06-30 | Paper |
2-distance 4-coloring of planar subcubic graphs with girth at least 21
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
| Graph reconstruction with connectivity queries | 2025-05-02 | Paper |
| The Grid-Minor theorem revisited | 2024-11-28 | Paper |
2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
Discrete Mathematics | 2024-11-09 | Paper |
| The \chi-binding function of d-directional segment graphs | 2023-09-12 | Paper |
| Boolean dimension of a Boolean lattice | 2023-07-31 | Paper |
| The grid-minor theorem revisited | 2023-07-06 | Paper |
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
Discrete Mathematics | 2023-05-31 | Paper |
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
2-distance list \((\varDelta +3)\)-coloring of sparse graphs
Graphs and Combinatorics | 2022-10-13 | Paper |
2-distance list ( +2)-coloring of planar graphs with girth at least 10
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
Further extensions of the Grötzsch theorem
Discrete Mathematics | 2022-04-11 | Paper |
| Computer assisted discharging procedure on planar graphs: application to 2-distance coloring | 2022-02-08 | Paper |
$2$-distance list $(\Delta+2)$-coloring of planar graphs with girth at least 10
(available as arXiv preprint) | 2021-09-29 | Paper |
| 2-distance (\Delta+2)-coloring of sparse graphs | 2021-09-24 | Paper |
A note on deterministic zombies
Discrete Applied Mathematics | 2021-06-14 | Paper |
| 2-distance 4-coloring of planar subcubic graphs with girth at least 21 | 2021-06-07 | Paper |
| 2-distance (\Delta+1)-coloring of sparse graphs using the potential method | 2021-03-22 | Paper |
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
European Journal of Combinatorics | 2021-02-08 | Paper |
Quickly excluding an apex-forest
(available as arXiv preprint) | N/A | Paper |
