| Publication | Date of Publication | Type |
|---|
| Polynomial-time combinatorial algorithm for general max-min fair allocation | 2024-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147509 | 2024-01-15 | Paper |
| Constrained independence system and triangulations of planar point sets | 2023-12-12 | Paper |
| Minimum dominating sets of intervals on lines | 2023-12-12 | Paper |
| Shortest Journeys in Directed Temporal Graphs | 2023-11-16 | Paper |
| A Generalization of Self-Improving Algorithms | 2023-11-02 | Paper |
| Dynamic Distribution-Sensitive Point Location | 2023-11-02 | Paper |
| Dynamic Distribution-Sensitive Point Location | 2023-10-31 | Paper |
| A Generalization of Self-Improving Algorithms | 2023-10-31 | Paper |
| General max-min fair allocation | 2023-03-30 | Paper |
| A study of the LMT-skeleton | 2023-01-25 | Paper |
| Multistage online maxmin allocation of indivisible entities | 2022-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091057 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091188 | 2022-07-21 | Paper |
| Restricted max-min allocation: integrality gap and approximation algorithm | 2022-06-28 | Paper |
| Adaptive Planar Point Location | 2021-08-06 | Paper |
| Restricted Max-Min Fair Allocation | 2021-07-28 | Paper |
| Fitting a graph to one-dimensional data | 2021-04-15 | Paper |
| Extensions of self-improving sorters | 2020-01-16 | Paper |
| Implicit manifold reconstruction | 2019-09-11 | Paper |
| Implicit Manifold Reconstruction | 2019-06-20 | Paper |
| Approximate Shortest Descending Paths | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633914 | 2019-05-06 | Paper |
| A Faster Algorithm for Computing Straight Skeletons | 2018-11-05 | Paper |
| A Fast and Simple Surface Reconstruction Algorithm | 2018-11-05 | Paper |
| Adaptive Planar Point Location | 2018-08-13 | Paper |
| Minimax regret 1-median problem in dynamic path networks | 2018-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643843 | 2018-05-29 | Paper |
| Finding Largest Common Point Sets | 2018-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132899 | 2018-01-30 | Paper |
| Adaptive Point Location in Planar Convex Subdivisions | 2017-10-20 | Paper |
| Navigating Weighted Regions with Scattered Skinny Tetrahedra | 2017-10-20 | Paper |
| Provable dimension detection using principal component analysis | 2017-10-20 | Paper |
| Triangulation Refinement and Approximate Shortest Paths in Weighted Regions | 2017-10-05 | Paper |
| Curve reconstruction from noisy samples | 2017-09-29 | Paper |
| Sampling and meshing a surface with guaranteed topology and geometry | 2017-09-29 | Paper |
| Quality meshing for polyhedra with small angles | 2017-09-29 | Paper |
| Approximating the average stretch factor of geometric graphs | 2017-03-09 | Paper |
| Overlap of Convex Polytopes under Rigid Motion | 2017-01-26 | Paper |
| Tangent estimation from point samples | 2016-10-27 | Paper |
| Minimax regret 1-median problem in dynamic path networks | 2016-09-29 | Paper |
| Adaptive Point Location in Planar Convex Subdivisions | 2016-01-11 | Paper |
| Navigating Weighted Regions with Scattered Skinny Tetrahedra | 2016-01-11 | Paper |
| Deforming Surface Meshes | 2015-10-06 | Paper |
| Sliver exudation | 2015-09-19 | Paper |
| Edge flips in surface meshes | 2015-07-20 | Paper |
| Shortest paths on polyhedral surfaces and terrains | 2015-06-26 | Paper |
| Minimax regret 1-sink location problem in dynamic path networks | 2015-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934663 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934704 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921773 | 2014-10-13 | Paper |
| A Faster Algorithm for Computing Straight Skeletons | 2014-10-08 | Paper |
| Range searching on uncertain data | 2014-09-09 | Paper |
| A fast and simple surface reconstruction algorithm | 2014-08-07 | Paper |
| Approximate Shortest Descending Paths | 2014-07-30 | Paper |
| Edge flips and deforming surface meshes | 2014-03-24 | Paper |
| Overlap of convex polytopes under rigid motion | 2014-01-08 | Paper |
| Minimax Regret 1-Sink Location Problems in Dynamic Path Networks | 2013-05-28 | Paper |
| Shape matching under rigid motion | 2013-04-29 | Paper |
| Maximum overlap of convex polytopes under translation | 2013-03-12 | Paper |
| APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS | 2012-11-23 | Paper |
| Delaunay Mesh Generation | 2011-01-07 | Paper |
| Approximating the Average Stretch Factor of Geometric Graphs | 2010-12-09 | Paper |
| Maximum Overlap of Convex Polytopes under Translation | 2010-12-09 | Paper |
| Approximate Shortest Homotopic Paths in Weighted Regions | 2010-12-09 | Paper |
| Querying Approximate Shortest Paths in Anisotropic Regions | 2010-11-04 | Paper |
| Anisotropic surface meshing | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579466 | 2010-08-06 | Paper |
| Delaunay refinement for piecewise smooth complexes | 2010-02-23 | Paper |
| Approximate Shortest Paths in Anisotropic Regions | 2009-06-22 | Paper |
| Casting an object with a core | 2009-06-16 | Paper |
| PROVABLE DIMENSION DETECTION USING PRINCIPAL COMPONENT ANALYSIS | 2009-03-02 | Paper |
| Querying approximate shortest paths in anisotropic regions | 2009-02-12 | Paper |
| Sampling and Meshing a Surface with Guaranteed Topology and Geometry | 2008-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442589 | 2008-02-22 | Paper |
| Motorcycle graphs and straight skeletons | 2007-03-12 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Three-dimensional Delaunay mesh generation | 2006-10-16 | Paper |
| Casting with skewed ejection direction | 2006-08-16 | Paper |
| On the sizes of Delaunay meshes | 2006-04-28 | Paper |
| THE REFLEX-FREE HULL | 2005-12-09 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES | 2005-09-29 | Paper |
| APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING | 2005-06-10 | Paper |
| Curve reconstruction from noisy samples | 2005-05-04 | Paper |
| Hierarchical decompositions and circular ray shooting in simple polygons | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828926 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828928 | 2004-11-29 | Paper |
| Competitive facility location: the Voronoi game | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471311 | 2004-07-28 | Paper |
| Hierarchy of surface models and irreducible triangulations. | 2004-03-14 | Paper |
| Quality Meshing with Weighted Delaunay Refinement | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425963 | 2003-09-14 | Paper |
| Quadtree, ray shooting and approximate minimum weight Steiner triangulation | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553235 | 2002-11-04 | Paper |
| Design and analysis of planar shape deformation | 2002-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945798 | 2002-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721994 | 2001-07-11 | Paper |
| LMT-skeleton heuristics for several new classes of optimal triangulations | 2001-02-22 | Paper |
| The Steiner tree problem for terminals on the boundary of a rectilinear polygon | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252290 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395320 | 1998-10-01 | Paper |
| Widest empty L-shaped corridor | 1997-02-27 | Paper |
| Triangulations intersect nicely | 1997-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875187 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138880 | 1994-09-20 | Paper |
| Single jog minimum area joining of compacted cells | 1993-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138933 | 1993-10-20 | Paper |
| Algorithms for ray-shooting and intersection searching | 1993-01-12 | Paper |
| New Results on Dynamic Planar Point Location | 1992-12-06 | Paper |
| Efficient distributed algorithms for single-source shortest paths and related problems on plane networks | 1992-09-26 | Paper |
| Efficient maintenance of the union of intervals on a line, with applications | 1991-01-01 | Paper |
| Efficient dynamic algorithms for some geometric intersection problems | 1990-01-01 | Paper |
