Kevin Buchin

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Faster Fr\'echet Distance under Transformations	2025	Kevin Buchin Maike Buchin Zijin Huang André Nusser Sampson Wong
+ PDF Chat	Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings	2024	Mikkel Abrahamsen Kevin Buchin Maike Buchin Linda Kleist Maarten Löffler Lena Schlipf André Schulz Jack Stade
+ PDF Chat	Computing Oriented Spanners and their Dilation	2024	Kevin Buchin Antonia Kalb Anil Maheshwari Saeed Odak Michiel Smid Carolin Rehs Sampson Wong
+ PDF Chat	Geometric spanners of bounded tree-width	2024	Kevin Buchin Carolin Rehs Torben Scheele
+ PDF Chat	Orienteering (with Time Windows) on Restricted Graph Classes	2024	Kevin Buchin Mart Hagedoorn Guangping Li Carolin Rehs
+ PDF Chat	Map-Matching Queries under Fr\'echet Distance on Low-Density Spanners	2024	Kevin Buchin Maike Buchin Joachim Gudmundsson Aleksandr Popov Sampson Wong
+ PDF Chat	Bicriteria approximation for minimum dilation graph augmentation	2024	Kevin Buchin Maike Buchin Joachim Gudmundsson Sampson Wong
+ PDF Chat	Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs	2024	Erik van den Akker Kevin Buchin Klaus-Tycho Foerster
+ PDF Chat	Fréchet Distance for Uncertain Curves	2023	Kevin Buchin Chenglin Fan Maarten Löffler Aleksandr Popov Benjamin Raichel Marcel Roeloffzen
+	Oriented Spanners	2023	Kevin Buchin Joachim Gudmundsson Antonia Kalb Aleksandr Popov Carolin Rehs André van Renssen Sampson Wong
+ PDF Chat	Morphing Planar Graph Drawings Through 3D	2022	Kevin Buchin Will Evans Fabrizio Frati Irina Kostitsyna Maarten Löffler Tim Ophelders Alexander Wolff
+ PDF Chat	Minimum Scan Cover and Variants: Theory and Experiments	2022	Kevin Buchin Alexander Hill Sándor P. Fekete Linda Kleist Irina Kostitsyna Dominik Krupke Roel Lambers Martijn Struijs
+	Computing the Fréchet distance between uncertain curves in one dimension	2022	Kevin Buchin Maarten Löffler Tim Ophelders Aleksandr Popov Jérôme Urhausen Kevin Verbeek
+ PDF Chat	Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time	2022	Kevin Buchin André Nusser Sampson Wong
+	Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time	2022	Kevin Buchin André Nusser Sampson Wong
+	On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem	2022	Peyman Afshani Mark de Berg Kevin Buchin Jie Gao Maarten Löffler Amir Nayyeri Benjamin Raichel Rik Sarkar Haotian Wang Hao-Tsung Yang
+	Segment Visibility Counting Queries in Polygons	2022	Kevin Buchin Bram Custers Ivor van der Hoog Maarten Löffler А. А. Попов Marcel Roeloffzen Frank Staals
+	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds	2022	Bahareh Banyassady Mark de Berg Karl Bringmann Kevin Buchin Henning Fernau Dan Halperin Irina Kostitsyna Yoshio Okamoto Stijn Slot
+ PDF Chat	On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis	2022	Kevin Buchin Paola Flocchini Irina Kostitsyna Tom Peters Nicola Santoro Koichi Wada
+	Morphing Planar Graph Drawings Through 3D	2022	Kevin Buchin William Evans Fabrizio Frati Irina Kostitsyna Maarten Löffler Tim Ophelders Alexander Wolff
+	Near-Delaunay Metrics	2021	Nathan van Beusekom Kevin Buchin Hidde Koerts Wouter Meulemans Benjamin Rodatz Bettina Speckmann
+ PDF Chat	Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency	2021	Peyman Afshani Mark de Berg Kevin Buchin Jie Gao Maarten Löffler Amir Nayyeri Benjamin Raichel Rik Sarkar Haotian Wang Hao-Tsung Yang
+	Computing the Fréchet Distance Between Uncertain Curves in One Dimension	2021	Kevin Buchin Maarten Löffler Tim Ophelders Aleksandr Popov Jérôme Urhausen Kevin Verbeek
+	Computing the Fréchet Distance Between Uncertain Curves in One Dimension	2021	Kevin Buchin Maarten Löffler Tim Ophelders А. А. Попов Jérôme Urhausen Kevin Verbeek
+	Uncertain Curve Simplification	2021	Kevin Buchin Maarten Löffler А. А. Попов Marcel Roeloffzen
+	Minimum Scan Cover and Variants -- Theory and Experiments	2021	Kevin Buchin Sándor P. Fekete Alexander Hill Linda Kleist Irina Kostitsyna Dominik Krupke Roel Lambers Martijn Struijs
+	Near-Delaunay Metrics	2021	Nathan van Beusekom Kevin Buchin Hidde Koerts Wouter Meulemans Benjamin Rodatz Bettina Speckmann
+	Dots & Boxes is PSPACE-complete	2021	Kevin Buchin Mart Hagedoorn Irina Kostitsyna Max van Mulken
+	Fine-grained Complexity Analysis of Two Classic TSP Variants	2020	Mark de Berg Kevin Buchin Bart M. P. Jansen Gerhard J. Woeginger
+ PDF Chat	(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping	2020	Milutin Brankovic Kevin Buchin Koen Klaren André Nusser Aleksandr Popov Sampson Wong
+ PDF Chat	A Spanner for the Day After	2020	Kevin Buchin Sariel Har-Peled Dániel Oláh
+	Frechet Distance for Uncertain Curves	2020	Kevin Buchin Chenglin Fan Maarten Löffler Aleksandr Popov Benjamin Raichel Marcel Roeloffzen
+	Dots & Polygons	2020	Kevin Buchin Mart Hagedoorn Irina Kostitsyna Max van Mulken Jolan Rensen Leo van Schooten
+	Progressive simplification of polygonal curves	2020	Kevin Buchin Maximilian Konzack Wim Reddingius
+	Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency	2020	Peyman Afshani Mark de Berg Kevin Buchin Jie Gao Maarten Löffler Amir Nayyeri Benjamin Raichel Rik Sarkar Haotian Wang Hao-Tsung Yang
+	Dots & Polygons	2020	Kevin Buchin Mart Hagedoorn Irina Kostitsyna Max van Mulken Jolan Rensen Leo van Schooten
+	Fréchet Distance for Uncertain Curves	2020	Kevin Buchin Chenglin Fan Maarten Löffler А. А. Попов Benjamin Raichel Marcel Roeloffzen
+	Sometimes Reliable Spanners of Almost Linear Size	2019	Kevin Buchin Sariel Har-Peled Dániel Oláh
+ PDF Chat	Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)	2019	Kevin Buchin Irina Kostitsyna Maarten Löffler Rodrigo I. Silveira
+ PDF Chat	Minimum Perimeter-Sum Partitions in the Plane	2019	Mikkel Abrahamsen Mark de Berg Kevin Buchin Mehran Mehr Ali D. Mehrabi
+	Geometric secluded paths and planar satisfiability	2019	Kevin Buchin Valentin Polishchuk Leonid Sedov Roman Voronov
+	On the hardness of computing an average curve	2019	Kevin Buchin Anne Driemel Martijn Struijs
+	The Number of Convex Polyominoes with Given Height and Width	2019	Kevin Buchin Man-Kwun Chiu Stefan Felsner Günter Rote André Schulz
+ PDF Chat	SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension	2019	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Sometimes Reliable Spanners of Almost Linear Size	2019	Kevin Buchin Sariel Har-Peled Dániel Oláh
+	A Spanner for the Day After	2018	Kevin Buchin Sariel Har-Peled Dániel Oláh
+	Locally correct Fréchet matchings	2018	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann
+	Progressive Simplification of Polygonal Curves	2018	Kevin Buchin Maximilian Konzack Wim Reddingius
+	Approximating the distribution of the median and other robust estimators on uncertain data	2018	Kevin Buchin Jeff M. Phillips Pingfan Tang
+	$\mathcal{O}(k)$-robust spanners in one dimension	2018	Kevin Buchin Tim Hulshof Dániel Oláh
+	Approximating $(k,\ell)$-center clustering for curves	2018	Kevin Buchin Anne Driemel Joachim Gudmundsson Michael Horton Irina Kostitsyna Maarten Löffler Martijn Struijs
+	SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension	2018	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Progressive Simplification of Polygonal Curves	2018	Kevin Buchin Maximilian Konzack Wim Reddingius
+	$\mathcal{O}(k)$-robust spanners in one dimension	2018	Kevin Buchin Tim Hulshof Dániel Oláh
+	A Spanner for the Day After	2018	Kevin Buchin Sariel Har-Peled Dániel Oláh
+ PDF Chat	Compact Flow Diagrams for State Sequences	2017	Kevin Buchin Maike Buchin Joachim Gudmundsson Michael Horton Stef Sijben
+	Placing your Coins on a Shelf	2017	Helmut Alt Kevin Buchin Steven Chaplick Otfried Cheong Philipp Kindermann Christian Knauer Fabian Stehn
+	Minimum Perimeter-Sum Partitions in the Plane	2017	Mikkel Abrahamsen Mark de Berg Kevin Buchin Moslem Afrashteh Mehr Abbas Mehrabi
+	Range-clustering queries	2017	Mikkel Abrahamsen Mark de Berg Kevin Buchin Moslem Afrashteh Mehr Abbas Mehrabi
+ PDF Chat	Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance	2017	Kevin Buchin Maike Buchin Wouter Meulemans Wolfgang Mulzer
+	Computing the similarity between moving curves	2017	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Computing the fréchet distance between real-valued surfaces	2017	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Range-Clustering Queries	2017	Mikkel Abrahamsen Mark de Berg Kevin Buchin Mehran Mehr Ali D. Mehrabi
+	Computing the Fréchet Distance between Real-Valued Surfaces	2017	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Placing your Coins on a Shelf	2017	Helmut G. Alt Kevin Buchin Steven Chaplick Otfried Cheong Philipp Kindermann Christian Knauer Fabian Stehn
+	Fine-Grained Complexity Analysis of Two Classic TSP Variants	2016	Mark de Berg Kevin Buchin Bart M. P. Jansen Gerhard J. Woeginger
+ PDF Chat	Computing the Fréchet Distance with a Retractable Leash	2016	Kevin Buchin Maike Buchin Rolf van Leusden Wouter Meulemans Wolfgang Mulzer
+ PDF Chat	Compact Flow Diagrams for State Sequences	2016	Kevin Buchin Maike Buchin Joachim Gudmundsson Michael Horton Stef Sijben
+	Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data	2016	Kevin Buchin Jeff M. Phillips Pingfan Tang
+	Fine-Grained Complexity Analysis of Two Classic TSP Variants	2016	Mark de Berg Kevin Buchin Bart M. P. Jansen Gerhard J. Woeginger
+	Computing the Similarity Between Moving Curves	2015	Kevin Buchin Tim Ophelders Bettina Speckmann
+ PDF Chat	Interference Minimization in Asymmetric Sensor Networks	2015	Yves Brise Kevin Buchin Dustin Eversmann Michael M. Hoffmann Wolfgang Mulzer
+ PDF Chat	Computing the Similarity Between Moving Curves	2015	Kevin Buchin Tim Ophelders Bettina Speckmann
+	Computing the Similarity Between Moving Curves	2015	Kevin Buchin Tim Ophelders Bettina Speckmann
+ PDF Chat	Trajectory Grouping Structure	2014	Kevin Buchin Maike Buchin Marc van Kreveld Bettina Speckmann Frank Staals
+	Angle-Restricted Steiner Arborescences for Flow Map Layout	2014	Kevin Buchin Bettina Speckmann Kevin Verbeek
+	Distribution-Sensitive Construction of the Greedy Spanner	2014	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin
+	Distribution-Sensitive Construction of the Greedy Spanner	2014	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin
+	Interference Minimization in Asymmetric Sensor Networks	2014	Yves Brise Kevin Buchin Dustin Eversmann Michael R. Hoffmann Wolfgang Mulzer
+	Computing the Greedy Spanner in Linear Space	2013	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin
+ PDF Chat	Memory-constrained algorithms for simple polygons	2013	Tetsuo Asano Kevin Buchin Maike Buchin Matias Korman Wolfgang Mulzer Günter Rote André Schulz
+ PDF Chat	Computing the Greedy Spanner in Linear Space	2013	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin
+	Trajectory Grouping Structures	2013	Kevin Buchin Maike Buchin Marc van Kreveld Bettina Speckmann Frank Staals
+	Computing the Greedy Spanner in Linear Space	2013	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin
+	Locally Correct Frechet Matchings	2012	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann
+ PDF Chat	Locally Correct Fréchet Matchings	2012	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann
+	Locally Correct Frechet Matchings	2012	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann
+	Angle-Restricted Steiner Arborescences for Flow Map Layout	2011	Kevin Buchin Bettina Speckmann Kevin Verbeek
+	Adjacency-Preserving Spatial Treemaps	2011	Kevin Buchin David Eppstein Maarten Löffler Martin Nöllenburg Rodrigo I. Silveira
+ PDF Chat	Adjacency-Preserving Spatial Treemaps	2011	Kevin Buchin David Eppstein Maarten Löffler Martin Nöllenburg Rodrigo I. Silveira
+	Angle-Restricted Steiner Arborescences for Flow Map Layout	2011	Kevin Buchin Bettina Speckmann Kevin Verbeek
+	Adjacency-Preserving Spatial Treemaps	2011	Kevin Buchin David Eppstein Maarten Löffler Martin Nöllenburg Rodrigo I. Silveira
+	Angle-Restricted Steiner Arborescences for Flow Map Layout	2011	Kevin Buchin Bettina Speckmann Kevin Verbeek
+ PDF Chat	A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets	2010	Ondřej Bílka Kevin Buchin Radoslav Fulek Masashi Kiyomi Yoshio Okamoto Shin‐ichi Tanigawa Csaba D. Tóth
+	Median trajectories	2010	Kevin Buchin Maike Buchin Marc van Kreveld Maarten Löffler Rodrigo I. Silveira Carola Wenk Lionov Wiratma
+ PDF Chat	VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE	2010	Sergey Bereg Kevin Buchin Maike Buchin Marina L. Gavrilova Binhai Zhu
+ PDF Chat	On the Number of Spanning Trees a Planar Graph Can Have	2010	Kevin Buchin André Schulz
+	On the number of spanning trees a planar graph can have	2009	Kevin Buchin André Schulz
+ PDF Chat	Polychromatic Colorings of Plane Graphs	2009	Noga Alon Robert Berke Kevin Buchin Maike Buchin Péter Csorba Saswata Shannigrahi Bettina Speckmann Philipp Zumstein
+	Transforming spanning trees: A lower bound	2009	Kevin Buchin Andreas Razen Takeaki Uno Uli Wagner
+	On the number of spanning trees a planar graph can have	2009	Kevin Buchin André Schulz
+	Vectors in a Box	2009	Kevin Buchin Jiřı́ Matoušek Robin A. Moser Dömötör Pálvölgyi
+ PDF Chat	Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance	2008	Sergey Bereg Kevin Buchin Maike Buchin Marina L. Gavrilova Binhai Zhu
+	Organizing Point Sets	2008	Kevin Buchin
+	Minimizing the Maximum Interference is Hard	2008	Kevin Buchin
+	Delaunay Triangulations in Linear Time? (Part I)	2008	Kevin Buchin
+	Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability	2008	Kevin Buchin Maike Buchin Jarosław Byrka Martin Nöllenburg Yoshio Okamoto Rodrigo I. Silveira Alexander Wolff
+ PDF Chat	On the Number of Cycles in Planar Graphs	2007	Kevin Buchin Christian Knauer Klaus Kriegel André Schulz Raimund Seidel
+	Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance	2007	Kevin Buchin Maike Buchin

Common Coauthors

Coauthor	Papers Together
Bettina Speckmann	21
Maike Buchin	21
Tim Ophelders	13
Maarten Löffler	12
Mark de Berg	11
Irina Kostitsyna	11
Sampson Wong	8
Wouter Meulemans	8
Maarten Löffler	8
Aleksandr Popov	7
Kevin Verbeek	7
André Schulz	6
Joachim Gudmundsson	6
Benjamin Raichel	6
Rodrigo I. Silveira	6
Wolfgang Mulzer	5
Sariel Har-Peled	5
Marcel Roeloffzen	5
Sander P. A. Alewijnse	5
Alex P. ten Brink	5
Quirijn W. Bouts	5
Mikkel Abrahamsen	5
Dániel Oláh	5
А. А. Попов	4
André Nusser	4
Mart Hagedoorn	4
Martijn Struijs	4
Martin Nöllenburg	4
Carolin Rehs	4
Rik Sarkar	3
Max van Mulken	3
David Eppstein	3
Amir Nayyeri	3
Hao-Tsung Yang	3
Linda Kleist	3
Christian Knauer	3
Peyman Afshani	3
Marc van Kreveld	3
Haotian Wang	3
Gerhard J. Woeginger	3
Frank Staals	3
Michael Horton	3
Chenglin Fan	3
Wim Reddingius	3
Maximilian Konzack	3
Bart M. P. Jansen	3
Alexander Wolff	3
Jérôme Urhausen	3
Fabrizio Frati	2
Nathan van Beusekom	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	The fréchet distance revisited and extended	2014	Sariel Har-Peled Benjamin Raichel	9
+ PDF Chat	Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails	2014	Karl Bringmann	8
+	Geometric Spanner Networks	2007	Giri Narasimhan Michiel Smid	6
+ PDF Chat	Computing the Discrete Fréchet Distance in Subquadratic Time	2014	Pankaj Agarwal Rinat Ben Avraham Haim Kaplan Micha Sharir	5
+ PDF Chat	Robust Geometric Spanners	2013	Prosenjit Bose Vida Dujmović Pat Morin Michiel Smid	4
+	Approximability of the discrete Fréchet distance	2016	Karl Bringmann Wolfgang Mulzer	4
+ PDF Chat	Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance	2017	Kevin Buchin Maike Buchin Wouter Meulemans Wolfgang Mulzer	4
+ PDF Chat	Minimum-weight triangulation is NP-hard	2008	Wolfgang Mulzer Günter Rote	3
+ PDF Chat	Counting Triangulations of Planar Point Sets	2011	Micha Sharir Adam Sheffer	3
+	Near-Optimal $O(k)$-Robust Geometric Spanners	2018	Prosenjit Bose Paz Carmi Vida Dujmović Pat Morin	3
+ PDF Chat	Locally Correct Fréchet Matchings	2012	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann	3
+	On the number of plane graphs	2006	Oswin Aichholzer Thomas Hackl Birgit Vogtenhuber Clemens Huemer Ferrán Hurtado Hannes Krasser	3
+	The directed Hausdorff distance between imprecise point sets	2011	Christian Knauer Maarten Löffler Marc Scherfenberg Thomas Wolle	3
+ PDF Chat	Sur quelques points du calcul fonctionnel	1906	Maurice Fréchet	3
+	Fr\'echet Distance Revisited and Extended	2012	Sariel Har-Peled Benjamin Raichel	2
+	Computing the Fr\'{e}chet Distance Between Folded Polygons	2011	Atlas F. Cook Anne Driemel Sariel Har-Peled Jessica Sherette Carola Wenk	2
+ PDF Chat	Clustering time series under the Fréchet distance	2015	Anne Driemel Amer Krivošija Christian Sohler	2
+	Approximating the integral Fréchet distance	2018	Anil Maheshwari Jörg-Rüdiger Sack Christian Scheffer	2
+ PDF Chat	Computing the Greedy Spanner in Linear Space	2013	Sander P. A. Alewijnse Quirijn W. Bouts Alex P. ten Brink Kevin Buchin	2
+	Approximating $(k,\ell)$-center clustering for curves	2018	Kevin Buchin Anne Driemel Joachim Gudmundsson Michael Horton Irina Kostitsyna Maarten Löffler Martijn Struijs	2
+ PDF Chat	On Fence Patrolling by Mobile Agents	2014	Adrian Dumitrescu Anirban Ghosh Csaba D. Tóth	2
+ PDF Chat	Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling	2015	Akitoshi Kawamura Makoto Soejima	2
+ PDF Chat	Fréchet Distance for Curves, Revisited	2006	Boris Aronov Sariel Har-Peled Christian Knauer Yusu Wang Carola Wenk	2
+ PDF Chat	Computing the Similarity Between Moving Curves	2015	Kevin Buchin Tim Ophelders Bettina Speckmann	2
+ PDF Chat	Geodesic Fréchet distance inside a simple polygon	2010	Atlas F. Cook Carola Wenk	2
+	Sparse geometric graphs with small dilation	2007	Boris Aronov Mark de Berg Otfried Cheong Joachim Gudmundsson Herman Haverkort Michiel Smid Antoine Vigneron	2
+ PDF Chat	Computing the Fréchet Distance between Folded Polygons	2011	Atlas F. Cook Anne Driemel Sariel Har-Peled Jessica Sherette Carola Wenk	2
+	Trajectory Grouping Structures	2013	Kevin Buchin Maike Buchin Marc van Kreveld Bettina Speckmann Frank Staals	2
+ PDF Chat	Encyklopädie der mathematischen Wissenschaften	1928	Hans Hahn	2
+	Locally Correct Frechet Matchings	2012	Kevin Buchin Maike Buchin Wouter Meulemans Bettina Speckmann	2
+ PDF Chat	Realization Spaces of Polytopes	1996	Jürgen Richter-Gebert	2
+	Algebraic Potential Theory on Graphs	1997	Norman Biggs	2
+ PDF Chat	Computing the Fréchet Distance with a Retractable Leash	2016	Kevin Buchin Maike Buchin Rolf van Leusden Wouter Meulemans Wolfgang Mulzer	2
+	On the Number of Plane Geometric Graphs	2007	Oswin Aichholzer Thomas Hackl Clemens Huemer Ferrán Hurtado Hannes Krasser Birgit Vogtenhuber	2
+	Spanning Trees in Regular Graphs	1983	Brendan D. McKay	2
+ PDF Chat	Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations	2013	Soroush Alamdari Elaheh Fata Stephen L. Smith	2
+	A bound for the complexity of a simple graph	1988	Robert Grone Russell Merris	2
+	Dimer problem in statistical mechanics-an exact result	1961	H. N. V. Temperley Michael E. Fisher	2
+ PDF Chat	Asymptotic Enumeration of Spanning Trees	2005	Russell Lyons	2
+ PDF Chat	A Near-Linear Algorithm for the Planar 2-Center Problem	1997	Micha Sharir	2
+	Rings of sets	1937	Garrett Birkhoff	2
+ PDF Chat	On Range Searching with Semialgebraic Sets. II	2013	Pankaj K. Agarwal Jiřı́ Matoušek Micha Sharir	2
+ PDF Chat	Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts	2013	Anne Driemel Sariel Har-Peled	2
+	The statistics of dimers on a lattice	1961	Piet Kasteleyn	2
+	A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph	1990	W. C. Stephen Suen	2
+	More planar two-center algorithms	1999	Timothy M. Chan	2
+	An Elementary Construction of Constant-Degree Expanders	2008	Noga Alon Oded Schwartz A. Shapira	2
+ PDF Chat	On the Number of Cycles in Planar Graphs	2007	Kevin Buchin Christian Knauer Klaus Kriegel André Schulz Raimund Seidel	2
+	Convex Representations of Graphs	1960	W. T. Tutte	2
+ PDF Chat	Multi-Robot Routing for Persistent Monitoring with Latency Constraints	2019	Ahmad Bilal Asghar Stephen L. Smith Shreyas Sundaram	2