| Publication | Date of Publication | Type |
|---|
| Asymmetric convex intersection testing | 2024-08-26 | Paper |
| scientific article; zbMATH DE number 7559212 (Why is no real title available?) | 2022-07-18 | Paper |
Weight balancing on boundaries
(available as arXiv preprint) | 2022-05-18 | Paper |
Time-space trade-offs for computing Euclidean minimum spanning trees
Journal of Computational Geometry | 2021-01-12 | Paper |
The geodesic farthest-point Voronoi diagram in a simple polygon
Algorithmica | 2020-04-01 | Paper |
Time-space trade-offs for computing Euclidean minimum spanning trees
Lecture Notes in Computer Science | 2020-02-12 | Paper |
The complexity of optimization on grids
Algorithmica | 2019-08-20 | Paper |
Subquadratic algorithms for algebraic 3SUM
Discrete & Computational Geometry | 2019-05-21 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | Paper |
Drawing the Horton set in an integer grid of minimum size
Computational Geometry | 2018-11-01 | Paper |
Subquadratic algorithms for algebraic generalizations of 3SUM
(available as arXiv preprint) | 2018-08-13 | Paper |
Corrigendum to ``Asymmetric polygons with maximum area
European Journal of Operational Research | 2018-05-30 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Linear transformation distance for bichromatic matchings
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Linear transformation distance for bichromatic matchings
Computational Geometry | 2018-02-19 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
| The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon | 2018-01-30 | Paper |
| Incremental Voronoi diagrams | 2018-01-30 | Paper |
Incremental Voronoi diagrams
Discrete & Computational Geometry | 2018-01-11 | Paper |
Incremental Voronoi diagrams
Discrete & Computational Geometry | 2018-01-11 | Paper |
| scientific article; zbMATH DE number 6789192 (Why is no real title available?) | 2017-10-10 | Paper |
Optimal detection of intersections between convex polyhedra
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Compatible connectivity-augmentation of planar disconnected graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
Space-time trade-offs for stack-based algorithms
(available as arXiv preprint) | 2017-01-30 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete & Computational Geometry | 2016-12-20 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete & Computational Geometry | 2016-12-20 | Paper |
Asymmetric polygons with maximum area
European Journal of Operational Research | 2016-10-07 | Paper |
Deterministic algorithms for unique sink orientations of grids
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Compatible connectivity augmentation of planar disconnected graphs
Discrete & Computational Geometry | 2015-12-02 | Paper |
Space-time trade-offs for stack-based algorithms
Algorithmica | 2015-09-02 | Paper |
Bichromatic compatible matchings
Computational Geometry | 2015-07-27 | Paper |
Isoperimetric enclosures
Graphs and Combinatorics | 2015-05-22 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
Bichromatic compatible matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
Computing a visibility polygon using few variables
Computational Geometry | 2014-08-13 | Paper |
Optimal algorithms for constrained 1-center problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
The Erdős-Sós conjecture for geometric graphs
(available as arXiv preprint) | 2014-02-14 | Paper |
| The Erdős-Sós conjecture for geometric graphs | 2014-02-14 | Paper |
On edge-disjoint empty triangles of point sets
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
On the stretch factor of the theta-4 graph
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Computing the visibility polygon using few variables
Algorithms and Computation | 2011-12-16 | Paper |
