| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6124759 | 2024-04-02 | Paper |
| Geometric spanning trees minimizing the Wiener index | 2024-01-16 | Paper |
| Computing β-Stretch Paths in Drawings of Graphs. | 2023-11-02 | Paper |
| Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane | 2023-10-04 | Paper |
| Algorithms for \(k\)-dispersion for points in convex position in the plane | 2023-08-17 | Paper |
| Shortcut hulls: vertex-restricted outer simplifications of polygons | 2023-06-26 | Paper |
| Planar Bichromatic Bottleneck Spanning Trees | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875486 | 2023-02-03 | Paper |
| Point probe decision trees for geometric concept classes | 2023-01-18 | Paper |
| Area-Optimal Simple Polygonalizations: The CG Challenge 2019 | 2022-09-06 | Paper |
| Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 | 2022-09-06 | Paper |
| The balanced connected subgraph problem | 2022-08-04 | Paper |
| Planar bichromatic bottleneck spanning trees | 2021-09-07 | Paper |
| Minimum membership covering and hitting | 2021-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136221 | 2020-11-25 | Paper |
| Existence and hardness of conveyor belts | 2020-11-05 | Paper |
| Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
| Packing and covering with segments | 2020-07-22 | Paper |
| New results on a family of geometric hitting set problems in the plane | 2020-05-13 | Paper |
| Don't rock the boat: algorithms for balanced dynamic loading and unloading | 2020-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240127 | 2019-10-24 | Paper |
| Minimum membership covering and hitting | 2019-10-15 | Paper |
| The balanced connected subgraph problem | 2019-10-10 | Paper |
| Locating Guards for Visibility Coverage of Polygons | 2019-09-11 | Paper |
| Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing | 2019-09-11 | Paper |
| Approximating Watchman Routes | 2019-05-15 | Paper |
| Locating battery charging stations to facilitate almost shortest paths | 2019-02-08 | Paper |
| An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains | 2019-01-11 | Paper |
| Optimal decomposition of polygonal models into triangle strips | 2018-11-23 | Paper |
| Visibility preserving terrain simplification | 2018-11-23 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2018-10-30 | Paper |
| Selecting and covering colored points | 2018-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580107 | 2018-08-13 | Paper |
| Universal Guard Problems | 2018-08-02 | Paper |
| Universal Guard Problems | 2018-04-19 | Paper |
| Geometric hitting set for segments of few orientations | 2018-04-12 | Paper |
| Connecting a set of circles with minimum sum of radii | 2018-02-19 | Paper |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain | 2018-01-24 | Paper |
| An algorithm for the maximum weight independent set problem on outerstring graphs | 2018-01-22 | Paper |
| On minimum-area hulls | 2017-12-05 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
| On the continuous Weber and k -median problems (extended abstract) | 2017-09-29 | Paper |
| Simplifying a polygonal subdivision while keeping it simple | 2017-09-29 | Paper |
| Farthest neighbors and center points in the presence of rectngular obstacles | 2017-09-29 | Paper |
| Computing the visibility graph of points within a polygon | 2017-09-29 | Paper |
| New results on shortest paths in three dimensions | 2017-09-29 | Paper |
| Optimizing Read Reversals for Sequence Compression | 2017-07-25 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2017-05-11 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
| Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | 2017-02-01 | Paper |
| Geometric hitting set for segments of few orientations | 2016-02-26 | Paper |
| Choice Is Hard | 2016-01-11 | Paper |
| The minimum backlog problem | 2015-10-30 | Paper |
| An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501798 | 2015-08-14 | Paper |
| Bichromatic 2-center of pairs of points | 2015-03-06 | Paper |
| Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions | 2015-03-06 | Paper |
| Picture-hanging puzzles | 2015-01-21 | Paper |
| Scandinavian thins on top of cake: new and improved algorithms for stacking and packing | 2015-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934576 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921708 | 2014-10-13 | Paper |
| Minimum-link paths revisited | 2014-05-19 | Paper |
| THE MINIMUM GUARDING TREE PROBLEM | 2014-04-25 | Paper |
| Watchman routes for lines and line segments | 2014-04-14 | Paper |
| A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane | 2014-04-03 | Paper |
| Geometric algorithms for optimal airspace design and air traffic controller workload balancing | 2014-04-01 | Paper |
| Guarding polyominoes | 2014-03-24 | Paper |
| Convex transversals | 2014-01-22 | Paper |
| Beacon-Based Algorithms for Geometric Routing | 2013-08-12 | Paper |
| Spiral Serpentine Polygonization of a Planar Point Set | 2013-01-07 | Paper |
| SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES | 2012-11-23 | Paper |
| The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices | 2012-10-23 | Paper |
| The art gallery theorem for polyominoes | 2012-10-15 | Paper |
| Minimum covering with travel cost | 2012-10-01 | Paper |
| Scheduling Aircraft to Reduce Controller Workload | 2012-09-28 | Paper |
| Watchman Routes for Lines and Segments | 2012-08-14 | Paper |
| Bichromatic 2-Center of Pairs of Points | 2012-06-29 | Paper |
| Routing multi-class traffic flows in the plane | 2012-06-13 | Paper |
| Optimizing restriction site placement for synthetic genomes | 2012-05-24 | Paper |
| Exploring and Triangulating a Region by a Swarm of Robots | 2011-08-17 | Paper |
| Connecting a set of circles with minimum sum of radii | 2011-08-12 | Paper |
| Convex Transversals | 2011-08-12 | Paper |
| The snowblower problem | 2011-08-02 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2011-04-04 | Paper |
| LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS | 2010-12-15 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| Touring a sequence of polygons | 2010-08-16 | Paper |
| Finding large sticks and potatoes in polygons | 2010-08-16 | Paper |
| Optimizing Restriction Site Placement for Synthetic Genomes | 2010-07-26 | Paper |
| Geometric stable roommates | 2010-06-16 | Paper |
| Triangulating input-constrained planar point sets | 2010-06-09 | Paper |
| An Experimental Study of Weighted k-Link Shortest Path Algorithms | 2010-06-02 | Paper |
| The Snowblower Problem | 2010-06-02 | Paper |
| A Near-Tight Approximation Algorithm for the Robot Localization Problem | 2010-04-29 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Minimum-perimeter enclosures | 2010-04-19 | Paper |
| Capturing crossings: convex hulls of segment and plane intersections | 2010-04-19 | Paper |
| Minimum Covering with Travel Cost | 2009-12-17 | Paper |
| Maximum thick paths in static and dynamic environments | 2009-11-16 | Paper |
| Not being (super)thin or solid is hard: A study of grid Hamiltonicity | 2009-07-27 | Paper |
| On the Continuous Fermat-Weber Problem | 2009-07-17 | Paper |
| Matching points with squares | 2009-03-24 | Paper |
| Minimum-link watchman tours | 2009-03-23 | Paper |
| Thick non-crossing paths and minimum-cost flows in polygonal domains | 2009-02-12 | Paper |
| Routing a maximum number of disks through a scene of moving obstacles | 2009-02-12 | Paper |
| Maximum thick paths in static and dynamic environments | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601572 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601573 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601580 | 2009-02-10 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2009-01-29 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2008-11-25 | Paper |
| Efficient algorithms for maximum regression depth | 2008-08-19 | Paper |
| Two New Classes of Hamiltonian Graphs | 2008-06-05 | Paper |
| Testing simple polygons. | 2008-04-25 | Paper |
| Delineating boundaries for imprecise regions | 2008-04-03 | Paper |
| Matching Points with Circles and Squares | 2008-03-18 | Paper |
| A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding | 2008-01-03 | Paper |
| Special issue: Selected papers based on the presentations at the 21th annual symposium on computational geometry (SCG '05), Pisa, Italy, June 6--8, 2005 | 2007-01-01 | Paper |
| On simultaneous planar graph embeddings | 2006-12-14 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2006-11-06 | Paper |
| The minimum-area spanning tree problem | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Optimal Covering Tours with Turn Costs | 2006-06-01 | Paper |
| SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS | 2006-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692695 | 2005-09-28 | Paper |
| Approximate minimum enclosing balls in high dimensions using core-sets | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024770 | 2005-07-04 | Paper |
| TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING | 2005-06-10 | Paper |
| Orthogonal segment stabbing | 2005-01-31 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2004-11-29 | Paper |
| When can you fold a map? | 2004-10-13 | Paper |
| Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046480 | 2004-08-12 | Paper |
| Analysis of Heuristics for the Freeze-Tag Problem | 2004-08-12 | Paper |
| Approximation algorithms for TSP with neighborhoods in the plane | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768270 | 2003-09-15 | Paper |
| The lazy bureaucrat scheduling problem | 2003-07-29 | Paper |
| An algorithmic study of manufacturing paperclips and other folded structures. | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801184 | 2003-04-07 | Paper |
| New similarity measures between polylines with applications to morphing and polygon sweeping | 2003-03-17 | Paper |
| Edit distance of run-length encoded strings. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778554 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778574 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768284 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228431 | 2002-01-16 | Paper |
| Approximation algorithms for lawn mowing and milling | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952719 | 2001-01-29 | Paper |
| Decision Trees for Geometric Models | 2000-11-07 | Paper |
| Voronoi Diagrams of Moving Points | 2000-11-07 | Paper |
| Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\) | 2000-10-17 | Paper |
| Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945516 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252444 | 2000-02-22 | Paper |
| Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems | 1999-10-28 | Paper |
| On the Maximum Scatter Traveling Salesperson Problem | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252291 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401014 | 1999-03-02 | Paper |
| A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane | 1999-02-22 | Paper |
| On minimum-area hulls | 1998-10-01 | Paper |
| Recognizing polygonal parts width measurements | 1998-08-19 | Paper |
| An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane | 1998-03-11 | Paper |
| A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem | 1998-03-11 | Paper |
| A new algorithm for shortest paths among obstacles in the plane | 1997-07-07 | Paper |
| SHORTEST PATHS AMONG OBSTACLES IN THE PLANE | 1997-04-13 | Paper |
| Generating random polygons with given vertices | 1997-03-03 | Paper |
| Counting convex polygons in planar point sets | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875213 | 1996-06-18 | Paper |
| Separation and approximation of polyhedral objects | 1996-02-13 | Paper |
| An Optimal Algorithm for Computing Visibility in the Plane | 1996-01-08 | Paper |
| LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON | 1995-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845369 | 1995-09-11 | Paper |
| Arrangements of segments that share endpoints: Single face results | 1995-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763413 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763415 | 1995-04-11 | Paper |
| APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS | 1995-01-02 | Paper |
| The weighted region problem | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138886 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302464 | 1994-09-13 | Paper |
| Geometric Knapsack problems | 1994-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138938 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694724 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037416 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037420 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037439 | 1993-05-18 | Paper |
| Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms | 1993-02-25 | Paper |
| Path Planning in 0/1/∞ Weighted Regions with Applications | 1993-02-18 | Paper |
| Minimum-link paths among obstacles in the plane | 1993-01-17 | Paper |
| \(L_ 1\) shortest paths among polygonal obstacles in the plane | 1992-08-13 | Paper |
| On a triangle counting problem | 1990-01-01 | Paper |
| On maximum flows in polyhedral domains | 1990-01-01 | Paper |
| An algorithmic approach to some problems in terrain navigation | 1988-01-01 | Paper |
| The Discrete Geodesic Problem | 1987-01-01 | Paper |
| 98%-Effective Lot-Sizing for One-Warehouse, Multi-Retailer Inventory Systems with Backlogging | 1987-01-01 | Paper |
