| Publication | Date of Publication | Type |
|---|
Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
Discrete Mathematics | 2024-11-09 | Paper |
| Pursuit-evasion in graphs: zombies, lazy zombies and a survivor | 2024-09-11 | Paper |
| A sub-quadratic time algorithm for computing the beacon kernel of simple polygons | 2024-08-22 | Paper |
On the zombie number of various graph classes
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| Illumination with orthogonal floodlights | 2023-03-21 | Paper |
An efficient algorithm for the proximity connected two center problem
(available as arXiv preprint) | 2022-08-30 | Paper |
A combinatorial bound for beacon-based routing in orthogonal polygons
(available as arXiv preprint) | 2022-05-18 | Paper |
| Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor | 2022-04-25 | Paper |
Piercing pairwise intersecting geodesic disks
Computational Geometry | 2021-09-17 | Paper |
Attraction-convexity and normal visibility
Computational Geometry | 2021-09-16 | Paper |
Computing the \(k\)-visibility region of a point in a polygon
Theory of Computing Systems | 2021-06-11 | Paper |
Gathering by repulsion
Computational Geometry | 2020-10-23 | Paper |
| Gathering by repulsion | 2020-08-25 | Paper |
| Computing the \(k\)-crossing visibility region of a point in a polygon | 2020-02-25 | Paper |
| Transmitting particles in a polygonal domain by repulsion | 2019-10-11 | Paper |
Nonadaptive broadcasting in trees
Networks | 2011-03-16 | Paper |
Edge-disjoint spanners in tori
Discrete Mathematics | 2009-06-19 | Paper |
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms | 2008-01-11 | Paper |
A linear time algorithm to remove winding of a simple polygon
Computational Geometry | 2006-04-28 | Paper |
Edge-disjoint spanners in Cartesian products of graphs
Discrete Mathematics | 2005-08-17 | Paper |
POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
| scientific article; zbMATH DE number 2084285 (Why is no real title available?) | 2004-08-06 | Paper |
Factor \(d\)-domatic colorings of graphs
Discrete Mathematics | 2003-04-28 | Paper |
Edge-disjoint spanners of complete bipartite graphs
Discrete Mathematics | 2002-03-29 | Paper |
| scientific article; zbMATH DE number 1424307 (Why is no real title available?) | 2000-11-13 | Paper |
Illumination of Orthogonal Polygons with Orthogonal Floodlights
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Degree-Constrained Network Spanners with Nonconstant Delay
SIAM Journal on Discrete Mathematics | 2000-07-04 | Paper |
On representations of some thickness-two graphs
Computational Geometry | 2000-01-17 | Paper |
Edge-disjoint spanners of complete graphs and complete digraphs
Discrete Mathematics | 1999-12-20 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
Guarding polyhedral terrains
Computational Geometry | 1997-03-18 | Paper |
Degree-constrained spanners for multidimensional grids
Discrete Applied Mathematics | 1996-11-25 | Paper |
Generalized guarding and partitioning for rectilinear polygons
Computational Geometry | 1996-11-04 | Paper |
On recognizing unions of two convex polygons and related problems
Pattern Recognition Letters | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 432849 (Why is no real title available?) | 1993-10-20 | Paper |
Grid spanners
Networks | 1993-09-05 | Paper |
Additive graph spanners
Networks | 1993-08-23 | Paper |
Probing polygons minimally is hard
Computational Geometry | 1993-06-29 | Paper |
Computing bushy and thin triangulations
Computational Geometry | 1992-09-27 | Paper |
A counterexample to the algorithms for determining opaque minimal forests
Information Processing Letters | 1992-06-28 | Paper |
A linear algorithm for bisecting a polygon
Information Processing Letters | 1992-06-28 | Paper |
Covering and guarding polygons using \(L_ k\)-sets
Geometriae Dedicata | 1991-01-01 | Paper |
