| Publication | Date of Publication | Type |
|---|
Computing β-Stretch Paths in Drawings of Graphs.
| 2023-11-02 | Paper |
Point probe decision trees for geometric concept classes
Lecture Notes in Computer Science | 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
Algorithmica | 2021-04-19 | Paper |
Network optimization on partitioned pairs of points
| 2020-11-25 | Paper |
scientific article; zbMATH DE number 7121835 (Why is no real title available?)
| 2019-10-24 | Paper |
Locating battery charging stations to facilitate almost shortest paths
Discrete Applied Mathematics | 2019-02-08 | Paper |
Selecting and covering colored points
Discrete Applied Mathematics | 2018-10-26 | Paper |
On minimum-area hulls (extended abstract)
Algorithms — ESA '96 | 2017-12-05 | Paper |
Shortest path to a segment and quickest visibility queries
| 2017-10-10 | Paper |
Optimizing Read Reversals for Sequence Compression
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Shortest path to a segment and quickest visibility queries
| 2017-03-30 | Paper |
Choice is hard
Algorithms and Computation | 2016-01-11 | Paper |
scientific article; zbMATH DE number 6472595 (Why is no real title available?)
| 2015-08-14 | Paper |
Bichromatic 2-center of pairs of points
Computational Geometry | 2015-03-06 | Paper |
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
Computational Geometry | 2015-03-06 | Paper |
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Theory of Computing Systems | 2015-01-21 | Paper |
Convex transversals
Computational Geometry | 2014-01-22 | Paper |
The \((K, k)\)-capacitated spanning tree problem
Discrete Optimization | 2012-12-28 | Paper |
Separability of point sets by \(k\)-level linear classification trees
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Bichromatic 2-center of pairs of points
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Convex transversals
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The snowblower problem
Computational Geometry | 2011-08-02 | Paper |
The (K,k)-Capacitated Spanning Tree Problem
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Geometric stable roommates
Information Processing Letters | 2010-06-16 | Paper |
The snowblower problem
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Capturing crossings: convex hulls of segment and plane intersections
Information Processing Letters | 2010-04-19 | Paper |
Maximum thick paths in static and dynamic environments
Computational Geometry | 2009-11-16 | Paper |
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry | 2009-07-27 | Paper |
Matching points with squares
Discrete \& Computational Geometry | 2009-03-24 | Paper |
Minimum-link watchman tours
Information Processing Letters | 2009-03-23 | Paper |
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Minimum-cost coverage of point sets by disks
| 2009-02-10 | Paper |
scientific article; zbMATH DE number 5506238 (Why is no real title available?)
| 2009-02-10 | Paper |
The \(k\)-path tree matroid and its applications to survivable network design
Discrete Optimization | 2008-10-29 | Paper |
Two New Classes of Hamiltonian Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Testing simple polygons.
Computational Geometry | 2008-04-25 | Paper |
Matching Points with Circles and Squares
Discrete and Computational Geometry | 2008-03-18 | Paper |
The freeze-tag problem: How to wake up a swarm of robots
Algorithmica | 2006-11-06 | Paper |
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms | 2006-10-05 | Paper |
Optimal Covering Tours with Turn Costs
SIAM Journal on Computing | 2006-06-01 | Paper |
SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
International Journal of Computational Geometry & Applications | 2006-05-10 | Paper |
scientific article; zbMATH DE number 2209713 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2185608 (Why is no real title available?)
| 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?
Computational Geometry | 2004-10-13 | Paper |
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
Algorithmica | 2004-10-01 | Paper |
Analysis of Heuristics for the Freeze-Tag Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
The lazy bureaucrat scheduling problem
Information and Computation | 2003-07-29 | Paper |
An algorithmic study of manufacturing paperclips and other folded structures.
Computational Geometry | 2003-05-19 | Paper |
scientific article; zbMATH DE number 1830733 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1830752 (Why is no real title available?)
| 2002-11-18 | Paper |
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics | 2002-08-29 | Paper |
Approximating the maximum quadratic assignment problem
Information Processing Letters | 2002-07-25 | Paper |
A note on orientations of mixed graphs
Discrete Applied Mathematics | 2002-07-03 | Paper |
Optimal covering tours with turn costs
| 2002-03-24 | Paper |
scientific article; zbMATH DE number 1256695 (Why is no real title available?)
| 2002-01-16 | Paper |
Minimum-diameter covering problems
| 2001-12-03 | Paper |
On local search for weighted \(k\)-set packing
Mathematics of Operations Research | 2001-11-26 | Paper |
Approximation algorithms for lawn mowing and milling
Computational Geometry | 2001-02-22 | Paper |
scientific article; zbMATH DE number 1445391 (Why is no real title available?)
| 2000-12-10 | Paper |
Decision Trees for Geometric Models
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Graph partitions with minimum degree constraints
Discrete Mathematics | 2000-11-02 | Paper |
Optimization problems related to zigzag pocket machining
Algorithmica | 2000-03-19 | Paper |
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing | 1999-10-28 | Paper |
On minimum-area hulls
Algorithmica | 1998-10-01 | Paper |
Recognizing polygonal parts width measurements
Computational Geometry | 1998-08-19 | Paper |
Restricted delivery problems on a network
| 1997-08-07 | Paper |
scientific article; zbMATH DE number 871940 (Why is no real title available?)
| 1996-09-15 | Paper |
LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1995-12-18 | Paper |
Arrangements of segments that share endpoints: Single face results
Discrete \& Computational Geometry | 1995-07-02 | Paper |
scientific article; zbMATH DE number 742973 (Why is no real title available?)
| 1995-04-11 | Paper |
Approximation algorithms for the Geometric Covering Salesman Problem
Discrete Applied Mathematics | 1995-02-01 | Paper |
Modularity of cycles and paths in graphs
Journal of the ACM | 1994-11-13 | Paper |
scientific article; zbMATH DE number 432758 (Why is no real title available?)
| 1994-09-20 | Paper |
Geometric Knapsack problems
Algorithmica | 1994-02-17 | Paper |
Approximating the tree and tour covers of a graph
Information Processing Letters | 1994-01-16 | Paper |
scientific article; zbMATH DE number 432804 (Why is no real title available?)
| 1993-10-20 | Paper |
scientific article; zbMATH DE number 177546 (Why is no real title available?)
| 1993-05-18 | Paper |
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
ORSA Journal on Computing | 1993-02-25 | Paper |
Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
Operations Research | 1992-06-26 | Paper |
Computational complexity of uncapacitated multi-echelon production planning problems
Operations Research Letters | 1989-01-01 | Paper |
Scheduling jobs with fixed start and end times
Discrete Applied Mathematics | 1987-01-01 | Paper |
On the complexity of circulations
Journal of Algorithms | 1986-01-01 | Paper |
On negative cycles in mixed graphs
Operations Research Letters | 1985-01-01 | Paper |
