| Publication | Date of Publication | Type |
|---|
| Capturing the shape of a point set with a line segment | 2026-05-12 | Paper |
| Polygon-universal graphs | 2026-04-27 | Paper |
Relating interleaving and Fréchet distances via ordered merge trees
Journal of Computational Geometry | 2026-03-17 | Paper |
| Polycubes via dual loops | 2026-03-12 | Paper |
| Optimal in-place compaction of sliding cubes | 2025-12-02 | Paper |
| Optimizing symbol visibility through displacement | 2025-12-02 | Paper |
| Optimal in-place compaction of sliding cubes (media exposition) | 2025-11-24 | Paper |
Faster Fréchet distance approximation through truncated smoothing
Journal of Computational Geometry | 2025-11-10 | Paper |
Optimizing symbol visibility through displacement
Applied Mathematics and Computation | 2025-10-02 | Paper |
Polygon-universal graphs
Journal of Computational Geometry | 2025-08-28 | Paper |
Density approximation for moving groups
Journal of Computational Geometry | 2025-04-23 | Paper |
Sorting under partial (interval order) information
Journal of Computational Geometry | 2024-11-22 | Paper |
| Preprocessing imprecise points for the Pareto front | 2024-07-19 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
| A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance | 2024-05-14 | Paper |
Density approximation for moving groups
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| Hiding sliding cubes: why reconfiguring modular robots is not easy (media exposition) | 2023-11-02 | Paper |
| Obstructing Classification via Projection | 2023-08-08 | Paper |
| scientific article; zbMATH DE number 7692360 (Why is no real title available?) | 2023-06-05 | Paper |
scientific article; zbMATH DE number 7662163 (Why is no real title available?)
(available as arXiv preprint) | 2023-03-10 | Paper |
Preprocessing Ambiguous Imprecise Points
(available as arXiv preprint) | 2022-07-18 | Paper |
Crossing Numbers of Beyond-Planar Graphs Revisited
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
| Diverse partitions of colored points | 2022-03-25 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
Agglomerative clustering of growing squares
Algorithmica | 2022-02-01 | Paper |
| Non-crossing geometric Steiner arborescences | 2020-11-25 | Paper |
Optimal morphs of planar orthogonal drawings. II
(available as arXiv preprint) | 2020-10-26 | Paper |
| Computing optimal homotopies over a spiked plane with polygonal boundary | 2020-05-27 | Paper |
| A framework for algorithm stability and its application to kinetic Euclidean MSTs | 2020-02-12 | Paper |
Agglomerative clustering of growing squares
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
| Computing representative networks for braided rivers | 2020-01-13 | 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 |
Non-crossing paths with geographic constraints
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2019-08-01 | Paper |
Non-crossing paths with geographic constraints
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Locally correct Fréchet matchings
Computational Geometry | 2018-11-16 | Paper |
Computing the similarity between moving curves
Computational Geometry | 2018-10-31 | Paper |
| scientific article; zbMATH DE number 6917067 (Why is no real title available?) | 2018-08-13 | 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 |
| scientific article; zbMATH DE number 6876121 (Why is no real title available?) | 2018-05-29 | Paper |
Computing the Fréchet distance with shortcuts is NP-hard
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
Computational Geometry | 2018-02-12 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
Grouping time-varying data for interactive exploration
(available as arXiv preprint) | 2018-01-30 | Paper |
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Trajectory grouping structure under geodesic distance | 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 |
Kinetic collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
Complexity measures for mosaic drawings
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
| Trajectory grouping structure | 2017-03-30 | Paper |
Strict Confluent Drawing
(available as arXiv preprint) | 2017-03-30 | Paper |
| Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | 2017-03-09 | Paper |
Towards characterizing graphs with a sliceable rectangular dual
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Distance-sensitive planar point location
Computational Geometry | 2016-05-17 | Paper |
Computing the similarity between moving curves
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Improved Grid Map Layout by Point Set Matching
International Journal of Computational Geometry & Applications | 2015-11-03 | Paper |
Algorithms for Necklace Maps
International Journal of Computational Geometry & Applications | 2015-10-09 | Paper |
Angle-restricted Steiner arborescences for flow map layout
Algorithmica | 2015-07-10 | Paper |
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Column planarity and partial simultaneous geometric embedding
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
On the number of regular edge labelings
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
Treemaps with bounded aspect ratio
Computational Geometry | 2014-05-19 | Paper |
Kinetic convex hulls and Delaunay triangulations in the black-box model
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Flip graphs of bounded degree triangulations
Graphs and Combinatorics | 2014-02-14 | Paper |
Triangulating and guarding realistic polygons
Computational Geometry | 2014-01-22 | Paper |
Colored spanning graphs for set visualization
Graph Drawing | 2013-12-20 | Paper |
Strict confluent drawing
Graph Drawing | 2013-12-20 | Paper |
On planar supports for hypergraphs
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Distance-Sensitive Planar Point Location
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Trajectory grouping structure
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Shooting permanent rays among disjoint polygons in the plane
SIAM Journal on Computing | 2012-11-29 | Paper |
Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Locally correct Fréchet matchings
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Area-universal and constrained rectangular layouts
SIAM Journal on Computing | 2012-09-12 | Paper |
Empty pseudo-triangles in point sets
Discrete Applied Mathematics | 2012-03-19 | Paper |
Treemaps with bounded aspect ratio
Algorithms and Computation | 2011-12-16 | Paper |
Angle-Restricted Steiner Arborescences for Flow Map Layout
Algorithms and Computation | 2011-12-16 | Paper |
Angle-Restricted Steiner Arborescences for Flow Map Layout
Algorithms and Computation | 2011-12-16 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Optimizing regular edge labelings
Graph Drawing | 2011-02-11 | Paper |
Algorithmic aspects of proportional symbol maps
Algorithmica | 2010-09-27 | Paper |
Kinetic kd-trees and longest-side kd-trees
SIAM Journal on Computing | 2010-09-06 | Paper |
Optimal BSPs and rectilinear cartograms
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
On planar supports for hypergraphs
Graph Drawing | 2010-04-27 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Graph Drawing | 2010-04-27 | Paper |
Homotopic Rectilinear Routing with Few Links and Thick Edges
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Matched drawings of planar graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | 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 |
On minimum weight pseudo-triangulations
Computational Geometry | 2009-07-27 | Paper |
Edges and switches, tunnels and bridges
Computational Geometry | 2009-06-30 | Paper |
Kinetic collision detection for convex fat objects
Algorithmica | 2009-05-06 | Paper |
On rectilinear duals for vertex-weighted plane graphs
Discrete Mathematics | 2009-04-09 | Paper |
Subdivision Drawings of Hypergraphs
Graph Drawing | 2009-03-03 | Paper |
Edges and Switches, Tunnels and Bridges
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Kinetic KD-trees and longest-side KD-trees
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Efficient algorithms for maximum regression depth
Discrete & Computational Geometry | 2008-08-19 | Paper |
Matched Drawings of Planar Graphs
Graph Drawing | 2008-03-25 | Paper |
Kinetic Collision Detection for Convex Fat Objects
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Algorithmic Aspects of Proportional Symbol Maps
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
On the number of pseudo-triangulations of certain point sets
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
Graphs and Combinatorics | 2007-12-10 | Paper |
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
Lecture Notes in Computer Science | 2007-09-05 | Paper |
On rectangular cartograms
Computational Geometry | 2007-06-04 | Paper |
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
Discrete & Computational Geometry | 2005-04-15 | Paper |
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Convexity minimizes pseudo-triangulations
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079328 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 1979490 (Why is no real title available?) | 2003-09-14 | Paper |
Tight degree bounds for pseudo-triangulations of points
Computational Geometry | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1786516 (Why is no real title available?) | 2002-08-21 | Paper |
