| Publication | Date of Publication | Type |
|---|
| Fréchet distance for uncertain curves | 2026-03-18 | Paper |
| Fréchet edit distance | 2025-11-24 | Paper |
On the budgeted Hausdorff distance problem
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| Reality distortion: exact and approximate algorithms for embedding into the line | 2025-08-05 | Paper |
Linear expected complexity for directional and multiplicative Voronoi diagrams
Discrete & Computational Geometry | 2025-01-14 | Paper |
| Clustering with faulty centers | 2024-09-11 | Paper |
| On cyclic solutions to the min-max latency multi-robot patrolling problem | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7799604 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7788579 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Generalized Metric Repair on Graphs
(available as arXiv preprint) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7651184 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Correction to: ``Avoiding the global sort: a faster contour tree algorithm''
Discrete & Computational Geometry | 2023-01-23 | Paper |
| Approximating Distance Measures for the Skyline | 2022-07-21 | Paper |
Metric violation distance: hardness and approximation
Algorithmica | 2022-05-03 | Paper |
Sparse convex hull coverage
Computational Geometry | 2021-09-17 | Paper |
Computing the Fréchet gap distance
Discrete & Computational Geometry | 2021-04-29 | Paper |
Sparse Approximation via Generating Point Sets
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Viewing the rings of a tree: minimum distortion embeddings into trees
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the expected complexity of Voronoi diagrams on terrains
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Computing the Fréchet Gap Distance | 2018-08-13 | Paper |
Net and prune: a linear time algorithm for Euclidean distance problems
Journal of the ACM | 2018-08-02 | Paper |
Sparse approximation via generating point sets
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the Complexity of Randomly Weighted Voronoi Diagrams
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Most likely Voronoi diagrams in higher dimensions | 2018-04-19 | Paper |
| Metric violation distance: hardness and approximation | 2018-03-15 | Paper |
| Avoiding the global sort: a faster contour tree algorithm | 2018-01-30 | Paper |
Avoiding the global sort: a faster contour tree algorithm
Discrete & Computational Geometry | 2018-01-11 | Paper |
Avoiding the global sort: a faster contour tree algorithm
Discrete & Computational Geometry | 2018-01-11 | Paper |
Geometric Packing under Nonuniform Constraints
SIAM Journal on Computing | 2017-11-22 | Paper |
| Space exploration via proximity search | 2017-10-10 | Paper |
| From proximity to utility: a Voronoi partition of Pareto optima | 2017-10-10 | Paper |
From proximity to utility: a Voronoi partition of Pareto optima
Discrete & Computational Geometry | 2016-10-27 | Paper |
From proximity to utility: a Voronoi partition of Pareto optima
Discrete & Computational Geometry | 2016-10-27 | Paper |
Space exploration via proximity search
Discrete & Computational Geometry | 2016-09-14 | Paper |
Space exploration via proximity search
Discrete & Computational Geometry | 2016-09-14 | Paper |
The Fréchet distance revisited and extended
ACM Transactions on Algorithms | 2015-08-14 | Paper |
On the complexity of randomly weighted multiplicative Voronoi diagrams
Discrete & Computational Geometry | 2015-06-18 | Paper |
Net and prune: a linear time algorithm for Euclidean distance problems
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On the expected complexity of Voronoi diagrams on terrains
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
