| Publication | Date of Publication | Type |
|---|
| Guarding disjoint orthogonal polygons in the plane | 2023-03-21 | Paper |
On geometric path query problems
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
Computational Geometry | 2021-09-16 | Paper |
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
Theoretical Computer Science | 2021-08-11 | Paper |
Trajectory planning for an articulated probe
Computational Geometry | 2020-10-23 | Paper |
Two-dimensional closest pair problem: a closer look
Discrete Applied Mathematics | 2020-10-14 | Paper |
Altitude terrain guarding and guarding uni-monotone polygons
Computational Geometry | 2019-10-25 | Paper |
Does a robot path have clearance C?
(available as arXiv preprint) | 2019-10-11 | Paper |
Dynamic minimum bichromatic separating circle
Theoretical Computer Science | 2019-06-25 | Paper |
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Maintaining visibility of a polygon with a moving point of view
Information Processing Letters | 2016-06-09 | Paper |
Dynamic minimum bichromatic separating circle
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Algorithms for fair partitioning of convex polygons
Theoretical Computer Science | 2015-12-11 | Paper |
Algorithms for fair partitioning of convex polygons
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Largest area convex hull of imprecise data based on axis-aligned squares
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
On some geometric problems of color-spanning sets
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
Computational Geometry | 2012-09-21 | Paper |
Largest area convex hull of axis-aligned squares based on imprecise data
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Kinetic red-blue minimum separating circle
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Line facility location in weighted regions
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
NP-Completeness of Spreading Colored Points
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Guarding a terrain by two watchtowers
Algorithmica | 2010-09-16 | Paper |
Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
Information Processing Letters | 2010-09-01 | Paper |
Fréchet distance problems in weighted regions
Discrete Mathematics, Algorithms and Applications | 2010-07-27 | Paper |
An experimental study of weighted \(k\)-link shortest path algorithms
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Visiting a sequence of points with a bevel-tip needle
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Fréchet distance problems in weighted regions
Algorithms and Computation | 2009-12-17 | Paper |
Towards an optimal algorithm for recognizing Laman graphs
Journal of Graph Algorithms and Applications | 2009-10-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Line Segment Facility Location in Weighted Subdivisions
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence | 2009-05-20 | Paper |
MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2009-05-19 | Paper |
A PTAS for cutting out polygons with lines
Algorithmica | 2009-04-29 | Paper |
Parallel Optimal Weighted Links
Transactions on Computational Science III | 2009-03-03 | Paper |
| scientific article; zbMATH DE number 5506244 (Why is no real title available?) | 2009-02-10 | Paper |
Computing Simple Paths on Points in Simple Polygons
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Line Facility Location in Weighted Regions
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
On Some City Guarding Problems
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Farthest-Point Queries with Geometric and Combinatorial Constraints
Discrete and Computational Geometry | 2008-03-18 | Paper |
A PTAS for Cutting Out Polygons with Lines
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
CUTTING OUT POLYGONS WITH LINES AND RAYS
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Proximity problems on line segments spanned by points
Computational Geometry | 2006-04-28 | Paper |
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry | 2006-04-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Polygonal path simplification with angle constraints
Computational Geometry | 2005-11-01 | Paper |
Extremal point queries with lines and line segments and related problems
Computational Geometry | 2005-11-01 | Paper |
ON GEOMETRIC PATH QUERY PROBLEMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
Polygonal chain approximation: A query based approach
Computational Geometry | 2005-02-09 | Paper |
New results on path approximation
Algorithmica | 2004-12-02 | Paper |
Finding an optimal path without growing the tree
Journal of Algorithms | 2004-10-01 | Paper |
SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2088185 (Why is no real title available?) | 2004-08-12 | Paper |
Efficient parallel algorithms for planar \(st\)-graphs
Algorithmica | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1729273 (Why is no real title available?) | 2002-07-02 | Paper |
Efficiently approximating polygonal paths in three and higher dimensions
Algorithmica | 2002-06-17 | Paper |
| Polygonal path approximation with angle constraints | 2002-01-30 | Paper |
Determining an optimal penetration among weighted regions in two and three dimensions
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1445369 (Why is no real title available?) | 2000-10-23 | Paper |
| scientific article; zbMATH DE number 1305095 (Why is no real title available?) | 1999-10-06 | Paper |
| scientific article; zbMATH DE number 1222818 (Why is no real title available?) | 1998-11-11 | Paper |
