| Publication | Date of Publication | Type |
|---|
| The Fréchet distance unleashed: approximating a dog with a frog | 2026-08-11 | Paper |
| The road to the closest point is paved by good neighbors | 2026-07-08 | Paper |
No-dimensional Tverberg partitions revisited Discrete & Computational Geometry | 2026-07-07 | Paper |
| Approximating densest subgraph in geometric intersection graphs | 2026-06-24 | Paper |
| Approximate shape fitting via linearization | 2026-05-08 | Paper |
| Clustering motion | 2026-05-08 | Paper |
| A replacement for Voronoi diagrams of near linear size | 2026-05-08 | Paper |
| Taking a walk in a planar arrangement | 2026-05-06 | Paper |
| On undecided LP, clustering and active learning | 2026-04-27 | Paper |
| Stabbing convex bodies with lines and flats | 2026-04-27 | Paper |
| Reliable spanners for metric spaces | 2026-04-27 | Paper |
| Active learning a convex body in low dimensions | 2026-03-18 | Paper |
| Oracle-augmented prophet inequalities | 2026-01-14 | Paper |
| No-dimensional Tverberg partitions revisited | 2025-12-02 | Paper |
| Local spanners revisited | 2025-12-02 | Paper |
| Near optimal locality sensitive orderings in Euclidean space | 2025-11-24 | Paper |
On the budgeted Hausdorff distance problem CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
How packed is it, really? CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
Near-optimal Euclidean locality-sensitive orderings Journal of Computational Geometry | 2025-08-28 | Paper |
| Approximating minimization diagrams and generalized proximity search | 2025-05-20 | Paper |
| Down the rabbit hole: robust proximity search and density estimation in sublinear space | 2025-05-05 | Paper |
Computing instance-optimal kernels in two dimensions Discrete & Computational Geometry | 2025-03-19 | Paper |
On the number of incidences when avoiding an induced biclique in geometric settings Discrete & Computational Geometry | 2025-02-19 | Paper |
Sparsifying disk intersection graphs for reliable connectivity CGT. Computing in Geometry and Topology | 2025-02-03 | Paper |
An Easy Proof of a Weak Version of Chernoff inequality (available as arXiv preprint) | 2025-01-01 | Paper |
| Fast approximation algorithms for piercing boxes by points | 2024-11-28 | Paper |
| Computing instance-optimal kernels in two dimensions | 2024-10-16 | Paper |
| Revisiting random points: combinatorial complexity and algorithms | 2024-05-29 | Paper |
| Halving by a thousand cuts or punctures | 2024-05-14 | Paper |
| On the number of incidences when avoiding an induced biclique in geometric settings | 2024-05-14 | Paper |
| Approximation algorithms for maximum matchings in geometric intersection graphs | 2024-05-14 | Paper |
Submodular clustering in low dimensions (available as arXiv preprint) | 2023-11-02 | Paper |
Fast Algorithms for Geometric Consensuses (available as arXiv preprint) | 2023-11-02 | Paper |
Reliable Spanners for Metric Spaces ACM Transactions on Algorithms | 2023-10-23 | Paper |
Improved Approximation Algorithms for Tverberg Partitions (available as arXiv preprint) | 2023-09-20 | Paper |
A note on stabbing convex bodies with points, lines, and flats Discrete & Computational Geometry | 2023-05-12 | Paper |
Edge Estimation with Independent Set Oracles ACM Transactions on Algorithms | 2023-04-26 | Paper |
Few cuts meet many point sets Algorithmica | 2023-04-11 | Paper |
| Sometimes Reliable Spanners of Almost Linear Size. | 2023-02-07 | Paper |
| Stabbing pairwise intersecting disks by five points | 2022-07-21 | Paper |
| A spanner for the day after | 2022-07-18 | Paper |
| Smallest k-enclosing rectangle revisited | 2022-07-18 | Paper |
| Journey to the Center of the Point Set | 2022-07-18 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2022-07-18 | Paper |
Optimal algorithms for geometric centers and depth SIAM Journal on Computing | 2022-06-08 | Paper |
Sometimes reliable spanners of almost linear size (available as arXiv preprint) | 2022-05-18 | Paper |
The maximum-level vertex in an arrangement of lines Discrete & Computational Geometry | 2022-03-21 | Paper |
Journey to the Center of the Point Set ACM Transactions on Algorithms | 2022-02-08 | Paper |
Smallest \(k\)-enclosing rectangle revisited Discrete & Computational Geometry | 2021-08-18 | Paper |
Approximate sparse linear regression (available as arXiv preprint) | 2021-07-28 | Paper |
Edge estimation with independent set oracles (available as arXiv preprint) | 2021-06-15 | 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 |
Active-learning a convex body in low dimensions Algorithmica | 2021-06-11 | Paper |
Grid Peeling and the Affine Curve-Shortening Flow Experimental Mathematics | 2021-04-01 | Paper |
Fast LP-based Approximations for Geometric Packing and Covering Problems Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A spanner for the day after Discrete & Computational Geometry | 2021-01-29 | Paper |
Approximate greedy clustering and distance selection for graph metrics (available as arXiv preprint) | 2021-01-12 | Paper |
On locality-sensitive orderings and their applications SIAM Journal on Computing | 2020-08-03 | Paper |
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location Discrete & Computational Geometry | 2020-06-16 | Paper |
On separating points by lines Discrete & Computational Geometry | 2020-04-07 | Paper |
Approximation schemes for independent set and sparse subsets of polygons Journal of the ACM | 2020-02-11 | Paper |
Sparse Approximation via Generating Point Sets ACM Transactions on Algorithms | 2019-11-25 | Paper |
Grid peeling and the affine curve-shortening flow 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Euclidean spanners in high dimensions Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Jaywalking your dog: computing the Fréchet distance with shortcuts | 2019-05-10 | Paper |
The one-round Voronoi game Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Optimally cutting a surface into a disk Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Projective clustering in high dimensions using core-sets Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
On the expected complexity of Voronoi diagrams on terrains ACM Transactions on Algorithms | 2018-11-05 | Paper |
Nearest-neighbor searching under uncertainty. II ACM Transactions on Algorithms | 2018-11-05 | 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 |
Approximating the k-level in three-dimensional plane arrangements Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Proximity in the age of distraction: robust approximate nearest neighbor search Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Quasi-polynomial time approximation scheme for sparse subsets of polygons Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On the Complexity of Randomly Weighted Voronoi Diagrams Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6850368 (Why is no real title available?) | 2018-03-15 | Paper |
Robust proximity search for balls using sublinear space Algorithmica | 2018-02-28 | Paper |
Robust proximity search for balls using sublinear space Algorithmica | 2018-02-28 | Paper |
Approximating the k-Level in Three-Dimensional Plane Arrangements A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Separating a Voronoi diagram via local search (available as arXiv preprint) | 2018-01-30 | Paper |
Approximation algorithms for polynomial-expansion and low-density graphs SIAM Journal on Computing | 2017-11-22 | Paper |
Geometric Packing under Nonuniform Constraints SIAM Journal on Computing | 2017-11-22 | Paper |
Smaller coresets for \(k\)-median and \(k\)-means clustering Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Fast construction of nets in low dimensional metrics, and their applications Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
A time-optimal delaunay refinement algorithm in two dimensions Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Approximation algorithms for maximum independent set of pseudo-disks Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
On the set multi-cover problem in geometric settings Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Shortest Path in a Polygon using Sublinear Space. | 2017-10-10 | Paper |
| Space exploration via proximity search | 2017-10-10 | Paper |
| From proximity to utility: a Voronoi partition of Pareto optima | 2017-10-10 | Paper |
Convex hulls under uncertainty Algorithmica | 2017-10-10 | Paper |
When crossings count — approximating the minimum spanning tree Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Computing approximate shortest paths on convex polytopes Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
A practical approach for computing the diameter of a point set Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Shape fitting with outliers Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
High-dimensional shape fitting in linear time Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Efficient algorithms for shared camera control Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On conflict-free coloring of points and simple regions in the plane Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Hausdorff distance under translation for points and balls Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the least median square problem Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |