| Publication | Date of Publication | Type |
|---|
| Approximate nearest neighbor for curves -- simple, efficient, and deterministic | 2026-03-18 | Paper |
| Robustly guarding polygons | 2025-11-24 | Paper |
| Discrete Fréchet distance oracles | 2025-11-24 | Paper |
| Online range assignment problems | 2025-11-11 | Paper |
Intersection queries for flat semi-algebraic objects in three dimensions and related problems
ACM Transactions on Algorithms | 2025-10-01 | Paper |
Robustly guarding polygons
Journal of Computational Geometry | 2025-08-28 | Paper |
Discrete Fréchet distance oracles
Journal of Computational Geometry | 2025-08-28 | Paper |
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
Spanners under the Hausdorff and Fréchet distances
Information Processing Letters | 2024-09-11 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2024-09-11 | Paper |
| Dynamic approximate multiplicatively-weighted nearest neighbors | 2024-05-27 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
Stabbing pairwise intersecting disks by four points
Discrete & Computational Geometry | 2023-12-21 | Paper |
On reverse shortest paths in geometric proximity graphs
Computational Geometry | 2023-11-23 | Paper |
Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Bottleneck matching in the plane
Computational Geometry | 2023-06-26 | Paper |
Approximate nearest neighbor for curves: simple, efficient, and deterministic
Algorithmica | 2023-04-28 | Paper |
| Optimal line bipartitions of point sets | 2023-01-25 | Paper |
| Computing fair and bottleneck matchings in geometric graphs | 2023-01-25 | Paper |
Constrained square-center problems
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Computing depth orders and related problems
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Models and motion planning
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
Computational Geometry | 2022-10-06 | Paper |
Bipartite diameter and other measures under translation
Discrete & Computational Geometry | 2022-09-16 | Paper |
Dynamic data structures for fat objects and their applications
Lecture Notes in Computer Science | 2022-08-19 | Paper |
| scientific article; zbMATH DE number 7559117 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559380 (Why is no real title available?) | 2022-07-18 | Paper |
| A constant-factor approximation algorithm for vertex guarding a WV-polygon | 2022-05-13 | Paper |
| A 4-approximation of the \(\frac{2\pi }{3} \)-MST | 2022-03-25 | Paper |
A constant-factor approximation algorithm for vertex guarding a WV-polygon
(available as arXiv preprint) | 2022-03-22 | Paper |
| A constant-factor approximation algorithm for vertex guarding a WV-polygon | 2022-03-22 | Paper |
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Computational Geometry | 2022-01-03 | Paper |
Minimizing total interference in asymmetric sensor networks
Theoretical Computer Science | 2021-10-06 | Paper |
| Resolving SINR queries in a dynamic setting | 2021-07-28 | Paper |
Minimizing total interference in asymmetric sensor networks
Algorithms for Sensor Systems | 2021-07-08 | Paper |
Resolving SINR Queries in a Dynamic Setting
SIAM Journal on Computing | 2021-01-13 | Paper |
Improved PTASs for convex barrier coverage
Computational Geometry | 2021-01-07 | Paper |
Network optimization on partitioned pairs of points
(available as arXiv preprint) | 2020-11-25 | Paper |
Sensor network topology design and analysis for efficient data gathering by a mobile mule
Algorithmica | 2020-10-12 | Paper |
| Algorithms for the discrete Fréchet distance under translation | 2020-09-09 | Paper |
| scientific article; zbMATH DE number 7238975 (Why is no real title available?) | 2020-08-25 | Paper |
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
Approximation and Online Algorithms | 2020-08-24 | Paper |
Tracking paths
Discrete Applied Mathematics | 2020-06-05 | Paper |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Efficient nearest-neighbor query and clustering of planar curves
(available as arXiv preprint) | 2020-01-16 | Paper |
| scientific article; zbMATH DE number 7121835 (Why is no real title available?) | 2019-10-24 | Paper |
Batched point location in SINR diagrams via algebraic tools
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Bottleneck detour tree of points on a path
Computational Geometry | 2019-03-20 | Paper |
Locating battery charging stations to facilitate almost shortest paths
Discrete Applied Mathematics | 2019-02-08 | Paper |
Visibility preserving terrain simplification, an experimental study
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Selecting and covering colored points
Discrete Applied Mathematics | 2018-10-26 | Paper |
Improved PTASs for convex barrier coverage
Approximation and Online Algorithms | 2018-06-22 | Paper |
| On interference among moving sensors and related problems | 2018-06-05 | Paper |
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| On the general chain pair simplification problem | 2018-03-21 | Paper |
On interference among moving sensors and related problems
(available as arXiv preprint) | 2018-03-02 | Paper |
Farthest neighbors and center points in the presence of rectangular obstacles
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Computing the visibility graph of points within a polygon
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Tracking paths
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Algorithmica | 2017-03-27 | Paper |
Bounded-angle spanning tree: modeling networks with angular constraints
Algorithmica | 2017-03-03 | Paper |
Symmetric connectivity with directional antennas
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Choice is hard
Algorithms and Computation | 2016-01-11 | Paper |
On the Chain Pair Simplification Problem
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Batched point location in SINR diagrams via algebraic tools
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Bottleneck Steiner tree with bounded number of Steiner vertices
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Spiderman graph: visibility in urban regions
Computational Geometry | 2014-12-23 | Paper |
| A constant-factor approximation algorithm for optimal terrain guarding | 2014-10-13 | Paper |
Bounded-angle spanning tree: modeling networks with angular constraints
Automata, Languages, and Programming | 2014-07-01 | Paper |
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
Discrete & Computational Geometry | 2014-03-25 | Paper |
The Euclidean bottleneck Steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Bottleneck non-crossing matching in the plane
Computational Geometry | 2014-01-22 | Paper |
Symmetric connectivity with directional antennas
Computational Geometry | 2013-09-03 | Paper |
Symmetric connectivity with directional antennas
Computational Geometry | 2013-09-03 | Paper |
Approximation Schemes for Covering and Packing
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
Information Processing Letters | 2013-04-04 | Paper |
Improved algorithms for placing undesirable facilities
Computers & Operations Research | 2013-03-25 | Paper |
Stable roommates spanner
Computational Geometry | 2012-12-04 | Paper |
Multi cover of a polygon minimizing the sum of areas
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Bottleneck non-crossing matching in the plane
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Conflict-free coloring of points on a line with respect to a set of intervals
Computational Geometry | 2012-09-21 | Paper |
Do directional antennas facilitate in reducing interferences?
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
The MST of symmetric disk graphs is light
Computational Geometry | 2012-06-08 | Paper |
A scheme for computing minimum covers within simple regions
Algorithmica | 2012-04-26 | Paper |
Polychromatic 4-coloring of cubic bipartite plane graphs
Discrete Mathematics | 2012-04-13 | Paper |
Optimal cover of points by disks in a simple polygon
SIAM Journal on Computing | 2012-03-15 | Paper |
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry | 2011-12-28 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Guarding orthogonal art galleries with sliding cameras
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
Multi cover of a polygon minimizing the sum of areas
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Optimal cover of points by disks in a simple polygon
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Polychromatic 4-coloring of guillotine subdivisions
Information Processing Letters | 2010-08-20 | Paper |
Finding large sticks and potatoes in polygons
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The MST of symmetric disk graphs is light
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Improved bounds on the average distance to the Fermat-Weber center of a convex object
Information Processing Letters | 2010-06-16 | Paper |
GUARDING RECTANGULAR PARTITIONS
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
A Scheme for Computing Minimum Covers within Simple Regions
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Minimum-cost load-balancing partitions
Algorithmica | 2009-08-27 | Paper |
Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem
Information Processing Letters | 2009-07-09 | Paper |
| scientific article; zbMATH DE number 5506221 (Why is no real title available?) | 2009-02-10 | Paper |
Covering Points by Unit Disks of Fixed Location
Algorithms and Computation | 2008-05-27 | Paper |
On guarding the vertices of rectilinear domains
Computational Geometry | 2008-03-13 | Paper |
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
Computational Geometry | 2008-03-13 | Paper |
A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
SIAM Journal on Computing | 2008-01-03 | Paper |
On Guarding Rectilinear Domains
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Power assignment in radio networks with two power levels
Algorithmica | 2007-03-12 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
The minimum-area spanning tree problem
Computational Geometry | 2006-10-25 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
On the Fermat-Weber center of a convex object
Computational Geometry | 2005-11-01 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Geographic quorum system approximations
Algorithmica | 2005-04-29 | Paper |
Orthogonal segment stabbing
Computational Geometry | 2005-01-31 | Paper |
| scientific article; zbMATH DE number 2080276 (Why is no real title available?) | 2004-08-04 | Paper |
Guarding scenes against invasive hypercubes.
Computational Geometry | 2003-08-25 | Paper |
Maintenance of a piercing set for intervals with applications
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1947392 (Why is no real title available?) | 2003-07-08 | Paper |
A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
Discrete & Computational Geometry | 2003-03-18 | Paper |
Walking around fat obstacles.
Information Processing Letters | 2003-01-21 | Paper |
Realistic input models for geometric algorithms
Algorithmica | 2002-12-01 | Paper |
Models and motion planning
Computational Geometry | 2002-09-03 | Paper |
Computing Euclidean bottleneck matchings in higher dimensions
Information Processing Letters | 2002-07-25 | Paper |
Obnoxious facility location: complete service with minimal harm
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
International Journal of Computational Geometry & Applications | 2000-12-05 | Paper |
OPTIMAL LINE BIPARTITIONS OF POINT SETS
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
On the union of \(\kappa\)-curved objects
Computational Geometry | 2000-10-22 | Paper |
Dynamic data structures for fat objects and their applications
Computational Geometry | 2000-05-08 | Paper |
Discrete rectilinear 2-center problems
Computational Geometry | 2000-05-08 | Paper |
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
Computational Geometry | 1998-06-11 | Paper |
An Expander-Based Approach to Geometric Optimization
SIAM Journal on Computing | 1998-02-10 | Paper |
Computing depth orders for fat objects and related problems
Computational Geometry | 1996-11-10 | Paper |
Optimal slope selection via expanders
Information Processing Letters | 1993-11-15 | Paper |
Efficient hidden surface removal for objects with small union size
Computational Geometry | 1993-05-16 | Paper |
