| Publication | Date of Publication | Type |
|---|
| An improved bound for plane covering paths | 2026-08-31 | Paper |
| Tight bounds on the number of closest pairs in vertical slabs | 2026-08-11 | Paper |
| Polychromatic coloring of tuples in hypergraphs | 2026-08-11 | Paper |
| Polynomial-time algorithms for contiguous art gallery and related problems | 2026-08-11 | Paper |
| Minimum plane bichromatic spanning trees | 2026-06-08 | Paper |
| Art galleries and mobile guards: revisiting O'Rourke's proof | 2026-05-26 | Paper |
Noncrossing longest paths and cycles
Graphs and Combinatorics | 2026-01-29 | Paper |
Piercing unit geodesic disks
Computational Geometry | 2026-01-22 | Paper |
City guarding with cameras of bounded field of view
Computational Geometry | 2026-01-16 | Paper |
On separating path and tree systems in graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
Metric and geometric spanners that are resilient to degree-bounded edge faults
Journal of Computational Geometry | 2025-12-04 | Paper |
Minimum plane bichromatic spanning trees
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| Noncrossing longest paths and cycles | 2025-10-07 | Paper |
Art galleries and mobile guards: revisiting O'Rourke's proof
Journal of Computational Geometry | 2025-05-22 | Paper |
Approximating average bounded-angle minimum spanning trees
Computational Geometry | 2025-03-10 | Paper |
Euclidean maximum matchings in the plane -- local to global
Algorithmica | 2025-01-24 | Paper |
Acute tours in the plane
Discrete & Computational Geometry | 2024-10-25 | Paper |
Improved bounds for covering paths and trees in the plane
Journal of Computational Geometry | 2024-10-18 | Paper |
| Improved bounds for covering paths and trees in the plane | 2024-10-16 | Paper |
The minimum consistent spanning subset problem on trees
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| A short proof of the toughness of Delaunay triangulations | 2024-05-14 | Paper |
| Acute tours in the plane | 2024-05-14 | Paper |
| A 10-approximation of the \(\frac{\pi}{2}\)-MST | 2024-04-23 | Paper |
| scientific article; zbMATH DE number 7788580 (Why is no real title available?) | 2024-01-15 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| Bounded-Angle Minimum Spanning Trees | 2023-11-02 | Paper |
| scientific article; zbMATH DE number 7746017 (Why is no real title available?) | 2023-10-05 | Paper |
Simple linear time algorithms for piercing pairwise intersecting disks
Computational Geometry | 2023-07-31 | Paper |
Piercing pairwise intersecting convex shapes in the plane
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| scientific article; zbMATH DE number 7691269 (Why is no real title available?) | 2023-06-01 | Paper |
Token Swapping on Trees
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7662164 (Why is no real title available?)
(available as arXiv preprint) | 2023-03-10 | Paper |
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
| A short proof of the non-biplanarity of \(K_9\) | 2022-07-01 | Paper |
A short proof of the non-biplanarity of $K_9$
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
On the spanning and routing ratios of the directed _6-graph
Computational Geometry | 2022-06-13 | Paper |
| On the spanning and routing ratios of the directed _6-graph | 2022-03-25 | Paper |
| The minimum moving spanning tree problem | 2022-03-25 | Paper |
| Euclidean maximum matchings in the plane -- local to global | 2022-03-25 | Paper |
Bounded-angle minimum spanning trees
Algorithmica | 2022-02-01 | Paper |
Euclidean bottleneck bounded-degree spanning tree ratios
Discrete & Computational Geometry | 2022-01-14 | Paper |
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
(available as arXiv preprint) | 2021-10-04 | Paper |
Rollercoasters and caterpillars
(available as arXiv preprint) | 2021-07-28 | Paper |
On the minimum consistent subset problem
Algorithmica | 2021-06-30 | Paper |
A short proof of the toughness of Delaunay triangulations
(available as arXiv preprint) | 2021-03-17 | Paper |
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Minimum ply covering of points with disks and squares
Computational Geometry | 2021-01-07 | Paper |
Faster algorithms for some optimization problems on collinear points
(available as arXiv preprint) | 2020-11-12 | Paper |
Plane hop spanners for unit disk graphs: simpler and better
Computational Geometry | 2020-10-23 | Paper |
Packing plane spanning trees into a point set
Computational Geometry | 2020-10-23 | Paper |
| On the size of outer-string representations | 2020-08-25 | Paper |
| Flip distance to some plane configurations | 2020-08-25 | Paper |
| Improved bounds for guarding plane graphs with edges | 2020-08-25 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-08-18 | Paper |
Packing boundary-anchored rectangles and squares
Computational Geometry | 2020-03-23 | Paper |
Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs
(available as arXiv preprint) | 2020-02-24 | Paper |
Plane and planarity thresholds for random geometric graphs
Discrete Mathematics, Algorithms and Applications | 2020-02-18 | Paper |
| Plane hop spanners for unit disk graphs | 2020-01-16 | Paper |
On the minimum consistent subset problem
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
Information Processing Letters | 2019-11-21 | Paper |
Flip distance to some plane configurations
Computational Geometry | 2019-10-25 | Paper |
Flip distance to some plane configurations
Computational Geometry | 2019-10-25 | Paper |
Rollercoasters: Long Sequences without Short Runs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Improved bounds for guarding plane graphs with edges
Graphs and Combinatorics | 2019-05-03 | Paper |
Improved bounds for guarding plane graphs with edges
Graphs and Combinatorics | 2019-05-03 | Paper |
Maximum plane trees in multipartite geometric graphs
Algorithmica | 2019-04-25 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Computational Geometry | 2018-11-01 | Paper |
Plane bichromatic trees of low degree
Discrete & Computational Geometry | 2018-07-13 | Paper |
| Towards plane spanners of degree 3 | 2018-04-19 | Paper |
Strong matching of points with geometric shapes
Computational Geometry | 2018-02-19 | Paper |
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
Computational Geometry | 2018-01-19 | Paper |
| scientific article; zbMATH DE number 6792401 (Why is no real title available?) | 2017-10-17 | Paper |
Maximum plane trees in multipartite geometric graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Faster algorithms for the minimum red-blue-purple spanning graph problem
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
| A plane 1.88-spanner for points in convex position | 2017-03-30 | Paper |
Towards plane spanners of degree 3
(available as arXiv preprint) | 2017-03-30 | Paper |
Plane bichromatic trees of low degree
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
Computational Geometry | 2016-01-15 | Paper |
Approximating the bottleneck plane perfect matching of a point set
Computational Geometry | 2016-01-15 | Paper |
Packing plane perfect matchings into a point set
(available as arXiv preprint) | 2015-12-03 | Paper |
| Packing plane perfect matchings into a point set | 2015-12-03 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On the hardness of full Steiner tree problems
Journal of Discrete Algorithms | 2015-08-24 | Paper |
Matchings in higher-order Gabriel graphs
Theoretical Computer Science | 2015-07-24 | Paper |
On full Steiner trees in unit disk graphs
Computational Geometry | 2015-06-17 | Paper |
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Fixed-orientation equilateral triangle matching of point sets
Theoretical Computer Science | 2014-10-06 | Paper |
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
Computational Geometry | 2014-01-22 | Paper |
Fixed-orientation equilateral triangle matching of point sets
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software | 2012-06-13 | Paper |
