| Publication | Date of Publication | Type |
|---|
| Reconfiguration in curve arrangements to reduce self-intersections and popular faces | 2026-09-21 | Paper |
| Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings | 2026-08-11 | Paper |
| Efficient Fréchet distance queries for segments | 2025-06-19 | Paper |
| Weakly and Strongly Fan-Planar Graphs | 2023-08-17 | Paper |
The thickness of fan-planar graphs is at most three
Lecture Notes in Computer Science | 2023-08-16 | Paper |
One-bend drawings of outerplanar graphs inside simple polygons
(available as arXiv preprint) | 2022-07-01 | Paper |
| Recognizing planar Laman graphs | 2022-05-11 | Paper |
Augmenting Geometric Graphs with Matchings
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
Journal of Graph Algorithms and Applications | 2021-01-19 | Paper |
| On Romeo and Juliet problems: minimizing distance-to-sight | 2020-08-25 | Paper |
| Edge-orders | 2020-05-27 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
Convexity-increasing morphs of planar graphs
Computational Geometry | 2019-10-25 | Paper |
Edge-orders
Algorithmica | 2019-05-07 | Paper |
Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
Information Processing Letters | 2019-03-11 | Paper |
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
(available as arXiv preprint) | 2019-02-15 | Paper |
Convexity-increasing morphs of planar graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
| On Gallai's conjecture for series-parallel graphs and planar 3-trees | 2017-06-13 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
Finding largest rectangles in convex polygons
Computational Geometry | 2016-01-18 | Paper |
Convex transversals
Computational Geometry | 2014-01-22 | Paper |
Covering and piercing disks with two centers
Computational Geometry | 2013-01-25 | Paper |
Computing the discrete Fréchet distance with imprecise input
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Largest inscribed rectangles in convex polygons
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Covering and piercing disks with two centers
Algorithms and Computation | 2011-12-16 | Paper |
Convex transversals
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Computing the discrete Fréchet distance with imprecise input
Algorithms and Computation | 2010-12-09 | Paper |
