| Publication | Date of Publication | Type |
|---|
| Kinetic geodesic Voronoi diagrams in a simple polygon | 2026-03-18 | Paper |
| Fréchet distance for uncertain curves | 2026-03-18 | Paper |
Experimental analysis of algorithms for the dynamic graph coloring problem
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Segment visibility counting queries in polygons | 2024-09-11 | Paper |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2022-07-21 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain
Computational Geometry | 2021-01-07 | Paper |
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
(available as arXiv preprint) | 2020-11-25 | Paper |
Routing in polygonal domains
(available as arXiv preprint) | 2020-11-25 | Paper |
Faster DBScan and HDBscan in low-dimensional Euclidean spaces
(available as arXiv preprint) | 2020-11-25 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
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 |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | 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 |
| Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
| On interference among moving sensors and related problems | 2018-06-05 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
| Improved time-space trade-offs for computing Voronoi diagrams | 2018-04-19 | Paper |
On interference among moving sensors and related problems
(available as arXiv preprint) | 2018-03-02 | Paper |
Line segment covering of cells in arrangements
Information Processing Letters | 2017-10-18 | Paper |
Time-space trade-offs for triangulating a simple polygon
(available as arXiv preprint) | 2017-10-17 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
| Hanabi is NP-complete, even for cheaters who look at their cards | 2017-07-17 | Paper |
Hanabi is NP-hard, even for cheaters who look at their cards
Theoretical Computer Science | 2017-05-12 | Paper |
| Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | 2017-03-09 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Distance-sensitive planar point location
Computational Geometry | 2016-05-17 | Paper |
Line segment covering of cells in arrangements
Lecture Notes in Computer Science | 2016-02-05 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Kinetic convex hulls and Delaunay triangulations in the black-box model
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Distance-Sensitive Planar Point Location
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
Algorithms – ESA 2012 | 2012-09-25 | Paper |
