| Publication | Date of Publication | Type |
|---|
| Constrained two-line center problems | 2026-06-08 | Paper |
On k-enclosing slab problems
Theoretical Computer Science | 2025-12-02 | 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 |
An optimal algorithm for the minimum-width cubic shell problem
Operations Research Letters | 2024-06-17 | Paper |
Maximum-width rainbow-bisecting empty annulus
Computational Geometry | 2024-06-06 | Paper |
| Minimum-width double-slabs and widest empty slabs in high dimensions | 2024-05-31 | Paper |
| Empty squares in arbitrary orientation among points | 2023-11-02 | Paper |
Empty squares in arbitrary orientation among points
Algorithmica | 2023-04-21 | Paper |
| scientific article; zbMATH DE number 7650258 (Why is no real title available?) | 2023-02-03 | Paper |
Rearranging a sequence of points onto a line
Computational Geometry | 2022-06-13 | Paper |
Faster counting empty convex polygons in a planar point set
Information Processing Letters | 2021-12-14 | Paper |
Maximum-width empty square and rectangular annulus
Computational Geometry | 2021-09-16 | Paper |
The reverse Kakeya problem
advg | 2021-04-20 | Paper |
On the minimum-area rectangular and square annulus problem
Computational Geometry | 2021-01-07 | Paper |
| Shortcuts for the circle | 2020-11-25 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
| The reverse Kakeya problem | 2020-08-18 | Paper |
Minimum-width double-strip and parallelogram annulus
Theoretical Computer Science | 2020-08-03 | Paper |
Minimum-width double-strip and parallelogram annulus
Theoretical Computer Science | 2020-08-03 | Paper |
Computing a minimum-width cubic and hypercubic shell
Operations Research Letters | 2020-02-10 | Paper |
\(L_1\) geodesic farthest neighbors in a simple polygon and related problems
Discrete & Computational Geometry | 2019-11-07 | Paper |
Closest-pair queries in fat rectangles
Computational Geometry | 2019-10-25 | Paper |
Area bounds of rectilinear polygons realized by angle sequences
Computational Geometry | 2019-10-25 | Paper |
Computing a geodesic two-center of points in a simple polygon
Computational Geometry | 2019-10-25 | Paper |
Tight bounds for beacon-based coverage in simple rectilinear polygons
Computational Geometry | 2019-10-18 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
Maximum-width empty square and rectangular annulus
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
\(L_{1}\) shortest path queries in simple polygons
Theoretical Computer Science | 2019-09-10 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Minimum-width annulus with outliers: circular, square, and rectangular cases
Information Processing Letters | 2019-03-11 | Paper |
Gap-Planar Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Computing the geodesic centers of a polygonal domain
Computational Geometry | 2018-11-19 | Paper |
The minimum convex container of two convex polytopes under translations
Computational Geometry | 2018-11-19 | Paper |
Computing a minimum-width square or rectangular annulus with outliers
Computational Geometry | 2018-11-16 | Paper |
Gap-planar graphs
Theoretical Computer Science | 2018-09-24 | Paper |
Minimum-width annulus with outliers: circular, square, and rectangular cases
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
| \(L_1\) geodesic farthest neighbors in a simple polygon and related problems | 2018-04-19 | Paper |
Covering points with convex sets of minimum size
Theoretical Computer Science | 2018-03-16 | Paper |
Computing a minimum-width square annulus in arbitrary orientation
Theoretical Computer Science | 2018-03-16 | Paper |
On finding a longest common palindromic subsequence
Theoretical Computer Science | 2018-02-16 | Paper |
| Approximating convex shapes with respect to symmetric difference under homotheties | 2018-01-30 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2018-01-24 | Paper |
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Efficient flattening algorithm for hierarchical and dynamic structure discrete event models
ACM Transactions on Modeling and Computer Simulation | 2017-06-30 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
Discrete & Computational Geometry | 2017-05-11 | Paper |
Computing a Minimum-Width Square or Rectangular Annulus with Outliers
Lecture Notes in Computer Science | 2016-09-02 | Paper |
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
Computational Geometry | 2016-05-17 | Paper |
Computing a Minimum-Width Square Annulus in Arbitrary Orientation
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 |
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 |
Group nearest-neighbor queries in the \(L_1\) plane
Theoretical Computer Science | 2015-10-08 | Paper |
Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
Computational Geometry | 2015-06-17 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
A generalization of the convex Kakeya problem
Algorithmica | 2015-01-19 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
Computational Geometry | 2014-06-27 | Paper |
Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
The geodesic diameter of polygonal domains
Discrete & Computational Geometry | 2013-09-23 | 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 |
Area Bounds of Rectilinear Polygons Realized by Angle Sequences
Algorithms and Computation | 2013-03-21 | Paper |
Rectilinear covering for imprecise input points (extended abstract)
Algorithms and Computation | 2013-03-21 | 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 |
A generalization of the convex Kakeya problem
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Tight bound for farthest-color Voronoi diagrams of line segments
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Farthest Voronoi diagrams under travel time metrics (extended abstract)
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry | 2012-05-18 | Paper |
On exact solutions to the Euclidean bottleneck Steiner tree problem
Information Processing Letters | 2012-03-19 | 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 |
Exact algorithms for the bottleneck Steiner tree problem
Algorithmica | 2011-12-14 | 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 |
The onion diagram: a Voronoi-like tessellation of a planar line space and its applications (extended abstract)
Algorithms and Computation | 2010-12-09 | Paper |
The geodesic diameter of polygonal domains
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Geometric stable roommates
Information Processing Letters | 2010-06-16 | Paper |
Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
Algorithms and Computation | 2009-12-17 | Paper |
Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
Algorithms and Computation | 2009-12-17 | 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 |
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
International Journal of Computational Geometry & Applications | 2009-06-30 | 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 |
All Farthest Neighbors in the Presence of Highways and Obstacles
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
WALCOM: Algorithms and Computation | 2009-02-24 | 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 |
Covering a Point Set by Two Disjoint Rectangles
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 |
Optimal Construction of the City Voronoi Diagram
Algorithms and Computation | 2008-04-24 | 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 |
VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
