| Publication | Date of Publication | Type |
|---|
| Asymmetric convex intersection testing | 2024-08-26 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Well-separation and hyperplane transversals in high dimensions | 2024-05-27 | Paper |
| Nearest-neighbor decompositions of drawings | 2024-05-27 | Paper |
| Long plane trees | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
Dynamic connectivity in disk graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
Flipping plane spanning paths
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Compact Routing in Unit Disk Graphs | 2023-11-14 | Paper |
Long Alternating Paths Exist
(available as arXiv preprint) | 2023-11-02 | Paper |
| No-dimensional Tverberg Theorems and Algorithms | 2023-11-02 | Paper |
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Maximum matchings in geometric intersection graphs
Discrete & Computational Geometry | 2023-10-12 | Paper |
Compatible spanning trees in simple drawings of \(K_n\)
Lecture Notes in Computer Science | 2023-08-16 | Paper |
scientific article; zbMATH DE number 7650916 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
No-dimensional Tverberg theorems and algorithms
Discrete & Computational Geometry | 2022-12-08 | Paper |
| scientific article; zbMATH DE number 7561404 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561700 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561380 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559226 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Triangles and girth in disk graphs and transmission graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
On the stretch factor of polygonal chains
SIAM Journal on Discrete Mathematics | 2021-07-23 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
A simple randomized \(O(N\log N)\)-time closest-pair algorithm in doubling metrics
(available as arXiv preprint) | 2021-01-12 | Paper |
Time-space trade-offs for computing Euclidean minimum spanning trees
Journal of Computational Geometry | 2021-01-12 | Paper |
Combinatorics of beacon-based routing in three dimensions
Computational Geometry | 2021-01-07 | Paper |
Minimum cuts in geometric intersection graphs
Computational Geometry | 2021-01-07 | Paper |
Routing in polygonal domains
(available as arXiv preprint) | 2020-11-25 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
Discrete & Computational Geometry | 2020-10-23 | Paper |
Routing in histograms
(available as arXiv preprint) | 2020-07-22 | Paper |
Routing in polygonal domains
Computational Geometry | 2020-04-22 | Paper |
A constructive proof of a concentration bound for real-valued random variables
Information Processing Letters | 2020-04-03 | Paper |
Reachability oracles for directed transmission graphs
Algorithmica | 2020-04-01 | Paper |
Combinatorics of beacon-based routing in three dimensions
Lecture Notes in Computer Science | 2020-02-12 | Paper |
Recognizing generalized transmission graphs of line segments and circular sectors
(available as arXiv preprint) | 2020-02-12 | Paper |
Time-space trade-offs for computing Euclidean minimum spanning trees
Lecture Notes in Computer Science | 2020-02-12 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
Theoretical Computer Science | 2019-09-10 | Paper |
| scientific article; zbMATH DE number 7075945 (Why is no real title available?) | 2019-07-03 | Paper |
scientific article; zbMATH DE number 7075945 (Why is no real title available?)
(available as arXiv preprint) | 2019-07-03 | Paper |
Four Soviets walk the dog -- with an application to Alt's conjecture
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved time-space trade-offs for computing Voronoi diagrams
Journal of Computational Geometry | 2019-02-27 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Computational Geometry | 2018-10-31 | Paper |
Computational aspects of the colorful Carathéodory theorem
Discrete & Computational Geometry | 2018-10-30 | Paper |
Spanners for directed transmission graphs
SIAM Journal on Computing | 2018-08-21 | Paper |
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Improved time-space trade-offs for computing Voronoi diagrams | 2018-04-19 | Paper |
Routing in unit disk graphs
Algorithmica | 2018-04-11 | Paper |
The dual diameter of triangulations
Computational Geometry | 2018-02-19 | Paper |
An optimal algorithm for reconstructing point set order types from radial orderings
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| scientific article; zbMATH DE number 6789180 (Why is no real title available?) | 2017-10-10 | Paper |
| Approximability of the discrete Fréchet distance | 2017-10-10 | Paper |
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
Discrete & Computational Geometry | 2017-10-10 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
| Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent | 2017-09-29 | Paper |
| Delta-fast tries: local searches in bounded universes with linear space | 2017-09-22 | Paper |
Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
| Approximability of the discrete Fréchet distance | 2017-03-30 | Paper |
| Constant-work-space algorithms for geometric problems | 2017-03-09 | Paper |
Unions of onions: preprocessing imprecise points for fast onion decomposition
(available as arXiv preprint) | 2017-03-09 | Paper |
Computing the Fréchet distance with a retractable leash
Discrete & Computational Geometry | 2016-09-14 | Paper |
Routing in unit disk graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
Algorithms and Computation | 2016-01-11 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Discrete & Computational Geometry | 2015-12-02 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Lecture Notes in Computer Science | 2015-10-30 | Paper |
ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Data structures on event graphs
Algorithmica | 2015-06-25 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Approximating Tverberg points in linear time for any fixed dimension
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Self-improving algorithms for coordinatewise maxima and convex hulls
SIAM Journal on Computing | 2014-07-30 | Paper |
Delaunay Triangulations in O(sort(n)) Time and More
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
| Self-improving algorithms for convex hulls | 2014-05-22 | Paper |
Convex hull of imprecise points in \(o(n \log n)\) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry | 2014-01-22 | Paper |
Algorithms for tolerated Tverberg partitions
Algorithms and Computation | 2014-01-14 | Paper |
Constant-work-space algorithms for shortest paths in trees and simple polygons
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Approximating Tverberg points in linear time for any fixed dimension
Discrete & Computational Geometry | 2013-09-23 | Paper |
Computing the Fréchet distance with a retractable leash
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Vertex deletion for 3D Delaunay triangulations
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
Computational Geometry | 2013-03-07 | Paper |
Triangulating the square and squaring the triangle: quadtrees and Delaunay triangulations are equivalent
SIAM Journal on Computing | 2012-11-29 | Paper |
Data structures on event graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Preprocessing imprecise points for Delaunay triangulation: simplified and extended
Algorithmica | 2011-11-07 | Paper |
Self-improving algorithms
SIAM Journal on Computing | 2011-07-29 | Paper |
Delaunay triangulations in O (sort( n )) time and more
Journal of the ACM | 2011-07-14 | Paper |
Computing hereditary convex structures
Discrete & Computational Geometry | 2011-06-03 | Paper |
A note on predecessor searching in the pointer machine model
Information Processing Letters | 2010-08-20 | Paper |
Constant-work-space algorithm for a shortest path in a simple polygon
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Delaunay Triangulation of Imprecise Points Simplified and Extended
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Markov incremental constructions
Discrete & Computational Geometry | 2009-08-27 | Paper |
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| Minimum weight triangulation is NP-hard | 2009-02-10 | Paper |
Minimum-weight triangulation is NP-hard
Journal of the ACM | 2008-12-21 | Paper |
