| Publication | Date of Publication | Type |
|---|
Complexity and algorithms for isometric path cover on chordal graphs and beyond
| 2024-09-11 | Paper |
Parallel algorithms for all minimum link paths and link center problems
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Hardness and approximation for the geodetic set problem in some graph classes
| 2020-07-21 | Paper |
On conflict-free chromatic guarding of simple polygons
| 2020-05-13 | Paper |
Drawing bipartite graphs in two layers with specified crossings
| 2019-10-10 | Paper |
Improved bounds for the conflict-free chromatic art gallery problem
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Two-layer drawings of bipartite graphs
| 2018-01-18 | Paper |
Approximability of guarding weak visibility polygons
Discrete Applied Mathematics | 2017-06-19 | Paper |
Mapping a Polygon with Holes Using a Compass
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Four-connected triangulations of planar point sets
Discrete & Computational Geometry | 2015-06-26 | Paper |
Some results on point visibility graphs
Theoretical Computer Science | 2015-04-01 | Paper |
Vertex guarding in weak visibility polygons
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Online algorithms for searching and exploration in the plane
Computer Science Review | 2014-10-24 | Paper |
Mapping a polygon with holes using a compass
Theoretical Computer Science | 2014-09-18 | Paper |
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys | 2014-06-05 | Paper |
Some results on point visibility graphs
Lecture Notes in Computer Science | 2014-02-18 | Paper |
Packing and covering tetrahedra
Discrete Applied Mathematics | 2013-11-29 | Paper |
Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics | 2010-05-05 | Paper |
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Triangulating with high connectivity.
Computational Geometry | 2008-04-25 | Paper |
Visibility Algorithms in the Plane
| 2008-02-22 | Paper |
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Berge's theorem for the maximum charge problem
Discrete Optimization | 2006-10-10 | Paper |
A linear time algorithm to remove winding of a simple polygon
Computational Geometry | 2006-04-28 | Paper |
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
Algorithmica | 2002-09-25 | Paper |
scientific article; zbMATH DE number 1729272 (Why is no real title available?)
| 2002-07-02 | Paper |
Characterizing LR-visibility polygons and related problems
Computational Geometry | 2001-04-24 | Paper |
scientific article; zbMATH DE number 1424307 (Why is no real title available?)
| 2000-11-13 | Paper |
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
Computational Geometry | 1997-10-28 | Paper |
On recognizing and characterizing visibility graphs of simple polygons
Discrete & Computational Geometry | 1997-03-23 | Paper |
A Note on Computing the Visibility Polygon from a Convex Chain
Journal of Algorithms | 1997-02-23 | Paper |
-Algorithms for Minimum Link Path and Related Problems
Journal of Algorithms | 1996-05-28 | Paper |
An algorithm for recognizing palm polygons
The Visual Computer | 1995-03-30 | Paper |
Characterizing and recognizing weak visibility polygons
Computational Geometry | 1993-11-01 | Paper |
An optimal parallel algorithm for computing furthest neighbors in a tree
Information Processing Letters | 1993-04-01 | Paper |
An Output-Sensitive Algorithm for Computing Visibility Graphs
SIAM Journal on Computing | 1992-06-26 | Paper |
Computing the visibility polygon from a convex set and related problems
Journal of Algorithms | 1991-01-01 | Paper |
An optimal algorithm for computing a minimum nested nonconvex polygon
Information Processing Letters | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4085050 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4090791 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062591 (Why is no real title available?)
| 1988-01-01 | Paper |
A linear time algorithm for computing the convex hull of an ordered crossing polygon
Pattern Recognition | 1984-01-01 | Paper |
A linear time algorithm for obtaining the convex hull of a simple polygon
Pattern Recognition | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3843152 (Why is no real title available?)
| 1983-01-01 | Paper |
