| Publication | Date of Publication | Type |
|---|
The Density Formula: One Lemma to Bound Them All
(available as arXiv preprint) | N/A | Paper |
Finding hardness reductions automatically using SAT solvers
(available as arXiv preprint) | N/A | Paper |
Holes in convex and simple drawings
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
| The bend number of cocomparability graphs | 2026-09-21 | Paper |
How many times can two minimum spanning trees cross?
(available as arXiv preprint) | 2026-01-01 | Paper |
| The density formula: one lemma to bound them all | 2025-10-07 | Paper |
| Holes in convex and simple drawings | 2025-10-07 | Paper |
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
| Topological drawings and the structure of crossings | 2024-10-31 | Paper |
| Linear size universal point sets for classes of planar graphs | 2024-10-16 | 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 |
| Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming | 2024-06-24 | Paper |
Holes in Convex and Simple Drawings
(available as arXiv preprint) | 2024-01-01 | Paper |
Topological drawings meet classical theorems from convex geometry
Discrete & Computational Geometry | 2023-10-12 | Paper |
Simplifying Non-Simple Fan-Planar Drawings
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
| Linear Size Universal Point Sets for Classes of Planar Graphs | 2023-02-28 | Paper |
Simplifying non-simple fan-planar drawings
(available as arXiv preprint) | 2022-07-01 | Paper |
| Coloring circle arrangements: New 4-chromatic planar graphs | 2022-05-17 | Paper |
Coloring drawings of graphs
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
Topological Drawings Meet Classical Theorems from Convex Geometry
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Improved bounds for centered colorings
Advances in Combinatorics | 2021-11-05 | Paper |
Improved bounds for centered colorings
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On the complexity of digraph colourings and vertex arboricity
(available as arXiv preprint) | 2020-10-28 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2020-10-26 | Paper |
On the edge-vertex ratio of maximal thrackles
(available as arXiv preprint) | 2019-08-23 | Paper |
