| Publication | Date of Publication | Type |
|---|
Largest unit rectangles inscribed in a convex polygon
Computational Geometry | 2024-11-15 | Paper |
| Inscribing or circumscribing a histogon to a convex polygon | 2024-09-12 | Paper |
Area-efficient algorithms for upward straight-line tree drawings
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Directed hamiltonian packing in d-dimensional meshes and its application | 2023-01-25 | Paper |
| Reachability of turn sequences | 2022-03-01 | Paper |
Minimum rectilinear polygons for given angle sequences
Computational Geometry | 2021-12-15 | Paper |
Representing graphs and hypergraphs by touching polygons in 3D
(available as arXiv preprint) | 2020-10-26 | Paper |
Area bounds of rectilinear polygons realized by angle sequences
Computational Geometry | 2019-10-25 | Paper |
Tight bounds for beacon-based coverage in simple rectilinear polygons
Computational Geometry | 2019-10-18 | Paper |
Minimum-width annulus with outliers: circular, square, and rectangular cases
Information Processing Letters | 2019-03-11 | Paper |
The minimum convex container of two convex polytopes under translations
Computational Geometry | 2018-11-19 | Paper |
Minimum-width annulus with outliers: circular, square, and rectangular cases
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
Covering points with convex sets of minimum size
Theoretical Computer Science | 2018-03-16 | Paper |
Maximizing the overlap of two planar convex sets under rigid motions
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Minimum rectilinear polygons for given angle sequences
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Covering Points with Convex Sets of Minimum Size
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Local event boundary detection with unreliable sensors: analysis of the majority vote scheme
Theoretical Computer Science | 2015-12-08 | Paper |
Local event boundary detection with unreliable sensors: analysis of the majority vote scheme
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
A note on minimum-sum coverage by aligned disks
Information Processing Letters | 2014-04-14 | Paper |
Realistic roofs over a rectilinear polygon
Computational Geometry | 2013-09-03 | Paper |
Area Bounds of Rectilinear Polygons Realized by Angle Sequences
Algorithms and Computation | 2013-03-21 | Paper |
Covering and piercing disks with two centers
Computational Geometry | 2013-01-25 | Paper |
The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
Generating realistic roofs over a rectilinear polygon
Algorithms and Computation | 2011-12-16 | Paper |
Covering and piercing disks with two centers
Algorithms and Computation | 2011-12-16 | Paper |
THE ALIGNED K-CENTER PROBLEM
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
The onion diagram: a Voronoi-like tessellation of a planar line space and its applications (extended abstract)
Algorithms and Computation | 2010-12-09 | Paper |
GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
International Journal of Computational Geometry & Applications | 2010-07-27 | Paper |
Covering a simple polygon by monotone directions
Computational Geometry | 2010-03-11 | Paper |
Untangling a planar graph
Discrete & Computational Geometry | 2009-12-14 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
On the minimum total length of interval systems expressing all intervals, and range-restricted queries
Computational Geometry | 2009-02-12 | Paper |
Covering a Simple Polygon by Monotone Directions
Algorithms and Computation | 2009-01-29 | Paper |
Escaping offline searchers and isoperimetric theorems
Computational Geometry | 2008-11-19 | Paper |
CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
International Journal of Computational Geometry & Applications | 2008-09-29 | Paper |
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
Algorithms and Computation | 2008-05-27 | Paper |
Maximum overlap and minimum convex hull of two convex polyhedra under translations
Computational Geometry | 2008-04-28 | Paper |
Moving Vertices to Make Drawings Plane
Graph Drawing | 2008-03-25 | Paper |
Farthest-Point Queries with Geometric and Combinatorial Constraints
Discrete and Computational Geometry | 2008-03-18 | Paper |
Maximizing the overlap of two planar convex sets under rigid motions
Computational Geometry | 2007-03-15 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
GUARDING ART GALLERIES BY GUARDING WITNESSES
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry | 2006-04-28 | Paper |
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry | 2006-04-28 | Paper |
Algorithms for drawing binary trees in the plane.
Information Processing Letters | 2006-01-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
LABELING A RECTILINEAR MAP WITH SLIDING LABELS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Labeling points with weights
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2081025 (Why is no real title available?) | 2004-08-04 | Paper |
Facility location and the geometric minimum-diameter spanning tree.
Computational Geometry | 2004-01-23 | Paper |
Computing farthest neighbors on a convex polytope.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947054 (Why is no real title available?) | 2003-07-07 | Paper |
Building bridges between convex regions
Computational Geometry | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1796963 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1696646 (Why is no real title available?) | 2002-07-01 | Paper |
Computing the optimal bridge between two polygons
Theory of Computing Systems | 2002-05-14 | Paper |
Area-efficient algorithms for straight-line tree drawings
Computational Geometry | 2001-01-29 | Paper |
Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes
Journal of Parallel and Distributed Computing | 2000-11-07 | Paper |
Placing two disks in a convex polygon
Information Processing Letters | 2000-10-26 | Paper |
The widest k-dense corridor problems
Information Processing Letters | 1999-01-12 | Paper |
