| Publication | Date of Publication | Type |
|---|
| Stabbing pairwise intersecting disks by four points | 2023-12-21 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2023-11-23 | Paper |
| Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane | 2023-10-04 | Paper |
| Bottleneck matching in the plane | 2023-06-26 | Paper |
| Approximate nearest neighbor for curves: simple, efficient, and deterministic | 2023-04-28 | Paper |
| Models and motion planning | 2022-12-09 | Paper |
| Constrained square-center problems | 2022-12-09 | Paper |
| Computing depth orders and related problems | 2022-12-09 | Paper |
| A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST | 2022-10-06 | Paper |
| Bipartite diameter and other measures under translation | 2022-09-16 | Paper |
| Dynamic data structures for fat objects and their applications | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089169 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090454 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075347 | 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 | 2022-03-22 | Paper |
| Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains | 2022-01-03 | Paper |
| Minimizing total interference in asymmetric sensor networks | 2021-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002834 | 2021-07-28 | Paper |
| Minimizing total interference in asymmetric sensor networks | 2021-07-08 | Paper |
| Resolving SINR Queries in a Dynamic Setting | 2021-01-13 | Paper |
| Improved PTASs for convex barrier coverage | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136221 | 2020-11-25 | Paper |
| Sensor network topology design and analysis for efficient data gathering by a mobile mule | 2020-10-12 | Paper |
| Algorithms for the discrete Fréchet distance under translation | 2020-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116484 | 2020-08-25 | Paper |
| Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains | 2020-08-24 | Paper |
| Tracking paths | 2020-06-05 | Paper |
| Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
| Efficient nearest-neighbor query and clustering of planar curves | 2020-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240127 | 2019-10-24 | Paper |
| Batched Point Location in SINR Diagrams via Algebraic Tools | 2019-03-28 | Paper |
| Bottleneck detour tree of points on a path | 2019-03-20 | Paper |
| Locating battery charging stations to facilitate almost shortest paths | 2019-02-08 | Paper |
| Visibility preserving terrain simplification | 2018-11-23 | Paper |
| The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 2018-10-30 | Paper |
| Selecting and covering colored points | 2018-10-26 | Paper |
| Improved PTASs for convex barrier coverage | 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 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608597 | 2018-03-21 | Paper |
| On interference among moving sensors and related problems | 2018-03-02 | Paper |
| Farthest neighbors and center points in the presence of rectngular obstacles | 2017-09-29 | Paper |
| A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$} | 2017-09-29 | Paper |
| Computing the visibility graph of points within a polygon | 2017-09-29 | Paper |
| Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
| Tracking Paths | 2017-07-21 | Paper |
| Switching to directional antennas with constant increase in radius and hop distance | 2017-03-27 | Paper |
| Bounded-angle spanning tree: modeling networks with angular constraints | 2017-03-03 | Paper |
| Symmetric Connectivity with Directional Antennas | 2016-12-19 | Paper |
| Choice Is Hard | 2016-01-11 | Paper |
| On the Chain Pair Simplification Problem | 2015-10-30 | Paper |
| Batched Point Location in SINR Diagrams via Algebraic Tools | 2015-10-27 | Paper |
| Bottleneck Steiner tree with bounded number of Steiner vertices | 2015-02-13 | Paper |
| Spiderman graph: visibility in urban regions | 2014-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921708 | 2014-10-13 | Paper |
| Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints | 2014-07-01 | Paper |
| The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition | 2014-03-25 | Paper |
| The euclidean bottleneck steiner path problem | 2014-03-24 | Paper |
| Bottleneck non-crossing matching in the plane | 2014-01-22 | Paper |
| Symmetric connectivity with directional antennas | 2013-09-03 | Paper |
| Approximation Schemes for Covering and Packing | 2013-04-12 | Paper |
| Settling the bound on the rectilinear link radius of a simple rectilinear polygon | 2013-04-04 | Paper |
| Improved algorithms for placing undesirable facilities | 2013-03-25 | Paper |
| Stable roommates spanner | 2012-12-04 | Paper |
| MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS | 2012-11-23 | Paper |
| Bottleneck Non-crossing Matching in the Plane | 2012-09-25 | Paper |
| Conflict-free coloring of points on a line with respect to a set of intervals | 2012-09-21 | Paper |
| Do Directional Antennas Facilitate in Reducing Interferences? | 2012-08-14 | Paper |
| The MST of symmetric disk graphs is light | 2012-06-08 | Paper |
| A scheme for computing minimum covers within simple regions | 2012-04-26 | Paper |
| Polychromatic 4-coloring of cubic bipartite plane graphs | 2012-04-13 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2012-03-15 | Paper |
| Connectivity guarantees for wireless networks with directional antennas | 2011-12-28 | Paper |
| Switching to Directional Antennas with Constant Increase in Radius and Hop Distance | 2011-08-12 | Paper |
| GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS | 2011-05-11 | Paper |
| Multi Cover of a Polygon Minimizing the Sum of Areas | 2011-02-20 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2010-09-06 | Paper |
| Polychromatic 4-coloring of guillotine subdivisions | 2010-08-20 | Paper |
| Finding large sticks and potatoes in polygons | 2010-08-16 | Paper |
| The MST of Symmetric Disk Graphs Is Light | 2010-06-22 | Paper |
| Improved bounds on the average distance to the Fermat-Weber center of a convex object | 2010-06-16 | Paper |
| GUARDING RECTANGULAR PARTITIONS | 2010-02-12 | Paper |
| A Scheme for Computing Minimum Covers within Simple Regions | 2009-10-20 | Paper |
| Minimum-cost load-balancing partitions | 2009-08-27 | Paper |
| Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem | 2009-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601553 | 2009-02-10 | Paper |
| Covering Points by Unit Disks of Fixed Location | 2008-05-27 | Paper |
| Polynomial-time approximation schemes for piercing and covering with applications in wireless networks | 2008-03-13 | Paper |
| On guarding the vertices of rectilinear domains | 2008-03-13 | Paper |
| A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding | 2008-01-03 | Paper |
| On Guarding Rectilinear Domains | 2007-09-07 | Paper |
| Power assignment in radio networks with two power levels | 2007-03-12 | Paper |
| The minimum-area spanning tree problem | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| TSP with neighborhoods of varying size | 2005-11-16 | Paper |
| On the Fermat-Weber center of a convex object | 2005-11-01 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Geographic quorum system approximations | 2005-04-29 | Paper |
| Orthogonal segment stabbing | 2005-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472527 | 2004-08-04 | Paper |
| Guarding scenes against invasive hypercubes. | 2003-08-25 | Paper |
| Maintenance of a piercing set for intervals with applications | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411358 | 2003-07-08 | Paper |
| A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\) | 2003-03-18 | Paper |
| Walking around fat obstacles. | 2003-01-21 | Paper |
| Realistic input models for geometric algorithms | 2002-12-01 | Paper |
| Models and motion planning | 2002-09-03 | Paper |
| Computing Euclidean bottleneck matchings in higher dimensions | 2002-07-25 | Paper |
| OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM | 2001-04-17 | Paper |
| 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES | 2000-12-05 | Paper |
| OPTIMAL LINE BIPARTITIONS OF POINT SETS | 2000-11-07 | Paper |
| On the union of \(\kappa\)-curved objects | 2000-10-22 | Paper |
| Discrete rectilinear 2-center problems | 2000-05-08 | Paper |
| Dynamic data structures for fat objects and their applications | 2000-05-08 | Paper |
| 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects | 1998-06-11 | Paper |
| An Expander-Based Approach to Geometric Optimization | 1998-02-10 | Paper |
| Computing depth orders for fat objects and related problems | 1996-11-10 | Paper |
| Optimal slope selection via expanders | 1993-11-15 | Paper |
| Efficient hidden surface removal for objects with small union size | 1993-05-16 | Paper |
