| Publication | Date of Publication | Type |
|---|
| Separating a polyhedron by one translation from a set of obstacles | 2024-02-28 | Paper |
| An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces | 2022-12-09 | Paper |
| An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures | 2022-10-13 | Paper |
| An O(n log n) algorithm for computing a link center in a simple polygon | 2022-08-16 | Paper |
| A new model and algorithms in firefighting theory | 2022-08-04 | Paper |
| Shortest paths among transient obstacles | 2022-07-18 | Paper |
| An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures | 2022-06-13 | Paper |
| A new model in firefighting theory | 2020-07-21 | Paper |
| Rectilinear shortest paths among transient obstacles | 2019-10-11 | Paper |
| Weighted minimum backward Fréchet distance | 2019-08-13 | Paper |
| Optimal shooting: Characterizations and applications | 2019-01-10 | Paper |
| Approximating the integral Fréchet distance | 2018-10-31 | Paper |
| Path refinement in weighted regions | 2018-10-18 | Paper |
| An optimal algorithm for detecting weak visibility of a polygon | 2018-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369528 | 2017-10-17 | Paper |
| Efficient, Decentralized Computation of the Topology of Spatial Regions | 2017-07-27 | Paper |
| Minimizing Walking Length in Map Matching | 2016-04-01 | Paper |
| Improved Approximation for Time-Dependent Shortest Paths | 2014-09-26 | Paper |
| Approximation algorithms for geometric shortest path problems | 2014-09-26 | Paper |
| Improved algorithms for partial curve matching | 2014-07-03 | Paper |
| Similarity of polygonal curves in the presence of outliers | 2014-04-09 | Paper |
| \(\alpha\)-visibility | 2014-01-22 | Paper |
| Finding paths with minimum shared edges | 2013-12-09 | Paper |
| An approximation algorithm for computing shortest paths in weighted 3-d domains | 2013-08-05 | Paper |
| Finding maximum edge bicliques in convex bipartite graphs | 2012-11-21 | Paper |
| α-Visibility | 2012-08-14 | Paper |
| Shortest paths in time-dependent FIFO networks | 2012-04-26 | Paper |
| Improved Algorithms for Partial Curve Matching | 2011-09-16 | Paper |
| Finding Paths with Minimum Shared Edges | 2011-08-17 | Paper |
| Fréchet distance with speed limits | 2011-01-31 | Paper |
| Algorithms for approximate shortest path queries on weighted polyhedral surfaces | 2010-11-08 | Paper |
| Finding Maximum Edge Bicliques in Convex Bipartite Graphs | 2010-07-20 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Note on the paper ``K-vertex guarding simple polygons | 2009-07-27 | Paper |
| Determining approximate shortest paths on weighted polyhedral surfaces | 2008-12-21 | Paper |
| A Meeting Scheduling Problem Respecting Time and Space | 2008-07-10 | Paper |
| Shortest Path Queries in Polygonal Domains | 2008-07-10 | Paper |
| An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane | 2008-05-27 | Paper |
| Approximate Shortest Path Queries on Weighted Polyhedral Surfaces | 2007-09-05 | Paper |
| An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT | 2005-06-10 | Paper |
| ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY | 2004-10-06 | Paper |
| Pop-stacks in parallel | 2002-07-25 | Paper |
| Ray shooting from convex ranges | 2001-09-03 | Paper |
| Approximating shortest paths on weighted polyhedral surfaces | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945513 | 2000-03-23 | Paper |
| Planar stage graphs: Characterizations and applications | 1998-07-23 | Paper |
| Stage-graph representations | 1998-01-29 | Paper |
| Obituary: Paul Erdős (1913-1996) | 1997-03-13 | Paper |
| Generating triangulations at random | 1996-04-28 | Paper |
| Optimal parallel algorithms for rectilinear link-distance problems | 1995-08-27 | Paper |
| Uniform generation of binary trees in parallel | 1995-03-08 | Paper |
| Uniform generation of forests of restricted height | 1994-07-21 | Paper |
| DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS | 1993-08-22 | Paper |
| SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS | 1993-04-01 | Paper |
| An \(O(n\log n)\) algorithm for computing the link center of a simple polygon | 1992-09-27 | Paper |
| Generating binary trees at random | 1992-06-28 | Paper |
| Computational geometry algorithms for the systolic screen | 1992-06-25 | Paper |
| A characterization of heaps and its applications | 1990-01-01 | Paper |
| Computing the configuration space for a robot on a mesh-of-prosessors | 1989-01-01 | Paper |
| Heuristics for optimum binary search trees and minimum weight triangulation problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484389 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827554 | 1989-01-01 | Paper |
| Recognizing polygons, or how to spy | 1988-01-01 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787487 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787488 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795225 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796757 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820006 | 1988-01-01 | Paper |
| Translation separability of sets of polygons | 1987-01-01 | Paper |
| Bounds for min-max heaps | 1987-01-01 | Paper |
| Algorithms for minimum length partitions of polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785935 | 1987-01-01 | Paper |
| Min-max heaps and generalized priority queues | 1986-01-01 | Paper |
| An algorithm for merging heaps | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026346 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683086 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186269 | 1984-01-01 | Paper |
