Kevin Buchin

Orcid: 0000-0002-3022-7877

Affiliations:
  • TU Dortmund, Germany
  • Eindhoven University of Technology, Netherlands


According to our database1, Kevin Buchin authored at least 145 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph Sampling for Map Comparison.
ACM Trans. Spatial Algorithms Syst., September, 2024

Dynamic L-Budget Clustering of Curves.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs.
Proceedings of the Structural Information and Communication Complexity, 2024

Bicriteria Approximation for Minimum Dilation Graph Augmentation.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Map-Matching Queries Under Fréchet Distance on Low-Density Spanners.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Guest Editors' Foreword.
Discret. Comput. Geom., September, 2023

Editorial.
Comput. Geom., August, 2023

Fréchet Distance for Uncertain Curves.
ACM Trans. Algorithms, July, 2023

Computing the Fréchet distance between uncertain curves in one dimension.
Comput. Geom., 2023

Morphing Planar Graph Drawings Through 3D.
Comput. Geom. Topol., 2023

On Length-Sensitive Fréchet Similarity.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Oriented Spanners.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Sometimes reliable spanners of almost linear size.
J. Comput. Geom., 2022

Minimum Scan Cover and Variants: Theory and Experiments.
ACM J. Exp. Algorithmics, 2022

Constructing L∞ Voronoi Diagrams in 2D and 3D.
Comput. Graph. Forum, 2022

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis.
Proceedings of the Structural Information and Communication Complexity, 2022

Segment Visibility Counting Queries in Polygons.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Tour4Me: a framework for customized tour planning algorithms.
Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Fine-grained Complexity Analysis of Two Classic TSP Variants.
ACM Trans. Algorithms, 2021

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.
Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

Uncertain Curve Simplification.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Dots & Boxes Is PSPACE-Complete.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Autonomous Mobile Robots: Refining the Computational Landscape.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

Near-Delaunay Metrics.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
A Spanner for the Day After.
Discret. Comput. Geom., 2020

Minimum Perimeter-Sum Partitions in the Plane.
Discret. Comput. Geom., 2020

Dots & Polygons.
CoRR, 2020

Progressive simplification of polygonal curves.
Comput. Geom., 2020

On the Hardness of Computing an Average Curve.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Ordered Strip Packing.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping.
Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

Geometric Secluded Paths and Planar Satisfiability.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Dots & Polygons (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Designing Art Galleries (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Restricted-Weight Minimum-Dilation Spanners on Three Points.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Visual exploration of migration patterns in gull data.
Inf. Vis., 2019

Locally correct Fréchet matchings.
Comput. Geom., 2019

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).
Algorithmica, 2019

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

Approximating (k, ℓ)-center clustering for curves.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Sampling-based Strategy for Distributing Taxis in a Road Network for Occupancy Maximization (GIS Cup).
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

klcluster: Center-based Clustering of Trajectories.
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Hardness results on Voronoi, Laguerre and Apollonius diagrams.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Placing your coins on a shelf.
J. Comput. Geom., 2018

Approximating (k, 𝓁)-center clustering for curves.
CoRR, 2018

𝓞(k)-robust spanners in one dimension.
CoRR, 2018

Computing the similarity between moving curves.
Comput. Geom., 2018

Model-Based Segmentation and Classification of Trajectories.
Algorithmica, 2018

Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Compact Flow Diagrams for State Sequences.
ACM J. Exp. Algorithmics, 2017

Visual analytics of delays and interaction in movement data.
Int. J. Geogr. Inf. Sci., 2017

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance.
Discret. Comput. Geom., 2017

Distribution-Sensitive Construction of the Greedy Spanner.
Algorithmica, 2017

Computing the Fréchet Distance between Real-Valued Surfaces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Efficient trajectory queries under the Fréchet distance (GIS Cup).
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Clustering Trajectories for Map Construction.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Ruler of the Plane - Games of Geometry (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Range-Clustering Queries.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Area-Preserving Simplification and Schematization of Polygonal Subdivisions.
ACM Trans. Spatial Algorithms Syst., 2016

Adjacency-preserving spatial treemaps.
J. Comput. Geom., 2016

Computing the Fréchet Distance with a Retractable Leash.
Discret. Comput. Geom., 2016

Geo word clouds.
Proceedings of the 2016 IEEE Pacific Visualization Symposium, 2016

2015
Trajectory grouping structure.
J. Comput. Geom., 2015

Progressive geometric algorithms.
J. Comput. Geom., 2015

Stacked space-time densities: a geovisualisation approach to explore dynamics of space use over time.
GeoInformatica, 2015

Mosaic Drawings and Cartograms.
Comput. Graph. Forum, 2015

Angle-Restricted Steiner Arborescences for Flow Map Layout.
Algorithmica, 2015

Computing the Greedy Spanner in Linear Space.
Algorithmica, 2015

Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

Analyzing delays in trajectories.
Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Dynamic Point Labeling is Strongly PSPACE-Complete.
Int. J. Comput. Geom. Appl., 2014

On the Number of Regular Edge Labelings.
Discret. Math. Theor. Comput. Sci., 2014

Reprint of: Memory-constrained algorithms for simple polygons.
Comput. Geom., 2014

Four Soviets Walk the Dog - with an Application to Alt's Conjecture.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

A framework for trajectory segmentation by stable criteria.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Trajectory Grouping Structure: the Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

A Framework for Computing the Greedy Spanner.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Interference Minimization in Asymmetric Sensor Networks.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Trajectory Grouping Structures
CoRR, 2013

Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Median Trajectories.
Algorithmica, 2013

Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm.
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Vertex Deletion for 3D Delaunay Triangulations.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Vectors in a box.
Math. Program., 2012

Rolling Block Mazes are PSPACE-complete.
J. Inf. Process., 2012

Processing aggregated data: the location of clusters in health data.
GeoInformatica, 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012

Evolution Strategies for Optimizing Rectangular Cartograms.
Proceedings of the Geographic Information Science - 7th International Conference, 2012

Detecting movement patterns using Brownian bridges.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2011
Flow Map Layout via Spiral Trees.
IEEE Trans. Vis. Comput. Graph., 2011

Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

On Planar Supports for Hypergraphs.
J. Graph Algorithms Appl., 2011

Delaunay triangulations in <i>O</i>(sort(<i>n</i>)) time and more.
J. ACM, 2011

Detecting Commuting Patterns by Clustering Subtrajectories.
Int. J. Comput. Geom. Appl., 2011

Finding long and similar parts of trajectories.
Comput. Geom., 2011

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.
Algorithmica, 2011

A new method for subdivision simplification with applications to urban-area generalization.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

A splitting line model for directional relations.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Shortest-Paths Preserving Metro Maps.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

Acyclic Orientation of Drawings.
J. Graph Algorithms Appl., 2010

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.
Int. J. Comput. Geom. Appl., 2010

Constrained free space diagrams: a tool for trajectory analysis.
Int. J. Geogr. Inf. Sci., 2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.
Electron. J. Comb., 2010

Optimizing Regular Edge Labelings.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

On the Number of Spanning Trees a Planar Graph Can Have.
Proceedings of the Algorithms, 2010

Fréchet Distance of Surfaces: Some Simple Hard Cases.
Proceedings of the Algorithms, 2010

10491 Results of the break-out group: Movement Data of Vervet Monkeys.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Gulls Data.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Visualisation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

2009
Polychromatic Colorings of Plane Graphs.
Discret. Comput. Geom., 2009

Transforming spanning trees: A lower bound.
Comput. Geom., 2009

Delaunay Triangulation of Imprecise Points Simplified and Extended.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Exact algorithms for partial curve matching via the Fréchet distance.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Delaunay Triangulations in O(sort(n)) Time and More.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Constructing Delaunay Triangulations along Space-Filling Curves.
Proceedings of the Algorithms, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Organizing Point Sets (Space-Filling Curves, Delaunay Tessellations of Random Point Sets, and Flow Complexes) (Strukturieren von Punktmengen) (Raumfüllende Kurven, Delaunay-Triangulierungen von zufälligen Punktmengen und Flusskomplexe)
PhD thesis, 2008

There Are Not Too Many Magic Configurations.
Discret. Comput. Geom., 2008

Delaunay Triangulations in Linear Time? (Part I)
CoRR, 2008

Minimizing the Maximum Interference is Hard
CoRR, 2008

Recursive geometry of the flow complex and topology of the flow complex filtration.
Comput. Geom., 2008

Computing the Fréchet distance between simple polygons.
Comput. Geom., 2008

Clusters in Aggregated Health Data.
Proceedings of the Headway in Spatial Data Handling, 2008

Detecting single file movement.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Drawing (Complete) Binary Tanglegrams.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance
CoRR, 2007

Topology Control.
Proceedings of the Algorithms for Sensor and Ad Hoc Networks, 2007

Inflating the cube by shrinking.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

On the Number of Cycles in Planar Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Computing the Fréchet distance between simple polygons in polynomial time.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Incremental construction along space-filling curves.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Flow Complex: General Structure and Algorithm.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
Real-time per-pixel rendering with stroke textures.
Proceedings of the 19th Spring Conference on Computer Graphics, 2003


  Loading...