| Publication | Date of Publication | Type |
|---|
Separating a polyhedron by one translation from a set of obstacles
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
Algorithm Theory — SWAT'98 | 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
STACS 89 | 2022-08-16 | Paper |
A new model and algorithms in firefighting theory
Discrete Applied Mathematics | 2022-08-04 | Paper |
Shortest paths among transient obstacles
Journal of Combinatorial Optimization | 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
Computational Geometry | 2022-06-13 | Paper |
A new model in firefighting theory
(available as arXiv preprint) | 2020-07-21 | Paper |
Rectilinear shortest paths among transient obstacles
(available as arXiv preprint) | 2019-10-11 | Paper |
Weighted minimum backward Fréchet distance
Theoretical Computer Science | 2019-08-13 | Paper |
Optimal shooting: Characterizations and applications
Automata, Languages and Programming | 2019-01-10 | Paper |
Approximating the integral Fréchet distance
Computational Geometry | 2018-10-31 | Paper |
Path refinement in weighted regions
Algorithmica | 2018-10-18 | Paper |
An optimal algorithm for detecting weak visibility of a polygon
IEEE Transactions on Computers | 2018-09-14 | Paper |
| Approximating the integral Fréchet distance | 2017-10-17 | Paper |
Efficient, Decentralized Computation of the Topology of Spatial Regions
IEEE Transactions on Computers | 2017-07-27 | Paper |
Minimizing walking length in map matching
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Approximation algorithms for geometric shortest path problems
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Improved approximation for time-dependent shortest paths
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Improved algorithms for partial curve matching
Algorithmica | 2014-07-03 | Paper |
Similarity of polygonal curves in the presence of outliers
Computational Geometry | 2014-04-09 | Paper |
\(\alpha\)-visibility
Computational Geometry | 2014-01-22 | Paper |
Finding paths with minimum shared edges
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
An approximation algorithm for computing shortest paths in weighted 3-d domains
Discrete & Computational Geometry | 2013-08-05 | Paper |
Finding maximum edge bicliques in convex bipartite graphs
Algorithmica | 2012-11-21 | Paper |
\(\alpha \)-visibility
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Shortest paths in time-dependent FIFO networks
Algorithmica | 2012-04-26 | Paper |
Improved algorithms for partial curve matching
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Finding paths with minimum shared edges
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Fréchet distance with speed limits
Computational Geometry | 2011-01-31 | Paper |
Algorithms for approximate shortest path queries on weighted polyhedral surfaces
Discrete & Computational Geometry | 2010-11-08 | Paper |
Finding maximum edge bicliques in convex bipartite graphs
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Note on the paper ``K-vertex guarding simple polygons
Computational Geometry | 2009-07-27 | Paper |
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM | 2008-12-21 | Paper |
Shortest Path Queries in Polygonal Domains
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A Meeting Scheduling Problem Respecting Time and Space
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
Algorithms and Computation | 2008-05-27 | Paper |
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Lecture Notes in Computer Science | 2007-09-05 | Paper |
An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
Parallel Algorithms and Applications | 2004-10-06 | Paper |
Pop-stacks in parallel
Information Processing Letters | 2002-07-25 | Paper |
Ray shooting from convex ranges
Discrete Applied Mathematics | 2001-09-03 | Paper |
Approximating shortest paths on weighted polyhedral surfaces
Algorithmica | 2001-08-09 | Paper |
| scientific article; zbMATH DE number 1424300 (Why is no real title available?) | 2000-03-23 | Paper |
Planar stage graphs: Characterizations and applications
Theoretical Computer Science | 1998-07-23 | Paper |
Stage-graph representations
Discrete Applied Mathematics | 1998-01-29 | Paper |
Obituary: Paul Erdős (1913-1996)
Computational Geometry | 1997-03-13 | Paper |
Generating triangulations at random
ACM Transactions on Modeling and Computer Simulation | 1996-04-28 | Paper |
Optimal parallel algorithms for rectilinear link-distance problems
Algorithmica | 1995-08-27 | Paper |
Uniform generation of binary trees in parallel
Journal of Parallel and Distributed Computing | 1995-03-08 | Paper |
Uniform generation of forests of restricted height
Information Processing Letters | 1994-07-21 | Paper |
DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
Discrete & Computational Geometry | 1992-09-27 | Paper |
Generating binary trees at random
Information Processing Letters | 1992-06-28 | Paper |
Computational geometry algorithms for the systolic screen
Algorithmica | 1992-06-25 | Paper |
A characterization of heaps and its applications
Information and Computation | 1990-01-01 | Paper |
Computing the configuration space for a robot on a mesh-of-prosessors
Parallel Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4155942 (Why is no real title available?) | 1989-01-01 | Paper |
Heuristics for optimum binary search trees and minimum weight triangulation problems
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4102515 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4060719 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4050999 (Why is no real title available?) | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4050998 (Why is no real title available?) | 1988-01-01 | Paper |
Recognizing polygons, or how to spy
The Visual Computer | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092772 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062600 (Why is no real title available?) | 1988-01-01 | Paper |
Bounds for min-max heaps
BIT | 1987-01-01 | Paper |
Translation separability of sets of polygons
The Visual Computer | 1987-01-01 | Paper |
Algorithms for minimum length partitions of polygons
BIT | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049041 (Why is no real title available?) | 1987-01-01 | Paper |
Min-max heaps and generalized priority queues
Communications of the ACM | 1986-01-01 | Paper |
An algorithm for merging heaps
Acta Informatica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4014031 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3905323 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3893909 (Why is no real title available?) | 1984-01-01 | Paper |
