| Publication | Date of Publication | Type |
|---|
An optimal and practical algorithm for the planar 2-center problem
Theory of Computing Systems | 2025-08-19 | Paper |
On-line exploration of an unbounded region with one obstacle
Theoretical Computer Science | 2025-06-19 | Paper |
Largest convex hulls for convex-hull disjoint clusters with bounded size
Theoretical Computer Science | 2025-06-19 | Paper |
| An optimal and practical algorithm for the planar 2-center problem | 2024-11-12 | Paper |
Two-guarding a rectilinear polygon
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Improved stretch factor of Delaunay triangulations of points in convex position
Journal of Combinatorial Optimization | 2022-11-17 | Paper |
Improved exploration of unknown polygons
Theoretical Computer Science | 2022-06-13 | Paper |
On the upper bound on the average distance from the Fermat-Weber center of a convex body
Computational Geometry | 2021-09-17 | Paper |
| Polynomial-time algorithms for the touring rays and related problems | 2021-07-05 | Paper |
The touring rays and related problems
Theoretical Computer Science | 2021-04-14 | Paper |
Improved stretch factor of Delaunay triangulations of points in convex position
Combinatorial Optimization and Applications | 2020-05-13 | Paper |
Computing simple paths from given points inside a polygon
Discrete Applied Mathematics | 2018-12-10 | Paper |
The capture time of a planar graph
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
An improved algorithm for computing a shortest watchman route for lines
Information Processing Letters | 2017-12-13 | Paper |
| Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem | 2017-10-23 | Paper |
Efficient algorithms for touring a sequence of convex polygons and related problems
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On the conjecture of the smallest 3-cop-win planar graph
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On the Capture Time of Cops and Robbers Game on a Planar Graph
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
An improved on-line strategy for exploring unknown polygons
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
A new distributed algorithm for computing a dominating set on grids
Frontiers in Algorithmics | 2015-11-12 | Paper |
A characterization of link-2 LR-visibility polygons with applications
Lecture Notes in Computer Science | 2015-09-14 | Paper |
On-line strategies for evacuating from a convex region in the plane
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Optimal point movement for covering circular regions
Algorithmica | 2015-07-10 | Paper |
Finding simple paths on given points in a polygonal region
Frontiers in Algorithmics | 2014-09-02 | Paper |
Characterizing and recognizing LR-visibility polygons
Discrete Applied Mathematics | 2014-05-05 | Paper |
Minimization of the maximum distance between the two guards patrolling a polygonal region
Theoretical Computer Science | 2014-04-15 | Paper |
Optimum sweeps of simple polygons with two guards
Information Processing Letters | 2014-04-14 | Paper |
Approximation algorithms for cutting a convex polyhedron out of a sphere
Theoretical Computer Science | 2013-12-19 | Paper |
A new approach to the upper bound on the average distance from the Fermat-Weber center of a convex body
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Optimal point movement for covering circular regions
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Minimization of the maximum distance between the two guards patrolling a polygonal region
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Simple Characterization of LR-visibility Polygons
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Searching for mobile intruders in circular corridors by two 1-searchers
Discrete Applied Mathematics | 2011-10-27 | Paper |
Approximation algorithms for cutting a convex polyhedron out of a sphere
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
New Algorithms for Barrier Coverage with Mobile Sensors
Frontiers in Algorithmics | 2010-09-07 | Paper |
Optimum sweeps of simple polygons with two guards
Frontiers in Algorithmics | 2010-09-07 | Paper |
Sweeping simple polygons with the minimum number of chain guards
Information Processing Letters | 2010-01-29 | Paper |
A 2-approximation algorithm for the zookeeper's problem
Information Processing Letters | 2010-01-29 | Paper |
Searching a Circular Corridor with Two Flashlights
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Finding shortest safari routes in simple polygons
Information Processing Letters | 2009-04-28 | Paper |
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
A unified and efficient solution to the room search problem
Computational Geometry | 2008-03-26 | Paper |
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
Discrete and Computational Geometry | 2008-03-18 | Paper |
Searching a Polygonal Region by Two Guards
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
Theoretical Computer Science | 2007-09-28 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2080272 (Why is no real title available?) | 2004-08-04 | Paper |
Approximation algorithms for the watchman route and zookeeper's problems.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1796966 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1796964 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1786527 (Why is no real title available?) | 2002-08-21 | Paper |
Fast computation of shortest watchman routes in simple polygons
Information Processing Letters | 2002-07-25 | Paper |
Shortest zookeeper's routes in simple polygons
Information Processing Letters | 2002-07-25 | Paper |
On optimal bridges between two convex regions
Information Processing Letters | 2002-07-25 | Paper |
Optimal computation of the Voronoi diagram of disjoint clusters
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1507309 (Why is no real title available?) | 2001-03-25 | Paper |
CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
International Journal of Computational Geometry & Applications | 2001-02-08 | Paper |
| scientific article; zbMATH DE number 1555972 (Why is no real title available?) | 2001-01-24 | Paper |
EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Routing multiterminal nets on a hexagonal grid
Discrete Applied Mathematics | 1999-06-07 | Paper |
Hexagonal three-layer channel routing
Information Processing Letters | 1997-02-27 | Paper |
The net adding problem
International Journal of Computer Mathematics | 1996-05-28 | Paper |
Complexity of projected images of convex subdivisions
Computational Geometry | 1995-04-09 | Paper |
AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
International Journal of Computational Geometry & Applications | 1994-05-03 | Paper |
The intersection searching problem for c-oriented polygons
Information Processing Letters | 1991-01-01 | Paper |
