| Publication | Date of Publication | Type |
|---|
| The complexity of geodesic spanners using Steiner points | 2026-06-08 | Paper |
| Dynamic embeddings of dynamic single-source upward planar graphs | 2026-05-26 | Paper |
| Crossing-optimal extension of simple drawings | 2026-05-12 | Paper |
| Characterizing universal reconfigurability of modular pivoting robots | 2026-04-27 | Paper |
| Optimal in-place compaction of sliding cubes | 2025-12-02 | Paper |
Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
Algorithmica | 2025-11-25 | Paper |
| Optimal in-place compaction of sliding cubes (media exposition) | 2025-11-24 | Paper |
| On k-plane insertion into plane drawings | 2025-10-07 | Paper |
| Augmenting plane straight-line graphs to meet parity constraints | 2025-05-02 | Paper |
Edge-minimum saturated \(k\)-planar drawings
Journal of Graph Theory | 2024-07-02 | Paper |
| Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete | 2024-05-31 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
Perfect matchings with crossings
Algorithmica | 2024-03-25 | Paper |
| Hiding sliding cubes: why reconfiguring modular robots is not easy (media exposition) | 2023-11-02 | Paper |
Shooting stars in simple drawings of \(K_{m,n}\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Inserting one edge into a simple drawing is hard
Discrete & Computational Geometry | 2023-03-09 | Paper |
Graphs with large total angular resolution
Theoretical Computer Science | 2023-01-05 | Paper |
Inserting one edge into a simple drawing is hard
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
On Compatible Matchings
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
How to fit a tree in a box
Graphs and Combinatorics | 2022-09-28 | Paper |
| Perfect matchings with crossings | 2022-08-30 | Paper |
Edge-minimum saturated \(k\)-planar drawings
(available as arXiv preprint) | 2022-07-01 | Paper |
Crossing Numbers of Beyond-Planar Graphs Revisited
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
(available as arXiv preprint) | 2022-05-11 | Paper |
Efficient segment folding is hard
Computational Geometry | 2022-04-08 | Paper |
Upward point set embeddings of paths and trees
(available as arXiv preprint) | 2021-10-04 | Paper |
On compatible matchings
(available as arXiv preprint) | 2021-10-04 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Edge-Minimum Saturated k-Planar Drawings
(available as arXiv preprint) | 2020-12-15 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2020-10-26 | Paper |
Extending simple drawings
(available as arXiv preprint) | 2020-10-26 | Paper |
On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
(available as arXiv preprint) | 2020-08-25 | Paper |
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
On the 2-colored crossing number
(available as arXiv preprint) | 2019-08-18 | Paper |
How to fit a tree in a box
Lecture Notes in Computer Science | 2019-02-15 | Paper |
A superlinear lower bound on the number of 5-holes
(available as arXiv preprint) | 2018-08-13 | Paper |
