Kevin Buchin

According to our database1, Kevin Buchin authored at least 93 papers between 2003 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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
Visual analytics of delays and interaction in movement data.
International Journal of Geographical Information Science, 2017

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance.
Discrete & Computational Geometry, 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

Placing your Coins on a Shelf.
Proceedings of the 28th International Symposium on Algorithms and Computation, 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

Minimum Perimeter-Sum Partitions in the Plane.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

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

Compact Flow Diagrams for State Sequences.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Fine-Grained Complexity Analysis of Two Classic TSP Variants.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

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

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

Computing the Similarity Between Moving Curves.
Proceedings of the Algorithms - ESA 2015, 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
On the Number of Regular Edge Labelings.
Discrete Mathematics & Theoretical Computer Science, 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

Progressive Geometric Algorithms.
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
Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Trajectory Grouping Structure.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 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

Dynamic Point Labeling is Strongly PSPACE-Complete.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

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

Computing the Fréchet Distance with a Retractable Leash.
Proceedings of the Algorithms - ESA 2013, 2013

Computing the Greedy Spanner in Linear Space.
Proceedings of the Algorithms - ESA 2013, 2013

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

Rolling Block Mazes are PSPACE-complete.
JIP, 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

Locally Correct Fréchet Matchings.
Proceedings of the Algorithms - ESA 2012, 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 Information Science, 2011

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

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

Adjacency-Preserving Spatial Treemaps.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Angle-Restricted Steiner Arborescences for Flow Map Layout.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 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

Constrained free space diagrams: a tool for trajectory analysis.
International Journal of Geographical Information Science, 2010

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

Optimizing Regular Edge Labelings.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 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

Median Trajectories.
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
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

Finding long and similar parts of trajectories.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

On Planar Supports for Hypergraphs.
Proceedings of the Graph Drawing, 17th International Symposium, 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
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 Commuting Patterns by Clustering Subtrajectories.
Proceedings of the Algorithms and Computation, 19th International Symposium, 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, GD 2008, Heraklion, Crete, 2008

Polychromatic colorings of plane graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

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, Gyeongju, 2007

There are not too many magic configurations.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 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
Acyclic Orientation of Drawings.
Proceedings of the Algorithm Theory, 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...