| Publication | Date of Publication | Type |
|---|
\(m\)-watchmen's routes in minbar and generalized minbar polygons
Computational Geometry | 2026-01-22 | Paper |
Approximation algorithms for the two-watchman route in a simple polygon
Algorithmica | 2024-10-07 | Paper |
| Guarding polyominoes under \(k\)-hop visibility | 2024-05-31 | Paper |
| scientific article; zbMATH DE number 7788584 (Why is no real title available?) | 2024-01-15 | Paper |
\(k\)-Transmitter watchman routes
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
On vertex guarding staircase polygons
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Online two-dimensional vector packing with advice
(available as arXiv preprint) | 2023-03-22 | Paper |
Local Routing in Sparse and Lightweight Geometric Graphs
(available as arXiv preprint) | 2023-02-03 | Paper |
Concerning the time bounds of existing shortest watchman route algorithms
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
SWAT 90 | 2022-12-09 | Paper |
Local routing in sparse and lightweight geometric graphs
Algorithmica | 2022-05-03 | Paper |
| Minimum spanning trees in \(d\) dimensions | 2021-12-20 | Paper |
How to Keep an Eye on Small Things
International Journal of Computational Geometry & Applications | 2021-11-26 | Paper |
Shortest watchman tours in simple polygons under rotated monotone visibility
(available as arXiv preprint) | 2021-04-21 | Paper |
Online clique clustering
Algorithmica | 2020-02-28 | Paper |
Competitive strategies for online clique clustering
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Approximate guarding of monotone and rectilinear polygons
Algorithmica | 2013-06-25 | Paper |
Competitive online clique clustering
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Competitive exploration of rectilinear polygons.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
The Online Freeze-Tag Problem
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Competitive exploration of rectilinear polygons
Theoretical Computer Science | 2006-04-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Online and offline algorithms for the time-dependent TSP with time zones
Algorithmica | 2004-10-01 | Paper |
Approximation results for kinetic variants of TSP
Discrete & Computational Geometry | 2002-08-20 | Paper |
| scientific article; zbMATH DE number 1809601 (Why is no real title available?) | 2002-01-01 | Paper |
Parallel searching on \(m\) rays
Computational Geometry | 2001-09-27 | Paper |
Approximating a shortest watchman route
Fundamenta Informaticae | 2001-04-24 | Paper |
| scientific article; zbMATH DE number 1436136 (Why is no real title available?) | 2000-04-26 | Paper |
Finding the shortest watchman route in a simple polygon
Discrete & Computational Geometry | 1999-11-23 | Paper |
Computing vision points in polygons
Algorithmica | 1999-06-29 | Paper |
An optimal algorithm for the rectilinear link center of a rectilinear polygon
Computational Geometry | 1996-07-14 | Paper |
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
| scientific article; zbMATH DE number 176583 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177562 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177553 (Why is no real title available?) | 1993-05-18 | Paper |
SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
