| Publication | Date of Publication | Type |
|---|
| Vantage point selection algorithms for bottleneck capacity estimation | 2026-08-11 | Paper |
| Link diameter, radius and 2-point link distance queries in polygonal domains | 2026-08-11 | Paper |
| Sweeping a domain with line-of-sight between covisible agents | 2026-08-11 | Paper |
| Polynomial-time algorithms for contiguous art gallery and related problems | 2026-08-11 | Paper |
Fair subgraph selection for contagion containment
Procedia Computer Science | 2025-12-11 | Paper |
| Optimizing visibility-based search in polygonal domains | 2025-12-02 | Paper |
| On two simple[st] learning tasks | 2025-11-11 | Paper |
Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique
Theoretical Computer Science | 2025-11-01 | Paper |
| Constant-factor approximation algorithms for convex cover and hidden set in a simple polygon | 2025-08-15 | Paper |
On flipping the Fréchet distance
Algorithmica | 2024-12-03 | Paper |
| On flipping the Fréchet distance | 2024-09-25 | Paper |
Geometric Secluded Paths and Planar Satisfiability
(available as arXiv preprint) | 2023-11-02 | Paper |
| scientific article; zbMATH DE number 7650284 (Why is no real title available?) | 2023-02-03 | Paper |
| Gender-aware facility location in multi-gender world | 2020-08-11 | Paper |
Most vital segment barriers
(available as arXiv preprint) | 2020-01-16 | Paper |
Altitude terrain guarding and guarding uni-monotone polygons
Computational Geometry | 2019-10-25 | Paper |
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
Algorithmica | 2019-01-11 | Paper |
Improved approximation algorithms for relay placement
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Optimal geometric flows via dual programs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| On the complexity of minimum-link path problems | 2018-01-30 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2018-01-24 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
Geometric <i>k</i> Shortest Paths
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Recognizing a DOG is hard, but not when it is thin and unit | 2017-07-17 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
Discrete & Computational Geometry | 2017-05-11 | Paper |
scientific article; zbMATH DE number 6707504 (Why is no real title available?)
(available as arXiv preprint) | 2017-04-24 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
On minimizing crossings in storyline visualizations
Lecture Notes in Computer Science | 2017-02-10 | Paper |
The minimum backlog problem
Theoretical Computer Science | 2015-10-30 | Paper |
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
Lecture Notes in Computer Science | 2015-10-27 | Paper |
On polygonal paths with bounded discrete-curvature: the inflection-free case
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Order-k -hulls and -shapes
Information Processing Letters | 2015-06-25 | Paper |
Optimizing airspace closure with respect to politicians' egos
Theoretical Computer Science | 2015-05-26 | Paper |
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Theory of Computing Systems | 2015-01-21 | Paper |
Minimum-link paths revisited
Computational Geometry | 2014-05-19 | Paper |
Shape approximation using k-order alpha-hulls
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Convex transversals
Computational Geometry | 2014-01-22 | Paper |
Simple wriggling is hard unless you are a fat hippo
Theory of Computing Systems | 2012-12-06 | Paper |
Routing multi-class traffic flows in the plane
Computational Geometry | 2012-06-13 | Paper |
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
Convex transversals
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Faster algorithms for minimum-link paths with restricted orientations
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The snowblower problem
Computational Geometry | 2011-08-02 | Paper |
Almost stable matchings by truncating the Gale-Shapley algorithm
Algorithmica | 2010-10-07 | Paper |
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters | 2010-08-16 | Paper |
Geometric stable roommates
Information Processing Letters | 2010-06-16 | Paper |
The snowblower problem
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Minimum-perimeter enclosures
Information Processing Letters | 2010-04-19 | Paper |
A Local 2-Approximation Algorithm for the Vertex Cover Problem
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Maximum thick paths in static and dynamic environments
Computational Geometry | 2009-11-16 | Paper |
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry | 2009-07-27 | Paper |
Thick non-crossing paths and minimum-cost flows in polygonal domains
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Routing a maximum number of disks through a scene of moving obstacles
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Improved approximation algorithms for relay placement
Lecture Notes in Computer Science | 2008-11-25 | Paper |
Two New Classes of Hamiltonian Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
THE TSP AND THE SUM OF ITS MARGINAL VALUES
International Journal of Computational Geometry & Applications | 2006-09-04 | Paper |
