| Publication | Date of Publication | Type |
|---|
| On the spanning and routing ratio of the directed theta-four graph | 2024-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147551 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187830 | 2024-01-15 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| Improved routing on the Delaunay triangulation | 2023-10-12 | Paper |
| An instance-based algorithm for deciding the bias of a coin | 2023-07-14 | Paper |
| Shortest beer path queries in outerplanar graphs | 2023-06-05 | Paper |
| The Minimum Moving Spanning Tree Problem | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881545 | 2023-03-10 | Paper |
| Static and dynamic algorithms for k-point clustering problems | 2023-01-18 | Paper |
| Further results on generalized intersection searching problems: Counting, reporting, and dynamization | 2023-01-18 | Paper |
| On intersection searching problems involving curved objects | 2022-12-09 | Paper |
| Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity | 2022-12-09 | Paper |
| On some geometric optimization problems in layered manufacturing | 2022-08-19 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2022-04-08 | Paper |
| The minimum moving spanning tree problem | 2022-03-25 | Paper |
| Euclidean maximum matchings in the plane -- local to global | 2022-03-25 | Paper |
| Closest-pair queries and minimum-weight queries are equivalent for squares | 2021-12-15 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2021-11-18 | Paper |
| Window queries for intersecting objects, maximal points and approximations using coresets | 2021-10-21 | Paper |
| Tight bounds on the clique chromatic number | 2021-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009579 | 2021-08-04 | Paper |
| On the minimum consistent subset problem | 2021-06-30 | Paper |
| The Most Likely Object to be Seen Through a Window | 2021-02-11 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:3387270 A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in
Doubling Metrics] | 2021-01-12 | Paper |
| An improved construction for spanners of disks | 2021-01-07 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-11-12 | Paper |
| Minimizing the continuous diameter when augmenting a geometric tree with a shortcut | 2020-10-23 | Paper |
| Querying relational event graphs using colored range searching data structures | 2020-09-17 | Paper |
| Flip Distance to some Plane Configurations. | 2020-08-25 | Paper |
| Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115775 | 2020-08-18 | Paper |
| Tight Bounds on the Clique Chromatic Number | 2020-06-19 | Paper |
| Optimal art gallery localization is NP-hard | 2020-03-23 | Paper |
| Plane and planarity thresholds for random geometric graphs | 2020-02-18 | Paper |
| Orthogonal range reporting and rectangle stabbing for fat rectangles | 2020-01-16 | Paper |
| On the minimum consistent subset problem | 2020-01-16 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2020-01-16 | Paper |
| Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs | 2019-11-21 | Paper |
| Flip distance to some plane configurations | 2019-10-25 | Paper |
| Closest-pair queries in fat rectangles | 2019-10-25 | Paper |
| On the Spanning and Routing Ratio of Theta-Four | 2019-10-15 | Paper |
| The discrete Voronoi game in a simple polygon | 2019-10-07 | Paper |
| Partial Enclosure Range Searching | 2019-09-09 | Paper |
| Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees | 2019-06-24 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2019-04-25 | Paper |
| Spanning trees in multipartite geometric graphs | 2019-01-11 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Approximate distance oracles for geometric spanners | 2018-11-05 | Paper |
| An optimal algorithm for plane matchings in multipartite geometric graphs | 2018-11-01 | Paper |
| Plane bichromatic trees of low degree | 2018-07-13 | Paper |
| Window queries for problems on intersecting objects and maximal points | 2018-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643897 | 2018-05-29 | Paper |
| Towards Plane Spanners of Degree 3 | 2018-04-19 | Paper |
| Improved spanning ratio for low degree plane spanners | 2018-04-11 | Paper |
| Geometric path problems with violations | 2018-04-06 | Paper |
| Strong matching of points with geometric shapes | 2018-02-19 | Paper |
| Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions | 2018-01-19 | Paper |
| Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon | 2018-01-19 | Paper |
| Planar spanners and approximate shortest path queries among obstacles in the plane | 2017-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369527 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369529 | 2017-10-17 | Paper |
| Minimizing the continuous diameter when augmenting a tree with a shortcut | 2017-09-22 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2017-09-22 | Paper |
| Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem | 2017-05-16 | Paper |
| Querying Relational Event Graphs Using Colored Range Searching Data Structures | 2017-04-07 | Paper |
| Essential Constraints of Edge-Constrained Proximity Graphs | 2017-04-05 | Paper |
| On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere | 2017-03-30 | Paper |
| A plane 1.88-spanner for points in convex position | 2017-03-30 | Paper |
| Towards plane spanners of degree 3 | 2017-03-30 | Paper |
| On the stretch factor of convex Delaunay graphs | 2017-03-09 | Paper |
| Approximating the average stretch factor of geometric graphs | 2017-03-09 | Paper |
| An optimal algorithm for computing angle-constrained spanners | 2017-03-09 | Paper |
| Network farthest-point diagrams | 2017-03-09 | Paper |
| Computing a largest empty anchored cylinder, and related problems | 2017-01-19 | Paper |
| Probing convex polygons with a wedge | 2016-11-14 | Paper |
| Plane bichromatic trees of low degree | 2016-09-29 | Paper |
| Essential Constraints of Edge-Constrained Proximity Graphs | 2016-09-29 | Paper |
| Efficient algorithms for counting and reporting pairwise intersections between convex polygons | 2016-06-16 | Paper |
| A lower bound for approximating the geometric minimum weight matching | 2016-06-16 | Paper |
| A technique for adding range restrictions to generalized searching problems | 2016-06-09 | Paper |
| Improved spanning ratio for low degree plane spanners | 2016-05-03 | Paper |
| Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon | 2016-04-01 | Paper |
| Higher-order triangular-distance Delaunay graphs: graph-theoretical properties | 2016-01-15 | Paper |
| Approximating the bottleneck plane perfect matching of a point set | 2016-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455035 | 2015-12-03 | Paper |
| An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs | 2015-10-30 | Paper |
| Fast Algorithms for Diameter-Optimally Augmenting Paths | 2015-10-27 | Paper |
| On the hardness of full Steiner tree problems | 2015-08-24 | Paper |
| Matchings in higher-order Gabriel graphs | 2015-07-24 | Paper |
| On full Steiner trees in unit disk graphs | 2015-06-17 | Paper |
| Fast algorithms for approximate Fréchet matching queries in geometric trees | 2015-06-17 | Paper |
| A Facility Coloring Problem in 1-D | 2015-05-20 | Paper |
| Average stretch factor: how low does it go? | 2015-04-16 | Paper |
| Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties | 2015-02-19 | Paper |
| Robust Geometric Spanners | 2015-02-17 | Paper |
| Optimal Data Structures for Farthest-Point Queries in Cactus Networks | 2015-01-27 | Paper |
| Fixed-orientation equilateral triangle matching of point sets | 2014-10-06 | Paper |
| A note on the unsolvability of the weighted region shortest path problem | 2014-06-27 | Paper |
| Data structures for range-aggregate extent queries | 2014-01-22 | Paper |
| An optimal algorithm for the Euclidean bottleneck full Steiner tree problem | 2014-01-22 | Paper |
| Robust Geometric Spanners | 2013-11-14 | Paper |
| Fréchet Queries in Geometric Trees | 2013-09-17 | Paper |
| On plane geometric spanners: a survey and open problems | 2013-08-22 | Paper |
| The Discrete Voronoi Game in a Simple Polygon | 2013-06-11 | Paper |
| On the power of the semi-separated pair decomposition | 2013-04-29 | Paper |
| Computing Large Planar Regions in Terrains | 2013-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4914756 | 2013-04-15 | Paper |
| Fixed-Orientation Equilateral Triangle Matching of Point Sets | 2013-04-12 | Paper |
| Low-interference networks in metric spaces of bounded doubling dimension | 2013-04-04 | Paper |
| An in-place min-max priority search tree | 2013-01-25 | Paper |
| π/2-ANGLE YAO GRAPHS ARE SPANNERS | 2012-11-23 | Paper |
| Two-Dimensional Range Diameter Queries | 2012-06-29 | Paper |
| Geometric spanners for weighted point sets | 2011-08-16 | Paper |
| On a family of strong geometric spanners that admit local routing strategies | 2011-07-20 | Paper |
| Algorithms for marketing-mix optimization | 2011-07-01 | Paper |
| Approximating the Average Stretch Factor of Geometric Graphs | 2010-12-09 | Paper |
| An Optimal Algorithm for Computing Angle-Constrained Spanners | 2010-12-09 | Paper |
| π/2-Angle Yao Graphs Are Spanners | 2010-12-09 | Paper |
| Computing the greedy spanner in near-quadratic time | 2010-09-27 | Paper |
| An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements | 2010-08-20 | Paper |
| Improved Methods For Generating Quasi-gray Codes | 2010-06-22 | Paper |
| On the false-positive rate of Bloom filters | 2010-06-09 | Paper |
| Communication-Efficient Construction of the Plane Localized Delaunay Graph | 2010-04-27 | Paper |
| Sigma-local graphs | 2010-02-26 | Paper |
| EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA | 2010-02-12 | Paper |
| The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension | 2009-11-12 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2009-11-06 | Paper |
| Geometric Spanners for Weighted Point Sets | 2009-10-29 | Paper |
| Clamshell casting | 2009-10-23 | Paper |
| On the Power of the Semi-Separated Pair Decomposition | 2009-10-20 | Paper |
| On the dilation spectrum of paths, cycles, and trees | 2009-08-14 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE | 2009-06-30 | Paper |
| Algorithms for optimal outlier removal | 2009-06-24 | Paper |
| Rotationally monotone polygons | 2009-06-18 | Paper |
| ON SPANNERS OF GEOMETRIC GRAPHS | 2009-04-14 | Paper |
| A linear-space algorithm for distance preserving graph embedding | 2009-03-09 | Paper |
| On a Family of Strong Geometric Spanners That Admit Local Routing Strategies | 2009-02-17 | Paper |
| On Generalized Diamond Spanners | 2009-02-17 | Paper |
| On the Stretch Factor of Convex Delaunay Graphs | 2009-01-29 | Paper |
| Geometric spanners with small chromatic number | 2008-11-19 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| Computing the Greedy Spanner in Near-Quadratic Time | 2008-07-15 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| I/O-efficient algorithms for computing planar geometric spanners | 2008-06-18 | Paper |
| Diamond Triangulations Contain Spanners of Bounded Degree | 2008-04-24 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2008-04-15 | Paper |
| Geometric Spanners with Small Chromatic Number | 2008-02-20 | Paper |
| On Spanners of Geometric Graphs | 2007-09-07 | Paper |
| Geometric Spanner Networks | 2007-06-06 | Paper |
| Space-efficient geometric divide-and-conquer algorithms | 2007-06-04 | Paper |
| Distance-preserving approximations of polygonal paths | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| A dynamic dictionary for priced information with application | 2006-06-14 | Paper |
| Constructing plane spanners of bounded degree and low weight | 2006-03-21 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705139 | 2005-11-08 | Paper |
| GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING | 2005-10-18 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829019 | 2004-11-29 | Paper |
| Approximating geometric bottleneck shortest paths | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808658 | 2004-08-12 | Paper |
| Light edges in degree-constrained graphs | 2004-08-06 | Paper |
| Computing large planar regions in terrains, with an application to fracture surfaces | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427857 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418635 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411344 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411362 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411366 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789805 | 2003-05-01 | Paper |
| A decomposition-based approach to layered manufacturing | 2003-03-10 | Paper |
| Using persistent data structures for adding range restrictions to searching problems | 2002-11-24 | Paper |
| Computing the Smallest T-Shaped Polygon Containing k Points | 2002-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778563 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778573 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945521 | 2002-10-23 | Paper |
| Computing An Optimal Hatching Direction In Layered Manufacturing | 2002-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542536 | 2002-09-17 | Paper |
| Improved algorithms for constructing fault-tolerant spanners | 2002-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779377 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230362 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762528 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150179 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234097 | 2001-08-28 | Paper |
| Lower bounds for computing geometric spanners and approximate shortest paths | 2001-01-01 | Paper |
| ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE | 2000-11-07 | Paper |
| Approximating the Stretch Factor of Euclidean Graphs | 2000-10-18 | Paper |
| Dynamic algorithms for geometric spanners of small diameter: Randomized solutions | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934236 | 2000-01-17 | Paper |
| On some geometric optimization problems in layered manufacturing | 1999-09-22 | Paper |
| Minimizing support structures and trapped area in two-dimensional layered manufacturing | 1999-09-22 | Paper |
| On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 1998-11-10 | Paper |
| Randomized Data Structures for the Dynamic Closest-Pair Problem | 1998-09-20 | Paper |
| Computing a Largest Empty Anchored Cylinder, and Related Problems | 1998-03-03 | Paper |
| The Rectangle Enclosure and Point-Dominance Problems Revisited | 1997-10-30 | Paper |
| Efficient construction of a bounded-degree spanner with low weight | 1997-06-09 | Paper |
| New Techniques for Exact and Approximate Dynamic Closest-Point Problems | 1997-03-03 | Paper |
| Fast algorithms for collision and proximity problems involving moving geometric objects | 1996-12-08 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization | 1996-05-28 | Paper |
| Static and Dynamic Algorithms for k-Point Clustering Problems | 1996-04-11 | Paper |
| SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763414 | 1995-04-11 | Paper |
| Dynamic rectangular point location, with an application to the closest pair problem | 1995-04-10 | Paper |
| Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity | 1995-04-09 | Paper |
| AN OPTIMAL CONSTRUCTION METHOD FOR GENERALIZED CONVEX LAYERS | 1995-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140433 | 1994-11-29 | Paper |
| An optimal algorithm for the on-line closest-pair problem | 1994-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138932 | 1993-10-20 | Paper |
| Maintaining the minimal distance of a point set in polylogarithmic time | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990112 | 1992-06-28 | Paper |
| Dynamic deferred data structuring | 1990-01-01 | Paper |
| Maintaining range trees in secondary memory. Part I: Partitions | 1990-01-01 | Paper |
| Maintaining range trees is secondary memory. Part II: Lower bounds | 1990-01-01 | Paper |
| Maintaining multiple representations of dynamic data structures | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729324 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787502 | 1988-01-01 | Paper |
| Duadic codes (Corresp.) | 1987-01-01 | Paper |
