| Publication | Date of Publication | Type |
|---|
Oriented spanners
| 2025-01-06 | Paper |
Segment visibility counting queries in polygons
| 2024-09-11 | Paper |
On cyclic solutions to the min-max latency multi-robot patrolling problem
| 2024-05-14 | Paper |
Unlabeled multi-robot motion planning with tighter separation bounds
| 2024-05-14 | Paper |
Computing continuous dynamic time warping of time series in polynomial time
| 2024-05-14 | Paper |
Minimum Scan Cover and Variants: Theory and Experiments
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
On length-sensitive Fréchet similarity
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology | 2023-12-16 | Paper |
Dots & Polygons (Media Exposition)
| 2023-11-02 | Paper |
On the Hardness of Computing an Average Curve.
| 2023-11-02 | Paper |
Geometric Secluded Paths and Planar Satisfiability
| 2023-11-02 | Paper |
Designing art galleries (Media Exposition)
| 2023-11-02 | Paper |
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Dots & Boxes Is PSPACE-Complete
| 2023-08-08 | Paper |
Minimum scan cover and variants -- theory and experiments
| 2023-06-23 | Paper |
Sometimes Reliable Spanners of Almost Linear Size.
| 2023-02-07 | Paper |
A spanner for the day after
| 2022-07-18 | Paper |
Sometimes reliable spanners of almost linear size
| 2022-05-18 | Paper |
Fine-grained Complexity Analysis of Two Classic TSP Variants
ACM Transactions on Algorithms | 2022-02-08 | Paper |
A spanner for the day after
Discrete & Computational Geometry | 2021-01-29 | Paper |
Placing your coins on a shelf
| 2020-11-25 | Paper |
Approximating the distribution of the median and other robust estimators on uncertain data
| 2020-08-18 | Paper |
Progressive simplification of polygonal curves
Computational Geometry | 2020-03-23 | Paper |
Minimum perimeter-sum partitions in the plane
Discrete & Computational Geometry | 2020-01-31 | Paper |
Approximating \((k,\ell)\)-center clustering for curves
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Region-based approximation algorithms for visibility between imprecise locations
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Four Soviets walk the dog -- with an application to Alt's conjecture
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
Algorithmica | 2019-05-21 | Paper |
scientific article; zbMATH DE number 7051233 (Why is no real title available?)
| 2019-05-06 | Paper |
The Number of Convex Polyominoes with Given Height and Width
| 2019-03-04 | Paper |
Placing your coins on a shelf
| 2019-02-27 | Paper |
Locally correct Fréchet matchings
Computational Geometry | 2018-11-16 | Paper |
Computing the similarity between moving curves
Computational Geometry | 2018-10-31 | Paper |
Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
| 2018-08-13 | Paper |
Range-clustering queries
| 2018-08-13 | Paper |
Minimum Perimeter-Sum Partitions in the Plane
| 2018-08-13 | Paper |
Ruler of the plane -- games of geometry
| 2018-08-13 | Paper |
Compact flow diagrams for state sequences
ACM Journal of Experimental Algorithmics | 2018-08-06 | Paper |
Model-based segmentation and classification of trajectories
Algorithmica | 2018-07-25 | Paper |
Computing the Fréchet distance between real-valued surfaces
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A framework for computing the greedy spanner
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Progressive geometric algorithms
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Fine-grained complexity analysis of two classic TSP variants
| 2017-12-19 | Paper |
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
Discrete & Computational Geometry | 2017-10-10 | Paper |
Distribution-sensitive construction of the greedy spanner
Algorithmica | 2017-05-11 | Paper |
Progressive geometric algorithms
| 2017-03-30 | Paper |
Adjacency-preserving spatial treemaps
| 2017-03-30 | Paper |
Computing the Fréchet distance with a retractable leash
Discrete & Computational Geometry | 2016-09-14 | Paper |
Computing the greedy spanner in linear space
Algorithmica | 2015-11-19 | Paper |
Computing the similarity between moving curves
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Angle-restricted Steiner arborescences for flow map layout
Algorithmica | 2015-07-10 | Paper |
Dynamic point labeling is strongly PSPACE-complete
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
On the number of regular edge labelings
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
Delaunay Triangulations in O(sort(n)) Time and More
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry | 2014-01-22 | Paper |
Dynamic Point Labeling is Strongly PSPACE-Complete
Algorithms and Computation | 2014-01-14 | Paper |
On planar supports for hypergraphs
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Computing the Fréchet distance with a retractable leash
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Vertex deletion for 3D Delaunay triangulations
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Computing the greedy spanner in linear space
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Trajectory grouping structure
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Median trajectories
Algorithmica | 2013-06-25 | Paper |
Vectors in a box
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Locally correct Fréchet matchings
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Drawing (complete) binary tanglegrams
Algorithmica | 2012-04-26 | Paper |
Shortest-Paths Preserving Metro Maps
Graph Drawing | 2012-03-09 | Paper |
Finding long and similar parts of trajectories
Computational Geometry | 2011-12-28 | Paper |
Angle-Restricted Steiner Arborescences for Flow Map Layout
Algorithms and Computation | 2011-12-16 | Paper |
Preprocessing imprecise points for Delaunay triangulation: simplified and extended
Algorithmica | 2011-11-07 | Paper |
Detecting commuting patterns by clustering subtrajectories
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Adjacency-preserving spatial treemaps
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Delaunay triangulations in O (sort( n )) time and more
Journal of the ACM | 2011-07-14 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Acyclic orientation of drawings
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Optimizing regular edge labelings
Graph Drawing | 2011-02-11 | Paper |
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Voronoi diagram of polygonal chains under the discrete Fréchet distance
International Journal of Computational Geometry & Applications | 2010-09-30 | Paper |
On the number of spanning trees a planar graph can have
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Fréchet distance of surfaces: some simple hard cases
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Median trajectories
Algorithms – ESA 2010 | 2010-09-06 | Paper |
On planar supports for hypergraphs
Graph Drawing | 2010-04-27 | Paper |
Constructing Delaunay Triangulations along Space-Filling Curves
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Delaunay Triangulation of Imprecise Points Simplified and Extended
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Connect the Dot: Computing Feed-Links with Minimum Dilation
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Polychromatic colorings of plane graphs
Discrete & Computational Geometry | 2009-08-27 | Paper |
Transforming spanning trees: A lower bound
Computational Geometry | 2009-06-30 | Paper |
scientific article; zbMATH DE number 5542483 (Why is no real title available?)
| 2009-04-14 | Paper |
On the Number of Cycles in Planar Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Drawing (Complete) Binary Tanglegrams
Graph Drawing | 2009-03-03 | Paper |
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Inflating the cube by shrinking
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5507813 (Why is no real title available?)
| 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506195 (Why is no real title available?)
| 2009-02-10 | Paper |
Detecting Commuting Patterns by Clustering Subtrajectories
Algorithms and Computation | 2009-01-29 | Paper |
Computing the Fréchet distance between simple polygons
Computational Geometry | 2008-07-29 | Paper |
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Recursive geometry of the flow complex and topology of the flow complex filtration
Computational Geometry | 2008-04-28 | Paper |
There are not too many magic configurations
Discrete & Computational Geometry | 2008-04-16 | Paper |
Acyclic Orientation of Drawings
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
