| Publication | Date of Publication | Type |
|---|
Moving an angle around a region
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
Computational Geometry | 2018-10-31 | Paper |
| Tight bounds for conflict-free chromatic guarding of orthogonal art galleries | 2017-10-10 | Paper |
| scientific article; zbMATH DE number 6472590 (Why is no real title available?) | 2015-08-14 | Paper |
Online exploration of polygons with holes
Approximation and Online Algorithms | 2013-09-13 | Paper |
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
Theoretical Computer Science | 2011-02-02 | Paper |
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
Frontiers in Algorithmics | 2009-07-14 | Paper |
Bounds on the quality of the PCA bounding boxes
Computational Geometry | 2009-06-30 | Paper |
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation
Frontiers in Algorithmics | 2009-03-10 | Paper |
On the Number of Cycles in Planar Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
| scientific article; zbMATH DE number 5507829 (Why is no real title available?) | 2009-02-12 | Paper |
Covering with ellipses
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2119696 (Why is no real title available?) | 2004-11-29 | Paper |
The polygon exploration problem
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1262794 (Why is no real title available?) | 2001-03-04 | Paper |
| scientific article; zbMATH DE number 1501064 (Why is no real title available?) | 2000-11-26 | Paper |
Triangles in Euclidean arrangements
Discrete & Computational Geometry | 2000-09-27 | Paper |
An applied point pattern matching problem: Comparing 2D patterns of protein spots
Discrete Applied Mathematics | 2000-06-21 | Paper |
On the Number of Simple Cycles in Planar Graphs
Combinatorics, Probability and Computing | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1107718 (Why is no real title available?) | 1998-05-04 | Paper |
| scientific article; zbMATH DE number 4219161 (Why is no real title available?) | 1998-01-01 | Paper |
A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
SIAM Journal on Discrete Mathematics | 1996-11-25 | Paper |
Generalized guarding and partitioning for rectilinear polygons
Computational Geometry | 1996-11-04 | Paper |
Lower bounds on the complexity of real-time branching programs
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
Embedding rectilinear graphs in linear time
Information Processing Letters | 1988-01-01 | Paper |
On dissections of the n-cube
Beiträge zur Algebra und Geometrie | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047113 (Why is no real title available?) | 1987-01-01 | Paper |
The dimension of graphs with respect to the direct powers of a two-element graph
Bulletin of the Australian Mathematical Society | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4001498 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3937107 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3885310 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3900168 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3827906 (Why is no real title available?) | 1983-01-01 | Paper |
