Kevin Verbeek

CoRR, 2024

Competitive Searching over Terrains.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

A Monotone Interleaving Distance for Merge Trees.

[BibT_eX]

[DOI]

CoRR, 2023

Computing the Fréchet distance between uncertain curves in one dimension.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Density Approximation for Moving Groups.

[BibT_eX]

[DOI]

Max van Mulken

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Optimal morphs of planar orthogonal drawings.

[BibT_eX]

[DOI]

Arthur van Goethem

J. Comput. Geom., 2022

Density Approximation for Kinetic Groups.

[BibT_eX]

[DOI]

Max van Mulken

CoRR, 2022

Obstructing Classification via Projection.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2022

Agglomerative Clustering of Growing Squares.

[BibT_eX]

[DOI]

Algorithmica, 2022

Story Trees: Representing Documents using Topological Persistence.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

Physically consistent map matching.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection.

[BibT_eX]

[DOI]

Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022

2021

Topological stability of kinetic <i>k</i>-centers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Volume from Outlines on Terrains.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Coordinated Schematization for Visualizing Mobility Patterns on Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Route Reconstruction from Traffic Flow via Representative Trajectories.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

Polygon-Universal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Stable Visual Summaries for Trajectory Collections.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Pacific Visualization Symposium, 2021

2020

Quantitative Comparison of Time-Dependent Treemaps.

[BibT_eX]

[DOI]

Eduardo Faccin Vernier

Comput. Graph. Forum, 2020

Ordered Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Uncertainty Treemaps.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE Pacific Visualization Symposium, 2020

2019

SolarView: Low Distortion Radial Embedding with a Focus.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2019

Computing representative networks for braided rivers.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Non-crossing paths with geographic constraints.

[BibT_eX]

[DOI]

Rodrigo I. Silveira

Discret. Math. Theor. Comput. Sci., 2019

Spatially and Temporally Coherent Visual Summaries.

[BibT_eX]

[DOI]

CoRR, 2019

Stability analysis of kinetic orientation-based shape descriptors.

[BibT_eX]

[DOI]

Wouter Meulemans

Jules Wulms

CoRR, 2019

Topological Stability of Kinetic k-centers.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Understanding Movement in Context with Heterogeneous Data.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data, 2019

Optimal Morphs of Planar Orthogonal Drawings II.

[BibT_eX]

[DOI]

Arthur van Goethem

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

A Practical Algorithm for Spatial Agglomerative Clustering.

[BibT_eX]

[DOI]

Thom Castermans

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Stable Treemaps via Local Moves.

[BibT_eX]

[DOI]

Max Sondag

IEEE Trans. Vis. Comput. Graph., 2018

Homotopic 𝒞-oriented routing with few links and thick edges.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Table cartogram.

[BibT_eX]

[DOI]

Comput. Geom., 2018

A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Volume-based similarity of linear features on terrains.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Optimal Morphs of Planar Orthogonal Drawings.

[BibT_eX]

[DOI]

Arthur van Goethem

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Optimal Algorithms for Compact Linear Layouts.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium, 2018

2017

A Framework for Algorithm Stability.

[BibT_eX]

[DOI]

CoRR, 2017

Complexity Measures for Mosaic Drawings.

[BibT_eX]

[DOI]

Quirijn W. Bouts

Proceedings of the WALCOM: Algorithms and Computation, 2017

Non-Crossing Geometric Steiner Arborescences.

[BibT_eX]

[DOI]

Irina Kostitsyna

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Strict confluent drawing.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

On the Most Likely Voronoi Diagram and Nearest Neighbor Searching.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

Metric embedding, hyperbolic space, and social networks.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Bundled Crossings in Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Modeling Checkpoint-Based Movement with the Earth Mover's Distance.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 9th International Conference, 2016

Most Likely Voronoi Diagrams in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Algorithms for Necklace Maps.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Balanced partitions of 3-colored geometric sets in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Angle-Restricted Steiner Arborescences for Flow Map Layout.

[BibT_eX]

[DOI]

Kevin Buchin

Sylvester David Eriksson-Bique

Algorithmica, 2015

Geometric <i>k</i> Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

On the Most Likely Voronoi Diagramand Nearest Neighbor Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Combinatorial and Geometric Properties of Planar Laman Graphs.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Torsten Ueckerdt

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

On the Most Likely Convex Hull of Uncertain Points.

[BibT_eX]

[DOI]

Hakan Yildiz

Proceedings of the Algorithms - ESA 2013, 2013

Table Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Area-Universal and Constrained Rectangular Layouts.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Homotopic $\mathcal{C}$-Oriented Routing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Flow Map Layout via Spiral Trees.

[BibT_eX]

[DOI]

Kevin Buchin

IEEE Trans. Vis. Comput. Graph., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

On Planar Supports for Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

2010

Necklace Maps.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2010

Homotopic Rectilinear Routing with Few Links and Thick Edges.

[BibT_eX]

[DOI]