| Publication | Date of Publication | Type |
|---|
| Computing β-Stretch Paths in Drawings of Graphs. | 2023-11-02 | Paper |
| Point probe decision trees for geometric concept classes | 2023-01-18 | Paper |
| Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers | 2022-05-11 | Paper |
| On local search for weighted \(k\)-set packing | 2021-12-20 | Paper |
| Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers | 2021-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136221 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240127 | 2019-10-24 | Paper |
| Locating battery charging stations to facilitate almost shortest paths | 2019-02-08 | Paper |
| Selecting and covering colored points | 2018-10-26 | Paper |
| On minimum-area hulls | 2017-12-05 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
| Optimizing Read Reversals for Sequence Compression | 2017-07-25 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
| Choice Is Hard | 2016-01-11 | 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 |
| Scandinavian thins on top of cake: new and improved algorithms for stacking and packing | 2015-01-21 | Paper |
| Convex transversals | 2014-01-22 | Paper |
| The \((K, k)\)-capacitated spanning tree problem | 2012-12-28 | Paper |
| SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES | 2012-11-23 | Paper |
| Bichromatic 2-Center of Pairs of Points | 2012-06-29 | Paper |
| Convex Transversals | 2011-08-12 | Paper |
| The snowblower problem | 2011-08-02 | Paper |
| The (K,k)-Capacitated Spanning Tree Problem | 2010-07-20 | Paper |
| Geometric stable roommates | 2010-06-16 | Paper |
| The Snowblower Problem | 2010-06-02 | Paper |
| Capturing crossings: convex hulls of segment and plane intersections | 2010-04-19 | 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 |
| Matching points with squares | 2009-03-24 | Paper |
| Minimum-link watchman tours | 2009-03-23 | Paper |
| Maximum thick paths in static and dynamic environments | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601572 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601573 | 2009-02-10 | Paper |
| The \(k\)-path tree matroid and its applications to survivable network design | 2008-10-29 | Paper |
| Two New Classes of Hamiltonian Graphs | 2008-06-05 | Paper |
| Testing simple polygons. | 2008-04-25 | Paper |
| Matching Points with Circles and Squares | 2008-03-18 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2006-11-06 | Paper |
| Approximations for minimum and min-max vehicle routing problems | 2006-10-05 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3024770 | 2005-07-04 | 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 |
| Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems | 2004-10-01 | Paper |
| Analysis of Heuristics for the Freeze-Tag Problem | 2004-08-12 | Paper |
| Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems | 2004-08-12 | 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/Q4778554 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778574 | 2002-11-18 | Paper |
| Increasing digraph arc-connectivity by arc addition, reversal and complement | 2002-08-29 | Paper |
| Approximating the maximum quadratic assignment problem | 2002-07-25 | Paper |
| A note on orientations of mixed graphs | 2002-07-03 | Paper |
| Optimal covering tours with turn costs | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228431 | 2002-01-16 | Paper |
| Minimum-diameter covering problems | 2001-12-03 | Paper |
| On local search for weighted \(k\)-set packing | 2001-11-26 | Paper |
| Approximation algorithms for lawn mowing and milling | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952714 | 2000-12-10 | Paper |
| Decision Trees for Geometric Models | 2000-11-07 | Paper |
| Graph partitions with minimum degree constraints | 2000-11-02 | Paper |
| Optimization problems related to zigzag pocket machining | 2000-03-19 | Paper |
| On the Maximum Scatter Traveling Salesperson Problem | 1999-10-28 | Paper |
| On minimum-area hulls | 1998-10-01 | Paper |
| Recognizing polygonal parts width measurements | 1998-08-19 | Paper |
| Restricted delivery problems on a network | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875215 | 1996-09-15 | Paper |
| LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON | 1995-12-18 | Paper |
| Arrangements of segments that share endpoints: Single face results | 1995-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763413 | 1995-04-11 | Paper |
| Approximation algorithms for the Geometric Covering Salesman Problem | 1995-02-01 | Paper |
| Modularity of cycles and paths in graphs | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138886 | 1994-09-20 | Paper |
| Geometric Knapsack problems | 1994-02-17 | Paper |
| Approximating the tree and tour covers of a graph | 1994-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138938 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037416 | 1993-05-18 | Paper |
| Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms | 1993-02-25 | Paper |
| Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights | 1992-06-26 | Paper |
| Computational complexity of uncapacitated multi-echelon production planning problems | 1989-01-01 | Paper |
| Scheduling jobs with fixed start and end times | 1987-01-01 | Paper |
| On the complexity of circulations | 1986-01-01 | Paper |
| On negative cycles in mixed graphs | 1985-01-01 | Paper |
