| Publication | Date of Publication | Type |
|---|
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
(available as arXiv preprint) | N/A | Paper |
Tight bounds on adjacency labels for monotone graph classes
(available as arXiv preprint) | N/A | Paper |
| Mim-width is paraNP-complete | 2026-09-10 | Paper |
| Adjacency labeling schemes for small classes | 2026-07-14 | Paper |
| Symmetric-difference (degeneracy) and signed tree models | 2026-05-12 | Paper |
Long induced paths and forbidden patterns: polylogarithmic bounds
SIAM Journal on Discrete Mathematics | 2026-01-20 | Paper |
| Tight bounds on adjacency labels for monotone graph classes | 2026-01-14 | Paper |
On the minimum number of inversions to make a digraph k-(arc-)strong
Journal of Graph Theory | 2026-01-13 | Paper |
Moderately beyond clique-width: reduced component max-leaf and related parameters
(available as arXiv preprint) | 2026-01-01 | Paper |
Decomposing tournaments into comparability graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Hereditary 2-WQO Graph Classes Have Bounded Clique-Width
(available as arXiv preprint) | 2026-01-01 | Paper |
Time-Optimal APSP and Matrix Multiplication in Classes of Linear Neighborhood Complexity
(available as arXiv preprint) | 2026-01-01 | Paper |
Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
Algorithmica | 2025-12-30 | Paper |
| PACE solver description: RedAlert -- heuristic track | 2025-09-24 | Paper |
| Stretch-width | 2025-09-24 | Paper |
| On the minimum number of inversions to make a digraph k-(arc-)strong (extended abstract) | 2025-04-08 | Paper |
| Maximum independent set when excluding an induced minor: K₁+tK₂ and tC₃ C₄ | 2025-01-06 | Paper |
Mim-Width is paraNP-complete
(available as arXiv preprint) | 2025-01-01 | Paper |
Planar induced paths via a decomposition into non-crossing ordered graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Counterexamples to statements on isometric graph coverings
(available as arXiv preprint) | 2025-01-01 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-28 | Paper |
Small but unwieldy: a lower bound on adjacency labels for small classes
SIAM Journal on Computing | 2024-11-01 | Paper |
Cutting Barnette graphs perfectly is hard
Theoretical Computer Science | 2024-08-20 | Paper |
Symmetric-Difference (Degeneracy) and Signed Tree Models
(available as arXiv preprint) | 2024-01-01 | Paper |
Adjacency Labeling Schemes for Small Classes
(available as arXiv preprint) | 2024-01-01 | Paper |
Long induced paths in sparse graphs and graphs with forbidden patterns
(available as arXiv preprint) | 2024-01-01 | Paper |
Long induced paths and forbidden patterns: Polylogarithmic bounds
(available as arXiv preprint) | 2024-01-01 | Paper |
| Stretch-width | 2023-05-19 | Paper |
| A tamed family of triangle-free graphs with unbounded chromatic number | 2023-04-09 | Paper |
| On the minimum number of inversions to make a digraph k-(arc-)strong | 2023-03-21 | Paper |
| Cutting Barnette graphs perfectly is hard | 2023-02-22 | Paper |
| Maximum Independent Set when excluding an induced minor: K₁ + tK₂ and tC₃ \uplus C₄ | 2023-02-16 | Paper |
A tamed family of triangle-free graphs with unbounded chromatic number
(available as arXiv preprint) | 2023-01-01 | Paper |
