| Publication | Date of Publication | Type |
|---|
Competitive searching over terrains
| 2024-05-31 | Paper |
Density approximation for moving groups
Lecture Notes in Computer Science | 2024-01-16 | 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?)
| 2023-03-10 | Paper |
Agglomerative clustering of growing squares
Algorithmica | 2022-02-01 | Paper |
Topological stability of kinetic \(k\)-centers
Theoretical Computer Science | 2021-04-14 | Paper |
Non-crossing geometric Steiner arborescences
| 2020-11-25 | Paper |
Optimal morphs of planar orthogonal drawings. II
| 2020-10-26 | Paper |
Optimal morphs of planar orthogonal drawings
| 2020-08-18 | 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 |
Topological stability of kinetic \(k\)-centers
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
A practical algorithm for spatial agglomerative clustering
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Non-crossing paths with geographic constraints
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2019-08-01 | Paper |
Combinatorial and geometric properties of planar Laman graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Non-crossing paths with geographic constraints
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
Computational Geometry | 2018-10-31 | Paper |
scientific article; zbMATH DE number 6917067 (Why is no real title available?)
| 2018-08-13 | Paper |
Metric embedding, hyperbolic space, and social networks
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Most likely Voronoi diagrams in higher dimensions
| 2018-04-19 | Paper |
Mapping polygons to the grid with small Hausdorff and Fréchet distance
| 2018-03-02 | Paper |
Table cartogram
Computational Geometry | 2018-02-19 | Paper |
Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
Computational Geometry | 2018-02-12 | Paper |
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
| 2017-10-10 | Paper |
Geometric k Shortest Paths
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Complexity measures for mosaic drawings
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Strict Confluent Drawing
| 2017-03-30 | Paper |
Metric embedding, hyperbolic space, and social networks
Computational Geometry | 2016-11-14 | Paper |
Bundled Crossings in Embedded Graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Algorithms for Necklace Maps
International Journal of Computational Geometry & Applications | 2015-10-09 | Paper |
On the most likely Voronoi diagram and nearest neighbor searching
Algorithms and Computation | 2015-09-11 | Paper |
Angle-restricted Steiner arborescences for flow map layout
Algorithmica | 2015-07-10 | Paper |
Balanced partitions of 3-colored geometric sets in the plane
Discrete Applied Mathematics | 2014-12-05 | 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 |
Table cartograms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
On the Most Likely Convex Hull of Uncertain Points
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Homotopic \(\mathcal{C}\)-oriented routing
Graph Drawing | 2013-04-03 | Paper |
Area-universal and constrained rectangular layouts
SIAM Journal on Computing | 2012-09-12 | 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 |
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 |
