| Publication | Date of Publication | Type |
|---|
| Approximating the Fréchet distance when only one curve is c-packed | 2026-06-08 | Paper |
| Bicriteria approximation for minimum dilation graph augmentation | 2026-05-26 | Paper |
The mutual visibility problem for fat robots with lights
CGT. Computing in Geometry and Topology | 2026-03-09 | Paper |
Oriented spanners
Algorithmica | 2025-12-30 | Paper |
| Dynamic L-budget clustering of curves | 2025-12-02 | Paper |
| Approximating multiplicatively weighted Voronoi diagrams: efficient construction with linear size | 2025-11-24 | Paper |
| Map-matching queries under Fréchet distance on low-density spanners | 2025-11-24 | Paper |
Shortest paths of mutually visible robots
International Journal of Computational Geometry & Applications | 2025-11-12 | Paper |
| Shortest beer path queries in digraphs with bounded treewidth | 2025-07-24 | Paper |
| Computing a subtrajectory cluster from c-packed trajectories | 2025-07-24 | Paper |
Pattern formation for fat robots with memory
Computational Geometry | 2025-07-04 | Paper |
Pattern formation for fat robots with lights
Computational Geometry | 2025-03-10 | Paper |
Map matching queries on realistic input graphs under the Fréchet distance
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Oriented spanners | 2025-01-06 | Paper |
| Approximating the -low-density value | 2024-08-22 | Paper |
| Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance | 2024-07-19 | Paper |
| A tail estimate with exponential decay for the randomized incremental construction of search structures | 2024-07-19 | Paper |
| Close approximations of minimum rectangular coverings (extended abstract) | 2024-07-05 | Paper |
| Map matching queries on realistic input graphs under the Fréchet distance | 2024-05-14 | Paper |
The mutual visibility problem for fat robots
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Approximating the discrete center line segment in linear time
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| Improving the dilation of a metric graph by adding edges | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788618 (Why is no real title available?) | 2024-01-15 | Paper |
Approximating the Packedness of Polygonal Curves
(available as arXiv preprint) | 2023-11-14 | Paper |
| On β-Plurality Points in Spatial Voting Games. | 2023-11-02 | Paper |
Improving the Dilation of a Metric Graph by Adding Edges
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Algorithms for radius-optimally augmenting trees in a metric space
Computational Geometry | 2023-07-31 | Paper |
Augmenting graphs to minimize the radius
Computational Geometry | 2023-07-12 | Paper |
Covering a set of line segments with a few squares
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Local Routing in Sparse and Lightweight Geometric Graphs
(available as arXiv preprint) | 2023-02-03 | Paper |
Barrier Coverage with Uniform Radii in 2D
Algorithms for Sensor Systems | 2022-12-09 | Paper |
A linear-time heuristic for minimum rectangular coverings (Extended abstract)
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Local routing in a tree metric 1-spanner
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Approximating the packedness of polygonal curves
Computational Geometry | 2022-10-06 | Paper |
Covering a set of line segments with a few squares
Theoretical Computer Science | 2022-06-13 | Paper |
Local routing in sparse and lightweight geometric graphs
Algorithmica | 2022-05-03 | Paper |
| Algorithms for radius-optimally augmenting trees in a metric space | 2022-03-25 | Paper |
On β-Plurality Points in Spatial Voting Games
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Translation invariant Fréchet distance queries
Algorithmica | 2021-11-19 | Paper |
Bounded-degree light approximate shortest-path trees in doubling metrics
Discrete Applied Mathematics | 2021-10-21 | Paper |
Local routing in a tree metric 1-spanner
(available as arXiv preprint) | 2021-04-21 | Paper |
| Shortcuts for the circle | 2020-11-25 | Paper |
Barrier coverage with non-uniform lengths to minimize aggregate movements
(available as arXiv preprint) | 2020-11-25 | Paper |
scientific article; zbMATH DE number 7278047 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
| When is red-blue nonblocker fixed-parameter tractable? | 2020-02-12 | Paper |
Approximating \((k,\ell)\)-center clustering for curves
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fast Fréchet distance between curves with long edges
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
Fast algorithms for diameter-optimally augmenting paths and trees
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Turbocharging treewidth heuristics
Algorithmica | 2019-02-14 | Paper |
Finding pairwise intersections inside a query range
Algorithmica | 2019-01-11 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Faster algorithms for computing plurality points
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Compact flow diagrams for state sequences
ACM Journal of Experimental Algorithmics | 2018-08-06 | Paper |
| Turbocharging treewidth heuristics | 2018-04-10 | Paper |
| Faster algorithms for computing plurality points | 2018-01-30 | Paper |
Finding the best shortcut in a geometric network
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Box-trees and R-trees with near-optimal query time
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
SEFE without mapping via large induced outerplane graphs in plane graphs
Journal of Graph Theory | 2016-06-10 | Paper |
Increasing-chord graphs on point sets
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Finding pairwise intersections inside a query range
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Fast algorithms for diameter-optimally augmenting paths
Automata, Languages, and Programming | 2015-10-27 | Paper |
Augmenting graphs to minimize the diameter
Algorithmica | 2015-09-02 | Paper |
Fast algorithms for approximate Fréchet matching queries in geometric trees
Computational Geometry | 2015-06-17 | Paper |
A generalization of the convex Kakeya problem
Algorithmica | 2015-01-19 | Paper |
Increasing-chord graphs on point sets
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Region-fault tolerant geometric spanners | 2014-12-18 | Paper |
A fast algorithm for data collection along a fixed track
Theoretical Computer Science | 2014-10-06 | Paper |
On the number of upward planar orientations of maximal planar graphs
Theoretical Computer Science | 2014-07-07 | Paper |
Quickest path queries on transportation network
Computational Geometry | 2014-06-27 | Paper |
Notes on large angle crossing graphs
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Planar visibility, testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Experimental study of geometric \(t\)-spanners
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
SEFE with no mapping via large induced outerplane graphs in plane graphs
Algorithms and Computation | 2014-01-14 | Paper |
Augmenting graphs to minimize the diameter
Lecture Notes in Computer Science | 2014-01-14 | Paper |
Fast query structures in anisotropic media
Theoretical Computer Science | 2014-01-10 | Paper |
Fréchet queries in geometric trees
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A fast algorithm for data collection along a fixed track
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Fast Fréchet queries
Computational Geometry | 2013-04-29 | Paper |
On the number of upward planar orientations of maximal planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
Approximate one-to-one point pattern matching
Journal of Discrete Algorithms | 2012-09-13 | Paper |
A generalization of the convex Kakeya problem
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Fast Fréchet queries
Algorithms and Computation | 2011-12-16 | Paper |
Detecting commuting patterns by clustering subtrajectories
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Geometric spanners for weighted point sets
Algorithmica | 2011-08-16 | Paper |
Quickest paths in anisotropic media
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Algorithms for marketing-mix optimization
Algorithmica | 2011-07-01 | Paper |
Farthest-polygon Voronoi diagrams
Computational Geometry | 2011-03-25 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
Journal of Discrete Algorithms | 2010-08-18 | Paper |
Detecting areas visited regularly
Lecture Notes in Computer Science | 2010-07-20 | Paper |
On the expected maximum degree of Gabriel and Yao graphs
Advances in Applied Probability | 2010-05-11 | Paper |
Chips on wafers (extended abstract)
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Constructing sparse t-spanners with small separators.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
FINDING POPULAR PLACES
International Journal of Computational Geometry & Applications | 2010-03-19 | Paper |
A simple and efficient kinetic spanner
Computational Geometry | 2009-11-16 | Paper |
Geometric Spanners for Weighted Point Sets
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Compressing spatio-temporal trajectories
Computational Geometry | 2009-08-14 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
International Journal of Computational Geometry & Applications | 2009-07-20 | Paper |
RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
International Journal of Computational Geometry & Applications | 2009-07-20 | Paper |
Region-fault tolerant geometric spanners
Discrete & Computational Geometry | 2009-05-06 | Paper |
ON SPANNERS OF GEOMETRIC GRAPHS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Improving the Stretch Factor of a Geometric Network by Edge Augmentation
SIAM Journal on Computing | 2009-03-16 | Paper |
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | 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 |
Region-restricted clustering for geographic data mining
Computational Geometry | 2009-02-12 | Paper |
Detecting Commuting Patterns by Clustering Subtrajectories
Algorithms and Computation | 2009-01-29 | Paper |
Aperture-angle and Hausdorff-approximation of convex figures
Discrete & Computational Geometry | 2008-12-02 | Paper |
Farthest-Polygon Voronoi Diagrams
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Reporting flock patterns
Computational Geometry | 2008-09-19 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
Constructing minimum-interference networks
Computational Geometry | 2008-06-18 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
Compressing Spatio-temporal Trajectories
Algorithms and Computation | 2008-05-27 | Paper |
Finding Popular Places
Algorithms and Computation | 2008-05-27 | Paper |
I/O-Efficiently Pruning Dense Spanners
Discrete and Computational Geometry | 2008-03-18 | Paper |
Reporting Flock Patterns
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Region-Restricted Clustering for Geographic Data Mining
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Experimental Algorithms | 2008-01-02 | Paper |
Minimum weight pseudo-triangulations
Computational Geometry | 2007-10-12 | Paper |
Restricted Mesh Simplification Using Edge Contractions
Lecture Notes in Computer Science | 2007-09-10 | Paper |
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
Lecture Notes in Computer Science | 2007-09-10 | Paper |
On Spanners of Geometric Graphs
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Path Simplification for Metro Map Layout
Graph Drawing | 2007-08-28 | Paper |
Schematisation of Tree Drawings
Graph Drawing | 2007-08-28 | Paper |
Approximate distance oracles for graphs with dense clusters
Computational Geometry | 2007-06-04 | Paper |
Distance-preserving approximations of polygonal paths
Computational Geometry | 2007-02-19 | Paper |
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms | 2007-02-14 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Constructing plane spanners of bounded degree and low weight
Algorithmica | 2006-03-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Constrained higher order Delaunay triangulations
Computational Geometry | 2005-05-12 | Paper |
Chips on wafers, or packing rectangles into grids
Computational Geometry | 2005-01-31 | Paper |
| scientific article; zbMATH DE number 2119744 (Why is no real title available?) | 2004-11-29 | Paper |
BALANCED PARTITION OF MINIMUM SPANNING TREES
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Balanced Partition of Minimum Spanning Trees
Lecture Notes in Computer Science | 2004-08-12 | Paper |
Ordered theta graphs
Computational Geometry | 2004-08-06 | Paper |
Facility location and the geometric minimum-diameter spanning tree.
Computational Geometry | 2004-01-23 | Paper |
| scientific article; zbMATH DE number 1979513 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1947396 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947392 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947054 (Why is no real title available?) | 2003-07-07 | Paper |
On R-trees with low query complexity
Computational Geometry | 2003-04-28 | Paper |
Box-trees and R-trees with near-optimal query time
Discrete & Computational Geometry | 2002-12-01 | Paper |
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing | 2002-09-29 | Paper |
Higher order Delaunay triangulations
Computational Geometry | 2002-09-03 | Paper |
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1670662 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1670656 (Why is no real title available?) | 2001-11-11 | Paper |
Approximating a minimum Manhattan network
Nordic Journal of Computing | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1617269 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1496856 (Why is no real title available?) | 2001-03-25 | Paper |
Close approximations of minimum rectangular coverings
Journal of Combinatorial Optimization | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1436138 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1302028 (Why is no real title available?) | 2000-01-18 | Paper |
