| Publication | Date of Publication | Type |
|---|
Guarding points on a terrain by watchtowers
Computational Geometry | 2026-01-22 | Paper |
| Monotone partitions of simple polygons | 2026-01-13 | Paper |
| Guarding terrains with guards on a line | 2026-01-13 | Paper |
Largest similar copies of convex polygons in polygonal domains
Theoretical Computer Science | 2026-01-05 | Paper |
Parallel line centers with guaranteed separation
Computational Geometry | 2025-07-04 | Paper |
Minimum-width double-slabs and widest empty slabs in high dimensions
Computational Geometry | 2025-07-04 | Paper |
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 |
Uniformly monotone partitioning of polygons
Theoretical Computer Science | 2024-08-27 | Paper |
A linear-time algorithm for the center problem in weighted cycle graphs
Information Processing Letters | 2024-06-07 | Paper |
| Minimum-width double-slabs and widest empty slabs in high dimensions | 2024-05-31 | Paper |
| Farthest-point Voronoi diagrams in the presence of rectangular obstacles | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7799597 (Why is no real title available?) | 2024-02-05 | Paper |
Efficient \(k\)-center algorithms for planar points in convex position
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Universal convex covering problems under translations and discrete rotations
advg | 2023-11-06 | Paper |
Farthest-point Voronoi diagrams in the presence of rectangular obstacles
Algorithmica | 2023-08-17 | Paper |
Special issue on algorithms and computation (ISAAC 2021)
Algorithmica | 2023-06-05 | Paper |
scientific article; zbMATH DE number 7650309 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Rectangular partitions of a rectilinear polygon
Computational Geometry | 2023-01-09 | Paper |
Intersecting disks using two congruent disks
Computational Geometry | 2023-01-09 | Paper |
Covering convex polygons by two congruent disks
Computational Geometry | 2022-11-16 | Paper |
Shortest rectilinear path queries to rectangles in a rectangular domain
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Rearranging a sequence of points onto a line
Computational Geometry | 2022-06-13 | Paper |
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Computational Geometry | 2022-04-08 | Paper |
Covering convex polygons by two congruent disks
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Intersecting disks using two congruent disks
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Shortest rectilinear path queries to rectangles in a rectangular domain
Computational Geometry | 2021-12-15 | Paper |
Maximizing dominance in the plane and its applications
Algorithmica | 2021-11-19 | Paper |
Efficient planar two-center algorithms
Computational Geometry | 2021-09-17 | Paper |
Largest triangles in a polygon
Computational Geometry | 2021-09-17 | Paper |
Maximum-area and maximum-perimeter rectangles in polygons
Computational Geometry | 2021-01-07 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Finding pairwise intersections of rectangles in a query rectangle
(available as arXiv preprint) | 2020-11-25 | Paper |
A new balanced subdivision of a simple polygon for time-space trade-off algorithms
(available as arXiv preprint) | 2020-11-25 | Paper |
Middle curves based on discrete Fréchet distance
Computational Geometry | 2020-10-23 | Paper |
| On Romeo and Juliet problems: minimizing distance-to-sight | 2020-08-25 | Paper |
Approximate range queries for clustering
(available as arXiv preprint) | 2020-08-18 | Paper |
Point location in dynamic planar subdivisions
(available as arXiv preprint) | 2020-08-18 | Paper |
Finding pairwise intersections of rectangles in a query rectangle
Computational Geometry | 2020-04-29 | Paper |
The geodesic farthest-point Voronoi diagram in a simple polygon
Algorithmica | 2020-04-01 | Paper |
Voronoi diagrams for a moderate-sized point-set in a simple polygon
Discrete & Computational Geometry | 2020-01-31 | Paper |
Maximizing dominance in the plane and its applications
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Assigning weights to minimize the covering radius in the plane
Computational Geometry | 2019-10-25 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
On Romeo and Juliet problems: minimizing distance-to-sight
Computational Geometry | 2019-10-25 | Paper |
Computing a geodesic two-center of points in a simple polygon
Computational Geometry | 2019-10-25 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
Computing the center region and its variants
Theoretical Computer Science | 2019-09-10 | Paper |
A new balanced subdivision of a simple polygon for time-space trade-off algorithms
Algorithmica | 2019-05-21 | 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 |
The geodesic 2-center problem in a simple polygon
Computational Geometry | 2018-10-31 | Paper |
Polygon queries for convex hulls of points
(available as arXiv preprint) | 2018-10-04 | Paper |
Voronoi diagrams for a moderate-sized point-set in a simple polygon
(available as arXiv preprint) | 2018-08-13 | Paper |
| Dynamic geodesic convex hulls in dynamic simple polygons | 2018-08-13 | Paper |
| Minimum-width square annulus intersecting polygons | 2018-06-15 | Paper |
Minimum-width annulus with outliers: circular, square, and rectangular cases
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
| A near-optimal algorithm for finding an optimal shortcut of a tree | 2018-04-19 | Paper |
Assigning weights to minimize the covering radius in the plane
(available as arXiv preprint) | 2018-04-19 | Paper |
Geometric matching algorithms for two realistic terrains
Theoretical Computer Science | 2018-02-09 | Paper |
| The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon | 2018-01-30 | Paper |
| A time-space trade-off for triangulations of points in the plane | 2017-10-23 | 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 |
| Constrained geodesic centers of a simple polygon | 2017-10-17 | Paper |
| scientific article; zbMATH DE number 6789192 (Why is no real title available?) | 2017-10-10 | Paper |
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Realistic roofs without local minimum edges over a rectilinear polygon
Theoretical Computer Science | 2017-05-12 | Paper |
Bundling two simple polygons to minimize their convex hull
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Computing the center region and its variants
Lecture Notes in Computer Science | 2017-05-05 | Paper |
Top-\(k\) Manhattan spatial skyline queries
Information Processing Letters | 2017-04-20 | Paper |
| Overlap of convex polytopes under rigid motion | 2017-01-26 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete & Computational Geometry | 2016-12-20 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete & Computational Geometry | 2016-12-20 | Paper |
A middle curve based on discrete Fréchet distance
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Computing a geodesic two-center of points in a simple polygon
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Bundling three convex polygons to minimize area or perimeter
Computational Geometry | 2016-01-18 | Paper |
An improved data stream algorithm for clustering
Computational Geometry | 2016-01-15 | Paper |
Geometric Matching Algorithms for Two Realistic Terrains
Algorithms and Computation | 2016-01-11 | Paper |
The 2-center problem in a simple polygon
Algorithms and Computation | 2016-01-11 | Paper |
Group nearest-neighbor queries in the \(L_1\) plane
Theoretical Computer Science | 2015-10-08 | Paper |
Computing \(k\) centers over streaming data for small \(k\)
International Journal of Computational Geometry & Applications | 2015-01-23 | Paper |
A generalization of the convex Kakeya problem
Algorithmica | 2015-01-19 | Paper |
An improved data stream algorithm for clustering
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Top-\(k\) Manhattan spatial skyline queries
Algorithms and Computation | 2014-02-18 | Paper |
Overlap of convex polytopes under rigid motion
Computational Geometry | 2014-01-08 | Paper |
Realistic roofs over a rectilinear polygon
Computational Geometry | 2013-09-03 | Paper |
Bundling three convex polygons to minimize area or perimeter
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Group nearest neighbor queries in the \(L _{1}\) plane
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Rectilinear covering for imprecise input points (extended abstract)
Algorithms and Computation | 2013-03-21 | Paper |
Computing \(k\)-center over streaming data for small \(k\)
Algorithms and Computation | 2013-03-21 | Paper |
Maximum overlap of convex polytopes under translation
Computational Geometry | 2013-03-12 | Paper |
Covering and piercing disks with two centers
Computational Geometry | 2013-01-25 | Paper |
Computing the discrete Fréchet distance with imprecise input
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
A generalization of the convex Kakeya problem
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry | 2012-06-08 | Paper |
Aligning two convex figures to minimize area or perimeter
Algorithmica | 2012-04-26 | Paper |
Empty pseudo-triangles in point sets
Discrete Applied Mathematics | 2012-03-19 | 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 |
MSSQ: Manhattan spatial skyline queries
Advances in Spatial and Temporal Databases | 2011-08-25 | Paper |
Covering a point set by two disjoint rectangles
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Covering points by disjoint boxes with outliers
Computational Geometry | 2011-01-21 | Paper |
Computing the discrete Fréchet distance with imprecise input
Algorithms and Computation | 2010-12-09 | Paper |
Maximum overlap of convex polytopes under translation
Algorithms and Computation | 2010-12-09 | Paper |
Adaptive algorithms for planar convex hull problems
Frontiers in Algorithmics | 2010-09-07 | Paper |
Covering a simple polygon by monotone directions
Computational Geometry | 2010-03-11 | Paper |
Computing minimum-area rectilinear convex hull and L-shape
Computational Geometry | 2009-08-14 | Paper |
Square and Rectangle Covering with Outliers
Frontiers in Algorithmics | 2009-07-14 | Paper |
Casting an object with a core
Algorithmica | 2009-06-16 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Aperture-angle and Hausdorff-approximation of convex figures
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
On the minimum total length of interval systems expressing all intervals, and range-restricted queries
Computational Geometry | 2009-02-12 | Paper |
Covering a Point Set by Two Disjoint Rectangles
Algorithms and Computation | 2009-01-29 | Paper |
Covering a Simple Polygon by Monotone Directions
Algorithms and Computation | 2009-01-29 | Paper |
Aperture-angle and Hausdorff-approximation of convex figures
Discrete & Computational Geometry | 2008-12-02 | Paper |
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
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 |
Maximizing the overlap of two planar convex sets under rigid motions
Computational Geometry | 2007-03-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Casting with skewed ejection direction
Algorithmica | 2006-08-16 | Paper |
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Computational Geometry | 2006-04-28 | Paper |
THE REFLEX-FREE HULL
International Journal of Computational Geometry & Applications | 2005-12-09 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Competitive facility location: the Voronoi game
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 1979506 (Why is no real title available?) | 2003-09-14 | Paper |
Casting a polyhedron with directional uncertainty
Computational Geometry | 2003-08-25 | Paper |
Building bridges between convex regions
Computational Geometry | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1798165 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1552835 (Why is no real title available?) | 2001-12-12 | Paper |
