NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (28)

math.CO2009

Vectors in a Box

Kevin Buchin, Jiří Matoušek, Robin A. Moser +1

cs.CG2017

Range-Clustering Queries

Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2

cs.CG2009

Delaunay Triangulations in Linear Time? (Part I)

Kevin Buchin

cs.DS2016

Fine-Grained Complexity Analysis of Two Classic TSP Variants

Mark de Berg, Kevin Buchin, Bart M. P. Jansen +1

cs.CG2013

Computing the Greedy Spanner in Linear Space

Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink +1

cs.CG2018

Approximating $(k,\ell)$-center clustering for curves

Kevin Buchin, Anne Driemel, Joachim Gudmundsson +4

cs.CG2018

Placing your Coins on a Shelf

Helmut Alt, Kevin Buchin, Steven Chaplick +4

cs.CG2011

Angle-Restricted Steiner Arborescences for Flow Map Layout

Kevin Buchin, Bettina Speckmann, Kevin Verbeek

cs.CG2018

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension

Kevin Buchin, Tim Ophelders, Bettina Speckmann

math.CO2019

The Number of Convex Polyominoes with Given Height and Width

Kevin Buchin, Man-Kwun Chiu, Stefan Felsner +2

cs.CG2013

Trajectory Grouping Structures

Kevin Buchin, Maike Buchin, Marc van Kreveld +2

cs.CG2015

Computing the Similarity Between Moving Curves

Kevin Buchin, Tim Ophelders, Bettina Speckmann

cs.CG2011

Adjacency-Preserving Spatial Treemaps

Kevin Buchin, David Eppstein, Maarten Löffler +2

math.CO2010

On the number of spanning trees a planar graph can have

Kevin Buchin, André Schulz

cs.CG2016

Computing the Fréchet Distance with a Retractable Leash

Kevin Buchin, Maike Buchin, Rolf van Leusden +2

cs.CG2014

Interference Minimization in Asymmetric Sensor Networks

Yves Brise, Kevin Buchin, Dustin Eversmann +2

cs.DS2016

Compact Flow Diagrams for State Sequences

Kevin Buchin, Maike Buchin, Joachim Gudmundsson +2

cs.CG2007

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

Kevin Buchin, Maike Buchin

cs.CG2018

$\mathcal{O}(k)$-robust spanners in one dimension

Kevin Buchin, Tim Hulshof, Dániel Oláh

cs.CG2012

Memory-Constrained Algorithms for Simple Polygons

Tetsuo Asano, Kevin Buchin, Maike Buchin +4

cs.NI2011

Minimizing the Maximum Interference is Hard

Kevin Buchin

cs.CG2014

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Kevin Buchin, Irina Kostitsyna, Maarten Löffler +1

cs.CG2018

Progressive Simplification of Polygonal Curves

Kevin Buchin, Maximilian Konzack, Wim Reddingius

cs.DM2018

Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data

Kevin Buchin, Jeff M. Phillips, Pingfan Tang

cs.CG2017

Four Soviets Walk the Dog-Improved Bounds for Computing the Fréchet Distance

Kevin Buchin, Maike Buchin, Wouter Meulemans +1

cs.CG2010

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

Kevin Buchin, Maike Buchin, Jaroslaw Byrka +4

cs.CG2014

Distribution-Sensitive Construction of the Greedy Spanner

Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink +1

cs.CG2012

Locally Correct Frechet Matchings

Kevin Buchin, Maike Buchin, Wouter Meulemans +1