| Publication | Date of Publication | Type |
|---|
| A subquadratic algorithm for computing the L₁-distance between two terrains | 2026-08-11 | Paper |
| Optimal motion planning for two square robots in a rectilinear environment | 2026-08-11 | Paper |
| Near-optimal min-sum multi-robot motion planning in a planar polygonal environment | 2026-07-13 | Paper |
| Computing the heaviest disk and related problems | 2026-07-13 | Paper |
Segment proximity graphs and nearest neighbor queries amid disjoint segments Algorithmica | 2026-07-13 | Paper |
Semi-algebraic off-line range searching and biclique partitions in the plane Discrete & Computational Geometry | 2026-07-03 | Paper |
| Efficient approximation algorithm for computing Wasserstein barycenter under euclidean metric | 2026-07-03 | Paper |
| Lower envelopes of surface patches in 3-space | 2026-05-26 | Paper |
| Segment proximity graphs and nearest neighbor queries amid disjoint segments | 2026-05-26 | Paper |
| Approximating shortest paths on a nonconvex polyhedron | 2026-05-21 | Paper |
| An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D | 2026-05-12 | Paper |
| Dynamic enumeration of similarity joins | 2026-05-12 | Paper |
| On the complexity of many faces in arrangements of circles | 2026-05-08 | Paper |
| Clustering under perturbation stability in near-linear time | 2026-03-23 | Paper |
| Semi-algebraic off-line range searching and biclique partitions in the plane | 2025-11-24 | Paper |
| Computing data distribution from query selectivities | 2025-11-11 | Paper |
| Parametric and kinetic minimum spanning trees | 2025-10-29 | Paper |
Intersection queries for flat semi-algebraic objects in three dimensions and related problems ACM Transactions on Algorithms | 2025-10-01 | Paper |
On two-handed planar assembly partitioning with connectivity constraints ACM Transactions on Algorithms | 2025-07-22 | Paper |
| On range searching with semialgebraic sets. II | 2025-05-05 | Paper |
Computing instance-optimal kernels in two dimensions Discrete & Computational Geometry | 2025-03-19 | Paper |
Line intersection searching amid unit balls in 3-space Algorithmica | 2025-02-14 | Paper |
| Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D | 2024-11-28 | Paper |
| Fast and accurate approximations of the optimal transport in semi-discrete and discrete settings | 2024-11-28 | Paper |
| Fast approximation algorithms for piercing boxes by points | 2024-11-28 | Paper |
| Near-optimal min-sum motion planning for two square robots in a polygonal environment | 2024-11-28 | Paper |
Decomposing the complement of the union of cubes and boxes in three dimensions Discrete & Computational Geometry | 2024-10-25 | Paper |
| Computing instance-optimal kernels in two dimensions | 2024-10-16 | Paper |
| Line intersection searching amid unit balls in 3-space | 2024-10-16 | Paper |
| Multi-robot motion planning for unit discs with revolving areas | 2024-09-11 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2024-09-11 | Paper |
| An improved \(\varepsilon\)-approximation algorithm for geometric bipartite matching | 2024-05-27 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788424 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788443 (Why is no real title available?) (available as arXiv preprint) | 2024-01-15 | Paper |
Deterministic, near-linear <i>𝜀</i> -approximation algorithm for geometric bipartite matching Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On reverse shortest paths in geometric proximity graphs Computational Geometry | 2023-11-23 | Paper |
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead ACM Transactions on Algorithms | 2023-10-31 | Paper |
Multi-robot motion planning for unit discs with revolving areas Computational Geometry | 2023-07-31 | Paper |
Connected component and simple polygon intersection searching Lecture Notes in Computer Science | 2023-01-18 | Paper |
Star unfolding of a polytope with applications SWAT 90 | 2022-12-09 | Paper |
Intersection queries in sets of disks SWAT 90 | 2022-12-09 | Paper |
Computing depth orders and related problems Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Selection in monotone matrices and computing k th nearest neighbors Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Maintaining the extent of a moving point set Lecture Notes in Computer Science | 2022-08-19 | Paper |
On range searching with semialgebraic sets Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Approximate minimum-weight matching with outliers under translation (available as arXiv preprint) | 2022-07-21 | Paper |
| An efficient algorithm for generalized polynomial partitioning and its applications | 2022-07-18 | Paper |
Efficient algorithms for geometric partial matching (available as arXiv preprint) | 2022-07-18 | Paper |
Maintaining the union of unit discs under insertions with near-optimal overhead (available as arXiv preprint) | 2022-07-18 | Paper |
| Geometric optimization revisited | 2022-02-16 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-07-28 | Paper |
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications SIAM Journal on Computing | 2021-05-27 | Paper |
Union of hypercubes and 3D Minkowski sums with random sizes Discrete & Computational Geometry | 2021-04-29 | Paper |
| Maintaining Reeb graphs of triangulated 2-manifolds | 2020-11-25 | Paper |
A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching Journal of the ACM | 2020-11-11 | Paper |
| Computing shortest paths in the plane with removable obstacles | 2020-08-25 | Paper |
Improved dynamic geodesic nearest neighbor searching in a simple polygon (available as arXiv preprint) | 2020-08-18 | Paper |
| scientific article; zbMATH DE number 7204982 (Why is no real title available?) | 2020-05-27 | Paper |
Near-linear algorithms for geometric hitting sets and set covers Discrete & Computational Geometry | 2020-01-31 | Paper |
Computing the discrete Fréchet distance in subquadratic time Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Algorithms for the transportation problem in geometric settings | 2019-05-10 | Paper |
| Approximate Euclidean shortest paths amid convex obstacles | 2019-05-06 | Paper |
An efficient algorithm for computing high-quality paths amid polygonal obstacles ACM Transactions on Algorithms | 2019-03-28 | Paper |
Computing the Gromov-Hausdorff distance for metric trees ACM Transactions on Algorithms | 2018-11-13 | Paper |
Nearest-neighbor searching under uncertainty. II ACM Transactions on Algorithms | 2018-11-05 | Paper |
Kinetic and dynamic data structures for closest pair and all nearest neighbors ACM Transactions on Algorithms | 2018-11-05 | Paper |
Algorithms for center and Tverberg points ACM Transactions on Algorithms | 2018-11-05 | Paper |
Faster algorithms for the geometric transportation problem (available as arXiv preprint) | 2018-08-13 | Paper |
Efficient Algorithms for k-Regret Minimizing Sets (available as arXiv preprint) | 2018-08-13 | Paper |
An efficient algorithm for computing high-quality paths amid polygonal obstacles Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| An Efficient Algorithm for Placing Electric Vehicle Charging Stations. | 2018-04-19 | Paper |
Range-max queries on uncertain data Journal of Computer and System Sciences | 2018-04-18 | Paper |
Simplex Range Searching and Its Variants: A Review A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Approximating dynamic time warping and edit distance for a pair of point sequences (available as arXiv preprint) | 2018-01-30 | Paper |
Nearest-neighbor searching under uncertainty. I Discrete & Computational Geometry | 2017-10-25 | Paper |
Guarding a terrain by two watchtowers Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Near-linear approximation algorithms for geometric hitting sets Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Maintaining contour trees of dynamic terrains | 2017-10-10 | Paper |
Convex hulls under uncertainty Algorithmica | 2017-10-10 | Paper |
Computing approximate shortest paths on convex polytopes Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the number of congruent simplices in a point Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Box-trees and R-trees with near-optimal query time Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Cache-oblivious data structures for orthogonal range searching 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 lines avoiding unit balls in three dimensions Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Algorithms for center and Tverberg points Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A scalable simulator for forest dynamics Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A 2D kinetic triangulation with near-quadratic topological changes Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A near-linear constant-factor approximation for Euclidean bipartite matching? Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Practical methods for shape fitting and kinetic data structures using core sets Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Extreme elevation on a 2-manifold Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| I/O-efficient contour queries on terrains | 2017-09-29 | Paper |
Linear approximation of simple objects Information Processing Letters | 2016-05-26 | Paper |
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions Discrete & Computational Geometry | 2016-02-03 | Paper |
Computing the Gromov-Hausdorff distance for metric trees Lecture Notes in Computer Science | 2016-01-11 | Paper |
Mergeable summaries ACM Transactions on Database Systems | 2015-09-03 | Paper |
Efficient algorithms for bichromatic separability ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472587 (Why is no real title available?) | 2015-08-14 | Paper |