default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: David Eppstein
@article{DBLP:journals/algorithmica/Eppstein24,
author = {David Eppstein},
title = {Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time},
journal = {Algorithmica},
volume = {86},
number = {9},
pages = {3027--3053},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01255-y},
doi = {10.1007/S00453-024-01255-Y},
timestamp = {Tue, 10 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinHMNSW24,
author = {David Eppstein and
Robert Hickingbotham and
Laura Merker and
Sergey Norin and
Michal T. Seweryn and
David R. Wood},
title = {Three-Dimensional Graph Products with Unbounded Stack-Number},
journal = {Discret. Comput. Geom.},
volume = {71},
number = {4},
pages = {1210--1237},
year = {2024},
url = {https://doi.org/10.1007/s00454-022-00478-6},
doi = {10.1007/S00454-022-00478-6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinHMNSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DistelDEHJMMSW24,
author = {Marc Distel and
Vida Dujmovic and
David Eppstein and
Robert Hickingbotham and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Michal T. Seweryn and
David R. Wood},
title = {Product Structure Extension of the Alon-Seymour-Thomas Theorem},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {3},
pages = {2095--2107},
year = {2024},
url = {https://doi.org/10.1137/23m1591773},
doi = {10.1137/23M1591773},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DistelDEHJMMSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-06328,
author = {David Eppstein},
title = {Non-Euclidean Erd{\H{o}}s-Anning Theorems},
journal = {CoRR},
volume = {abs/2401.06328},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.06328},
doi = {10.48550/ARXIV.2401.06328},
eprinttype = {arXiv},
eprint = {2401.06328},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-06328.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-03290,
author = {Hadi Khodabandeh and
David Eppstein},
title = {Maintaining Light Spanners via Minimal Updates},
journal = {CoRR},
volume = {abs/2403.03290},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.03290},
doi = {10.48550/ARXIV.2403.03290},
eprinttype = {arXiv},
eprint = {2403.03290},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-03290.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Eppstein23,
author = {David Eppstein},
title = {A Stronger Lower Bound on Parametric Minimum Spanning Trees},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1738--1753},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01024-9},
doi = {10.1007/S00453-022-01024-9},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgt/Eppstein23,
author = {David Eppstein},
title = {Locked and Unlocked Smooth Embeddings of Surfaces},
journal = {Comput. Geom. Topol.},
volume = {2},
number = {2},
pages = {5:1--5:20},
year = {2023},
url = {https://www.cgt-journal.org/index.php/cgt/article/view/28},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgt/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AichholzerEH23,
author = {Oswin Aichholzer and
David Eppstein and
Eva{-}Maria Hainzl},
title = {Geometric dominating sets - a minimum version of the No-Three-In-Line
Problem},
journal = {Comput. Geom.},
volume = {108},
pages = {101913},
year = {2023},
url = {https://doi.org/10.1016/j.comgeo.2022.101913},
doi = {10.1016/J.COMGEO.2022.101913},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/AichholzerEH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EppsteinFO23,
author = {David Eppstein and
Daniel Frishberg and
Martha C. Osegueda},
title = {Angles of arc-polygons and Lombardi drawings of cacti},
journal = {Comput. Geom.},
volume = {112},
pages = {101982},
year = {2023},
url = {https://doi.org/10.1016/j.comgeo.2023.101982},
doi = {10.1016/J.COMGEO.2023.101982},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/EppsteinFO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinLW23,
author = {David Eppstein and
Andrea Lincoln and
Virginia {Vassilevska Williams}},
title = {Quasipolynomiality of the Smallest Missing Induced Subgraph},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {5},
pages = {329--339},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00625},
doi = {10.7155/JGAA.00625},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/theoretics/Eppstein23,
author = {David Eppstein},
title = {The Complexity of Iterated Reversible Computation},
journal = {TheoretiCS},
volume = {2},
year = {2023},
url = {https://doi.org/10.46298/theoretics.23.10},
doi = {10.46298/THEORETICS.23.10},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/theoretics/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein23,
author = {David Eppstein},
editor = {Denis Pankratov},
title = {A Parameterized Algorithm for Flat Folding},
booktitle = {Proceedings of the 35th Canadian Conference on Computational Geometry,
{CCCG} 2023, Concordia University, Montreal, Quebec, Canada, July
31 - August 4, 2023},
pages = {35--42},
year = {2023},
timestamp = {Tue, 02 Jul 2024 17:53:46 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiedlEU23,
author = {Therese Biedl and
David Eppstein and
Torsten Ueckerdt},
editor = {Denis Pankratov},
title = {On the complexity of embedding in graph products},
booktitle = {Proceedings of the 35th Canadian Conference on Computational Geometry,
{CCCG} 2023, Concordia University, Montreal, Quebec, Canada, July
31 - August 4, 2023},
pages = {77--88},
year = {2023},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BiedlEU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/EppsteinM23,
author = {David Eppstein and
Rose McCarty},
editor = {Denis Pankratov},
title = {Geometric Graphs with Unbounded Flip-Width},
booktitle = {Proceedings of the 35th Canadian Conference on Computational Geometry,
{CCCG} 2023, Concordia University, Montreal, Quebec, Canada, July
31 - August 4, 2023},
pages = {197--206},
year = {2023},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/EppsteinM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein23,
author = {David Eppstein},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.29},
doi = {10.4230/LIPICS.SOCG.2023.29},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein23,
author = {David Eppstein},
editor = {Michael A. Bekos and
Markus Chimani},
title = {On the Biplanarity of Blowups},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14465},
pages = {3--17},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49272-3\_1},
doi = {10.1007/978-3-031-49272-3\_1},
timestamp = {Thu, 18 Jan 2024 08:27:16 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChiuEG23,
author = {Alvin Chiu and
David Eppstein and
Michael T. Goodrich},
editor = {Michael A. Bekos and
Markus Chimani},
title = {Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected
Planar Graphs},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14466},
pages = {141--149},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49275-4\_10},
doi = {10.1007/978-3-031-49275-4\_10},
timestamp = {Sat, 10 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/ChiuEG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EppsteinF23,
author = {David Eppstein and
Daniel Frishberg},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Improved Mixing for the Convex Polygon Triangulation Flip Walk},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {56:1--56:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.56},
doi = {10.4230/LIPICS.ICALP.2023.56},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EppsteinF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EppsteinF23,
author = {David Eppstein and
Daniel Frishberg},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains
in Bounded-Treewidth Graphs},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {30:1--30:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.30},
doi = {10.4230/LIPICS.ISAAC.2023.30},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/EppsteinF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein23,
author = {David Eppstein},
editor = {Pat Morin and
Subhash Suri},
title = {Lower Bounds for Non-adaptive Shortest Path Relaxation},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {416--429},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_27},
doi = {10.1007/978-3-031-38906-1\_27},
timestamp = {Tue, 01 Aug 2023 13:49:25 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-00147,
author = {David Eppstein},
title = {Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time},
journal = {CoRR},
volume = {abs/2303.00147},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.00147},
doi = {10.48550/ARXIV.2303.00147},
eprinttype = {arXiv},
eprint = {2303.00147},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-00147.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-17028,
author = {Therese Biedl and
David Eppstein and
Torsten Ueckerdt},
title = {On the complexity of embedding in graph products},
journal = {CoRR},
volume = {abs/2303.17028},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.17028},
doi = {10.48550/ARXIV.2303.17028},
eprinttype = {arXiv},
eprint = {2303.17028},
timestamp = {Fri, 14 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-17028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09230,
author = {David Eppstein},
title = {Lower Bounds for Non-Adaptive Shortest Path Relaxation},
journal = {CoRR},
volume = {abs/2305.09230},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09230},
doi = {10.48550/ARXIV.2305.09230},
eprinttype = {arXiv},
eprint = {2305.09230},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-11185,
author = {David Eppstein and
Andrea Lincoln and
Virginia {Vassilevska Williams}},
title = {Quasipolynomiality of the Smallest Missing Induced Subgraph},
journal = {CoRR},
volume = {abs/2306.11185},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11185},
doi = {10.48550/ARXIV.2306.11185},
eprinttype = {arXiv},
eprint = {2306.11185},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11185.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-11939,
author = {David Eppstein},
title = {A Parameterized Algorithm for Flat Folding},
journal = {CoRR},
volume = {abs/2306.11939},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11939},
doi = {10.48550/ARXIV.2306.11939},
eprinttype = {arXiv},
eprint = {2306.11939},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11939.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-12611,
author = {David Eppstein and
Rose McCarty},
title = {Geometric Graphs with Unbounded Flip-Width},
journal = {CoRR},
volume = {abs/2306.12611},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.12611},
doi = {10.48550/ARXIV.2306.12611},
eprinttype = {arXiv},
eprint = {2306.12611},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-12611.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-10527,
author = {Alvin Chiu and
David Eppstein and
Michael T. Goodrich},
title = {Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected
Planar Graphs},
journal = {CoRR},
volume = {abs/2307.10527},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.10527},
doi = {10.48550/ARXIV.2307.10527},
eprinttype = {arXiv},
eprint = {2307.10527},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-10527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DujmovicEHMW22,
author = {Vida Dujmovic and
David Eppstein and
Robert Hickingbotham and
Pat Morin and
David R. Wood},
title = {Stack-Number is Not Bounded by Queue-Number},
journal = {Comb.},
volume = {42},
number = {2},
pages = {151--164},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4585-7},
doi = {10.1007/S00493-021-4585-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DujmovicEHMW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AkitayaDETU22,
author = {Hugo A. Akitaya and
Erik D. Demaine and
David Eppstein and
Tomohiro Tachi and
Ryuhei Uehara},
title = {Ununfoldable polyhedra with 6 vertices or 6 faces},
journal = {Comput. Geom.},
volume = {103},
pages = {101857},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2021.101857},
doi = {10.1016/J.COMGEO.2021.101857},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AkitayaDETU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EppsteinFM22,
author = {David Eppstein and
Daniel Frishberg and
William Maxwell},
title = {On the treewidth of Hanoi graphs},
journal = {Theor. Comput. Sci.},
volume = {906},
pages = {1--17},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.12.014},
doi = {10.1016/J.TCS.2021.12.014},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EppsteinFM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein22,
author = {David Eppstein},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Reflections in an Octagonal Mirror Maze},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {129--134},
year = {2022},
timestamp = {Wed, 23 Nov 2022 15:41:57 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein22a,
author = {David Eppstein},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Locked and Unlocked Smooth Embeddings of Surfaces},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {135--142},
year = {2022},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein22b,
author = {David Eppstein},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Orthogonal Dissection into Few Rectangles},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {143--150},
year = {2022},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein22b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Eppstein22,
author = {David Eppstein},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Finding Relevant Points for Nearest-Neighbor Classification},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {68--78},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.6},
doi = {10.1137/1.9781611977066.6},
timestamp = {Sat, 19 Aug 2023 18:10:48 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Eppstein22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EppsteinK22,
author = {David Eppstein and
Hadi Khodabandeh},
editor = {Kunal Agrawal and
I{-}Ting Angelina Lee},
title = {Brief Announcement: Distributed Lightweight Spanner Construction for
Unit Ball Graphs in Doubling Metrics},
booktitle = {{SPAA} '22: 34th {ACM} Symposium on Parallelism in Algorithms and
Architectures, Philadelphia, PA, USA, July 11 - 14, 2022},
pages = {57--59},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3490148.3538553},
doi = {10.1145/3490148.3538553},
timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},
biburl = {https://dblp.org/rec/conf/spaa/EppsteinK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EppsteinK22,
author = {David Eppstein and
Hadi Khodabandeh},
editor = {Christian Scheideler},
title = {Distributed Construction of Lightweight Spanners for Unit Ball Graphs},
booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022,
October 25-27, 2022, Augusta, Georgia, {USA}},
series = {LIPIcs},
volume = {246},
pages = {21:1--21:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.DISC.2022.21},
doi = {10.4230/LIPICS.DISC.2022.21},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EppsteinK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05327,
author = {David Eppstein and
Robert Hickingbotham and
Laura Merker and
Sergey Norin and
Michal T. Seweryn and
David R. Wood},
title = {Three-dimensional graph products with unbounded stack-number},
journal = {CoRR},
volume = {abs/2202.05327},
year = {2022},
url = {https://arxiv.org/abs/2202.05327},
eprinttype = {arXiv},
eprint = {2202.05327},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-13170,
author = {Oswin Aichholzer and
David Eppstein and
Eva{-}Maria Hainzl},
title = {Geometric Dominating Sets},
journal = {CoRR},
volume = {abs/2203.13170},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.13170},
doi = {10.48550/ARXIV.2203.13170},
eprinttype = {arXiv},
eprint = {2203.13170},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-13170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-10675,
author = {David Eppstein},
title = {Orthogonal dissection into few rectangles},
journal = {CoRR},
volume = {abs/2206.10675},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.10675},
doi = {10.48550/ARXIV.2206.10675},
eprinttype = {arXiv},
eprint = {2206.10675},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-10675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11413,
author = {David Eppstein},
title = {Reflections in an octagonal mirror maze},
journal = {CoRR},
volume = {abs/2206.11413},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11413},
doi = {10.48550/ARXIV.2206.11413},
eprinttype = {arXiv},
eprint = {2206.11413},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12989,
author = {David Eppstein},
title = {Locked and unlocked smooth embeddings of surfaces},
journal = {CoRR},
volume = {abs/2206.12989},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12989},
doi = {10.48550/ARXIV.2206.12989},
eprinttype = {arXiv},
eprint = {2206.12989},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12989.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-09972,
author = {David Eppstein and
Daniel Frishberg},
title = {Improved mixing for the convex polygon triangulation flip walk},
journal = {CoRR},
volume = {abs/2207.09972},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.09972},
doi = {10.48550/ARXIV.2207.09972},
eprinttype = {arXiv},
eprint = {2207.09972},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-09972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LozzoEGG21,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
title = {C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
Carving-Width},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2471--2502},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00839-2},
doi = {10.1007/S00453-021-00839-2},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LozzoEGG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Eppstein21,
author = {David Eppstein},
title = {On Polyhedral Realization with Isosceles Triangles},
journal = {Graphs Comb.},
volume = {37},
number = {4},
pages = {1247--1269},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02314-9},
doi = {10.1007/S00373-021-02314-9},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein21,
author = {David Eppstein},
title = {Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {549--562},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00571},
doi = {10.7155/JGAA.00571},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Eppstein21,
author = {David Eppstein},
title = {Cubic planar graphs that cannot be drawn on few lines},
journal = {J. Comput. Geom.},
volume = {12},
number = {1},
pages = {178--197},
year = {2021},
url = {https://doi.org/10.20382/v12i1a8},
doi = {10.20382/V12I1A8},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinV21,
author = {David Eppstein and
Vijay V. Vazirani},
title = {{NC} Algorithms for Computing a Perfect Matching and a Maximum Flow
in One-Crossing-Minor-Free Graphs},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
pages = {1014--1033},
year = {2021},
url = {https://doi.org/10.1137/19M1256221},
doi = {10.1137/19M1256221},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/EppsteinFO21,
author = {David Eppstein and
Daniel Frishberg and
Martha C. Osegueda},
editor = {Meng He and
Don Sheehy},
title = {Angles of Arc-Polygons and Lombardi Drawings of Cacti},
booktitle = {Proceedings of the 33rd Canadian Conference on Computational Geometry,
{CCCG} 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova
Scotia, Canada},
pages = {56--64},
year = {2021},
timestamp = {Fri, 24 Sep 2021 13:55:36 +0200},
biburl = {https://dblp.org/rec/conf/cccg/EppsteinFO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinK21,
author = {David Eppstein and
Hadi Khodabandeh},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {On the Edge Crossings of the Greedy Spanner},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {33:1--33:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.33},
doi = {10.4230/LIPICS.SOCG.2021.33},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/EppsteinGH21,
author = {David Eppstein and
Siddharth Gupta and
Elham Havvaei},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Parameterized Complexity of Finding Subgraphs with Hereditary Properties
on Hereditary Graph Classes},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {217--229},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_15},
doi = {10.1007/978-3-030-86593-1\_15},
timestamp = {Tue, 14 Sep 2021 19:09:35 +0200},
biburl = {https://dblp.org/rec/conf/fct/EppsteinGH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/EppsteinFM21,
author = {David Eppstein and
Daniel Frishberg and
William Maxwell},
editor = {Martin Farach{-}Colton and
Giuseppe Prencipe and
Ryuhei Uehara},
title = {On the Treewidth of Hanoi Graphs},
booktitle = {10th International Conference on Fun with Algorithms, {FUN} 2021,
May 30 to June 1, 2021, Favignana Island, Sicily, Italy},
series = {LIPIcs},
volume = {157},
pages = {13:1--13:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FUN.2021.13},
doi = {10.4230/LIPICS.FUN.2021.13},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/EppsteinFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein21,
author = {David Eppstein},
editor = {Helen C. Purchase and
Ignaz Rutter},
title = {Limitations on Realistic Hyperbolic Graph Drawing},
booktitle = {Graph Drawing and Network Visualization - 29th International Symposium,
{GD} 2021, T{\"{u}}bingen, Germany, September 14-17, 2021, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12868},
pages = {343--357},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92931-2\_25},
doi = {10.1007/978-3-030-92931-2\_25},
timestamp = {Sun, 13 Nov 2022 09:57:23 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein21,
author = {David Eppstein},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {A Stronger Lower Bound on Parametric Minimum Spanning Trees},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {343--356},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_25},
doi = {10.1007/978-3-030-83508-8\_25},
timestamp = {Fri, 06 Aug 2021 11:47:24 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Eppstein21,
author = {David Eppstein},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {The Graphs of Stably Matchable Pairs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {349--360},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_27},
doi = {10.1007/978-3-030-86838-3\_27},
timestamp = {Tue, 21 Sep 2021 19:14:12 +0200},
biburl = {https://dblp.org/rec/conf/wg/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-09918,
author = {David Eppstein and
Siddharth Gupta and
Elham Havvaei},
title = {Parameterized Complexity of Finding Subgraphs with Hereditary Properties
on Hereditary Graph Classes},
journal = {CoRR},
volume = {abs/2101.09918},
year = {2021},
url = {https://arxiv.org/abs/2101.09918},
eprinttype = {arXiv},
eprint = {2101.09918},
timestamp = {Sat, 30 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-09918.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05371,
author = {David Eppstein},
title = {A Stronger Lower Bound on Parametric Minimum Spanning Trees},
journal = {CoRR},
volume = {abs/2105.05371},
year = {2021},
url = {https://arxiv.org/abs/2105.05371},
eprinttype = {arXiv},
eprint = {2105.05371},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-15234,
author = {David Eppstein and
Hadi Khodabandeh},
title = {Optimal Spanners for Unit Ball Graphs in Doubling Metrics},
journal = {CoRR},
volume = {abs/2106.15234},
year = {2021},
url = {https://arxiv.org/abs/2106.15234},
eprinttype = {arXiv},
eprint = {2106.15234},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-15234.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03615,
author = {David Eppstein and
Daniel Frishberg and
Martha C. Osegueda},
title = {Angles of Arc-Polygons and Lombardi Drawings of Cacti},
journal = {CoRR},
volume = {abs/2107.03615},
year = {2021},
url = {https://arxiv.org/abs/2107.03615},
eprinttype = {arXiv},
eprint = {2107.03615},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-07441,
author = {David Eppstein},
title = {Limitations on Realistic Hyperbolic Graph Drawing},
journal = {CoRR},
volume = {abs/2108.07441},
year = {2021},
url = {https://arxiv.org/abs/2108.07441},
eprinttype = {arXiv},
eprint = {2108.07441},
timestamp = {Fri, 20 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-07441.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-06163,
author = {David Eppstein},
title = {Finding Relevant Points for Nearest-Neighbor Classification},
journal = {CoRR},
volume = {abs/2110.06163},
year = {2021},
url = {https://arxiv.org/abs/2110.06163},
eprinttype = {arXiv},
eprint = {2110.06163},
timestamp = {Fri, 22 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-06163.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-03898,
author = {David Eppstein and
Daniel Frishberg},
title = {Rapid mixing of the hardcore Glauber dynamics and other Markov chains
in bounded-treewidth graphs},
journal = {CoRR},
volume = {abs/2111.03898},
year = {2021},
url = {https://arxiv.org/abs/2111.03898},
eprinttype = {arXiv},
eprint = {2111.03898},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-03898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-11607,
author = {David Eppstein},
title = {The Complexity of Iterated Reversible Computation},
journal = {CoRR},
volume = {abs/2112.11607},
year = {2021},
url = {https://arxiv.org/abs/2112.11607},
eprinttype = {arXiv},
eprint = {2112.11607},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-11607.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinH20,
author = {David Eppstein and
Elham Havvaei},
title = {Parameterized Leaf Power Recognition via Embedding into Graph Products},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2337--2359},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00720-8},
doi = {10.1007/S00453-020-00720-8},
timestamp = {Wed, 26 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BairdBDDEFGGMS20,
author = {Molly Baird and
Sara C. Billey and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
S{\'{a}}ndor P. Fekete and
Graham Gordon and
Sean Griffin and
Joseph S. B. Mitchell and
Joshua P. Swanson},
title = {Existence and Hardness of Conveyor Belts},
journal = {Electron. J. Comb.},
volume = {27},
number = {4},
pages = {4},
year = {2020},
url = {https://doi.org/10.37236/9782},
doi = {10.37236/9782},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BairdBDDEFGGMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein20,
author = {David Eppstein},
title = {Treetopes and Their Graphs},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {2},
pages = {259--289},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00177-0},
doi = {10.1007/S00454-020-00177-0},
timestamp = {Tue, 11 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein20a,
author = {David Eppstein},
title = {Counting Polygon Triangulations is Hard},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {4},
pages = {1210--1234},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00251-7},
doi = {10.1007/S00454-020-00251-7},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/EppsteinHN20,
author = {David Eppstein and
Sariel Har{-}Peled and
Gabriel Nivasch},
title = {Grid Peeling and the Affine Curve-Shortening Flow},
journal = {Exp. Math.},
volume = {29},
number = {3},
pages = {306--316},
year = {2020},
url = {https://doi.org/10.1080/10586458.2018.1466379},
doi = {10.1080/10586458.2018.1466379},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/em/EppsteinHN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BarequetEGM20,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Nil Mamano},
title = {Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {26--59},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a2},
doi = {10.20382/JOCG.V11I1A2},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BarequetEGM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AkitayaDEHJL20,
author = {Hugo A. Akitaya and
Vida Dujmovic and
David Eppstein and
Thomas C. Hull and
Kshitij Jain and
Anna Lubiw},
title = {Face flips in origami tessellations},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {397--417},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a15},
doi = {10.20382/JOCG.V11I1A15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/AkitayaDEHJL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/EppsteinHS20,
author = {David Eppstein and
Sariel Har{-}Peled and
Anastasios Sidiropoulos},
title = {Approximate greedy clustering and distance selection for graph metrics},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {629--652},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a25},
doi = {10.20382/JOCG.V11I1A25},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/EppsteinHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicEJMW20,
author = {Vida Dujmovic and
David Eppstein and
Gwena{\"{e}}l Joret and
Pat Morin and
David R. Wood},
title = {Minor-Closed Graph Classes with Bounded Layered Pathwidth},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {1693--1709},
year = {2020},
url = {https://doi.org/10.1137/18M122162X},
doi = {10.1137/18M122162X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicEJMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CardinalDEHW20,
author = {Jean Cardinal and
Erik D. Demaine and
David Eppstein and
Robert A. Hearn and
Andrew Winslow},
title = {Reconfiguration of satisfying assignments and subset sums: Easy to
find, hard to connect},
journal = {Theor. Comput. Sci.},
volume = {806},
pages = {332--343},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.05.028},
doi = {10.1016/J.TCS.2019.05.028},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CardinalDEHW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/ChiuDDEHHKPR20,
author = {Man{-}Kwun Chiu and
Erik D. Demaine and
Yevhenii Diomidov and
David Eppstein and
Robert A. Hearn and
Adam Hesterberg and
Matias Korman and
Irene Parada and
Mikhail Rudoy},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {New Results in Sona Drawing: Hardness and {TSP} Separation},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {63--72},
year = {2020},
timestamp = {Mon, 03 May 2021 21:50:39 +0200},
biburl = {https://dblp.org/rec/conf/cccg/ChiuDDEHHKPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DemaineDEO20,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Joseph O'Rourke},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Some Polycubes Have No Edge Zipper Unfolding},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {101--105},
year = {2020},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DemaineDEO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DemaineDE20,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {106--113},
year = {2020},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DemaineDE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein20,
author = {David Eppstein},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Dynamic Products of Ranks},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {199--205},
year = {2020},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BorradaileCEMN20,
author = {Glencora Borradaile and
Erin Wolf Chambers and
David Eppstein and
William Maxwell and
Amir Nayyeri},
editor = {Susanne Albers},
title = {Low-Stretch Spanning Trees of Graphs with Bounded Width},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.15},
doi = {10.4230/LIPICS.SWAT.2020.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BorradaileCEMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EppsteinFH20,
author = {David Eppstein and
Daniel Frishberg and
Elham Havvaei},
editor = {Susanne Albers},
title = {Simplifying Activity-On-Edge Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.24},
doi = {10.4230/LIPICS.SWAT.2020.24},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EppsteinFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-01610,
author = {David Eppstein and
Daniel Frishberg and
Elham Havvaei},
title = {Simplifying Activity-on-Edge Graphs},
journal = {CoRR},
volume = {abs/2002.01610},
year = {2020},
url = {https://arxiv.org/abs/2002.01610},
eprinttype = {arXiv},
eprint = {2002.01610},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-01610.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05854,
author = {David Eppstein and
Hadi Khodabandeh},
title = {On the Edge Crossings of the Greedy Spanner},
journal = {CoRR},
volume = {abs/2002.05854},
year = {2020},
url = {https://arxiv.org/abs/2002.05854},
eprinttype = {arXiv},
eprint = {2002.05854},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08375,
author = {Glencora Borradaile and
Erin Wolf Chambers and
David Eppstein and
William Maxwell and
Amir Nayyeri},
title = {Low-stretch spanning trees of graphs with bounded width},
journal = {CoRR},
volume = {abs/2004.08375},
year = {2020},
url = {https://arxiv.org/abs/2004.08375},
eprinttype = {arXiv},
eprint = {2004.08375},
timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08375.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00179,
author = {David Eppstein and
Daniel Frishberg and
William Maxwell},
title = {On the treewidth of Hanoi graphs},
journal = {CoRR},
volume = {abs/2005.00179},
year = {2020},
url = {https://arxiv.org/abs/2005.00179},
eprinttype = {arXiv},
eprint = {2005.00179},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-00179.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08123,
author = {David Eppstein},
title = {Dynamic Products of Ranks},
journal = {CoRR},
volume = {abs/2007.08123},
year = {2020},
url = {https://arxiv.org/abs/2007.08123},
eprinttype = {arXiv},
eprint = {2007.08123},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-14525,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein},
title = {Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra},
journal = {CoRR},
volume = {abs/2007.14525},
year = {2020},
url = {https://arxiv.org/abs/2007.14525},
eprinttype = {arXiv},
eprint = {2007.14525},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-14525.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-15784,
author = {Man{-}Kwun Chiu and
Erik D. Demaine and
Yevhenii Diomidov and
David Eppstein and
Robert A. Hearn and
Adam Hesterberg and
Matias Korman and
Irene Parada and
Mikhail Rudoy},
title = {New Results in Sona Drawing: Hardness and {TSP} Separation},
journal = {CoRR},
volume = {abs/2007.15784},
year = {2020},
url = {https://arxiv.org/abs/2007.15784},
eprinttype = {arXiv},
eprint = {2007.15784},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-15784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-00116,
author = {David Eppstein},
title = {On Polyhedral Realization with Isosceles Triangles},
journal = {CoRR},
volume = {abs/2009.00116},
year = {2020},
url = {https://arxiv.org/abs/2009.00116},
eprinttype = {arXiv},
eprint = {2009.00116},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-00116.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-09230,
author = {David Eppstein},
title = {The Graphs of Stably Matchable Pairs},
journal = {CoRR},
volume = {abs/2010.09230},
year = {2020},
url = {https://arxiv.org/abs/2010.09230},
eprinttype = {arXiv},
eprint = {2010.09230},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-09230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-04195,
author = {Vida Dujmovic and
David Eppstein and
Robert Hickingbotham and
Pat Morin and
David R. Wood},
title = {Stack-number is not bounded by queue-number},
journal = {CoRR},
volume = {abs/2011.04195},
year = {2020},
url = {https://arxiv.org/abs/2011.04195},
eprinttype = {arXiv},
eprint = {2011.04195},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-04195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBCCEMS19,
author = {Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean{-}Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Maximum Plane Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1512--1534},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0482-x},
doi = {10.1007/S00453-018-0482-X},
timestamp = {Wed, 10 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBCCEMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BannisterDDEW19,
author = {Michael J. Bannister and
William E. Devanny and
Vida Dujmovic and
David Eppstein and
David R. Wood},
title = {Track Layouts, Layered Path Decompositions, and Leveled Planarity},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1561--1583},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0487-5},
doi = {10.1007/S00453-018-0487-5},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BannisterDDEW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BergCCEK19,
author = {Mark de Berg and
Sergio Cabello and
Otfried Cheong and
David Eppstein and
Christian Knauer},
title = {Covering many points with a small-area box},
journal = {J. Comput. Geom.},
volume = {10},
number = {1},
pages = {207--222},
year = {2019},
url = {https://doi.org/10.20382/jocg.v10i1a8},
doi = {10.20382/JOCG.V10I1A8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/BergCCEK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Eppstein19,
author = {David Eppstein},
title = {Realization and connectivity of the graphs of origami flat foldings},
journal = {J. Comput. Geom.},
volume = {10},
number = {1},
pages = {257--280},
year = {2019},
url = {https://doi.org/10.20382/jocg.v10i1a10},
doi = {10.20382/JOCG.V10I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Eppstein19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein19,
author = {David Eppstein},
editor = {Zachary Friggstad and
Jean{-}Lou De Carufel},
title = {Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings},
booktitle = {Proceedings of the 31st Canadian Conference on Computational Geometry,
{CCCG} 2019, August 8-10, 2019, University of Alberta, Edmonton, Alberta,
Canada},
pages = {17--22},
year = {2019},
timestamp = {Thu, 23 Apr 2020 16:22:06 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein19,
author = {David Eppstein},
editor = {Gill Barequet and
Yusu Wang},
title = {Cubic Planar Graphs That Cannot Be Drawn On Few Lines},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {32:1--32:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.32},
doi = {10.4230/LIPICS.SOCG.2019.32},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein19a,
author = {David Eppstein},
editor = {Gill Barequet and
Yusu Wang},
title = {Counting Polygon Triangulations is Hard},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {33:1--33:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.33},
doi = {10.4230/LIPICS.SOCG.2019.33},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BiedlCEMO19,
author = {Therese Biedl and
Erin Wolf Chambers and
David Eppstein and
Arnaud de Mesmay and
Tim Ophelders},
editor = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {Homotopy Height, Grid-Major Height and Graph-Drawing Height},
booktitle = {Graph Drawing and Network Visualization - 27th International Symposium,
{GD} 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11904},
pages = {468--481},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-35802-0\_36},
doi = {10.1007/978-3-030-35802-0\_36},
timestamp = {Sun, 13 Nov 2022 09:57:24 +0100},
biburl = {https://dblp.org/rec/conf/gd/BiedlCEMO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MamanoEEFGKMP19,
author = {Nil Mamano and
Alon Efrat and
David Eppstein and
Daniel Frishberg and
Michael T. Goodrich and
Stephen G. Kobourov and
Pedro Matias and
Valentin Polishchuk},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {New Applications of Nearest-Neighbor Chains: Euclidean {TSP} and Motorcycle
Graphs},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {51:1--51:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.51},
doi = {10.4230/LIPICS.ISAAC.2019.51},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MamanoEEFGKMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EppsteinGLM19,
author = {David Eppstein and
Michael T. Goodrich and
James A. Liu and
Pedro Matias},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Tracking Paths in Planar Graphs},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {54:1--54:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.54},
doi = {10.4230/LIPICS.ISAAC.2019.54},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EppsteinGLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/LozzoEG019,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
Carving-Width},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.9},
doi = {10.4230/LIPICS.IPEC.2019.9},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/LozzoEG019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinR19,
author = {David Eppstein and
Bruce A. Reed},
editor = {Timothy M. Chan},
title = {Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear
Time},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {589--605},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.37},
doi = {10.1137/1.9781611975482.37},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EppsteinR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EppsteinV19,
author = {David Eppstein and
Vijay V. Vazirani},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {{NC} Algorithms for Computing a Perfect Matching, the Number of Perfect
Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {23--30},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323206},
doi = {10.1145/3323165.3323206},
timestamp = {Wed, 19 Jun 2019 08:07:06 +0200},
biburl = {https://dblp.org/rec/conf/spaa/EppsteinV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DemaineEHJLUU19,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Kshitij Jain and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Reconfiguring Undirected Paths},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {353--365},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_26},
doi = {10.1007/978-3-030-24766-9\_26},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DemaineEHJLUU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-06875,
author = {Alon Efrat and
David Eppstein and
Daniel Frishberg and
Michael T. Goodrich and
Stephen G. Kobourov and
Nil Mamano and
Pedro Matias and
Valentin Polishchuk},
title = {Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor
Chains},
journal = {CoRR},
volume = {abs/1902.06875},
year = {2019},
url = {http://arxiv.org/abs/1902.06875},
eprinttype = {arXiv},
eprint = {1902.06875},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-06875.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-04737,
author = {David Eppstein},
title = {Counting Polygon Triangulations is Hard},
journal = {CoRR},
volume = {abs/1903.04737},
year = {2019},
url = {http://arxiv.org/abs/1903.04737},
eprinttype = {arXiv},
eprint = {1903.04737},
timestamp = {Sun, 31 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-04737.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-05256,
author = {David Eppstein},
title = {Cubic Planar Graphs that cannot be Drawn on few Lines},
journal = {CoRR},
volume = {abs/1903.05256},
year = {2019},
url = {http://arxiv.org/abs/1903.05256},
eprinttype = {arXiv},
eprint = {1903.05256},
timestamp = {Sun, 31 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-05256.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00518,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Kshitij Jain and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Reconfiguring Undirected Paths},
journal = {CoRR},
volume = {abs/1905.00518},
year = {2019},
url = {http://arxiv.org/abs/1905.00518},
eprinttype = {arXiv},
eprint = {1905.00518},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-04401,
author = {David Eppstein},
title = {Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings},
journal = {CoRR},
volume = {abs/1906.04401},
year = {2019},
url = {http://arxiv.org/abs/1906.04401},
eprinttype = {arXiv},
eprint = {1906.04401},
timestamp = {Fri, 14 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-04401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-08433,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Joseph O'Rourke},
title = {Some Polycubes Have No Edge-Unzipping},
journal = {CoRR},
volume = {abs/1907.08433},
year = {2019},
url = {http://arxiv.org/abs/1907.08433},
eprinttype = {arXiv},
eprint = {1907.08433},
timestamp = {Tue, 30 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-08433.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-05445,
author = {David Eppstein and
Michael T. Goodrich and
James A. Liu and
Pedro Matias},
title = {Tracking Paths in Planar Graphs},
journal = {CoRR},
volume = {abs/1908.05445},
year = {2019},
url = {http://arxiv.org/abs/1908.05445},
eprinttype = {arXiv},
eprint = {1908.05445},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-05445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-05706,
author = {Therese Biedl and
Erin Wolf Chambers and
David Eppstein and
Arnaud de Mesmay and
Tim Ophelders},
title = {Homotopy height, grid-major height and graph-drawing height},
journal = {CoRR},
volume = {abs/1908.05706},
year = {2019},
url = {http://arxiv.org/abs/1908.05706},
eprinttype = {arXiv},
eprint = {1908.05706},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-05706.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-07668,
author = {Molly Baird and
Sara C. Billey and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
S{\'{a}}ndor P. Fekete and
Graham Gordon and
Sean Griffin and
Joseph S. B. Mitchell and
Joshua P. Swanson},
title = {Existence and hardness of conveyor belts},
journal = {CoRR},
volume = {abs/1908.07668},
year = {2019},
url = {http://arxiv.org/abs/1908.07668},
eprinttype = {arXiv},
eprint = {1908.07668},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-07668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-02057,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
title = {C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
Carving-Width},
journal = {CoRR},
volume = {abs/1910.02057},
year = {2019},
url = {http://arxiv.org/abs/1910.02057},
eprinttype = {arXiv},
eprint = {1910.02057},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-02057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-05667,
author = {Hugo A. Akitaya and
Vida Dujmovic and
David Eppstein and
Thomas C. Hull and
Kshitij Jain and
Anna Lubiw},
title = {Face flips in origami tessellations},
journal = {CoRR},
volume = {abs/1910.05667},
year = {2019},
url = {http://arxiv.org/abs/1910.05667},
eprinttype = {arXiv},
eprint = {1910.05667},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-05667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinKKLLMMV18,
author = {David Eppstein and
Philipp Kindermann and
Stephen G. Kobourov and
Giuseppe Liotta and
Anna Lubiw and
Aude Maignan and
Debajyoti Mondal and
Hamideh Vosoughpour and
Sue Whitesides and
Stephen K. Wismath},
title = {On the Planar Split Thickness of Graphs},
journal = {Algorithmica},
volume = {80},
number = {3},
pages = {977--994},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0328-y},
doi = {10.1007/S00453-017-0328-Y},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinKKLLMMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinH18,
author = {David Eppstein and
Daniel S. Hirschberg},
title = {From Discrepancy to Majority},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1278--1297},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0303-7},
doi = {10.1007/S00453-017-0303-7},
timestamp = {Fri, 02 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazBEMMS18,
author = {Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanning Trees in Multipartite Geometric Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3177--3191},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0375-4},
doi = {10.1007/S00453-017-0375-4},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBEMMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AichholzerBDDEF18,
author = {Oswin Aichholzer and
Michael Biro and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
S{\'{a}}ndor P. Fekete and
Adam Hesterberg and
Irina Kostitsyna and
Christiane Schmidt},
title = {Folding Polyominoes into (Poly)Cubes},
journal = {Int. J. Comput. Geom. Appl.},
volume = {28},
number = {3},
pages = {197--226},
year = {2018},
url = {https://doi.org/10.1142/S0218195918500048},
doi = {10.1142/S0218195918500048},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AichholzerBDDEF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterCE18,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
title = {Parameterized Complexity of 1-Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {23--49},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00457},
doi = {10.7155/JGAA.00457},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterCE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein18,
author = {David Eppstein},
title = {The Effect of Planarization on Width},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {461--481},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00468},
doi = {10.7155/JGAA.00468},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein18a,
author = {David Eppstein},
title = {Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {483--499},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00463},
doi = {10.7155/JGAA.00463},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterE18,
author = {Michael J. Bannister and
David Eppstein},
title = {Crossing Minimization for 1-page and 2-page Drawings of Graphs with
Bounded Treewidth},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {4},
pages = {577--606},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00479},
doi = {10.7155/JGAA.00479},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AbelDDELU18,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Anna Lubiw and
Ryuhei Uehara},
title = {Flat foldings of plane graphs with prescribed angles and edge lengths},
journal = {J. Comput. Geom.},
volume = {9},
number = {1},
pages = {74--93},
year = {2018},
url = {https://doi.org/10.20382/jocg.v9i1a3},
doi = {10.20382/JOCG.V9I1A3},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AbelDDELU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/DuncanEGKLN18,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg},
title = {Planar and poly-arc Lombardi drawings},
journal = {J. Comput. Geom.},
volume = {9},
number = {1},
pages = {328--355},
year = {2018},
url = {https://doi.org/10.20382/jocg.v9i1a11},
doi = {10.20382/JOCG.V9I1A11},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/DuncanEGKLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein18,
author = {David Eppstein},
title = {The Parametric Closure Problem},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {1},
pages = {2:1--2:22},
year = {2018},
url = {https://doi.org/10.1145/3147212},
doi = {10.1145/3147212},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Eppstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/VialDEGJ18,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich and
Timothy Johnson},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving
Data},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {87--96},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.8},
doi = {10.1137/1.9781611975055.8},
timestamp = {Thu, 04 Jan 2018 14:01:44 +0100},
biburl = {https://dblp.org/rec/conf/alenex/VialDEGJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/EppsteinHN18,
author = {David Eppstein and
Sariel Har{-}Peled and
Gabriel Nivasch},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Grid peeling and the affine curve-shortening flow},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {109--116},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.10},
doi = {10.1137/1.9781611975055.10},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/EppsteinHN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/EppsteinGJT18,
author = {David Eppstein and
Michael T. Goodrich and
Jordan Jorgensen and
Manuel R. Torres},
editor = {Stephane Durocher and
Shahin Kamali},
title = {Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching},
booktitle = {Proceedings of the 30th Canadian Conference on Computational Geometry,
{CCCG} 2018, August 8-10, 2018, University of Manitoba, Winnipeg,
Manitoba, Canada},
pages = {98--113},
year = {2018},
url = {http://www.cs.umanitoba.ca/\%7Ecccg2018/papers/session3A-p3.pdf},
timestamp = {Thu, 12 Mar 2020 11:28:29 +0100},
biburl = {https://dblp.org/rec/conf/cccg/EppsteinGJT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CardinalDEHW18,
author = {Jean Cardinal and
Erik D. Demaine and
David Eppstein and
Robert A. Hearn and
Andrew Winslow},
editor = {Lusheng Wang and
Daming Zhu},
title = {Reconfiguration of Satisfying Assignments and Subset Sums: Easy to
Find, Hard to Connect},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {365--377},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_31},
doi = {10.1007/978-3-319-94776-1\_31},
timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CardinalDEHW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Eppstein18,
author = {David Eppstein},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {Faster Evaluation of Subtraction Games},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {20:1--20:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.20},
doi = {10.4230/LIPICS.FUN.2018.20},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/Eppstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Eppstein18a,
author = {David Eppstein},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {Making Change in 2048},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.21},
doi = {10.4230/LIPICS.FUN.2018.21},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/Eppstein18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein18,
author = {David Eppstein},
editor = {Therese Biedl and
Andreas Kerren},
title = {Realization and Connectivity of the Graphs of Origami Flat Foldings},
booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
{GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11282},
pages = {541--554},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04414-5\_38},
doi = {10.1007/978-3-030-04414-5\_38},
timestamp = {Sun, 13 Nov 2022 09:57:25 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/VialDEGJ18,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich and
Timothy Johnson},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Optimally Sorting Evolving Data},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {81:1--81:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.81},
doi = {10.4230/LIPICS.ICALP.2018.81},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/VialDEGJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BarequetEGM18,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Nil Mamano},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {89:1--89:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.89},
doi = {10.4230/LIPICS.ICALP.2018.89},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BarequetEGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EppsteinL18,
author = {David Eppstein and
Daniel Lokshtanov},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {The Parameterized Complexity of Finding Point Sets with Hereditary
Properties},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.11},
doi = {10.4230/LIPICS.IPEC.2018.11},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EppsteinL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EppsteinH18,
author = {David Eppstein and
Elham Havvaei},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Parameterized Leaf Power Recognition via Embedding into Graph Products},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.16},
doi = {10.4230/LIPICS.IPEC.2018.16},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EppsteinH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EppsteinGM18,
author = {David Eppstein and
Michael T. Goodrich and
Nil Mamano},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Reactive Proximity Data Structures for Graphs},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {777--789},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_56},
doi = {10.1007/978-3-319-77404-6\_56},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/EppsteinGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LozzoEG018,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Subexponential-Time and {FPT} Algorithms for Embedded Flat Clustered
Planarity},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {111--124},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_10},
doi = {10.1007/978-3-030-00256-5\_10},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LozzoEG018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2018,
editor = {David Eppstein},
title = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-068-2},
isbn = {978-3-95977-068-2},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-00084,
author = {David Eppstein and
Vijay V. Vazirani},
title = {{NC} Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free
Graphs},
journal = {CoRR},
volume = {abs/1802.00084},
year = {2018},
url = {http://arxiv.org/abs/1802.00084},
eprinttype = {arXiv},
eprint = {1802.00084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-00084.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04555,
author = {David Eppstein and
Michael T. Goodrich and
Nil Mamano},
title = {Reactive Proximity Data Structures for Graphs},
journal = {CoRR},
volume = {abs/1803.04555},
year = {2018},
url = {http://arxiv.org/abs/1803.04555},
eprinttype = {arXiv},
eprint = {1803.04555},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04555.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-05465,
author = {Giordano Da Lozzo and
David Eppstein and
Michael T. Goodrich and
Siddharth Gupta},
title = {Subexponential-Time and {FPT} Algorithms for Embedded Flat Clustered
Planarity},
journal = {CoRR},
volume = {abs/1803.05465},
year = {2018},
url = {http://arxiv.org/abs/1803.05465},
eprinttype = {arXiv},
eprint = {1803.05465},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-05465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-06515,
author = {David Eppstein},
title = {Faster Evaluation of Subtraction Games},
journal = {CoRR},
volume = {abs/1804.06515},
year = {2018},
url = {http://arxiv.org/abs/1804.06515},
eprinttype = {arXiv},
eprint = {1804.06515},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-06515.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07396,
author = {David Eppstein},
title = {Making Change in 2048},
journal = {CoRR},
volume = {abs/1804.07396},
year = {2018},
url = {http://arxiv.org/abs/1804.07396},
eprinttype = {arXiv},
eprint = {1804.07396},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07396.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-09411,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Nil Mamano},
title = {Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms},
journal = {CoRR},
volume = {abs/1804.09411},
year = {2018},
url = {http://arxiv.org/abs/1804.09411},
eprinttype = {arXiv},
eprint = {1804.09411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-09411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03350,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich and
Timothy Johnson},
title = {Optimally Sorting Evolving Data},
journal = {CoRR},
volume = {abs/1805.03350},
year = {2018},
url = {http://arxiv.org/abs/1805.03350},
eprinttype = {arXiv},
eprint = {1805.03350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-03350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-04055,
author = {Jean Cardinal and
Erik D. Demaine and
David Eppstein and
Robert A. Hearn and
Andrew Winslow},
title = {Reconfiguration of Satisfying Assignments and Subset Sums: Easy to
Find, Hard to Connect},
journal = {CoRR},
volume = {abs/1805.04055},
year = {2018},
url = {http://arxiv.org/abs/1805.04055},
eprinttype = {arXiv},
eprint = {1805.04055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-04055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-05443,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich and
Timothy Johnson},
title = {Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving
Data},
journal = {CoRR},
volume = {abs/1805.05443},
year = {2018},
url = {http://arxiv.org/abs/1805.05443},
eprinttype = {arXiv},
eprint = {1805.05443},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-05443.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-00561,
author = {David Eppstein and
Michael T. Goodrich and
Jordan Jorgensen and
Manuel R. Torres},
title = {Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching},
journal = {CoRR},
volume = {abs/1808.00561},
year = {2018},
url = {http://arxiv.org/abs/1808.00561},
eprinttype = {arXiv},
eprint = {1808.00561},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-00561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-02162,
author = {David Eppstein and
Daniel Lokshtanov},
title = {The Parameterized Complexity of Finding Point Sets with Hereditary
Properties},
journal = {CoRR},
volume = {abs/1808.02162},
year = {2018},
url = {http://arxiv.org/abs/1808.02162},
eprinttype = {arXiv},
eprint = {1808.02162},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-02162.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-06013,
author = {David Eppstein},
title = {Realization and Connectivity of the Graphs of Origami Flat Foldings},
journal = {CoRR},
volume = {abs/1808.06013},
year = {2018},
url = {http://arxiv.org/abs/1808.06013},
eprinttype = {arXiv},
eprint = {1808.06013},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-06013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-02452,
author = {David Eppstein and
Elham Havvaei},
title = {Parameterized Leaf Power Recognition via Embedding into Graph Products},
journal = {CoRR},
volume = {abs/1810.02452},
year = {2018},
url = {http://arxiv.org/abs/1810.02452},
eprinttype = {arXiv},
eprint = {1810.02452},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-02452.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07825,
author = {David Eppstein and
Bruce A. Reed},
title = {Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear
Time},
journal = {CoRR},
volume = {abs/1810.07825},
year = {2018},
url = {http://arxiv.org/abs/1810.07825},
eprinttype = {arXiv},
eprint = {1810.07825},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-07825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08314,
author = {Vida Dujmovic and
David Eppstein and
Gwena{\"{e}}l Joret and
Pat Morin and
David R. Wood},
title = {Minor-closed graph classes with bounded layered pathwidth},
journal = {CoRR},
volume = {abs/1810.08314},
year = {2018},
url = {http://arxiv.org/abs/1810.08314},
eprinttype = {arXiv},
eprint = {1810.08314},
timestamp = {Thu, 01 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-08314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinMP17,
author = {David Eppstein and
J. Michael McCarthy and
Brian E. Parrish},
title = {Rooted Cycle Bases},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {663--686},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00434},
doi = {10.7155/JGAA.00434},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Eppstein17,
author = {David Eppstein},
title = {Maximizing the sum of radii of disjoint balls or disks},
journal = {J. Comput. Geom.},
volume = {8},
number = {1},
pages = {316--339},
year = {2017},
url = {https://doi.org/10.20382/jocg.v8i1a12},
doi = {10.20382/JOCG.V8I1A12},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Eppstein17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicEW17,
author = {Vida Dujmovic and
David Eppstein and
David R. Wood},
title = {Structure of Graphs with Locally Restricted Crossings},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {805--824},
year = {2017},
url = {https://doi.org/10.1137/16M1062879},
doi = {10.1137/16M1062879},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicEW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein17,
author = {David Eppstein},
editor = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Forbidden Configurations in Discrete Geometry},
booktitle = {Proceedings of the 29th Canadian Conference on Computational Geometry,
{CCCG} 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario,
Canada},
pages = {1},
year = {2017},
timestamp = {Thu, 12 Mar 2020 11:28:08 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein17,
author = {David Eppstein},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {506--513},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_39},
doi = {10.1007/978-3-319-73915-1\_39},
timestamp = {Sun, 13 Nov 2022 09:57:25 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein17a,
author = {David Eppstein},
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {The Effect of Planarization on Width},
booktitle = {Graph Drawing and Network Visualization - 25th International Symposium,
{GD} 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10692},
pages = {560--572},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-73915-1\_43},
doi = {10.1007/978-3-319-73915-1\_43},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/Eppstein017,
author = {David Eppstein and
Siddharth Gupta},
editor = {Erik G. Hoel and
Shawn D. Newsam and
Siva Ravada and
Roberto Tamassia and
Goce Trajcevski},
title = {Crossing Patterns in Nonplanar Road Networks},
booktitle = {Proceedings of the 25th {ACM} {SIGSPATIAL} International Conference
on Advances in Geographic Information Systems, {GIS} 2017, Redondo
Beach, CA, USA, November 7-10, 2017},
pages = {40:1--40:9},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3139958.3139999},
doi = {10.1145/3139958.3139999},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/Eppstein017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/EppsteinGKM17,
author = {David Eppstein and
Michael T. Goodrich and
Doruk Korkmaz and
Nil Mamano},
editor = {Erik G. Hoel and
Shawn D. Newsam and
Siva Ravada and
Roberto Tamassia and
Goce Trajcevski},
title = {Defining Equitable Geographic Districts in Road Networks via Stable
Matching},
booktitle = {Proceedings of the 25th {ACM} {SIGSPATIAL} International Conference
on Advances in Geographic Information Systems, {GIS} 2017, Redondo
Beach, CA, USA, November 7-10, 2017},
pages = {52:1--52:4},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3139958.3140015},
doi = {10.1145/3139958.3140015},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/EppsteinGKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LozzoDEJ17,
author = {Giordano Da Lozzo and
William E. Devanny and
David Eppstein and
Timothy Johnson},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Square-Contact Representations of Partial 2-Trees and Triconnected
Simply-Nested Graphs},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.24},
doi = {10.4230/LIPICS.ISAAC.2017.24},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LozzoDEJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwcia/EppsteinGM17,
author = {David Eppstein and
Michael T. Goodrich and
Nil Mamano},
editor = {Valentin E. Brimkov and
Reneta P. Barneva},
title = {Algorithms for Stable Matching and Clustering in a Grid},
booktitle = {Combinatorial Image Analysis - 18th International Workshop, {IWCIA}
2017, Plovdiv, Bulgaria, June 19-21, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10256},
pages = {117--131},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59108-7\_10},
doi = {10.1007/978-3-319-59108-7\_10},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/iwcia/EppsteinGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EppsteinK17,
author = {David Eppstein and
Denis Kurz},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {K-Best Solutions of {MSO} Problems on Tree-Decomposable Graphs},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {16:1--16:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.16},
doi = {10.4230/LIPICS.IPEC.2017.16},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EppsteinK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/EppsteinGMT17,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Manuel R. Torres},
editor = {Emanuel Sallinger and
Jan Van den Bussche and
Floris Geerts},
title = {2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection},
booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
pages = {247--260},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3034786.3056115},
doi = {10.1145/3034786.3056115},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/EppsteinGMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EppsteinG17,
author = {David Eppstein and
Michael T. Goodrich},
editor = {Christian Scheideler and
Mohammad Taghi Hajiaghayi},
title = {Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters
for Set Intersection Queries and Sparse Boolean Matrix Multiplication},
booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
pages = {137--139},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087556.3087599},
doi = {10.1145/3087556.3087599},
timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
biburl = {https://dblp.org/rec/conf/spaa/EppsteinG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazBCCEMS17,
author = {Ahmad Biniaz and
Prosenjit Bose and
Kimberly Crosbie and
Jean{-}Lou De Carufel and
David Eppstein and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Maximum Plane Trees in Multipartite Geometric Graphs},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {193--204},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_17},
doi = {10.1007/978-3-319-62127-2\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BiniazBCCEMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinK17,
author = {David Eppstein and
Denis Kurz},
title = {K-Best Solutions of {MSO} Problems on Tree-Decomposable Graphs},
journal = {CoRR},
volume = {abs/1703.02784},
year = {2017},
url = {http://arxiv.org/abs/1703.02784},
eprinttype = {arXiv},
eprint = {1703.02784},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGM17,
author = {David Eppstein and
Michael T. Goodrich and
Nil Mamano},
title = {Algorithms for Stable Matching and Clustering in a Grid},
journal = {CoRR},
volume = {abs/1704.02303},
year = {2017},
url = {http://arxiv.org/abs/1704.02303},
eprinttype = {arXiv},
eprint = {1704.02303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGKM17,
author = {David Eppstein and
Michael T. Goodrich and
Doruk Korkmaz and
Nil Mamano},
title = {Defining Equitable Geographic Districts in Road Networks via Stable
Matching},
journal = {CoRR},
volume = {abs/1706.09593},
year = {2017},
url = {http://arxiv.org/abs/1706.09593},
eprinttype = {arXiv},
eprint = {1706.09593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-05152,
author = {David Eppstein},
title = {Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count},
journal = {CoRR},
volume = {abs/1708.05152},
year = {2017},
url = {http://arxiv.org/abs/1708.05152},
eprinttype = {arXiv},
eprint = {1708.05152},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-05152.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-05155,
author = {David Eppstein},
title = {The Effect of Planarization on Width},
journal = {CoRR},
volume = {abs/1708.05155},
year = {2017},
url = {http://arxiv.org/abs/1708.05155},
eprinttype = {arXiv},
eprint = {1708.05155},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-05155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-06113,
author = {David Eppstein and
Siddharth Gupta},
title = {Crossing Patterns in Nonplanar Road Networks},
journal = {CoRR},
volume = {abs/1709.06113},
year = {2017},
url = {http://arxiv.org/abs/1709.06113},
eprinttype = {arXiv},
eprint = {1709.06113},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-06113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-00426,
author = {Giordano Da Lozzo and
William E. Devanny and
David Eppstein and
Timothy Johnson},
title = {Square-Contact Representations of Partial 2-Trees and Triconnected
Simply-Nested Graphs},
journal = {CoRR},
volume = {abs/1710.00426},
year = {2017},
url = {http://arxiv.org/abs/1710.00426},
eprinttype = {arXiv},
eprint = {1710.00426},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-00426.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03960,
author = {David Eppstein and
Sariel Har{-}Peled and
Gabriel Nivasch},
title = {Grid peeling and the affine curve-shortening flow},
journal = {CoRR},
volume = {abs/1710.03960},
year = {2017},
url = {http://arxiv.org/abs/1710.03960},
eprinttype = {arXiv},
eprint = {1710.03960},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-09317,
author = {Oswin Aichholzer and
Michael Biro and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
S{\'{a}}ndor P. Fekete and
Adam Hesterberg and
Irina Kostitsyna and
Christiane Schmidt},
title = {Folding Polyominoes into (Poly)Cubes},
journal = {CoRR},
volume = {abs/1712.09317},
year = {2017},
url = {http://arxiv.org/abs/1712.09317},
eprinttype = {arXiv},
eprint = {1712.09317},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-09317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AronovBERS16,
author = {Boris Aronov and
Mark de Berg and
David Eppstein and
Marcel Roeloffzen and
Bettina Speckmann},
title = {Distance-sensitive planar point location},
journal = {Comput. Geom.},
volume = {54},
pages = {17--31},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2016.02.001},
doi = {10.1016/J.COMGEO.2016.02.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AronovBERS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemaineEHILUU16,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Folding a paper strip to minimize thickness},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {18--26},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.09.003},
doi = {10.1016/J.JDA.2015.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemaineEHILUU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein16,
author = {David Eppstein},
title = {Simple Recognition of Halin Graphs and Their Generalizations},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {323--346},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00395},
doi = {10.7155/JGAA.00395},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/EppsteinHLNSV16,
author = {David Eppstein and
Danny Holten and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Bettina Speckmann and
Kevin Verbeek},
title = {Strict confluent drawing},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {22--46},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a2},
doi = {10.20382/JOCG.V7I1A2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/EppsteinHLNSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BuchinELNS16,
author = {Kevin Buchin and
David Eppstein and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Rodrigo I. Silveira},
title = {Adjacency-preserving spatial treemaps},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {100--122},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a6},
doi = {10.20382/JOCG.V7I1A6},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BuchinELNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AbelCDEHKLT16,
author = {Zachary Abel and
Jason H. Cantarella and
Erik D. Demaine and
David Eppstein and
Thomas C. Hull and
Jason S. Ku and
Robert J. Lang and
Tomohiro Tachi},
title = {Rigid origami vertices: conditions and forcing sets},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {171--184},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a9},
doi = {10.20382/JOCG.V7I1A9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/AbelCDEHKLT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/VialDEG16,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
editor = {Marc Goerigk and
Renato F. Werneck},
title = {Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection},
booktitle = {16th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2016, August 25, 2016, Aarhus,
Denmark},
series = {OASIcs},
volume = {54},
pages = {5:1--5:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2016.5},
doi = {10.4230/OASICS.ATMOS.2016.5},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/atmos/VialDEG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein16,
author = {David Eppstein},
editor = {Thomas C. Shermer},
title = {Maximizing the Sum of Radii of Disjoint Balls or Disks},
booktitle = {Proceedings of the 28th Canadian Conference on Computational Geometry,
{CCCG} 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada},
pages = {260--265},
publisher = {Simon Fraser University, Vancouver, British Columbia, Canada},
year = {2016},
timestamp = {Thu, 12 Mar 2020 11:28:28 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BorradaileENW16,
author = {Glencora Borradaile and
David Eppstein and
Amir Nayyeri and
Christian Wulff{-}Nilsen},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {22:1--22:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.22},
doi = {10.4230/LIPICS.SOCG.2016.22},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BorradaileENW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterDDEW16,
author = {Michael J. Bannister and
William E. Devanny and
Vida Dujmovic and
David Eppstein and
David R. Wood},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Track Layout Is Hard},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {499--510},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_38},
doi = {10.1007/978-3-319-50106-2\_38},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterDDEW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isw/EppsteinGLMMT16,
author = {David Eppstein and
Michael T. Goodrich and
Jenny Lam and
Nil Mamano and
Michael Mitzenmacher and
Manuel R. Torres},
editor = {Matt Bishop and
Anderson C. A. Nascimento},
title = {Models and Algorithms for Graph Watermarking},
booktitle = {Information Security - 19th International Conference, {ISC} 2016,
Honolulu, HI, USA, September 3-6, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9866},
pages = {283--301},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45871-7\_18},
doi = {10.1007/978-3-319-45871-7\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/isw/EppsteinGLMMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EppsteinH16,
author = {David Eppstein and
Daniel S. Hirschberg},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {From Discrepancy to Majority},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {390--402},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_29},
doi = {10.1007/978-3-662-49529-2\_29},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/EppsteinH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EppsteinKKLLMMV16,
author = {David Eppstein and
Philipp Kindermann and
Stephen G. Kobourov and
Giuseppe Liotta and
Anna Lubiw and
Aude Maignan and
Debajyoti Mondal and
Hamideh Vosoughpour and
Sue Whitesides and
Stephen K. Wismath},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {On the Planar Split Thickness of Graphs},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {403--415},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_30},
doi = {10.1007/978-3-662-49529-2\_30},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/EppsteinKKLLMMV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein16,
author = {David Eppstein},
editor = {Robert Krauthgamer},
title = {Treetopes and their Graphs},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {969--984},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch69},
doi = {10.1137/1.9781611974331.CH69},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Eppstein16,
author = {David Eppstein},
editor = {Rasmus Pagh},
title = {Cuckoo Filter: Simplification and Analysis},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {8:1--8:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.8},
doi = {10.4230/LIPICS.SWAT.2016.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Eppstein16,
author = {David Eppstein},
title = {\emph{k}-Best Enumeration},
booktitle = {Encyclopedia of Algorithms},
pages = {1003--1006},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_733},
doi = {10.1007/978-1-4939-2864-4\_733},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGSU16,
author = {David Eppstein and
Mereke van Garderen and
Bettina Speckmann and
Torsten Ueckerdt},
title = {Convex-Arc Drawings of Pseudolines},
journal = {CoRR},
volume = {abs/1601.06865},
year = {2016},
url = {http://arxiv.org/abs/1601.06865},
eprinttype = {arXiv},
eprint = {1601.06865},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AronovBERS16,
author = {Boris Aronov and
Mark de Berg and
David Eppstein and
Marcel Roeloffzen and
Bettina Speckmann},
title = {Distance-Sensitive Planar Point Location},
journal = {CoRR},
volume = {abs/1602.00767},
year = {2016},
url = {http://arxiv.org/abs/1602.00767},
eprinttype = {arXiv},
eprint = {1602.00767},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AronovBERS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein16,
author = {David Eppstein},
title = {Cuckoo Filter: Simplification and Analysis},
journal = {CoRR},
volume = {abs/1604.06067},
year = {2016},
url = {http://arxiv.org/abs/1604.06067},
eprinttype = {arXiv},
eprint = {1604.06067},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGLMMT16,
author = {David Eppstein and
Michael T. Goodrich and
Jenny Lam and
Nil Mamano and
Michael Mitzenmacher and
Manuel R. Torres},
title = {Models and Algorithms for Graph Watermarking},
journal = {CoRR},
volume = {abs/1605.09425},
year = {2016},
url = {http://arxiv.org/abs/1605.09425},
eprinttype = {arXiv},
eprint = {1605.09425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGLMMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein16a,
author = {David Eppstein},
title = {Maximizing the Sum of Radii of Disjoint Balls or Disks},
journal = {CoRR},
volume = {abs/1607.02184},
year = {2016},
url = {http://arxiv.org/abs/1607.02184},
eprinttype = {arXiv},
eprint = {1607.02184},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VialDEG16,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
title = {Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection},
journal = {CoRR},
volume = {abs/1609.04512},
year = {2016},
url = {http://arxiv.org/abs/1609.04512},
eprinttype = {arXiv},
eprint = {1609.04512},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VialDEG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiniazBEMMS16,
author = {Ahmad Biniaz and
Prosenjit Bose and
David Eppstein and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
title = {Spanning Trees in Multipartite Geometric Graphs},
journal = {CoRR},
volume = {abs/1611.01661},
year = {2016},
url = {http://arxiv.org/abs/1611.01661},
eprinttype = {arXiv},
eprint = {1611.01661},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiniazBEMMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BergCCEK16,
author = {Mark de Berg and
Sergio Cabello and
Otfried Cheong and
David Eppstein and
Christian Knauer},
title = {Covering many points with a small-area box},
journal = {CoRR},
volume = {abs/1612.02149},
year = {2016},
url = {http://arxiv.org/abs/1612.02149},
eprinttype = {arXiv},
eprint = {1612.02149},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BergCCEK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BorradaileE15,
author = {Glencora Borradaile and
David Eppstein},
title = {Near-linear-time deterministic plane Steiner spanners for well-spaced
point sets},
journal = {Comput. Geom.},
volume = {49},
pages = {8--16},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2015.04.005},
doi = {10.1016/J.COMGEO.2015.04.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BorradaileE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BandeltCE15,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Victor Chepoi and
David Eppstein},
title = {Ramified Rectilinear Polygons: Coordinatization by Dendrons},
journal = {Discret. Comput. Geom.},
volume = {54},
number = {4},
pages = {771--797},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9743-5},
doi = {10.1007/S00454-015-9743-5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BandeltCE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Eppstein15,
author = {David Eppstein},
title = {K-Best Enumeration},
journal = {Bull. {EATCS}},
volume = {115},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/322},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Eppstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/EppsteinKSS15,
author = {David Eppstein and
Marc J. van Kreveld and
Bettina Speckmann and
Frank Staals},
title = {Improved Grid Map Layout by Point Set Matching},
journal = {Int. J. Comput. Geom. Appl.},
volume = {25},
number = {2},
pages = {101--122},
year = {2015},
url = {https://doi.org/10.1142/S0218195915500077},
doi = {10.1142/S0218195915500077},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/EppsteinKSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorradaileEZ15,
author = {Glencora Borradaile and
David Eppstein and
Pingan Zhu},
title = {Planar Induced Subgraphs of Sparse Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {281--297},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00358},
doi = {10.7155/JGAA.00358},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BorradaileEZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein15,
author = {David Eppstein},
title = {Metric Dimension Parameterized by Max Leaf Number},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {313--323},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00360},
doi = {10.7155/JGAA.00360},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterDEG15,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are
Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {619--656},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00349},
doi = {10.7155/JGAA.00349},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterDEG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/EppsteinW15,
author = {David Eppstein and
Veit Wiechert},
title = {Erratum to: Antimatroids and Balanced Pairs},
journal = {Order},
volume = {32},
number = {1},
pages = {145--146},
year = {2015},
url = {https://doi.org/10.1007/s11083-014-9335-7},
doi = {10.1007/S11083-014-9335-7},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/EppsteinW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AichholzerBDDEF15,
author = {Oswin Aichholzer and
Michael Biro and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
S{\'{a}}ndor P. Fekete and
Adam Hesterberg and
Irina Kostitsyna and
Christiane Schmidt},
title = {Folding Polyominoes into (Poly)Cubes},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/37.pdf},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AichholzerBDDEF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BokalCE15,
author = {Drago Bokal and
Sergio Cabello and
David Eppstein},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Finding All Maximal Subsequences with Hereditary Properties},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {240--254},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.240},
doi = {10.4230/LIPICS.SOCG.2015.240},
timestamp = {Wed, 16 Jun 2021 12:03:14 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BokalCE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DujmovicEW15,
author = {Vida Dujmovic and
David Eppstein and
David R. Wood},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {Genus, Treewidth, and Local Crossing Number},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {87--98},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_8},
doi = {10.1007/978-3-319-27261-0\_8},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/DujmovicEW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterBE15,
author = {Michael J. Bannister and
David A. Brown and
David Eppstein},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {Confluent Orthogonal Drawings of Syntax Diagrams},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {260--271},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_22},
doi = {10.1007/978-3-319-27261-0\_22},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterBE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BallingerDEFGH15,
author = {Brad Ballinger and
Mirela Damian and
David Eppstein and
Robin Y. Flatland and
Jessica Ginepro and
Thomas C. Hull},
editor = {Piotr Indyk},
title = {Minimum Forcing Sets for Miura Folding Patterns},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {136--147},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.11},
doi = {10.1137/1.9781611973730.11},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/BallingerDEFGH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Contact Graphs of Circular Arcs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {1--13},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_1},
doi = {10.1007/978-3-319-21840-3\_1},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein15,
author = {David Eppstein},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {The Parametric Closure Problem},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {327--338},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_27},
doi = {10.1007/978-3-319-21840-3\_27},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinMP15,
author = {David Eppstein and
J. Michael McCarthy and
Brian E. Parrish},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Rooted Cycle Bases},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {339--350},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_28},
doi = {10.1007/978-3-319-21840-3\_28},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DemaineEHILUU15,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {Folding a Paper Strip to Minimize Thickness},
booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
pages = {113--124},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5\_11},
doi = {10.1007/978-3-319-15612-5\_11},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/DemaineEHILUU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2015,
editor = {Ulrik Brandes and
David Eppstein},
title = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973754},
doi = {10.1137/1.9781611973754},
isbn = {978-1-61197-375-4},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamE0KPSU15,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael Kaufmann and
Stephen G. Kobourov and
Sergey Pupyrev and
Andr{\'{e}} Schulz and
Torsten Ueckerdt},
title = {Contact Representations of Sparse Planar Graphs},
journal = {CoRR},
volume = {abs/1501.00318},
year = {2015},
url = {http://arxiv.org/abs/1501.00318},
eprinttype = {arXiv},
eprint = {1501.00318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamE0KPSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein15,
author = {David Eppstein},
title = {D3-Reducible Graphs},
journal = {CoRR},
volume = {abs/1502.05334},
year = {2015},
url = {http://arxiv.org/abs/1502.05334},
eprinttype = {arXiv},
eprint = {1502.05334},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein15a,
author = {David Eppstein},
title = {The Parametric Closure Problem},
journal = {CoRR},
volume = {abs/1504.04073},
year = {2015},
url = {http://arxiv.org/abs/1504.04073},
eprinttype = {arXiv},
eprint = {1504.04073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinMP15,
author = {David Eppstein and
J. Michael McCarthy and
Brian E. Parrish},
title = {Rooted Cycle Bases},
journal = {CoRR},
volume = {abs/1504.04931},
year = {2015},
url = {http://arxiv.org/abs/1504.04931},
eprinttype = {arXiv},
eprint = {1504.04931},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein15b,
author = {David Eppstein},
title = {Metric Dimension Parameterized by Max Leaf Number},
journal = {CoRR},
volume = {abs/1506.01749},
year = {2015},
url = {http://arxiv.org/abs/1506.01749},
eprinttype = {arXiv},
eprint = {1506.01749},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DujmovicEW15,
author = {Vida Dujmovic and
David Eppstein and
David R. Wood},
title = {Genus, Treewidth, and Local Crossing Number},
journal = {CoRR},
volume = {abs/1506.04380},
year = {2015},
url = {http://arxiv.org/abs/1506.04380},
eprinttype = {arXiv},
eprint = {1506.04380},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DujmovicEW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterDDEW15,
author = {Michael J. Bannister and
William E. Devanny and
Vida Dujmovic and
David Eppstein and
David R. Wood},
title = {Track Layouts, Layered Path Decompositions, and Leveled Planarity},
journal = {CoRR},
volume = {abs/1506.09145},
year = {2015},
url = {http://arxiv.org/abs/1506.09145},
eprinttype = {arXiv},
eprint = {1506.09145},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterDDEW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinHS15,
author = {David Eppstein and
Sariel Har{-}Peled and
Anastasios Sidiropoulos},
title = {Approximate Greedy Clustering and Distance Selection for Graph Metrics},
journal = {CoRR},
volume = {abs/1507.01555},
year = {2015},
url = {http://arxiv.org/abs/1507.01555},
eprinttype = {arXiv},
eprint = {1507.01555},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterBE15,
author = {Michael J. Bannister and
David A. Brown and
David Eppstein},
title = {Confluent Orthogonal Drawings of Syntax Diagrams},
journal = {CoRR},
volume = {abs/1509.00818},
year = {2015},
url = {http://arxiv.org/abs/1509.00818},
eprinttype = {arXiv},
eprint = {1509.00818},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterBE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein15c,
author = {David Eppstein},
title = {Treetopes and their Graphs},
journal = {CoRR},
volume = {abs/1510.03152},
year = {2015},
url = {http://arxiv.org/abs/1510.03152},
eprinttype = {arXiv},
eprint = {1510.03152},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein15c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinH15,
author = {David Eppstein and
Daniel S. Hirschberg},
title = {From Discrepancy to Majority},
journal = {CoRR},
volume = {abs/1512.06488},
year = {2015},
url = {http://arxiv.org/abs/1512.06488},
eprinttype = {arXiv},
eprint = {1512.06488},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Eppstein14,
author = {David Eppstein},
title = {Grid Minors in Damaged Grids},
journal = {Electron. J. Comb.},
volume = {21},
number = {3},
pages = {3},
year = {2014},
url = {https://doi.org/10.37236/3872},
doi = {10.37236/3872},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein14,
author = {David Eppstein},
title = {A M{\"{o}}bius-Invariant Power Diagram and Its Applications to
Soap Bubbles and Planar Lombardi Drawing},
journal = {Discret. Comput. Geom.},
volume = {52},
number = {3},
pages = {515--550},
year = {2014},
url = {https://doi.org/10.1007/s00454-014-9627-0},
doi = {10.1007/S00454-014-9627-0},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ewc/Eppstein14,
author = {David Eppstein},
title = {Diamond-kite adaptive quadrilateral meshing},
journal = {Eng. Comput.},
volume = {30},
number = {2},
pages = {223--235},
year = {2014},
url = {https://doi.org/10.1007/s00366-013-0327-9},
doi = {10.1007/S00366-013-0327-9},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ewc/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterCDE14,
author = {Michael J. Bannister and
Zhanpeng Cheng and
William E. Devanny and
David Eppstein},
title = {Superpatterns and Universal Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {177--209},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00318},
doi = {10.7155/JGAA.00318},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterCDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein14,
author = {David Eppstein},
title = {Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {211--231},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00319},
doi = {10.7155/JGAA.00319},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniEFKLMTW14,
author = {Patrizio Angelini and
David Eppstein and
Fabrizio Frati and
Michael Kaufmann and
Sylvain Lazard and
Tamara Mchedlidze and
Monique Teillaud and
Alexander Wolff},
title = {Universal Point Sets for Drawing Planar Graphs with Circular Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {313--324},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00324},
doi = {10.7155/JGAA.00324},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniEFKLMTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/EppsteinM14,
author = {David Eppstein and
Elena Mumford},
title = {Steinitz Theorems for Simple Orthogonal Polyhedra},
journal = {J. Comput. Geom.},
volume = {5},
number = {1},
pages = {179--244},
year = {2014},
url = {https://doi.org/10.20382/jocg.v5i1a10},
doi = {10.20382/JOCG.V5I1A10},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/EppsteinM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/Eppstein14,
author = {David Eppstein},
title = {Antimatroids and Balanced Pairs},
journal = {Order},
volume = {31},
number = {1},
pages = {81--99},
year = {2014},
url = {https://doi.org/10.1007/s11083-013-9289-1},
doi = {10.1007/S11083-013-9289-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BannisterDE14,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Small Superpatterns for Dominance Drawing},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {92--103},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.9},
doi = {10.1137/1.9781611973204.9},
timestamp = {Tue, 23 May 2017 01:10:30 +0200},
biburl = {https://dblp.org/rec/conf/analco/BannisterDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BorradaileEZ14,
author = {Glencora Borradaile and
David Eppstein and
Pingan Zhu},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Planar Induced Subgraphs of Sparse Graphs},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {1--12},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_1},
doi = {10.1007/978-3-662-45803-7\_1},
timestamp = {Sun, 13 Nov 2022 09:57:27 +0100},
biburl = {https://dblp.org/rec/conf/gd/BorradaileEZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlamEGKP14,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Sergey Pupyrev},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Balanced Circle Packings for Planar Graphs},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {125--136},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_11},
doi = {10.1007/978-3-662-45803-7\_11},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AlamEGKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterDEG14,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions Are
Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {149--161},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_13},
doi = {10.1007/978-3-662-45803-7\_13},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterDEG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterE14,
author = {Michael J. Bannister and
David Eppstein},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Crossing Minimization for 1-page and 2-page Drawings of Graphs with
Bounded Treewidth},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {210--221},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_18},
doi = {10.1007/978-3-662-45803-7\_18},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AbelDDELU14,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Anna Lubiw and
Ryuhei Uehara},
editor = {Christian A. Duncan and
Antonios Symvonis},
title = {Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths},
booktitle = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
Germany, September 24-26, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {272--283},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45803-7\_23},
doi = {10.1007/978-3-662-45803-7\_23},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/AbelDDELU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChengE14,
author = {Zhanpeng Cheng and
David Eppstein},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Linear-Time Algorithms for Proportional Apportionment},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {581--592},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_46},
doi = {10.1007/978-3-319-13075-0\_46},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChengE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/EppsteinGMP14,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Pawel Pszona},
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs
into One Basket},
booktitle = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,
Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8504},
pages = {162--173},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2\_14},
doi = {10.1007/978-3-319-07959-2\_14},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/EppsteinGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGMP14,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Pawel Pszona},
title = {Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs
into One Basket},
journal = {CoRR},
volume = {abs/1404.0286},
year = {2014},
url = {http://arxiv.org/abs/1404.0286},
eprinttype = {arXiv},
eprint = {1404.0286},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterDEG14,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are
Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings},
journal = {CoRR},
volume = {abs/1408.1422},
year = {2014},
url = {http://arxiv.org/abs/1408.1422},
eprinttype = {arXiv},
eprint = {1408.1422},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterDEG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlamEGKP14,
author = {Md. Jawaherul Alam and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Sergey Pupyrev},
title = {Balanced Circle Packings for Planar Graphs},
journal = {CoRR},
volume = {abs/1408.4902},
year = {2014},
url = {http://arxiv.org/abs/1408.4902},
eprinttype = {arXiv},
eprint = {1408.4902},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlamEGKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorradaileEZ14,
author = {Glencora Borradaile and
David Eppstein and
Pingan Zhu},
title = {Planar Induced Subgraphs of Sparse Graphs},
journal = {CoRR},
volume = {abs/1408.5939},
year = {2014},
url = {http://arxiv.org/abs/1408.5939},
eprinttype = {arXiv},
eprint = {1408.5939},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorradaileEZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterE14,
author = {Michael J. Bannister and
David Eppstein},
title = {Crossing Minimization for 1-page and 2-page Drawings of Graphs with
Bounded Treewidth},
journal = {CoRR},
volume = {abs/1408.6321},
year = {2014},
url = {http://arxiv.org/abs/1408.6321},
eprinttype = {arXiv},
eprint = {1408.6321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbelDDELU14,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Anna Lubiw and
Ryuhei Uehara},
title = {Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths},
journal = {CoRR},
volume = {abs/1408.6771},
year = {2014},
url = {http://arxiv.org/abs/1408.6771},
eprinttype = {arXiv},
eprint = {1408.6771},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbelDDELU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChengE14,
author = {Zhanpeng Cheng and
David Eppstein},
title = {Linear-time Algorithms for Proportional Apportionment},
journal = {CoRR},
volume = {abs/1409.2603},
year = {2014},
url = {http://arxiv.org/abs/1409.2603},
eprinttype = {arXiv},
eprint = {1409.2603},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChengE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BallingerDEFGH14,
author = {Brad Ballinger and
Mirela Damian and
David Eppstein and
Robin Y. Flatland and
Jessica Ginepro and
Thomas C. Hull},
title = {Minimum Forcing Sets for Miura Folding Patterns},
journal = {CoRR},
volume = {abs/1410.2231},
year = {2014},
url = {http://arxiv.org/abs/1410.2231},
eprinttype = {arXiv},
eprint = {1410.2231},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BallingerDEFGH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineEHILUU14,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Folding a Paper Strip to Minimize Thickness},
journal = {CoRR},
volume = {abs/1411.6371},
year = {2014},
url = {http://arxiv.org/abs/1411.6371},
eprinttype = {arXiv},
eprint = {1411.6371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineEHILUU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorradaileENW14,
author = {Glencora Borradaile and
David Eppstein and
Amir Nayyeri and
Christian Wulff{-}Nilsen},
title = {All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs},
journal = {CoRR},
volume = {abs/1411.7055},
year = {2014},
url = {http://arxiv.org/abs/1411.7055},
eprinttype = {arXiv},
eprint = {1411.7055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorradaileENW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterDE14,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein},
title = {ERGMs are Hard},
journal = {CoRR},
volume = {abs/1412.1787},
year = {2014},
url = {http://arxiv.org/abs/1412.1787},
eprinttype = {arXiv},
eprint = {1412.1787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein14,
author = {David Eppstein},
title = {{\textdollar}k{\textdollar}-best enumeration},
journal = {CoRR},
volume = {abs/1412.5075},
year = {2014},
url = {http://arxiv.org/abs/1412.5075},
eprinttype = {arXiv},
eprint = {1412.5075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DuncanEGKN13,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
title = {Drawing Trees with Perfect Angular Resolution and Polynomial Area},
journal = {Discret. Comput. Geom.},
volume = {49},
number = {2},
pages = {157--182},
year = {2013},
url = {https://doi.org/10.1007/s00454-012-9472-y},
doi = {10.1007/S00454-012-9472-Y},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/DuncanEGKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinL13,
author = {David Eppstein and
Maarten L{\"{o}}ffler},
title = {Bounds on the Complexity of Halfspace Intersections when the Bounded
Faces have Small Dimension},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {1},
pages = {1--21},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9503-3},
doi = {10.1007/S00454-013-9503-3},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/BarequetDEHV13,
author = {Gill Barequet and
Matthew Dickerson and
David Eppstein and
David Hodorkovsky and
Kira Vyatkina},
title = {On 2-Site Voronoi Diagrams Under Geometric Distance Functions},
journal = {J. Comput. Sci. Technol.},
volume = {28},
number = {2},
pages = {267--277},
year = {2013},
url = {https://doi.org/10.1007/s11390-013-1328-2},
doi = {10.1007/S11390-013-1328-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcst/BarequetDEHV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EppsteinLS13,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Darren Strash},
title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2543629},
doi = {10.1145/2543629},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EppsteinLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein13,
author = {David Eppstein},
title = {The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {1},
pages = {35--55},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00283},
doi = {10.7155/JGAA.00283},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinLMN13,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Elena Mumford and
Martin N{\"{o}}llenburg},
title = {Optimal 3D Angular Resolution for Low-Degree Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {173--200},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00290},
doi = {10.7155/JGAA.00290},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinLMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChambersE13,
author = {Erin W. Chambers and
David Eppstein},
title = {Flows in One-Crossing-Minor-Free Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {201--220},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00291},
doi = {10.7155/JGAA.00291},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChambersE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinS13,
author = {David Eppstein and
Joseph A. Simons},
title = {Confluent Hasse Diagrams},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {7},
pages = {689--710},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00312},
doi = {10.7155/JGAA.00312},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EppsteinGLST13,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler and
Darren Strash and
Lowell Trott},
title = {Category-based routing in social networks: Membership dimension and
the small-world phenomenon},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {96--104},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.04.027},
doi = {10.1016/J.TCS.2013.04.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EppsteinGLST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apvis/EppsteinKSS13,
author = {David Eppstein and
Marc J. van Kreveld and
Bettina Speckmann and
Frank Staals},
editor = {Sheelagh Carpendale and
Wei Chen and
Seok{-}Hee Hong},
title = {Improved grid map layout by point set matching},
booktitle = {{IEEE} Pacific Visualization Symposium, PacificVis 2013, February
27 2013-March 1, 2013, Sydney, NSW, Australia},
pages = {25--32},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/PacificVis.2013.6596124},
doi = {10.1109/PACIFICVIS.2013.6596124},
timestamp = {Thu, 27 Apr 2023 14:57:18 +0200},
biburl = {https://dblp.org/rec/conf/apvis/EppsteinKSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AngeliniEFKLMTW13,
author = {Patrizio Angelini and
David Eppstein and
Fabrizio Frati and
Michael Kaufmann and
Sylvain Lazard and
Tamara Mchedlidze and
Monique Teillaud and
Alexander Wolff},
title = {Universal Point Sets for Planar Graph Drawings with Circular Arcs},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_43.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AngeliniEFKLMTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/EppsteinGS13,
author = {David Eppstein and
Michael T. Goodrich and
Joseph A. Simons},
title = {Set-Difference Range Queries},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_4.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/EppsteinGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein13,
author = {David Eppstein},
editor = {Guilherme Dias da Fonseca and
Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and
Timothy M. Chan and
Rolf Klein},
title = {The graphs of planar soap bubbles},
booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
Brazil, June 17-20, 2013},
pages = {27--36},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2462356.2462370},
doi = {10.1145/2462356.2462370},
timestamp = {Mon, 14 Jun 2021 16:24:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterCDE13,
author = {Michael J. Bannister and
Zhanpeng Cheng and
William E. Devanny and
David Eppstein},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Superpatterns and Universal Point Sets},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {208--219},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_19},
doi = {10.1007/978-3-319-03841-4\_19},
timestamp = {Sun, 13 Nov 2022 09:57:27 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterCDE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterES13,
author = {Michael J. Bannister and
David Eppstein and
Joseph A. Simons},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Fixed Parameter Tractability of Crossing Minimization of Almost-Trees},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {340--351},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_30},
doi = {10.1007/978-3-319-03841-4\_30},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinHLNSV13,
author = {David Eppstein and
Danny Holten and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Bettina Speckmann and
Kevin Verbeek},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Strict Confluent Drawing},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {352--363},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_31},
doi = {10.1007/978-3-319-03841-4\_31},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gd/EppsteinHLNSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein13,
author = {David Eppstein},
editor = {Stephen K. Wismath and
Alexander Wolff},
title = {Drawing Arrangement Graphs in Small Grids, or How to Play Planarity},
booktitle = {Graph Drawing - 21st International Symposium, {GD} 2013, Bordeaux,
France, September 23-25, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8242},
pages = {436--447},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03841-4\_38},
doi = {10.1007/978-3-319-03841-4\_38},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BannisterDES13,
author = {Michael J. Bannister and
Christopher DuBois and
David Eppstein and
Padhraic Smyth},
editor = {Sanjeev Khanna},
title = {Windows into Relational Events: Data Structures for Contiguous Subsequences
of Edges},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {856--864},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.61},
doi = {10.1137/1.9781611973105.61},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/BannisterDES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BannisterCE13,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parameterized Complexity of 1-Planarity},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {97--108},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_9},
doi = {10.1007/978-3-642-40104-6\_9},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BannisterCE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinGH13,
author = {David Eppstein and
Michael T. Goodrich and
Daniel S. Hirschberg},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Combinatorial Pair Testing: Distinguishing Workers from Slackers},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {316--327},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_28},
doi = {10.1007/978-3-642-40104-6\_28},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/Eppstein13,
author = {David Eppstein},
editor = {Jean{-}Claude Falmagne and
Dietrich Albert and
Christopher Doble and
David Eppstein and
Xiangen Hu},
title = {Learning Sequences: An Efficient Data Structure for Learning Spaces},
booktitle = {Knowledge Spaces, Applications in Education},
pages = {287--304},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35329-1\_13},
doi = {10.1007/978-3-642-35329-1\_13},
timestamp = {Mon, 29 May 2017 13:41:07 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/Eppstein13a,
author = {David Eppstein},
editor = {Jean{-}Claude Falmagne and
Dietrich Albert and
Christopher Doble and
David Eppstein and
Xiangen Hu},
title = {Projection, Decomposition, and Adaption of Learning Spaces},
booktitle = {Knowledge Spaces, Applications in Education},
pages = {305--322},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35329-1\_14},
doi = {10.1007/978-3-642-35329-1\_14},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/Eppstein13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0035378,
editor = {Jean{-}Claude Falmagne and
Dietrich Albert and
Christopher Doble and
David Eppstein and
Xiangen Hu},
title = {Knowledge Spaces, Applications in Education},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35329-1},
doi = {10.1007/978-3-642-35329-1},
isbn = {978-3-642-35328-4},
timestamp = {Mon, 29 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0035378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1136,
author = {David Eppstein},
title = {Grid Minors in Damaged Grids},
journal = {CoRR},
volume = {abs/1303.1136},
year = {2013},
url = {http://arxiv.org/abs/1303.1136},
eprinttype = {arXiv},
eprint = {1303.1136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5591,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
title = {Parameterized Complexity of 1-Planarity},
journal = {CoRR},
volume = {abs/1304.5591},
year = {2013},
url = {http://arxiv.org/abs/1304.5591},
eprinttype = {arXiv},
eprint = {1304.5591},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0110,
author = {David Eppstein and
Michael T. Goodrich and
Daniel S. Hirschberg},
title = {Combinatorial Pair Testing: Distinguishing Workers from Slackers},
journal = {CoRR},
volume = {abs/1305.0110},
year = {2013},
url = {http://arxiv.org/abs/1305.0110},
eprinttype = {arXiv},
eprint = {1305.0110},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0110.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGS13,
author = {David Eppstein and
Michael T. Goodrich and
Joseph A. Simons},
title = {Set-Difference Range Queries},
journal = {CoRR},
volume = {abs/1306.3482},
year = {2013},
url = {http://arxiv.org/abs/1306.3482},
eprinttype = {arXiv},
eprint = {1306.3482},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Eppstein13,
author = {David Eppstein},
title = {Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity},
journal = {CoRR},
volume = {abs/1308.0066},
year = {2013},
url = {http://arxiv.org/abs/1308.0066},
eprinttype = {arXiv},
eprint = {1308.0066},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterCDE13,
author = {Michael J. Bannister and
Zhanpeng Cheng and
William E. Devanny and
David Eppstein},
title = {Superpatterns and Universal Point Sets},
journal = {CoRR},
volume = {abs/1308.0403},
year = {2013},
url = {http://arxiv.org/abs/1308.0403},
eprinttype = {arXiv},
eprint = {1308.0403},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterCDE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterES13,
author = {Michael J. Bannister and
David Eppstein and
Joseph A. Simons},
title = {Fixed parameter tractability of crossing minimization of almost-trees},
journal = {CoRR},
volume = {abs/1308.5741},
year = {2013},
url = {http://arxiv.org/abs/1308.5741},
eprinttype = {arXiv},
eprint = {1308.5741},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterES13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinHLNSV13,
author = {David Eppstein and
Danny Holten and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Bettina Speckmann and
Kevin Verbeek},
title = {Strict Confluent Drawing},
journal = {CoRR},
volume = {abs/1308.6824},
year = {2013},
url = {http://arxiv.org/abs/1308.6824},
eprinttype = {arXiv},
eprint = {1308.6824},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinHLNSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BannisterDE13,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein},
title = {Small Superpatterns for Dominance Drawing},
journal = {CoRR},
volume = {abs/1310.3770},
year = {2013},
url = {http://arxiv.org/abs/1310.3770},
eprinttype = {arXiv},
eprint = {1310.3770},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BannisterDE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DuncanEGKN12,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
title = {Lombardi Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {85--108},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00251},
doi = {10.7155/JGAA.00251},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DuncanEGKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChambersEGL12,
author = {Erin W. Chambers and
David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
title = {Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial
Area},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {243--259},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00257},
doi = {10.7155/JGAA.00257},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChambersEGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinS12,
author = {David Eppstein and
Emma S. Spiro},
title = {The h-Index of a Graph and its Application to Dynamic Subgraph Statistics},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {543--567},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00273},
doi = {10.7155/JGAA.00273},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterES12,
author = {Michael J. Bannister and
David Eppstein and
Joseph A. Simons},
title = {Inapproximability of Orthogonal Compaction},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {651--673},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00263},
doi = {10.7155/JGAA.00263},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterES12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinMSV12,
author = {David Eppstein and
Elena Mumford and
Bettina Speckmann and
Kevin Verbeek},
title = {Area-Universal and Constrained Rectangular Layouts},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {3},
pages = {537--564},
year = {2012},
url = {https://doi.org/10.1137/110834032},
doi = {10.1137/110834032},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinMSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EppsteinGST12,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash and
Lowell Trott},
title = {Extended dynamic subgraph statistics using h-index parameterized data
structures},
journal = {Theor. Comput. Sci.},
volume = {447},
pages = {44--52},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.11.034},
doi = {10.1016/J.TCS.2011.11.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EppsteinGST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BannisterE12,
author = {Michael J. Bannister and
David Eppstein},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Randomized Speedup of the Bellman-Ford Algorithm},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {41--47},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.6},
doi = {10.1137/1.9781611973020.6},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/BannisterE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BorradaileE12,
author = {Glencora Borradaile and
David Eppstein},
title = {Near-Linear-Time Deterministic Plane Steiner Spanners and {TSP} Approximation
for Well-Spaced Point Sets},
booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry,
{CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
2012},
pages = {297--302},
year = {2012},
url = {http://2012.cccg.ca/papers/paper41.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BorradaileE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Eppstein12,
author = {David Eppstein},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Solving Single-Digit Sudoku Subproblems},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {142--153},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_16},
doi = {10.1007/978-3-642-30347-0\_16},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/Eppstein12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein12,
author = {David Eppstein},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {Planar Lombardi Drawings for Subcubic Graphs},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {126--137},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_12},
doi = {10.1007/978-3-642-36763-2\_12},
timestamp = {Sun, 13 Nov 2022 09:57:28 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BrandenburgEGGHR12,
author = {Franz{-}Josef Brandenburg and
David Eppstein and
Andreas Glei{\ss}ner and
Michael T. Goodrich and
Kathrin Hanauer and
Josef Reislhuber},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {On the Density of Maximal 1-Planar Graphs},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {327--338},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_29},
doi = {10.1007/978-3-642-36763-2\_29},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BrandenburgEGGHR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterEGT12,
author = {Michael J. Bannister and
David Eppstein and
Michael T. Goodrich and
Lowell Trott},
editor = {Walter Didimo and
Maurizio Patrignani},
title = {Force-Directed Graph Drawing Using Social Gravity and Scaling},
booktitle = {Graph Drawing - 20th International Symposium, {GD} 2012, Redmond,
WA, USA, September 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7704},
pages = {414--425},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-36763-2\_37},
doi = {10.1007/978-3-642-36763-2\_37},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterEGT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imr/Eppstein12,
author = {David Eppstein},
editor = {Xiangmin Jiao and
Jean{-}Christophe Weill},
title = {Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal
Circle Packing},
booktitle = {Proceedings of the 21st International Meshing Roundtable, {IMR} 2012,
October 7-10, 2012, San Jose, CA, {USA}},
pages = {261--277},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33573-0\_16},
doi = {10.1007/978-3-642-33573-0\_16},
timestamp = {Thu, 15 Jun 2017 21:35:13 +0200},
biburl = {https://dblp.org/rec/conf/imr/Eppstein12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iros/YehTEA12,
author = {Hsin{-}Yi Yeh and
Shawna L. Thomas and
David Eppstein and
Nancy M. Amato},
title = {{UOBPRM:} {A} uniformly distributed obstacle-based {PRM}},
booktitle = {2012 {IEEE/RSJ} International Conference on Intelligent Robots and
Systems, {IROS} 2012, Vilamoura, Algarve, Portugal, October 7-12,
2012},
pages = {2655--2662},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/IROS.2012.6385875},
doi = {10.1109/IROS.2012.6385875},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/iros/YehTEA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5074,
author = {David Eppstein},
title = {Solving Single-digit Sudoku Subproblems},
journal = {CoRR},
volume = {abs/1202.5074},
year = {2012},
url = {http://arxiv.org/abs/1202.5074},
eprinttype = {arXiv},
eprint = {1202.5074},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-2254,
author = {Glencora Borradaile and
David Eppstein},
title = {Near-Linear-Time Deterministic Plane Steiner Spanners and {TSP} Approximation
for Well-Spaced Point Sets},
journal = {CoRR},
volume = {abs/1206.2254},
year = {2012},
url = {http://arxiv.org/abs/1206.2254},
eprinttype = {arXiv},
eprint = {1206.2254},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-2254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-6142,
author = {David Eppstein},
title = {Planar Lombardi Drawings for Subcubic Graphs},
journal = {CoRR},
volume = {abs/1206.6142},
year = {2012},
url = {http://arxiv.org/abs/1206.6142},
eprinttype = {arXiv},
eprint = {1206.6142},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-6142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-3761,
author = {David Eppstein},
title = {The Graphs of Planar Soap Bubbles},
journal = {CoRR},
volume = {abs/1207.3761},
year = {2012},
url = {http://arxiv.org/abs/1207.3761},
eprinttype = {arXiv},
eprint = {1207.3761},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-3761.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5082,
author = {David Eppstein},
title = {Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal
Circle Packing},
journal = {CoRR},
volume = {abs/1207.5082},
year = {2012},
url = {http://arxiv.org/abs/1207.5082},
eprinttype = {arXiv},
eprint = {1207.5082},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-0748,
author = {Michael J. Bannister and
David Eppstein and
Michael T. Goodrich and
Lowell Trott},
title = {Force-Directed Graph Drawing Using Social Gravity and Scaling},
journal = {CoRR},
volume = {abs/1209.0748},
year = {2012},
url = {http://arxiv.org/abs/1209.0748},
eprinttype = {arXiv},
eprint = {1209.0748},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-0748.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-5791,
author = {Michael J. Bannister and
Christopher DuBois and
David Eppstein and
Padhraic Smyth},
title = {Windows into Relational Events: Data Structures for Contiguous Subsequences
of Edges},
journal = {CoRR},
volume = {abs/1209.5791},
year = {2012},
url = {http://arxiv.org/abs/1209.5791},
eprinttype = {arXiv},
eprint = {1209.5791},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-5791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CabelloEK11,
author = {Sergio Cabello and
David Eppstein and
Sandi Klavzar},
title = {The Fibonacci Dimension of a Graph},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/542},
doi = {10.37236/542},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CabelloEK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinG11,
author = {David Eppstein and
Emden R. Gansner},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {3--5},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00214},
doi = {10.7155/JGAA.00214},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein11,
author = {David Eppstein},
title = {Recognizing Partial Cubes in Quadratic Time},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {269--293},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00226},
doi = {10.7155/JGAA.00226},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinW11,
author = {David Eppstein and
Kevin A. Wortman},
title = {Optimal Angular Resolution for Face-Symmetric Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {4},
pages = {551--564},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00238},
doi = {10.7155/JGAA.00238},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Eppstein11,
author = {David Eppstein},
title = {Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight
Span Construction},
journal = {J. Comput. Geom.},
volume = {2},
number = {1},
pages = {144--182},
year = {2011},
url = {https://doi.org/10.20382/jocg.v2i1a8},
doi = {10.20382/JOCG.V2I1A8},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Eppstein11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/EppsteinG11,
author = {David Eppstein and
Michael T. Goodrich},
title = {Succinct Greedy Geometric Routing Using Hyperbolic Geometry},
journal = {{IEEE} Trans. Computers},
volume = {60},
number = {11},
pages = {1571--1580},
year = {2011},
url = {https://doi.org/10.1109/TC.2010.257},
doi = {10.1109/TC.2010.257},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/EppsteinG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/EppsteinG11,
author = {David Eppstein and
Michael T. Goodrich},
title = {Straggler Identification in Round-Trip Data Streams via Newton's Identities
and Invertible Bloom Filters},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {23},
number = {2},
pages = {297--306},
year = {2011},
url = {https://doi.org/10.1109/TKDE.2010.132},
doi = {10.1109/TKDE.2010.132},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkde/EppsteinG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cason/EppsteinGLST11,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler and
Darren Strash and
Lowell Trott},
title = {Category-based routing in social networks: Membership dimension and
the small-world phenomenon},
booktitle = {International Conference on Computational Aspects of Social Networks,
CASoN 2011, Salamanca, Spain, October 19-21, 2011},
pages = {102--107},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/CASON.2011.6085926},
doi = {10.1109/CASON.2011.6085926},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/cason/EppsteinGLST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinL11,
author = {David Eppstein and
Maarten L{\"{o}}ffler},
editor = {Ferran Hurtado and
Marc J. van Kreveld},
title = {Bounds on the complexity of halfspace intersections when the bounded
faces have small dimension},
booktitle = {Proceedings of the 27th {ACM} Symposium on Computational Geometry,
Paris, France, June 13-15, 2011},
pages = {361--369},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1998196.1998257},
doi = {10.1145/1998196.1998257},
timestamp = {Mon, 14 Jun 2021 16:24:49 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinS11,
author = {David Eppstein and
Joseph A. Simons},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Confluent Hasse Diagrams},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {2--13},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_2},
doi = {10.1007/978-3-642-25878-7\_2},
timestamp = {Tue, 07 May 2024 20:06:26 +0200},
biburl = {https://dblp.org/rec/conf/gd/EppsteinS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DuncanEGKL11,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Maarten L{\"{o}}ffler},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Planar and Poly-arc Lombardi Drawings},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {308--319},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_30},
doi = {10.1007/978-3-642-25878-7\_30},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DuncanEGKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BannisterE11,
author = {Michael J. Bannister and
David Eppstein},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Hardness of Approximate Compaction for Nonplanar Orthogonal Graph
Drawings},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {367--378},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_35},
doi = {10.1007/978-3-642-25878-7\_35},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BannisterE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isvd/BarequetDEHV11,
author = {Gill Barequet and
Matthew T. Dickerson and
David Eppstein and
David Hodorkovsky and
Kira Vyatkina},
editor = {Fran{\c{c}}ois Anton and
Wenping Wang},
title = {On 2-Site Voronoi Diagrams under Geometric Distance Functions},
booktitle = {Eighth International Symposium on Voronoi Diagrams in Science and
Engineering, {ISVD} 2011, Qingdao, China, June 28-30, 2011},
pages = {31--38},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/ISVD.2011.13},
doi = {10.1109/ISVD.2011.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isvd/BarequetDEHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/EppsteinGUV11,
author = {David Eppstein and
Michael T. Goodrich and
Frank C. Uyeda and
George Varghese},
editor = {Srinivasan Keshav and
J{\"{o}}rg Liebeherr and
John W. Byers and
Jeffrey C. Mogul},
title = {What's the difference?: efficient set reconciliation without prior
context},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 2011 Conference on Applications,
Technologies, Architectures, and Protocols for Computer Communications,
Toronto, ON, Canada, August 15-19, 2011},
pages = {218--229},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2018436.2018462},
doi = {10.1145/2018436.2018462},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/EppsteinGUV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BuchinELNS11,
author = {Kevin Buchin and
David Eppstein and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Rodrigo I. Silveira},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Adjacency-Preserving Spatial Treemaps},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {159--170},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_14},
doi = {10.1007/978-3-642-22300-6\_14},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BuchinELNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinGL11,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Tracking Moving Objects with Few Handovers},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {362--373},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_31},
doi = {10.1007/978-3-642-22300-6\_31},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/EppsteinS11,
author = {David Eppstein and
Darren Strash},
editor = {Panos M. Pardalos and
Steffen Rebennack},
title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
booktitle = {Experimental Algorithms - 10th International Symposium, {SEA} 2011,
Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6630},
pages = {364--375},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20662-7\_31},
doi = {10.1007/978-3-642-20662-7\_31},
timestamp = {Mon, 05 Feb 2024 20:31:36 +0100},
biburl = {https://dblp.org/rec/conf/wea/EppsteinS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-0318,
author = {David Eppstein and
Darren Strash},
title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
journal = {CoRR},
volume = {abs/1103.0318},
year = {2011},
url = {http://arxiv.org/abs/1103.0318},
eprinttype = {arXiv},
eprint = {1103.0318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-0318.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2575,
author = {David Eppstein and
Maarten L{\"{o}}ffler},
title = {Bounds on the Complexity of Halfspace Intersections when the Bounded
Faces have Small Dimension},
journal = {CoRR},
volume = {abs/1103.2575},
year = {2011},
url = {http://arxiv.org/abs/1103.2575},
eprinttype = {arXiv},
eprint = {1103.2575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-2575.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0392,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
title = {Tracking Moving Objects with Few Handovers},
journal = {CoRR},
volume = {abs/1105.0392},
year = {2011},
url = {http://arxiv.org/abs/1105.0392},
eprinttype = {arXiv},
eprint = {1105.0392},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0392.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0398,
author = {Kevin Buchin and
David Eppstein and
Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Rodrigo I. Silveira},
title = {Adjacency-Preserving Spatial Treemaps},
journal = {CoRR},
volume = {abs/1105.0398},
year = {2011},
url = {http://arxiv.org/abs/1105.0398},
eprinttype = {arXiv},
eprint = {1105.0398},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-4130,
author = {Gill Barequet and
Matthew T. Dickerson and
David Eppstein and
David Hodorkovsky and
Kira Vyatkina},
title = {On 2-Site Voronoi Diagrams under Geometric Distance Functions},
journal = {CoRR},
volume = {abs/1105.4130},
year = {2011},
url = {http://arxiv.org/abs/1105.4130},
eprinttype = {arXiv},
eprint = {1105.4130},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-4130.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3593,
author = {David Eppstein and
Michael T. Goodrich and
Pierre Baldi},
title = {Privacy-Enhanced Methods for Comparing Compressed {DNA} Sequences},
journal = {CoRR},
volume = {abs/1107.3593},
year = {2011},
url = {http://arxiv.org/abs/1107.3593},
eprinttype = {arXiv},
eprint = {1107.3593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-4675,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler and
Darren Strash and
Lowell Trott},
title = {Category-Based Routing in Social Networks: Membership Dimension and
the Small-World Phenomenon (Short)},
journal = {CoRR},
volume = {abs/1108.4675},
year = {2011},
url = {http://arxiv.org/abs/1108.4675},
eprinttype = {arXiv},
eprint = {1108.4675},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-4675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-4705,
author = {Michael J. Bannister and
David Eppstein},
title = {Hardness of Approximate Compaction for Nonplanar Orthogonal Graph
Drawings},
journal = {CoRR},
volume = {abs/1108.4705},
year = {2011},
url = {http://arxiv.org/abs/1108.4705},
eprinttype = {arXiv},
eprint = {1108.4705},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-4705.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-5361,
author = {David Eppstein and
Joseph A. Simons},
title = {Confluent Hasse diagrams},
journal = {CoRR},
volume = {abs/1108.5361},
year = {2011},
url = {http://arxiv.org/abs/1108.5361},
eprinttype = {arXiv},
eprint = {1108.5361},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-5361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-0345,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Maarten L{\"{o}}ffler},
title = {Planar and Poly-Arc Lombardi Drawings},
journal = {CoRR},
volume = {abs/1109.0345},
year = {2011},
url = {http://arxiv.org/abs/1109.0345},
eprinttype = {arXiv},
eprint = {1109.0345},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-0345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4499,
author = {David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler and
Darren Strash and
Lowell Trott},
title = {Category-Based Routing in Social Networks: Membership Dimension and
the Small-World Phenomenon (Full)},
journal = {CoRR},
volume = {abs/1110.4499},
year = {2011},
url = {http://arxiv.org/abs/1110.4499},
eprinttype = {arXiv},
eprint = {1110.4499},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4499.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-5414,
author = {Michael J. Bannister and
David Eppstein},
title = {Randomized Speedup of the Bellman-Ford Algorithm},
journal = {CoRR},
volume = {abs/1111.5414},
year = {2011},
url = {http://arxiv.org/abs/1111.5414},
eprinttype = {arXiv},
eprint = {1111.5414},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-5414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Eppstein10,
author = {David Eppstein},
title = {Densities of Minor-Closed Graph Families},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/408},
doi = {10.37236/408},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/AugustineEW10,
author = {John Augustine and
David Eppstein and
Kevin A. Wortman},
title = {Approximate Weighted Farthest Neighbors and Minimum Dilation Stars},
journal = {Discret. Math. Algorithms Appl.},
volume = {2},
number = {4},
pages = {553--566},
year = {2010},
url = {https://doi.org/10.1142/S1793830910000887},
doi = {10.1142/S1793830910000887},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/AugustineEW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Eppstein10,
author = {David Eppstein},
title = {Happy Endings for Flip Graphs},
journal = {J. Comput. Geom.},
volume = {1},
number = {1},
pages = {3--28},
year = {2010},
url = {https://doi.org/10.20382/jocg.v1i1a2},
doi = {10.20382/JOCG.V1I1A2},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGS10,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash},
title = {Linear-Time Algorithms for Geometric Graphs with Sublinearly Many
Edge Crossings},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3814--3829},
year = {2010},
url = {https://doi.org/10.1137/090759112},
doi = {10.1137/090759112},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BandeltCE10,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Victor Chepoi and
David Eppstein},
title = {Combinatorics and Geometry of Finite and Infinite Squaregraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1399--1440},
year = {2010},
url = {https://doi.org/10.1137/090760301},
doi = {10.1137/090760301},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BandeltCE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/ClarkeEGRSSSV10,
author = {Dave Clarke and
David Eppstein and
Kaveh Ghasemloo and
Lev Reyzin and
Andr{\'{a}}s Z. Salamon and
Peter W. Shor and
Aaron D. Sterling and
Suresh Venkatasubramanian},
title = {Questions answered. in theory.: http://cstheory.stackexchange.com/},
journal = {{SIGACT} News},
volume = {41},
number = {4},
pages = {58--60},
year = {2010},
url = {https://doi.org/10.1145/1907450.1907532},
doi = {10.1145/1907450.1907532},
timestamp = {Wed, 06 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/ClarkeEGRSSSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Eppstein10,
author = {David Eppstein},
title = {Regular labelings and geometric structures},
booktitle = {Proceedings of the 22nd Annual Canadian Conference on Computational
Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
pages = {125--130},
year = {2010},
url = {http://cccg.ca/proceedings/2010/paper35.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/EppsteinGST10,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash and
Lowell Trott},
editor = {Weili Wu and
Ovidiu Daescu},
title = {Extended Dynamic Subgraph Statistics Using \emph{h}-Index Parameterized
Data Structures},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6508},
pages = {128--141},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17458-2\_12},
doi = {10.1007/978-3-642-17458-2\_12},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/EppsteinGST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AugustineEW10,
author = {John Augustine and
David Eppstein and
Kevin A. Wortman},
editor = {My T. Thai and
Sartaj Sahni},
title = {Approximate Weighted Farthest Neighbors and Minimum Dilation Stars},
booktitle = {Computing and Combinatorics, 16th Annual International Conference,
{COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6196},
pages = {90--99},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14031-0\_12},
doi = {10.1007/978-3-642-14031-0\_12},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AugustineEW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinM10,
author = {David Eppstein and
Elena Mumford},
editor = {David G. Kirkpatrick and
Joseph S. B. Mitchell},
title = {Steinitz theorems for orthogonal polyhedra},
booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
Snowbird, Utah, USA, June 13-16, 2010},
pages = {429--438},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810959.1811030},
doi = {10.1145/1810959.1811030},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DickersonEG10,
author = {Matthew T. Dickerson and
David Eppstein and
Michael T. Goodrich},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Cloning Voronoi Diagrams via Retroactive Data Structures},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {362--373},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_31},
doi = {10.1007/978-3-642-15775-2\_31},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DickersonEG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ChambersEGL10,
author = {Erin W. Chambers and
David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial
Area},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {129--140},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_12},
doi = {10.1007/978-3-642-18469-7\_12},
timestamp = {Sun, 13 Nov 2022 09:57:29 +0100},
biburl = {https://dblp.org/rec/conf/gd/ChambersEGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DuncanEGKN10,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Drawing Trees with Perfect Angular Resolution and Polynomial Area},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {183--194},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_17},
doi = {10.1007/978-3-642-18469-7\_17},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DuncanEGKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DuncanEGKN10a,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Lombardi Drawings of Graphs},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {195--207},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_18},
doi = {10.1007/978-3-642-18469-7\_18},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DuncanEGKN10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinLMN10,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Elena Mumford and
Martin N{\"{o}}llenburg},
editor = {Ulrik Brandes and
Sabine Cornelsen},
title = {Optimal 3D Angular Resolution for Low-Degree Graphs},
booktitle = {Graph Drawing - 18th International Symposium, {GD} 2010, Konstanz,
Germany, September 21-24, 2010. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6502},
pages = {208--219},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18469-7\_19},
doi = {10.1007/978-3-642-18469-7\_19},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/EppsteinLMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/EppsteinGT10,
author = {David Eppstein and
Michael T. Goodrich and
Roberto Tamassia},
editor = {Divyakant Agrawal and
Pusheng Zhang and
Amr El Abbadi and
Mohamed F. Mokbel},
title = {Privacy-preserving data-oblivious geometric algorithms for geographic
data},
booktitle = {18th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic
Information Systems, {ACM-GIS} 2010, November 3-5, 2010, San Jose,
CA, USA, Proceedings},
pages = {13--22},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1869790.1869796},
doi = {10.1145/1869790.1869796},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/EppsteinGT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Eppstein10,
author = {David Eppstein},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Regular Labelings and Geometric Structures},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {1},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_1},
doi = {10.1007/978-3-642-17517-6\_1},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChambersE10,
author = {Erin W. Chambers and
David Eppstein},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Flows in One-Crossing-Minor-Free Graphs},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {241--252},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_23},
doi = {10.1007/978-3-642-17517-6\_23},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChambersE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EppsteinLS10,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Darren Strash},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {403--414},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_36},
doi = {10.1007/978-3-642-17517-6\_36},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EppsteinLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isvd/DickersonEW10,
author = {Matthew Dickerson and
David Eppstein and
Kevin A. Wortman},
editor = {Mir Abolfazl Mostafavi},
title = {Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance
and Dilation},
booktitle = {Seventh International Symposium on Voronoi Diagrams in Science and
Engineering, {ISVD} 2010, Quebec, Canada, June 28-30, 2010},
pages = {13--22},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ISVD.2010.12},
doi = {10.1109/ISVD.2010.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isvd/DickersonEW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein10,
author = {David Eppstein},
editor = {Moses Charikar},
title = {Paired Approximation Problems and Incompatible Inapproximabilities},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1076--1086},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.87},
doi = {10.1137/1.9781611973075.87},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/Eppstein10,
author = {David Eppstein},
editor = {Andrew Adamatzky},
title = {Growth and Decay in Life-Like Cellular Automata},
booktitle = {Game of Life Cellular Automata},
pages = {71--97},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-1-84996-217-9\_6},
doi = {10.1007/978-1-84996-217-9\_6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/p/Eppstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2009,
editor = {David Eppstein and
Emden R. Gansner},
title = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11805-0},
doi = {10.1007/978-3-642-11805-0},
isbn = {978-3-642-11804-3},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/EppsteinLS10,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Darren Strash},
editor = {Thore Husfeldt and
Dieter Kratsch and
Ramamohan Paturi and
Gregory B. Sorkin},
title = {Listing all maximal cliques in sparse graphs in near-optimal time},
booktitle = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10441},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2935/},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/EppsteinLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-1921,
author = {Matthew T. Dickerson and
David Eppstein and
Michael T. Goodrich},
title = {Cloning Voronoi Diagrams via Retroactive Data Structures},
journal = {CoRR},
volume = {abs/1006.1921},
year = {2010},
url = {http://arxiv.org/abs/1006.1921},
eprinttype = {arXiv},
eprint = {1006.1921},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-1921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-5440,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Darren Strash},
title = {Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time},
journal = {CoRR},
volume = {abs/1006.5440},
year = {2010},
url = {http://arxiv.org/abs/1006.5440},
eprinttype = {arXiv},
eprint = {1006.5440},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-5440.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0221,
author = {David Eppstein},
title = {Regular Labelings and Geometric Structures},
journal = {CoRR},
volume = {abs/1007.0221},
year = {2010},
url = {http://arxiv.org/abs/1007.0221},
eprinttype = {arXiv},
eprint = {1007.0221},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1484,
author = {Erin W. Chambers and
David Eppstein},
title = {Flows in One-Crossing-Minor-Free Graphs},
journal = {CoRR},
volume = {abs/1007.1484},
year = {2010},
url = {http://arxiv.org/abs/1007.1484},
eprinttype = {arXiv},
eprint = {1007.1484},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0045,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Elena Mumford and
Martin N{\"{o}}llenburg},
title = {Optimal 3D Angular Resolution for Low-Degree Graphs},
journal = {CoRR},
volume = {abs/1009.0045},
year = {2010},
url = {http://arxiv.org/abs/1009.0045},
eprinttype = {arXiv},
eprint = {1009.0045},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0088,
author = {Erin W. Chambers and
David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
title = {Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial
Area},
journal = {CoRR},
volume = {abs/1009.0088},
year = {2010},
url = {http://arxiv.org/abs/1009.0088},
eprinttype = {arXiv},
eprint = {1009.0088},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0088.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0579,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
title = {Lombardi Drawings of Graphs},
journal = {CoRR},
volume = {abs/1009.0579},
year = {2010},
url = {http://arxiv.org/abs/1009.0579},
eprinttype = {arXiv},
eprint = {1009.0579},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0579.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0581,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
title = {Drawing Trees with Perfect Angular Resolution and Polynomial Area},
journal = {CoRR},
volume = {abs/1009.0581},
year = {2010},
url = {http://arxiv.org/abs/1009.0581},
eprinttype = {arXiv},
eprint = {1009.0581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0783,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash and
Lowell Trott},
title = {Extended h-Index Parameterized Data Structures for Computing Dynamic
Subgraph Statistics},
journal = {CoRR},
volume = {abs/1009.0783},
year = {2010},
url = {http://arxiv.org/abs/1009.0783},
eprinttype = {arXiv},
eprint = {1009.0783},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-1904,
author = {David Eppstein and
Michael T. Goodrich and
Roberto Tamassia},
title = {Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic
Data},
journal = {CoRR},
volume = {abs/1009.1904},
year = {2010},
url = {http://arxiv.org/abs/1009.1904},
eprinttype = {arXiv},
eprint = {1009.1904},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-1904.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/Diaz-GutierrezEG09,
author = {Pablo Diaz{-}Gutierrez and
David Eppstein and
Meenakshisundaram Gopi},
title = {Curvature Aware Fundamental Cycles},
journal = {Comput. Graph. Forum},
volume = {28},
number = {7},
pages = {2015--2024},
year = {2009},
url = {https://doi.org/10.1111/j.1467-8659.2009.01580.x},
doi = {10.1111/J.1467-8659.2009.01580.X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/Diaz-GutierrezEG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EppsteinKMS09,
author = {David Eppstein and
Marc J. van Kreveld and
Elena Mumford and
Bettina Speckmann},
title = {Edges and switches, tunnels and bridges},
journal = {Comput. Geom.},
volume = {42},
number = {8},
pages = {790--802},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2008.05.005},
doi = {10.1016/J.COMGEO.2008.05.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/EppsteinKMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein09,
author = {David Eppstein},
title = {Finding Large Clique Minors is Hard},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {197--204},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00183},
doi = {10.7155/JGAA.00183},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09,
author = {David Eppstein},
title = {Testing bipartiteness of geometric intersection graphs},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {15:1--15:35},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497291},
doi = {10.1145/1497290.1497291},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Eppstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09a,
author = {David Eppstein},
title = {Squarepants in a tree: Sum of subtree clustering and hyperbolic pants
decomposition},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {3},
pages = {29:1--29:24},
year = {2009},
url = {https://doi.org/10.1145/1541885.1541890},
doi = {10.1145/1541885.1541890},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Eppstein09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09b,
author = {David Eppstein},
title = {All maximal independent sets and dynamic dominance for sparse graphs},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {4},
pages = {38:1--38:14},
year = {2009},
url = {https://doi.org/10.1145/1597036.1597042},
doi = {10.1145/1597036.1597042},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Eppstein09b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vc/EppsteinGKT09,
author = {David Eppstein and
Michael T. Goodrich and
Ethan Kim and
Rasmus Tamstorf},
title = {Approximate topological matching of quad meshes},
journal = {Vis. Comput.},
volume = {25},
number = {8},
pages = {771--783},
year = {2009},
url = {https://doi.org/10.1007/s00371-009-0363-z},
doi = {10.1007/S00371-009-0363-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/vc/EppsteinGKT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DickersonE09,
author = {Matthew T. Dickerson and
David Eppstein},
editor = {John Hershberger and
Efi Fogel},
title = {Animating a continuous family of two-site Voronoi diagrams (and a
proof of a bound on the number of regions)},
booktitle = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
Aarhus, Denmark, June 8-10, 2009},
pages = {92--93},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1542362.1542380},
doi = {10.1145/1542362.1542380},
timestamp = {Mon, 14 Jun 2021 16:24:56 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DickersonE09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinMSV09,
author = {David Eppstein and
Elena Mumford and
Bettina Speckmann and
Kevin Verbeek},
editor = {John Hershberger and
Efi Fogel},
title = {Area-universal rectangular layouts},
booktitle = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
Aarhus, Denmark, June 8-10, 2009},
pages = {267--276},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1542362.1542411},
doi = {10.1145/1542362.1542411},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/EppsteinGT09,
author = {David Eppstein and
Michael T. Goodrich and
Lowell Trott},
editor = {Divyakant Agrawal and
Walid G. Aref and
Chang{-}Tien Lu and
Mohamed F. Mokbel and
Peter Scheuermann and
Cyrus Shahabi and
Ouri Wolfson},
title = {Going off-road: transversal complexity in road networks},
booktitle = {17th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic
Information Systems, {ACM-GIS} 2009, November 4-6, 2009, Seattle,
Washington, USA, Proceedings},
pages = {23--32},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1653771.1653778},
doi = {10.1145/1653771.1653778},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/EppsteinGT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinGS09,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash},
editor = {Claire Mathieu},
title = {Linear-time algorithms for geometric graphs with sublinearly many
crossings},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {150--159},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.18},
doi = {10.1137/1.9781611973068.18},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinM09,
author = {David Eppstein and
Elena Mumford},
editor = {Claire Mathieu},
title = {Self-overlapping curves revisited},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {160--169},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.19},
doi = {10.1137/1.9781611973068.19},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DuEGL09,
author = {Wenliang Du and
David Eppstein and
Michael T. Goodrich and
George S. Lueker},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {On the Approximability of Geometric and Geographic Generalization
and the Min-Max Bin Covering Problem},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {242--253},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_22},
doi = {10.1007/978-3-642-03367-4\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DuEGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinM09,
author = {David Eppstein and
Elena Mumford},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Orientation-Constrained Rectangular Layouts},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {266--277},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_24},
doi = {10.1007/978-3-642-03367-4\_24},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinS09,
author = {David Eppstein and
Emma S. Spiro},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {The \emph{h}-Index of a Graph and Its Application to Dynamic Subgraph
Statistics},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {278--289},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_25},
doi = {10.1007/978-3-642-03367-4\_25},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinW09,
author = {David Eppstein and
Kevin A. Wortman},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Optimal Embedding into Star Metrics},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {290--301},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_26},
doi = {10.1007/978-3-642-03367-4\_26},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Eppstein09,
author = {David Eppstein},
editor = {Christophe Paul and
Michel Habib},
title = {Graph-Theoretic Solutions to Computational Geometry Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {1--16},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_1},
doi = {10.1007/978-3-642-11409-0\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Eppstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-3924,
author = {David Eppstein and
Elena Mumford and
Bettina Speckmann and
Kevin Verbeek},
title = {Area-Universal Rectangular Layouts},
journal = {CoRR},
volume = {abs/0901.3924},
year = {2009},
url = {http://arxiv.org/abs/0901.3924},
eprinttype = {arXiv},
eprint = {0901.3924},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-3924.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-2507,
author = {Sergio Cabello and
David Eppstein and
Sandi Klavzar},
title = {The Fibonacci dimension of a graph},
journal = {CoRR},
volume = {abs/0903.2507},
year = {2009},
url = {http://arxiv.org/abs/0903.2507},
eprinttype = {arXiv},
eprint = {0903.2507},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-2507.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-3741,
author = {David Eppstein and
Emma S. Spiro},
title = {The h-Index of a Graph and its Application to Dynamic Subgraph Statistics},
journal = {CoRR},
volume = {abs/0904.3741},
year = {2009},
url = {http://arxiv.org/abs/0904.3741},
eprinttype = {arXiv},
eprint = {0904.3741},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-3741.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-3756,
author = {Wenliang Du and
David Eppstein and
Michael T. Goodrich and
George S. Lueker},
title = {On the Approximability of Geometric and Geographic Generalization
and the Min-Max Bin Covering Problem},
journal = {CoRR},
volume = {abs/0904.3756},
year = {2009},
url = {http://arxiv.org/abs/0904.3756},
eprinttype = {arXiv},
eprint = {0904.3756},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-3756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-4312,
author = {David Eppstein and
Elena Mumford},
title = {Orientation-Constrained Rectangular Layouts},
journal = {CoRR},
volume = {abs/0904.4312},
year = {2009},
url = {http://arxiv.org/abs/0904.4312},
eprinttype = {arXiv},
eprint = {0904.4312},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-4312.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-0283,
author = {David Eppstein and
Kevin A. Wortman},
title = {Optimal Embedding Into Star Metrics},
journal = {CoRR},
volume = {abs/0905.0283},
year = {2009},
url = {http://arxiv.org/abs/0905.0283},
eprinttype = {arXiv},
eprint = {0905.0283},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-0283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-5474,
author = {David Eppstein and
Kevin A. Wortman},
title = {Optimal Angular Resolution for Face-Symmetric Drawings},
journal = {CoRR},
volume = {abs/0907.5474},
year = {2009},
url = {http://arxiv.org/abs/0907.5474},
eprinttype = {arXiv},
eprint = {0907.5474},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-5474.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-3916,
author = {David Eppstein},
title = {Graph-Theoretic Solutions to Computational Geometry Problems},
journal = {CoRR},
volume = {abs/0908.3916},
year = {2009},
url = {http://arxiv.org/abs/0908.3916},
eprinttype = {arXiv},
eprint = {0908.3916},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-3916.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-1866,
author = {David Eppstein},
title = {Optimally fast incremental Manhattan plane embedding and planar tight
span construction},
journal = {CoRR},
volume = {abs/0909.1866},
year = {2009},
url = {http://arxiv.org/abs/0909.1866},
eprinttype = {arXiv},
eprint = {0909.1866},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-1866.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-1870,
author = {David Eppstein},
title = {Paired approximation problems and incompatible inapproximabilities},
journal = {CoRR},
volume = {abs/0909.1870},
year = {2009},
url = {http://arxiv.org/abs/0909.1870},
eprinttype = {arXiv},
eprint = {0909.1870},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-1870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-2891,
author = {David Eppstein and
Michael T. Goodrich and
Lowell Trott},
title = {Going Off-road: Transversal Complexity in Road Networks},
journal = {CoRR},
volume = {abs/0909.2891},
year = {2009},
url = {http://arxiv.org/abs/0909.2891},
eprinttype = {arXiv},
eprint = {0909.2891},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-2891.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0537,
author = {David Eppstein and
Elena Mumford},
title = {Steinitz Theorems for Orthogonal Polyhedra},
journal = {CoRR},
volume = {abs/0912.0537},
year = {2009},
url = {http://arxiv.org/abs/0912.0537},
eprinttype = {arXiv},
eprint = {0912.0537},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-0537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0019809,
author = {David Eppstein and
Jean{-}Claude Falmagne and
Sergei Ovchinnikov},
title = {Media theory - interdisciplinary applied mathematics},
publisher = {Springer},
year = {2008},
isbn = {978-3-540-71696-9},
timestamp = {Thu, 10 Feb 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0019809.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/EppsteinGKT08,
author = {David Eppstein and
Michael T. Goodrich and
Ethan Kim and
Rasmus Tamstorf},
title = {Motorcycle Graphs: Canonical Quad Mesh Partitioning},
journal = {Comput. Graph. Forum},
volume = {27},
number = {5},
pages = {1477--1486},
year = {2008},
url = {https://doi.org/10.1111/j.1467-8659.2008.01288.x},
doi = {10.1111/J.1467-8659.2008.01288.X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/EppsteinGKT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EppsteinF08,
author = {David Eppstein and
Jean{-}Claude Falmagne},
title = {Algorithms for media},
journal = {Discret. Appl. Math.},
volume = {156},
number = {8},
pages = {1308--1320},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.035},
doi = {10.1016/J.DAM.2007.05.035},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EppsteinF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/EppsteinGS08,
author = {David Eppstein and
Michael T. Goodrich and
Jonathan Z. Sun},
title = {Skip Quadtrees: Dynamic Data Structures for Multidimensional Point
Sets},
journal = {Int. J. Comput. Geom. Appl.},
volume = {18},
number = {1/2},
pages = {131--160},
year = {2008},
url = {https://doi.org/10.1142/S0218195908002568},
doi = {10.1142/S0218195908002568},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/EppsteinGS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein08,
author = {David Eppstein},
title = {Upright-Quad Drawing of st-Planar Learning Spaces},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {51--72},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00159},
doi = {10.7155/JGAA.00159},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BarequetEGV08,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Amir Vaxman},
editor = {Dan Halperin and
Kurt Mehlhorn},
title = {Straight Skeletons of Three-Dimensional Polyhedra},
booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
Germany, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5193},
pages = {148--160},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87744-8\_13},
doi = {10.1007/978-3-540-87744-8\_13},
timestamp = {Sun, 02 Jun 2019 21:14:36 +0200},
biburl = {https://dblp.org/rec/conf/esa/BarequetEGV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinG08,
author = {David Eppstein and
Michael T. Goodrich},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Succinct Greedy Graph Drawing in the Hyperbolic Plane},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {14--25},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_3},
doi = {10.1007/978-3-642-00219-9\_3},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/EppsteinG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein08,
author = {David Eppstein},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {78--89},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_9},
doi = {10.1007/978-3-642-00219-9\_9},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein08a,
author = {David Eppstein},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Isometric Diamond Subgraphs},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {384--389},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_37},
doi = {10.1007/978-3-642-00219-9\_37},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/EppsteinG08,
author = {David Eppstein and
Michael T. Goodrich},
editor = {Walid G. Aref and
Mohamed F. Mokbel and
Markus Schneider},
title = {Studying (non-planar) road networks through an algorithmic lens},
booktitle = {16th {ACM} {SIGSPATIAL} International Symposium on Advances in Geographic
Information Systems, {ACM-GIS} 2008, November 5-7, 2008, Irvine, California,
USA, Proceedings},
pages = {16},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1463434.1463455},
doi = {10.1145/1463434.1463455},
timestamp = {Sat, 31 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gis/EppsteinG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smi/EppsteinGKT08,
author = {David Eppstein and
Michael T. Goodrich and
Ethan Kim and
Rasmus Tamstorf},
title = {Approximate topological matching of quadrilateral meshes},
booktitle = {2008 International Conference on Shape Modeling and Applications {(SMI}
2008), June 4-6, 2008, Stony Brook, NY, {USA}},
pages = {83--92},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/SMI.2008.4547954},
doi = {10.1109/SMI.2008.4547954},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/smi/EppsteinGKT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein08,
author = {David Eppstein},
editor = {Shang{-}Hua Teng},
title = {Recognizing partial cubes in quadratic time},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1258--1266},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347219},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-4030,
author = {David Eppstein},
title = {Learning Sequences},
journal = {CoRR},
volume = {abs/0803.4030},
year = {2008},
url = {http://arxiv.org/abs/0803.4030},
eprinttype = {arXiv},
eprint = {0803.4030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-4030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-0022,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Amir Vaxman},
title = {Straight Skeletons of Three-Dimensional Polyhedra},
journal = {CoRR},
volume = {abs/0805.0022},
year = {2008},
url = {http://arxiv.org/abs/0805.0022},
eprinttype = {arXiv},
eprint = {0805.0022},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-0022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0341,
author = {David Eppstein and
Michael T. Goodrich},
title = {Succinct Greedy Graph Drawing in the Hyperbolic Plane},
journal = {CoRR},
volume = {abs/0806.0341},
year = {2008},
url = {http://arxiv.org/abs/0806.0341},
eprinttype = {arXiv},
eprint = {0806.0341},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-1724,
author = {David Eppstein and
Elena Mumford},
title = {Self-overlapping Curves Revisited},
journal = {CoRR},
volume = {abs/0806.1724},
year = {2008},
url = {http://arxiv.org/abs/0806.1724},
eprinttype = {arXiv},
eprint = {0806.1724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-1724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-0007,
author = {David Eppstein},
title = {Finding Large Clique Minors is Hard},
journal = {CoRR},
volume = {abs/0807.0007},
year = {2008},
url = {http://arxiv.org/abs/0807.0007},
eprinttype = {arXiv},
eprint = {0807.0007},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-0007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-2218,
author = {David Eppstein},
title = {Isometric Diamond Subgraphs},
journal = {CoRR},
volume = {abs/0807.2218},
year = {2008},
url = {http://arxiv.org/abs/0807.2218},
eprinttype = {arXiv},
eprint = {0807.2218},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-2218.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0808-3694,
author = {David Eppstein and
Michael T. Goodrich},
title = {Studying (Non-Planar) Road Networks Through an Algorithmic Lens},
journal = {CoRR},
volume = {abs/0808.3694},
year = {2008},
url = {http://arxiv.org/abs/0808.3694},
eprinttype = {arXiv},
eprint = {0808.3694},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0808-3694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-0607,
author = {Matthew Dickerson and
David Eppstein and
Kevin A. Wortman},
title = {Dilation, smoothed distance, and minimization diagrams of convex functions},
journal = {CoRR},
volume = {abs/0812.0607},
year = {2008},
url = {http://arxiv.org/abs/0812.0607},
eprinttype = {arXiv},
eprint = {0812.0607},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-0607.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-0893,
author = {David Eppstein and
Michael T. Goodrich and
Darren Strash},
title = {Linear-Time Algorithms for Geometric Graphs with Sublinearly Many
Crossings},
journal = {CoRR},
volume = {abs/0812.0893},
year = {2008},
url = {http://arxiv.org/abs/0812.0893},
eprinttype = {arXiv},
eprint = {0812.0893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-0893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinGM07,
author = {David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Confluent Layered Drawings},
journal = {Algorithmica},
volume = {47},
number = {4},
pages = {439--452},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0159-8},
doi = {10.1007/S00453-006-0159-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinGM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EppsteinW07,
author = {David Eppstein and
Kevin A. Wortman},
title = {Minimum dilation stars},
journal = {Comput. Geom.},
volume = {37},
number = {1},
pages = {27--37},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.05.007},
doi = {10.1016/J.COMGEO.2006.05.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/EppsteinW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DujmovicESW07,
author = {Vida Dujmovic and
David Eppstein and
Matthew Suderman and
David R. Wood},
title = {Drawings of planar graphs with few slopes and segments},
journal = {Comput. Geom.},
volume = {38},
number = {3},
pages = {194--212},
year = {2007},
url = {https://doi.org/10.1016/j.comgeo.2006.09.002},
doi = {10.1016/J.COMGEO.2006.09.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DujmovicESW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein07,
author = {David Eppstein},
title = {The Traveling Salesman Problem for Cubic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {11},
number = {1},
pages = {61--81},
year = {2007},
url = {https://doi.org/10.7155/jgaa.00137},
doi = {10.7155/JGAA.00137},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGH07,
author = {David Eppstein and
Michael T. Goodrich and
Daniel S. Hirschberg},
title = {Improved Combinatorial Group Testing Algorithms for Real-World Problem
Sizes},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {5},
pages = {1360--1375},
year = {2007},
url = {https://doi.org/10.1137/050631847},
doi = {10.1137/050631847},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinGH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein07,
author = {David Eppstein},
title = {Foreword to special issue on {SODA} 2002},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {1},
pages = {1},
year = {2007},
url = {https://doi.org/10.1145/1219944.1219946},
doi = {10.1145/1219944.1219946},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Eppstein07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BagchiCEG07,
author = {Amitabha Bagchi and
Amitabh Chaudhary and
David Eppstein and
Michael T. Goodrich},
title = {Deterministic sampling and range counting in geometric data streams},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {2},
pages = {16},
year = {2007},
url = {https://doi.org/10.1145/1240233.1240239},
doi = {10.1145/1240233.1240239},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BagchiCEG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/SinghalBE07,
author = {Love Singhal and
Elaheh Bozorgzadeh and
David Eppstein},
title = {Interconnect Criticality-Driven Delay Relaxation},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {26},
number = {10},
pages = {1803--1817},
year = {2007},
url = {https://doi.org/10.1109/TCAD.2007.896319},
doi = {10.1109/TCAD.2007.896319},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/SinghalBE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinGS07,
author = {David Eppstein and
Michael T. Goodrich and
Nodari Sitchinava},
editor = {Jeff Erickson},
title = {Guard placement for efficient point-in-polygon proofs},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {27--36},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247075},
doi = {10.1145/1247069.1247075},
timestamp = {Mon, 14 Jun 2021 16:25:02 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinGS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein07,
author = {David Eppstein},
editor = {Jeff Erickson},
title = {Happy endings for flip graphs},
booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
Gyeongju, South Korea, June 6-8, 2007},
pages = {92--101},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1247069.1247084},
doi = {10.1145/1247069.1247084},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein07,
author = {David Eppstein},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Squarepants in a tree: sum of subtree clustering and hyperbolic pants
decomposition},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {29--38},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283387},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinKMS07,
author = {David Eppstein and
Marc J. van Kreveld and
Elena Mumford and
Bettina Speckmann},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Edges and Switches, Tunnels and Bridges},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {77--88},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_8},
doi = {10.1007/978-3-540-73951-7\_8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinKMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinG07,
author = {David Eppstein and
Michael T. Goodrich},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Space-Efficient Straggler Identification in Round-Trip Data Streams
Via Newton's Identities and Invertible Bloom Filters},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {637--648},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_55},
doi = {10.1007/978-3-540-73951-7\_55},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0704-2919,
author = {David Eppstein and
Jean{-}Claude Falmagne and
Hasan Uzun},
title = {On Verifying and Engineering the Well-gradedness of a Union-closed
Family},
journal = {CoRR},
volume = {abs/0704.2919},
year = {2007},
url = {http://arxiv.org/abs/0704.2919},
eprinttype = {arXiv},
eprint = {0704.2919},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0704-2919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0704-3313,
author = {David Eppstein and
Michael T. Goodrich},
title = {Space-Efficient Straggler Identification in Round-Trip Data Streams
via Newton's Identities and Invertible Bloom Filters},
journal = {CoRR},
volume = {abs/0704.3313},
year = {2007},
url = {http://arxiv.org/abs/0704.3313},
eprinttype = {arXiv},
eprint = {0704.3313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0704-3313.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-0413,
author = {David Eppstein and
Marc J. van Kreveld and
Elena Mumford and
Bettina Speckmann},
title = {Edges and Switches, Tunnels and Bridges},
journal = {CoRR},
volume = {abs/0705.0413},
year = {2007},
url = {http://arxiv.org/abs/0705.0413},
eprinttype = {arXiv},
eprint = {0705.0413},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-0413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-1025,
author = {David Eppstein},
title = {Recognizing Partial Cubes in Quadratic Time},
journal = {CoRR},
volume = {abs/0705.1025},
year = {2007},
url = {http://arxiv.org/abs/0705.1025},
eprinttype = {arXiv},
eprint = {0705.1025},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-1025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0709-4087,
author = {David Eppstein},
title = {The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing},
journal = {CoRR},
volume = {abs/0709.4087},
year = {2007},
url = {http://arxiv.org/abs/0709.4087},
eprinttype = {arXiv},
eprint = {0709.4087},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0709-4087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Eppstein06,
author = {David Eppstein},
title = {Cubic Partial Cubes from Simplicial Arrangements},
journal = {Electron. J. Comb.},
volume = {13},
number = {1},
year = {2006},
url = {https://doi.org/10.37236/1105},
doi = {10.37236/1105},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Eppstein06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BagchiBCES06,
author = {Amitabha Bagchi and
Ankur Bhargava and
Amitabh Chaudhary and
David Eppstein and
Christian Scheideler},
title = {The Effect of Faults on Network Expansion},
journal = {Theory Comput. Syst.},
volume = {39},
number = {6},
pages = {903--928},
year = {2006},
url = {https://doi.org/10.1007/s00224-006-1349-0},
doi = {10.1007/S00224-006-1349-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BagchiBCES06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein06,
author = {David Eppstein},
title = {Quasiconvex analysis of multivariate recurrence equations for backtracking
algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {4},
pages = {492--509},
year = {2006},
url = {https://doi.org/10.1145/1198513.1198515},
doi = {10.1145/1198513.1198515},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Eppstein06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CarlsonE06,
author = {Josiah Carlson and
David Eppstein},
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Trees with Convex Faces and Optimal Angles},
booktitle = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
Germany, September 18-20, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4372},
pages = {77--88},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-70904-6\_9},
doi = {10.1007/978-3-540-70904-6\_9},
timestamp = {Sun, 13 Nov 2022 09:57:32 +0100},
biburl = {https://dblp.org/rec/conf/gd/CarlsonE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein06,
author = {David Eppstein},
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Upright-Quad Drawing of \emph{st} -Planar Learning Spaces},
booktitle = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
Germany, September 18-20, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4372},
pages = {282--293},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-70904-6\_28},
doi = {10.1007/978-3-540-70904-6\_28},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DillencourtEG06,
author = {Michael B. Dillencourt and
David Eppstein and
Michael T. Goodrich},
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Choosing Colors for Geometric Graphs Via Color Space Embeddings},
booktitle = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
Germany, September 18-20, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4372},
pages = {294--305},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-70904-6\_29},
doi = {10.1007/978-3-540-70904-6\_29},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DillencourtEG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sibgrapi/Diaz-GutierrezEG06,
author = {Pablo Diaz{-}Gutierrez and
David Eppstein and
M. Gopi},
title = {Single Triangle Strip and Loop on Manifolds with Boundaries},
booktitle = {19th Brazilian Symposium on Computer Graphics and Image Processing
{(SIBGRAPI} 2006), 8-11 October 2006, Manaus, Amazonas, Brazil},
pages = {221--228},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/SIBGRAPI.2006.41},
doi = {10.1109/SIBGRAPI.2006.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sibgrapi/Diaz-GutierrezEG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarlsonE06,
author = {Josiah Carlson and
David Eppstein},
editor = {Lars Arge and
Rusins Freivalds},
title = {The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {400--410},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_37},
doi = {10.1007/11785293\_37},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarlsonE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0602029,
author = {John Augustine and
David Eppstein and
Kevin A. Wortman},
title = {Approximate Weighted Farthest Neighbors and Minimum Dilation Stars},
journal = {CoRR},
volume = {abs/cs/0602029},
year = {2006},
url = {http://arxiv.org/abs/cs/0602029},
eprinttype = {arXiv},
eprint = {cs/0602029},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0602029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603057,
author = {David Eppstein and
Michael T. Goodrich and
Nodari Sitchinava},
title = {Guard Placement For Wireless Localization},
journal = {CoRR},
volume = {abs/cs/0603057},
year = {2006},
url = {http://arxiv.org/abs/cs/0603057},
eprinttype = {arXiv},
eprint = {cs/0603057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604034,
author = {David Eppstein},
title = {Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants
Decomposition},
journal = {CoRR},
volume = {abs/cs/0604034},
year = {2006},
url = {http://arxiv.org/abs/cs/0604034},
eprinttype = {arXiv},
eprint = {cs/0604034},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0607094,
author = {David Eppstein},
title = {Upright-Quad Drawing of st-Planar Learning Spaces},
journal = {CoRR},
volume = {abs/cs/0607094},
year = {2006},
url = {http://arxiv.org/abs/cs/0607094},
eprinttype = {arXiv},
eprint = {cs/0607094},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0607094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0607113,
author = {Josiah Carlson and
David Eppstein},
title = {Trees with Convex Faces and Optimal Angles},
journal = {CoRR},
volume = {abs/cs/0607113},
year = {2006},
url = {http://arxiv.org/abs/cs/0607113},
eprinttype = {arXiv},
eprint = {cs/0607113},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0607113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609033,
author = {Michael B. Dillencourt and
David Eppstein and
Michael T. Goodrich},
title = {Choosing Colors for Geometric Graphs via Color Space Embeddings},
journal = {CoRR},
volume = {abs/cs/0609033},
year = {2006},
url = {http://arxiv.org/abs/cs/0609033},
eprinttype = {arXiv},
eprint = {cs/0609033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0610092,
author = {David Eppstein},
title = {Happy endings for flip graphs},
journal = {CoRR},
volume = {abs/cs/0610092},
year = {2006},
url = {http://arxiv.org/abs/cs/0610092},
eprinttype = {arXiv},
eprint = {cs/0610092},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0610092.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DemaineDEFF05,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Greg N. Frederickson and
Erich Friedman},
title = {Hinged dissection of polyominoes and polyforms},
journal = {Comput. Geom.},
volume = {31},
number = {3},
pages = {237--262},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2004.12.008},
doi = {10.1016/J.COMGEO.2004.12.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DemaineDEFF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Eppstein05,
author = {David Eppstein},
title = {The lattice dimension of a graph},
journal = {Eur. J. Comb.},
volume = {26},
number = {5},
pages = {585--592},
year = {2005},
url = {https://doi.org/10.1016/j.ejc.2004.05.001},
doi = {10.1016/J.EJC.2004.05.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Eppstein05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BeigelE05,
author = {Richard Beigel and
David Eppstein},
title = {3-coloring in time O(1.3289\({}^{\mbox{n}}\))},
journal = {J. Algorithms},
volume = {54},
number = {2},
pages = {168--204},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.06.008},
doi = {10.1016/J.JALGOR.2004.06.008},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BeigelE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DickersonEGM05,
author = {Matthew Dickerson and
David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {31--52},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00099},
doi = {10.7155/JGAA.00099},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DickersonEGM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mam/GivargisE05,
author = {Tony Givargis and
David Eppstein},
title = {Memory reference caching for activity reduction on address buses},
journal = {Microprocess. Microsystems},
volume = {29},
number = {4},
pages = {145--153},
year = {2005},
url = {https://doi.org/10.1016/j.micpro.2004.08.001},
doi = {10.1016/J.MICPRO.2004.08.001},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mam/GivargisE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinGS05,
author = {David Eppstein and
Michael T. Goodrich and
Jonathan Z. Sun},
editor = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote},
title = {The skip quadtree: a simple dynamic data structure for multidimensional
data},
booktitle = {Proceedings of the 21st {ACM} Symposium on Computational Geometry,
Pisa, Italy, June 6-8, 2005},
pages = {296--305},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1064092.1064138},
doi = {10.1145/1064092.1064138},
timestamp = {Mon, 14 Jun 2021 16:24:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinW05,
author = {David Eppstein and
Kevin A. Wortman},
editor = {Joseph S. B. Mitchell and
G{\"{u}}nter Rote},
title = {Minimum dilation stars},
booktitle = {Proceedings of the 21st {ACM} Symposium on Computational Geometry,
Pisa, Italy, June 6-8, 2005},
pages = {321--326},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1064092.1064142},
doi = {10.1145/1064092.1064142},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinGM05,
author = {David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
editor = {Patrick Healy and
Nikola S. Nikolov},
title = {Delta-Confluent Drawings},
booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
Ireland, September 12-14, 2005, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3843},
pages = {165--176},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11618058\_16},
doi = {10.1007/11618058\_16},
timestamp = {Sun, 13 Nov 2022 09:57:32 +0100},
biburl = {https://dblp.org/rec/conf/gd/EppsteinGM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ArgeEG05,
author = {Lars Arge and
David Eppstein and
Michael T. Goodrich},
editor = {Marcos Kawazoe Aguilera and
James Aspnes},
title = {Skip-webs: efficient distributed data structures for multi-dimensional
data sets},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2005, Las Vegas, NV, USA, July 17-20,
2005},
pages = {69--76},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073814.1073827},
doi = {10.1145/1073814.1073827},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/ArgeEG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein05,
author = {David Eppstein},
title = {All maximal independent sets and dynamic dominance for sparse graphs},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {451--459},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070494},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinGH05,
author = {David Eppstein and
Michael T. Goodrich and
Daniel S. Hirschberg},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Improved Combinatorial Group Testing for Real-World Problem Sizes},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {86--98},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_9},
doi = {10.1007/11534273\_9},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinGH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0503023,
author = {Josiah Carlson and
David Eppstein},
title = {The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems},
journal = {CoRR},
volume = {abs/cs/0503023},
year = {2005},
url = {http://arxiv.org/abs/cs/0503023},
eprinttype = {arXiv},
eprint = {cs/0503023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0503023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0505048,
author = {David Eppstein and
Michael T. Goodrich and
Daniel S. Hirschberg},
title = {Improved Combinatorial Group Testing Algorithms for Real-World Problem
Sizes},
journal = {CoRR},
volume = {abs/cs/0505048},
year = {2005},
url = {http://arxiv.org/abs/cs/0505048},
eprinttype = {arXiv},
eprint = {cs/0505048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0505048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507049,
author = {David Eppstein and
Michael T. Goodrich and
Jonathan Z. Sun},
title = {The Skip Quadtree: {A} Simple Dynamic Data Structure for Multidimensional
Data},
journal = {CoRR},
volume = {abs/cs/0507049},
year = {2005},
url = {http://arxiv.org/abs/cs/0507049},
eprinttype = {arXiv},
eprint = {cs/0507049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507050,
author = {Lars Arge and
David Eppstein and
Michael T. Goodrich},
title = {Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional
Data Sets},
journal = {CoRR},
volume = {abs/cs/0507050},
year = {2005},
url = {http://arxiv.org/abs/cs/0507050},
eprinttype = {arXiv},
eprint = {cs/0507050},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507051,
author = {David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Confluent Layered Drawings},
journal = {CoRR},
volume = {abs/cs/0507051},
year = {2005},
url = {http://arxiv.org/abs/cs/0507051},
eprinttype = {arXiv},
eprint = {cs/0507051},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0507053,
author = {David Eppstein},
title = {Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku},
journal = {CoRR},
volume = {abs/cs/0507053},
year = {2005},
url = {http://arxiv.org/abs/cs/0507053},
eprinttype = {arXiv},
eprint = {cs/0507053},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0507053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0510024,
author = {David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Delta-confluent Drawings},
journal = {CoRR},
volume = {abs/cs/0510024},
year = {2005},
url = {http://arxiv.org/abs/cs/0510024},
eprinttype = {arXiv},
eprint = {cs/0510024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0510024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-math-0510263,
author = {David Eppstein},
title = {Cubic Partial Cubes from Simplicial Arrangements},
journal = {CoRR},
volume = {abs/math/0510263},
year = {2005},
url = {http://arxiv.org/abs/math/0510263},
eprinttype = {arXiv},
eprint = {math/0510263},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-math-0510263.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/GopiE04,
author = {M. Gopi and
David Eppstein},
title = {Single-Strip Triangulation of Manifolds with Arbitrary Topology},
journal = {Comput. Graph. Forum},
volume = {23},
number = {3},
pages = {371--380},
year = {2004},
url = {https://doi.org/10.1111/j.1467-8659.2004.00768.x},
doi = {10.1111/J.1467-8659.2004.00768.X},
timestamp = {Fri, 05 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgf/GopiE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/EppsteinSU04,
author = {David Eppstein and
John M. Sullivan and
Alper {\"{U}}ng{\"{o}}r},
title = {Tiling space and slabs with acute tetrahedra},
journal = {Comput. Geom.},
volume = {27},
number = {3},
pages = {237--255},
year = {2004},
url = {https://doi.org/10.1016/j.comgeo.2003.11.003},
doi = {10.1016/J.COMGEO.2003.11.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/EppsteinSU04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinW04,
author = {David Eppstein and
Joseph Wang},
title = {Fast Approximation of Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {39--45},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00081},
doi = {10.7155/JGAA.00081},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CardinalE04,
author = {Jean Cardinal and
David Eppstein},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {112--119},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 13:45:59 +0100},
biburl = {https://dblp.org/rec/conf/alenex/CardinalE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BagchiCEG04,
author = {Amitabha Bagchi and
Amitabh Chaudhary and
David Eppstein and
Michael T. Goodrich},
editor = {Jack Snoeyink and
Jean{-}Daniel Boissonnat},
title = {Deterministic sampling and range counting in geometric data streams},
booktitle = {Proceedings of the 20th {ACM} Symposium on Computational Geometry,
Brooklyn, New York, USA, June 8-11, 2004},
pages = {144--151},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/997817.997842},
doi = {10.1145/997817.997842},
timestamp = {Mon, 14 Jun 2021 16:25:03 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BagchiCEG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DuncanEK04,
author = {Christian A. Duncan and
David Eppstein and
Stephen G. Kobourov},
editor = {Jack Snoeyink and
Jean{-}Daniel Boissonnat},
title = {The geometric thickness of low degree graphs},
booktitle = {Proceedings of the 20th {ACM} Symposium on Computational Geometry,
Brooklyn, New York, USA, June 8-11, 2004},
pages = {340--346},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/997817.997868},
doi = {10.1145/997817.997868},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DuncanEK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinG04,
author = {David Eppstein and
M. Gopi},
editor = {Jack Snoeyink and
Jean{-}Daniel Boissonnat},
title = {Single-strip triangulation of manifolds with arbitrary topology},
booktitle = {Proceedings of the 20th {ACM} Symposium on Computational Geometry,
Brooklyn, New York, USA, June 8-11, 2004},
pages = {455--456},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/997817.997888},
doi = {10.1145/997817.997888},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein04,
author = {David Eppstein},
editor = {J{\'{a}}nos Pach},
title = {Algorithms for Drawing Media},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {173--183},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_19},
doi = {10.1007/978-3-540-31843-9\_19},
timestamp = {Sun, 13 Nov 2022 09:57:33 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/EppsteinGM04,
author = {David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
editor = {J{\'{a}}nos Pach},
title = {Confluent Layered Drawings},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {184--194},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_20},
doi = {10.1007/978-3-540-31843-9\_20},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/EppsteinGM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein04,
author = {David Eppstein},
editor = {J. Ian Munro},
title = {Quasiconvex analysis of backtracking algorithms},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {788--797},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982912},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein04a,
author = {David Eppstein},
editor = {J. Ian Munro},
title = {Testing bipartiteness of geometric intersection graphs},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {860--868},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982921},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BagchiBCES04,
author = {Amitabha Bagchi and
Ankur Bhargava and
Amitabh Chaudhary and
David Eppstein and
Christian Scheideler},
editor = {Phillip B. Gibbons and
Micah Adler},
title = {The effect of faults on network expansion},
booktitle = {{SPAA} 2004: Proceedings of the Sixteenth Annual {ACM} Symposium on
Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona,
Spain},
pages = {286--293},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007912.1007960},
doi = {10.1145/1007912.1007960},
timestamp = {Wed, 21 Nov 2018 11:11:51 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BagchiBCES04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0412025,
author = {David Eppstein and
Kevin A. Wortman},
title = {Minimum Dilation Stars},
journal = {CoRR},
volume = {abs/cs/0412025},
year = {2004},
url = {http://arxiv.org/abs/cs/0412025},
eprinttype = {arXiv},
eprint = {cs/0412025},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0412025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0412046,
author = {David Eppstein},
title = {Quasiconvex Programming},
journal = {CoRR},
volume = {abs/cs/0412046},
year = {2004},
url = {http://arxiv.org/abs/cs/0412046},
eprinttype = {arXiv},
eprint = {cs/0412046},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0412046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0405036,
author = {M. Gopi and
David Eppstein},
title = {Single-Strip Triangulation of Manifolds with Arbitrary Topology},
journal = {CoRR},
volume = {cs.CG/0405036},
year = {2004},
url = {http://arxiv.org/abs/cs/0405036},
timestamp = {Fri, 05 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0405036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DC-0404029,
author = {Amitabha Bagchi and
Ankur Bhargava and
Amitabh Chaudhary and
David Eppstein and
Christian Scheideler},
title = {The Effect of Faults on Network Expansion},
journal = {CoRR},
volume = {cs.DC/0404029},
year = {2004},
url = {http://arxiv.org/abs/cs/0404029},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DC-0404029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0402028,
author = {David Eppstein},
title = {The lattice dimension of a graph},
journal = {CoRR},
volume = {cs.DS/0402028},
year = {2004},
url = {http://arxiv.org/abs/cs/0402028},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0402028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0406020,
author = {David Eppstein},
title = {Algorithms for Drawing Media},
journal = {CoRR},
volume = {cs.DS/0406020},
year = {2004},
url = {http://arxiv.org/abs/cs/0406020},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0406020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0407036,
author = {David Eppstein},
title = {All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs},
journal = {CoRR},
volume = {cs.DS/0407036},
year = {2004},
url = {http://arxiv.org/abs/cs.DS/0407036},
doi = {10.48550/ARXIV.CS/0407036},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0407036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BernDEKMS03,
author = {Marshall W. Bern and
Erik D. Demaine and
David Eppstein and
Eric Kuo and
Andrea Mantler and
Jack Snoeyink},
title = {Ununfoldable polyhedra with convex faces},
journal = {Comput. Geom.},
volume = {24},
number = {2},
pages = {51--62},
year = {2003},
url = {https://doi.org/10.1016/S0925-7721(02)00091-3},
doi = {10.1016/S0925-7721(02)00091-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BernDEKMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein03,
author = {David Eppstein},
title = {Guest Editor's Foreword},
journal = {Discret. Comput. Geom.},
volume = {30},
number = {1},
pages = {1--2},
year = {2003},
url = {https://doi.org/10.1007/s00454-003-2920-y},
doi = {10.1007/S00454-003-2920-Y},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein03,
author = {David Eppstein},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {131--140},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00064},
doi = {10.7155/JGAA.00064},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Eppstein03,
author = {David Eppstein},
title = {Setting Parameters by Example},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {3},
pages = {643--653},
year = {2003},
url = {https://doi.org/10.1137/S0097539700370084},
doi = {10.1137/S0097539700370084},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernE03,
author = {Marshall W. Bern and
David Eppstein},
editor = {Steven Fortune},
title = {Optimized color gamuts for tiled displays},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {274--281},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777834},
doi = {10.1145/777792.777834},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DickersonEGM03,
author = {Matthew Dickerson and
David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
editor = {Giuseppe Liotta},
title = {Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {1--12},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_1},
doi = {10.1007/978-3-540-24595-7\_1},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/DickersonEGM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BrandenburgEGKLM03,
author = {Franz{-}Josef Brandenburg and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Giuseppe Liotta and
Petra Mutzel},
editor = {Giuseppe Liotta},
title = {Selected Open Problems in Graph Drawing},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {515--539},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_55},
doi = {10.1007/978-3-540-24595-7\_55},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BrandenburgEGKLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernE03,
author = {Marshall W. Bern and
David Eppstein},
title = {M{\"{o}}bius-invariant natural neighbor interpolation},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {128--129},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644130},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein03,
author = {David Eppstein},
title = {Dynamic generators of topologically embedded graphs},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {599--608},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644208},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein03,
author = {David Eppstein},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {The Traveling Salesman Problem for Cubic Graphs},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {307--318},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_27},
doi = {10.1007/978-3-540-45078-8\_27},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0302027,
author = {David Eppstein and
John M. Sullivan and
Alper {\"{U}}ng{\"{o}}r},
title = {Tiling space and slabs with acute tetrahedra},
journal = {CoRR},
volume = {cs.CG/0302027},
year = {2003},
url = {http://arxiv.org/abs/cs/0302027},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0302027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0307023,
author = {David Eppstein},
title = {Testing Bipartiteness of Geometric Intersection Graphs},
journal = {CoRR},
volume = {cs.CG/0307023},
year = {2003},
url = {http://arxiv.org/abs/cs/0307023},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0307023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0307027,
author = {Amitabha Bagchi and
Amitabh Chaudhary and
David Eppstein and
Michael T. Goodrich},
title = {Deterministic Sampling and Range Counting in Geometric Data Streams},
journal = {CoRR},
volume = {cs.CG/0307027},
year = {2003},
url = {http://arxiv.org/abs/cs/0307027},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0307027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0312056,
author = {Christian A. Duncan and
David Eppstein and
Stephen G. Kobourov},
title = {The Geometric Thickness of Low Degree Graphs},
journal = {CoRR},
volume = {cs.CG/0312056},
year = {2003},
url = {http://arxiv.org/abs/cs/0312056},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0312056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0302030,
author = {David Eppstein},
title = {The traveling salesman problem for cubic graphs},
journal = {CoRR},
volume = {cs.DS/0302030},
year = {2003},
url = {http://arxiv.org/abs/cs/0302030},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0302030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0304018,
author = {David Eppstein},
title = {Quasiconvex Analysis of Backtracking Algorithms},
journal = {CoRR},
volume = {cs.DS/0304018},
year = {2003},
url = {http://arxiv.org/abs/cs/0304018},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0304018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EppsteinBH02,
author = {David Eppstein and
Marshall W. Bern and
Brad L. Hutchings},
title = {Algorithms for Coloring Quadtrees},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {87--94},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0054-2},
doi = {10.1007/S00453-001-0054-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EppsteinBH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein02,
author = {David Eppstein},
title = {Beta-skeletons have unbounded dilation},
journal = {Comput. Geom.},
volume = {23},
number = {1},
pages = {43--52},
year = {2002},
url = {https://doi.org/10.1016/S0925-7721(01)00055-4},
doi = {10.1016/S0925-7721(01)00055-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BernE02,
author = {Marshall W. Bern and
David Eppstein},
title = {Multivariate Regression Depth},
journal = {Discret. Comput. Geom.},
volume = {28},
number = {1},
pages = {1--17},
year = {2002},
url = {https://doi.org/10.1007/s00454-001-0092-1},
doi = {10.1007/S00454-001-0092-1},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BernE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ewc/BernEE02,
author = {Marshall W. Bern and
David Eppstein and
Jeff Erickson},
title = {Flipping Cubical Meshes},
journal = {Eng. Comput.},
volume = {18},
number = {3},
pages = {173--187},
year = {2002},
url = {https://doi.org/10.1007/s003660200016},
doi = {10.1007/S003660200016},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ewc/BernEE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EppsteinL02,
author = {David Eppstein and
George S. Lueker},
title = {The minimum expectation selection problem},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {278--292},
year = {2002},
url = {https://doi.org/10.1002/rsa.10061},
doi = {10.1002/RSA.10061},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EppsteinL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DemaineEEHO02,
author = {Erik D. Demaine and
David Eppstein and
Jeff Erickson and
George W. Hart and
Joseph O'Rourke},
editor = {Ferran Hurtado and
Vera Sacrist{\'{a}}n and
Chandrajit Bajaj and
Subhash Suri},
title = {Vertex-unfoldings of simplicial manifolds},
booktitle = {Proceedings of the 18th Annual Symposium on Computational Geometry,
Barcelona, Spain, June 5-7, 2002},
pages = {237--243},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/513400.513429},
doi = {10.1145/513400.513429},
timestamp = {Mon, 14 Jun 2021 16:25:21 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DemaineEEHO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/Eppstein02,
author = {David Eppstein},
editor = {Stephen G. Kobourov and
Michael T. Goodrich},
title = {Separating Thickness from Geometric Thickness},
booktitle = {Graph Drawing, 10th International Symposium, {GD} 2002, Irvine, CA,
USA, August 26-28, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2528},
pages = {150--161},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36151-0\_15},
doi = {10.1007/3-540-36151-0\_15},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/Eppstein02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/EppsteinW02,
author = {David Eppstein and
Joseph Wang},
editor = {Mark Levene and
Alexandra Poulovassilis},
title = {A Steady State Model for Graph Power Law},
booktitle = {Proceedings of the Second International Workshop on Web Dynamics,
WebDyn@WWW 2002, Honululu, HW, USA, May 7, 2002},
series = {{CEUR} Workshop Proceedings},
volume = {702},
pages = {15--24},
publisher = {CEUR-WS.org},
year = {2002},
url = {https://ceur-ws.org/Vol-702/paper2.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:23 +0100},
biburl = {https://dblp.org/rec/conf/www/EppsteinW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2002,
editor = {David Eppstein},
title = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381},
isbn = {0-89871-513-X},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0207081,
author = {Marshall W. Bern and
David Eppstein},
title = {Moebius-Invariant Natural Neighbor Interpolation},
journal = {CoRR},
volume = {cs.CG/0207081},
year = {2002},
url = {https://arxiv.org/abs/cs/0207081},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0207081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0212007,
author = {Marshall W. Bern and
David Eppstein},
title = {Optimized Color Gamuts for Tiled Displays},
journal = {CoRR},
volume = {cs.CG/0212007},
year = {2002},
url = {http://arxiv.org/abs/cs/0212007},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0212007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0212046,
author = {Matthew Dickerson and
David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way},
journal = {CoRR},
volume = {cs.CG/0212046},
year = {2002},
url = {http://arxiv.org/abs/cs/0212046},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0212046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DM-0204001,
author = {David Eppstein and
Joseph Wang},
title = {A steady state model for graph power laws},
journal = {CoRR},
volume = {cs.DM/0204001},
year = {2002},
url = {https://arxiv.org/abs/cs/0204001},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DM-0204001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0206033,
author = {David Eppstein and
Jean{-}Claude Falmagne},
title = {Algorithms for Media},
journal = {CoRR},
volume = {cs.DS/0206033},
year = {2002},
url = {https://arxiv.org/abs/cs/0206033},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0206033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0207082,
author = {David Eppstein},
title = {Dynamic Generators of Topologically Embedded Graphs},
journal = {CoRR},
volume = {cs.DS/0207082},
year = {2002},
url = {https://arxiv.org/abs/cs/0207082},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0207082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-CO-0204252,
author = {David Eppstein},
title = {Separating Thickness from Geometric Thickness},
journal = {CoRR},
volume = {math.CO/0204252},
year = {2002},
url = {https://arxiv.org/abs/math/0204252},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-CO-0204252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/Eppstein01,
author = {David Eppstein},
title = {Tangent Spheres and Triangle Centers},
journal = {Am. Math. Mon.},
volume = {108},
number = {1},
pages = {63--66},
year = {2001},
url = {http://www.jstor.org/stable/2695679},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/Eppstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GeES01,
author = {Xianping Ge and
David Eppstein and
Padhraic Smyth},
title = {The distribution of loop lengths in graphical models for turbo decoding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {6},
pages = {2549--2553},
year = {2001},
url = {https://doi.org/10.1109/18.945266},
doi = {10.1109/18.945266},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GeES01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imr/BernE01,
author = {Marshall W. Bern and
David Eppstein},
editor = {Alla Sheffer},
title = {Flipping Cubical Meshes},
booktitle = {Proceedings of the 10th International Meshing Roundtable, {IMR} 2001,
Newport Beach, CA, USA, October 7-10, 2001},
year = {2001},
url = {http://imr.sandia.gov/papers/abstracts/Be204.html},
timestamp = {Tue, 16 Jun 2015 19:51:47 +0200},
biburl = {https://dblp.org/rec/conf/imr/BernE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinW01,
author = {David Eppstein and
Joseph Wang},
editor = {S. Rao Kosaraju},
title = {Fast approximation of centrality},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {228--229},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365449},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/EppsteinW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein01,
author = {David Eppstein},
editor = {S. Rao Kosaraju},
title = {Improved algorithms for 3-coloring, 3-edge-coloring, and constraint
satisfaction},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {329--337},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365471},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinM01,
author = {David Eppstein and
S. Muthukrishnan},
editor = {S. Rao Kosaraju},
title = {Internet packet filter management and rectangle geometry},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {827--835},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365791},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BernE01,
author = {Marshall W. Bern and
David Eppstein},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Optimal M{\"{o}}bius Transformations for Information Visualization
and Meshing},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {14--25},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_3},
doi = {10.1007/3-540-44634-6\_3},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/BernE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BernE01a,
author = {Marshall W. Bern and
David Eppstein},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Optimization over Zonotopes and Training Support Vector Machines},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {111--121},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_11},
doi = {10.1007/3-540-44634-6\_11},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BernE01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein01,
author = {David Eppstein},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {462--470},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_42},
doi = {10.1007/3-540-44634-6\_42},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0101006,
author = {Marshall W. Bern and
David Eppstein},
title = {Optimal Moebius Transformations for Information Visualization and
Meshing},
journal = {CoRR},
volume = {cs.CG/0101006},
year = {2001},
url = {https://arxiv.org/abs/cs/0101006},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0101006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0105017,
author = {Marshall W. Bern and
David Eppstein},
title = {Optimization Over Zonotopes and Training Support Vector Machines},
journal = {CoRR},
volume = {cs.CG/0105017},
year = {2001},
url = {https://arxiv.org/abs/cs/0105017},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0105017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0106032,
author = {David Eppstein},
title = {Hinged Kite Mirror Dissection},
journal = {CoRR},
volume = {cs.CG/0106032},
year = {2001},
url = {https://arxiv.org/abs/cs/0106032},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0106032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0107023,
author = {Erik D. Demaine and
David Eppstein and
Jeff Erickson and
George W. Hart and
Joseph O'Rourke},
title = {Vertex-Unfoldings of Simplicial Polyhedra},
journal = {CoRR},
volume = {cs.CG/0107023},
year = {2001},
url = {https://arxiv.org/abs/cs/0107023},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0107023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0108020,
author = {Marshall W. Bern and
David Eppstein and
Jeff Erickson},
title = {Flipping Cubical Meshes},
journal = {CoRR},
volume = {cs.CG/0108020},
year = {2001},
url = {https://arxiv.org/abs/cs/0108020},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0108020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0110054,
author = {Erik D. Demaine and
David Eppstein and
Jeff Erickson and
George W. Hart and
Joseph O'Rourke},
title = {Vertex-Unfoldings of Simplicial Manifolds},
journal = {CoRR},
volume = {cs.CG/0110054},
year = {2001},
url = {https://arxiv.org/abs/cs/0110054},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0110054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0110011,
author = {David Eppstein and
George S. Lueker},
title = {The Minimum Expectation Selection Problem},
journal = {CoRR},
volume = {cs.DS/0110011},
year = {2001},
url = {https://arxiv.org/abs/cs/0110011},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0110011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-CO-0109195,
author = {David Eppstein},
title = {Separating Geometric Thickness from Book Thickness},
journal = {CoRR},
volume = {math.CO/0109195},
year = {2001},
url = {https://arxiv.org/abs/math/0109195},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-CO-0109195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Eppstein00,
author = {David Eppstein},
title = {Diameter and Treewidth in Minor-Closed Graph Families},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {275--291},
year = {2000},
url = {https://doi.org/10.1007/s004530010020},
doi = {10.1007/S004530010020},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AmentaBET00,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein and
Shang{-}Hua Teng},
title = {Regression Depth and Center Points},
journal = {Discret. Comput. Geom.},
volume = {23},
number = {3},
pages = {305--323},
year = {2000},
url = {https://doi.org/10.1007/PL00009502},
doi = {10.1007/PL00009502},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AmentaBET00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernE00,
author = {Marshall W. Bern and
David Eppstein},
title = {Quadrilateral Meshing by Circle Packing},
journal = {Int. J. Comput. Geom. Appl.},
volume = {10},
number = {4},
pages = {347--360},
year = {2000},
url = {https://doi.org/10.1142/S0218195900000206},
doi = {10.1142/S0218195900000206},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Eppstein00,
author = {David Eppstein},
title = {Incremental and Decremental Maintenance of Planar Width},
journal = {J. Algorithms},
volume = {37},
number = {2},
pages = {570--577},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1107},
doi = {10.1006/JAGM.2000.1107},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Eppstein00,
author = {David Eppstein},
title = {Fast Hierarchical Clustering and Other Applications of Dynamic Closest
Pairs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {1},
year = {2000},
url = {https://doi.org/10.1145/351827.351829},
doi = {10.1145/351827.351829},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DillencourtEH00,
author = {Michael B. Dillencourt and
David Eppstein and
Daniel S. Hirschberg},
title = {Geometric Thickness of Complete Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {5--17},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00023},
doi = {10.7155/JGAA.00023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DillencourtEH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Eppstein00,
author = {David Eppstein},
title = {Clustering for faster network simplex pivots},
journal = {Networks},
volume = {35},
number = {3},
pages = {173--180},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1097-0037(200005)35:3\&\#60;173::AID-NET1\&\#62;3.0.CO;2-W},
doi = {10.1002/(SICI)1097-0037(200005)35:3\&\#60;173::AID-NET1\&\#62;3.0.CO;2-W},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernE00,
author = {Marshall W. Bern and
David Eppstein},
editor = {Siu{-}Wing Cheng and
Otfried Cheong and
Pankaj K. Agarwal and
Steven Fortune},
title = {Multivariate regression depth},
booktitle = {Proceedings of the Sixteenth Annual Symposium on Computational Geometry,
Clear Water Bay, Hong Kong, China, June 12-14, 2000},
pages = {315--321},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/336154.336218},
doi = {10.1145/336154.336218},
timestamp = {Mon, 14 Jun 2021 16:25:02 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/Eppstein00,
author = {David Eppstein},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Spanning Trees and Spanners},
booktitle = {Handbook of Computational Geometry},
pages = {425--461},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50010-3},
doi = {10.1016/B978-044482537-7/50010-3},
timestamp = {Fri, 28 Jun 2019 09:10:30 +0200},
biburl = {https://dblp.org/rec/books/el/00/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-AI-0004003,
author = {David Eppstein},
title = {Searching for Spaceships},
journal = {CoRR},
volume = {cs.AI/0004003},
year = {2000},
url = {https://arxiv.org/abs/cs/0004003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-AI-0004003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0008025,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein},
title = {Phutball Endgames are Hard},
journal = {CoRR},
volume = {cs.CC/0008025},
year = {2000},
url = {https://arxiv.org/abs/cs/0008025},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0008025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0009024,
author = {Marshall W. Bern and
David Eppstein},
title = {Computing the Depth of a Flat},
journal = {CoRR},
volume = {cs.CG/0009024},
year = {2000},
url = {https://arxiv.org/abs/cs/0009024},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0009024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-0010018,
author = {David Eppstein and
S. Muthukrishnan},
title = {Internet Packet Filter Management and Rectangle Geometry},
journal = {CoRR},
volume = {cs.CG/0010018},
year = {2000},
url = {https://arxiv.org/abs/cs/0010018},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-0010018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0006046,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in Time O(1.3289{\^{}}n)},
journal = {CoRR},
volume = {cs.DS/0006046},
year = {2000},
url = {https://arxiv.org/abs/cs/0006046},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0006046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0009005,
author = {David Eppstein and
Joseph Wang},
title = {Fast Approximation of Centrality},
journal = {CoRR},
volume = {cs.DS/0009005},
year = {2000},
url = {https://arxiv.org/abs/cs/0009005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0009005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0009006,
author = {David Eppstein},
title = {Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint
Satisfaction},
journal = {CoRR},
volume = {cs.DS/0009006},
year = {2000},
url = {https://arxiv.org/abs/cs/0009006},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0009006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0011009,
author = {David Eppstein},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
journal = {CoRR},
volume = {cs.DS/0011009},
year = {2000},
url = {https://arxiv.org/abs/cs/0011009},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0011009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-CO-0006067,
author = {Cristopher Moore and
David Eppstein},
title = {One-Dimensional Peg Solitaire},
journal = {CoRR},
volume = {math.CO/0006067},
year = {2000},
url = {https://arxiv.org/abs/math/0006067},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-CO-0006067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-CO-0008172,
author = {Cristopher Moore and
David Eppstein},
title = {One-Dimensional Peg Solitaire, and Duotaire},
journal = {CoRR},
volume = {math.CO/0008172},
year = {2000},
url = {https://arxiv.org/abs/math/0008172},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-CO-0008172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein99,
author = {David Eppstein},
title = {Linear complexity hexahedral mesh generation},
journal = {Comput. Geom.},
volume = {12},
number = {1-2},
pages = {3--16},
year = {1999},
url = {https://doi.org/10.1016/S0925-7721(98)00032-7},
doi = {10.1016/S0925-7721(98)00032-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinE99,
author = {David Eppstein and
Jeff Erickson},
title = {Raising Roofs, Crashing Cycles, and Playing Pool: Applications of
a Data Structure for Finding Pairwise Interactions},
journal = {Discret. Comput. Geom.},
volume = {22},
number = {4},
pages = {569--592},
year = {1999},
url = {https://doi.org/10.1007/PL00009479},
doi = {10.1007/PL00009479},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinE99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernET99,
author = {Marshall W. Bern and
David Eppstein and
Shang{-}Hua Teng},
title = {Parallel Construction of Quadtrees and Quality Triangulations},
journal = {Int. J. Comput. Geom. Appl.},
volume = {9},
number = {6},
pages = {517--532},
year = {1999},
url = {https://doi.org/10.1142/S0218195999000303},
doi = {10.1142/S0218195999000303},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernET99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AmentaBE99,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein},
title = {Optimal Point Placement for Mesh Smoothing},
journal = {J. Algorithms},
volume = {30},
number = {2},
pages = {302--322},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0984},
doi = {10.1006/JAGM.1998.0984},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AmentaBE99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/EppsteinI99,
author = {David Eppstein and
Giuseppe F. Italiano},
title = {{PREFACE:} Festschrift for Zvi Galil},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {1--3},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0492},
doi = {10.1006/JCOM.1998.0492},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/EppsteinI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein99,
author = {David Eppstein},
title = {Subgraph Isomorphism in Planar Graphs and Related Problems},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {3},
pages = {1--27},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00014},
doi = {10.7155/JGAA.00014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BernDEK99,
author = {Marshall W. Bern and
Erik D. Demaine and
David Eppstein and
Eric Kuo},
title = {Ununfoldable polyhedra},
booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry,
UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
year = {1999},
url = {http://www.cccg.ca/proceedings/1999/fp38.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BernDEK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DemaineDEF99,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Erich Friedman},
title = {Hinged dissections of polyominoes and polyforms},
booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry,
UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
year = {1999},
url = {http://www.cccg.ca/proceedings/1999/fp37.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DemaineDEF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Eppstein99,
author = {David Eppstein},
title = {Setting Parameters by Example},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {309--318},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814602},
doi = {10.1109/SFFCS.1999.814602},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Eppstein99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinH99,
author = {David Eppstein and
David Hart},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Shortest Paths in an Arrangement with \emph{k} Line Orientations},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {310--316},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314580},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein99,
author = {David Eppstein},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Incremental and Decremental Maintenance of Planar Width},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {899--900},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315077},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/99/EppsteinGI99,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano},
editor = {Mikhail J. Atallah},
title = {Dynamic Graph Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781420049503-c9},
doi = {10.1201/9781420049503-C9},
timestamp = {Fri, 17 Jul 2020 16:12:44 +0200},
biburl = {https://dblp.org/rec/books/crc/99/EppsteinGI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9907018,
author = {Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Greg N. Frederickson and
Erich Friedman},
title = {Hinged Dissection of Polyominoes and Polyforms},
journal = {CoRR},
volume = {cs.CG/9907018},
year = {1999},
url = {https://arxiv.org/abs/cs/9907018},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9907018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9907030,
author = {David Eppstein and
Marshall W. Bern and
Brad L. Hutchings},
title = {Algorithms for Coloring Quadtrees},
journal = {CoRR},
volume = {cs.CG/9907030},
year = {1999},
url = {https://arxiv.org/abs/cs/9907030},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9907030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9907031,
author = {David Eppstein},
title = {Beta-Skeletons have Unbounded Dilation},
journal = {CoRR},
volume = {cs.CG/9907031},
year = {1999},
url = {https://arxiv.org/abs/cs/9907031},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9907031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9908003,
author = {Marshall W. Bern and
Erik D. Demaine and
David Eppstein and
Eric Kuo and
Andrea Mantler and
Jack Snoeyink},
title = {Ununfoldable Polyhedra with Convex Faces},
journal = {CoRR},
volume = {cs.CG/9908003},
year = {1999},
url = {https://arxiv.org/abs/cs/9908003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9908003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9908016,
author = {Marshall W. Bern and
David Eppstein},
title = {Quadrilateral Meshing by Circle Packing},
journal = {CoRR},
volume = {cs.CG/9908016},
year = {1999},
url = {https://arxiv.org/abs/cs/9908016},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9908016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9909001,
author = {Marshall W. Bern and
David Eppstein and
Pankaj K. Agarwal and
Nina Amenta and
L. Paul Chew and
Tamal K. Dey and
David P. Dobkin and
Herbert Edelsbrunner and
Cindy Grimm and
Leonidas J. Guibas and
John Harer and
Joel Hass and
Andrew Hicks and
Carroll K. Johnson and
Gilad Lerman and
David Letscher and
Paul E. Plassmann and
Eric Sedgwick and
Jack Snoeyink and
Jeff Weeks and
Chee{-}Keng Yap and
Denis Zorin},
title = {Emerging Challenges in Computational Topology},
journal = {CoRR},
volume = {cs.CG/9909001},
year = {1999},
url = {https://arxiv.org/abs/cs/9909001},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9909001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9912013,
author = {Marshall W. Bern and
David Eppstein},
title = {Multivariate Regression Depth},
journal = {CoRR},
volume = {cs.CG/9912013},
year = {1999},
url = {https://arxiv.org/abs/cs/9912013},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9912013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DM-9907002,
author = {Xianping Ge and
David Eppstein and
Padhraic Smyth},
title = {The Distribution of Cycle Lengths in Graphical Models for Iterative
Decoding},
journal = {CoRR},
volume = {cs.DM/9907002},
year = {1999},
url = {https://arxiv.org/abs/cs/9907002},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DM-9907002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-9907001,
author = {David Eppstein},
title = {Setting Parameters by Example},
journal = {CoRR},
volume = {cs.DS/9907001},
year = {1999},
url = {https://arxiv.org/abs/cs/9907001},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-9907001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-9911003,
author = {David Eppstein},
title = {Subgraph Isomorphism in Planar Graphs and Related Problems},
journal = {CoRR},
volume = {cs.DS/9911003},
year = {1999},
url = {https://arxiv.org/abs/cs/9911003},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-9911003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-9912014,
author = {David Eppstein},
title = {Fast Hierarchical Clustering and Other Applications of Dynamic Closest
Pairs},
journal = {CoRR},
volume = {cs.DS/9912014},
year = {1999},
url = {https://arxiv.org/abs/cs/9912014},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-9912014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-CO-9910185,
author = {Michael B. Dillencourt and
David Eppstein and
Daniel S. Hirschberg},
title = {Geometric Thickness of Complete Graphs},
journal = {CoRR},
volume = {math.CO/9910185},
year = {1999},
url = {https://arxiv.org/abs/math/9910185},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-CO-9910185.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BarequetDE98,
author = {Gill Barequet and
Matthew Dickerson and
David Eppstein},
title = {On triangulating three-dimensional polygons},
journal = {Comput. Geom.},
volume = {10},
number = {3},
pages = {155--170},
year = {1998},
url = {https://doi.org/10.1016/S0925-7721(98)00005-4},
doi = {10.1016/S0925-7721(98)00005-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BarequetDE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cvgip/AmentaBE98,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein},
title = {The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction},
journal = {Graph. Model. Image Process.},
volume = {60},
number = {2},
pages = {125--135},
year = {1998},
url = {https://doi.org/10.1006/gmip.1998.0465},
doi = {10.1006/GMIP.1998.0465},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cvgip/AmentaBE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein98,
author = {David Eppstein},
title = {Geometric Lower Bounds for Parametric Matroid Optimization},
journal = {Discret. Comput. Geom.},
volume = {20},
number = {4},
pages = {463--476},
year = {1998},
url = {https://doi.org/10.1007/PL00009396},
doi = {10.1007/PL00009396},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGIS98,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
title = {Separator-Based Sparsification {II:} Edge and Vertex Connectivity},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {341--381},
year = {1998},
url = {https://doi.org/10.1137/S0097539794269072},
doi = {10.1137/S0097539794269072},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinGIS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Eppstein98,
author = {David Eppstein},
title = {Finding the k Shortest Paths},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {652--673},
year = {1998},
url = {https://doi.org/10.1137/S0097539795290477},
doi = {10.1137/S0097539795290477},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Eppstein98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinE98,
author = {David Eppstein and
Jeff Erickson},
editor = {Ravi Janardan},
title = {Raising Roofs, Crashing Cycles, and Playing Pool: Applications of
a Data Structure for Finding Pairwise Interactions},
booktitle = {Proceedings of the Fourteenth Annual Symposium on Computational Geometry,
Minneapolis, Minnesota, USA, June 7-10, 1998},
pages = {58--67},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276884.276891},
doi = {10.1145/276884.276891},
timestamp = {Mon, 14 Jun 2021 16:25:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgarwalEGH98,
author = {Pankaj K. Agarwal and
David Eppstein and
Leonidas J. Guibas and
Monika Rauch Henzinger},
title = {Parametric and Kinetic Minimum Spanning Trees},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {596--605},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743510},
doi = {10.1109/SFCS.1998.743510},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgarwalEGH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DillencourtEH98,
author = {Michael B. Dillencourt and
David Eppstein and
Daniel S. Hirschberg},
editor = {Sue Whitesides},
title = {Geometric Thickness of Complete Graphs},
booktitle = {Graph Drawing, 6th International Symposium, GD'98, Montr{\'{e}}al,
Canada, August 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1547},
pages = {101--110},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-37623-2\_8},
doi = {10.1007/3-540-37623-2\_8},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/DillencourtEH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein98,
author = {David Eppstein},
editor = {Howard J. Karloff},
title = {Fast Hierarchical Clustering and Other Applications of Dynamic Closest
Pairs},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {619--628},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.315030},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/Eppstein98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9809037,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein and
Shang{-}Hua Teng},
title = {Regression Depth and Center Points},
journal = {CoRR},
volume = {cs.CG/9809037},
year = {1998},
url = {https://arxiv.org/abs/cs/9809037},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9809037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9809038,
author = {David Eppstein},
title = {Incremental and Decremental Maintenance of Planar Width},
journal = {CoRR},
volume = {cs.CG/9809038},
year = {1998},
url = {https://arxiv.org/abs/cs/9809038},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9809038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9809081,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein},
title = {Optimal Point Placement for Mesh Smoothing},
journal = {CoRR},
volume = {cs.CG/9809081},
year = {1998},
url = {https://arxiv.org/abs/cs/9809081},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9809081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CG-9809109,
author = {David Eppstein},
title = {Linear Complexity Hexahedral Mesh Generation},
journal = {CoRR},
volume = {cs.CG/9809109},
year = {1998},
url = {https://arxiv.org/abs/cs/9809109},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CG-9809109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein97,
author = {David Eppstein},
title = {Faster Geometric K-point {MST} Approximation},
journal = {Comput. Geom.},
volume = {8},
pages = {231--240},
year = {1997},
url = {https://doi.org/10.1016/S0925-7721(96)00021-1},
doi = {10.1016/S0925-7721(96)00021-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinPY97,
author = {David Eppstein and
Mike Paterson and
F. Frances Yao},
title = {On Nearest-Neighbor Graphs},
journal = {Discret. Comput. Geom.},
volume = {17},
number = {3},
pages = {263--282},
year = {1997},
url = {https://doi.org/10.1007/PL00009293},
doi = {10.1007/PL00009293},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinPY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Eppstein97,
author = {David Eppstein},
title = {Faster Circle Packing with Application to Non-Obtuse Triangulation},
journal = {Int. J. Comput. Geom. Appl.},
volume = {7},
number = {5},
pages = {485--492},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000296},
doi = {10.1142/S0218195997000296},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eppstein97,
author = {David Eppstein},
title = {Dynamic Connectivity in Digital Images},
journal = {Inf. Process. Lett.},
volume = {62},
number = {3},
pages = {121--126},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00056-2},
doi = {10.1016/S0020-0190(97)00056-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGIN97,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Amnon Nissenzweig},
title = {Sparsification - a technique for speeding up dynamic graph algorithms},
journal = {J. {ACM}},
volume = {44},
number = {5},
pages = {669--696},
year = {1997},
url = {https://doi.org/10.1145/265910.265914},
doi = {10.1145/265910.265914},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGIN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Eppstein97,
author = {David Eppstein},
title = {Minimum Range Balanced Cuts via Dynamic Subset Sums},
journal = {J. Algorithms},
volume = {23},
number = {2},
pages = {375--385},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0841},
doi = {10.1006/JAGM.1996.0841},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EppsteinH97,
author = {David Eppstein and
Daniel S. Hirschberg},
title = {Choosing Subsets with Maximum Weighted Average},
journal = {J. Algorithms},
volume = {24},
number = {1},
pages = {177--193},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0849},
doi = {10.1006/JAGM.1996.0849},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EppsteinH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein97,
author = {David Eppstein},
editor = {Michael E. Saks},
title = {Faster Construction of Planar Two-Centers},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {131--138},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314198},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AmentaBE97,
author = {Nina Amenta and
Marshall W. Bern and
David Eppstein},
editor = {Michael E. Saks},
title = {Optimal Point Placement for Mesh Smoothing},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {528--537},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314383},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AmentaBE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EppsteinH97,
author = {David Eppstein and
David Hart},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {An Efficient Algorithm for Shortest Paths in Vertical and Horizontal
Segments},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {234--247},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_63},
doi = {10.1007/3-540-63307-3\_63},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/EppsteinH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein96,
author = {David Eppstein},
title = {Average Case Analysis of Dynamic Geometric Optimization},
journal = {Comput. Geom.},
volume = {6},
pages = {45--68},
year = {1996},
url = {https://doi.org/10.1016/0925-7721(95)00018-6},
doi = {10.1016/0925-7721(95)00018-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/ClarksonEMST96,
author = {Kenneth L. Clarkson and
David Eppstein and
Gary L. Miller and
Carl Sturtivant and
Shang{-}Hua Teng},
title = {Approximating center points with iterative Radon points},
journal = {Int. J. Comput. Geom. Appl.},
volume = {6},
number = {3},
pages = {357--377},
year = {1996},
url = {https://doi.org/10.1142/S021819599600023X},
doi = {10.1142/S021819599600023X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijcga/ClarksonEMST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EppsteinGIS96,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
title = {Separator Based Sparsification. I. Planary Testing and Minimum Spanning
Trees},
journal = {J. Comput. Syst. Sci.},
volume = {52},
number = {1},
pages = {3--27},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0002},
doi = {10.1006/JCSS.1996.0002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EppsteinGIS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Fernandez-BacaSE96,
author = {David Fern{\'{a}}ndez{-}Baca and
Giora Slutzki and
David Eppstein},
title = {Using Sparsification for Parametric Minimum Spanning Tree Problems},
journal = {Nord. J. Comput.},
volume = {3},
number = {4},
pages = {352--366},
year = {1996},
timestamp = {Mon, 24 Jul 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/Fernandez-BacaSE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tog/DobkinEM96,
author = {David P. Dobkin and
David Eppstein and
Don P. Mitchell},
title = {Computing the Discrepancy with Applications to Supersampling Patterns},
journal = {{ACM} Trans. Graph.},
volume = {15},
number = {4},
pages = {354--376},
year = {1996},
url = {https://doi.org/10.1145/234535.234536},
doi = {10.1145/234535.234536},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tog/DobkinEM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BarequetDE96,
author = {Gill Barequet and
Matthew Dickerson and
David Eppstein},
editor = {Sue Whitesides},
title = {On Triangulating Three-Dimensional Polygons},
booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry,
Philadelphia, PA, USA, May 24-26, 1996},
pages = {38--47},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237218.237234},
doi = {10.1145/237218.237234},
timestamp = {Mon, 14 Jun 2021 16:25:18 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BarequetDE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Eppstein96,
author = {David Eppstein},
editor = {Sue Whitesides},
title = {Linear Complexity Hexahedral Mesh Generation},
booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry,
Philadelphia, PA, USA, May 24-26, 1996},
pages = {58--67},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237218.237237},
doi = {10.1145/237218.237237},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Eppstein96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-BacaSE96,
author = {David Fern{\'{a}}ndez{-}Baca and
Giora Slutzki and
David Eppstein},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Using Sparsification for Parametric Minimum Spanning Tree Problems},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {149--160},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_128},
doi = {10.1007/3-540-61422-2\_128},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-BacaSE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Eppstein95,
author = {David Eppstein},
title = {Asymptotic Speed-Ups in Constructive Solid Geometry},
journal = {Algorithmica},
volume = {13},
number = {5},
pages = {462--471},
year = {1995},
url = {https://doi.org/10.1007/BF01190849},
doi = {10.1007/BF01190849},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Eppstein95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DickersonE95,
author = {Matthew Dickerson and
David Eppstein},
title = {Algorithms for Proximity Problems in Higher Dimensions},
journal = {Comput. Geom.},
volume = {5},
pages = {277--291},
year = {1995},
url = {https://doi.org/10.1016/0925-7721(95)00009-7},
doi = {10.1016/0925-7721(95)00009-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DickersonE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein95,
author = {David Eppstein},
title = {Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions},
journal = {Discret. Comput. Geom.},
volume = {13},
pages = {111--122},
year = {1995},
url = {https://doi.org/10.1007/BF02574030},
doi = {10.1007/BF02574030},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/EppsteinMT95,
author = {David Eppstein and
Gary L. Miller and
Shang{-}Hua Teng},
title = {A Deterministic Linear Time Algorithm for Geometric Separators and
its Applications},
journal = {Fundam. Informaticae},
volume = {22},
number = {4},
pages = {309--329},
year = {1995},
url = {https://doi.org/10.3233/FI-1995-2241},
doi = {10.3233/FI-1995-2241},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/EppsteinMT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernDE95,
author = {Marshall W. Bern and
David P. Dobkin and
David Eppstein},
title = {Triangulating polygons without large angles},
journal = {Int. J. Comput. Geom. Appl.},
volume = {5},
pages = {171--192},
year = {1995},
url = {https://doi.org/10.1142/S0218195995000106},
doi = {10.1142/S0218195995000106},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernDE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BernEGHSW95,
author = {Marshall W. Bern and
David Eppstein and
Leonidas J. Guibas and
John Hershberger and
Subhash Suri and
Jan Wolter},
editor = {Paul G. Spirakis},
title = {The Centroid of Points with Approximate Weights},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {460--472},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_163},
doi = {10.1007/3-540-60313-1\_163},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BernEGHSW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeigelE95,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in Time O(1.3446\({}^{\mbox{n}}\)): {A} No-MIS Algorithm},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {444--452},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492575},
doi = {10.1109/SFCS.1995.492575},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeigelE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernCER95,
author = {Marshall W. Bern and
L. Paul Chew and
David Eppstein and
Jim Ruppert},
editor = {Kenneth L. Clarkson},
title = {Dihedral Bounds for Mesh Generation in High Dimensions},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {189--196},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313694},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/BernCER95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein95,
author = {David Eppstein},
editor = {Kenneth L. Clarkson},
title = {Subgraph Isomorphism in Planar Graphs and Related Problems},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {632--640},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313830},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Eppstein95,
author = {David Eppstein},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Geometric lower bounds for parametric matroid optimization},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {662--671},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225284},
doi = {10.1145/225058.225284},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Eppstein95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-033,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in time O(1.3446\({}^{\mbox{n}}\)): {A} no-MIS Algorithm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-033}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-033/index.html},
eprinttype = {ECCC},
eprint = {TR95-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BernDEG94,
author = {Marshall W. Bern and
David P. Dobkin and
David Eppstein and
Robert L. Grossman},
title = {Visibility with a Moving Point of View},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {360--378},
year = {1994},
url = {https://doi.org/10.1007/BF01187019},
doi = {10.1007/BF01187019},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BernDEG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Eppstein94,
author = {David Eppstein},
title = {Approximating the Minimum Weight Steiner Triangulation},
journal = {Discret. Comput. Geom.},
volume = {11},
pages = {163--191},
year = {1994},
url = {https://doi.org/10.1007/BF02574002},
doi = {10.1007/BF02574002},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinE94,
author = {David Eppstein and
Jeff Erickson},
title = {Iterated Nearest Neighbors and Finding Minimal Polytopes},
journal = {Discret. Comput. Geom.},
volume = {11},
pages = {321--350},
year = {1994},
url = {https://doi.org/10.1007/BF02574012},
doi = {10.1007/BF02574012},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinE94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AronovBE94,
author = {Boris Aronov and
Marshall W. Bern and
David Eppstein},
title = {On the Number of Minimal 1-Steiner Trees},
journal = {Discret. Comput. Geom.},
volume = {12},
pages = {29--34},
year = {1994},
url = {https://doi.org/10.1007/BF02574363},
doi = {10.1007/BF02574363},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AronovBE94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Eppstein94,
author = {David Eppstein},
title = {Tree-weighted neighbors and geometric k smallest spanning trees},
journal = {Int. J. Comput. Geom. Appl.},
volume = {4},
number = {2},
pages = {229--238},
year = {1994},
url = {https://doi.org/10.1142/S0218195994000136},
doi = {10.1142/S0218195994000136},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eppstein94,
author = {David Eppstein},
title = {Arboricity and Bipartite Subgraph Listing Algorithms},
journal = {Inf. Process. Lett.},
volume = {51},
number = {4},
pages = {207--211},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90121-X},
doi = {10.1016/0020-0190(94)90121-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Eppstein94,
author = {David Eppstein},
title = {Offline Algorithms for Dynamic Minimum Spanning Tree Problems},
journal = {J. Algorithms},
volume = {17},
number = {2},
pages = {237--250},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1033},
doi = {10.1006/JAGM.1994.1033},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BernEG94,
author = {Marshall W. Bern and
David Eppstein and
John R. Gilbert},
title = {Provably Good Mesh Generation},
journal = {J. Comput. Syst. Sci.},
volume = {48},
number = {3},
pages = {384--409},
year = {1994},
url = {https://doi.org/10.1016/S0022-0000(05)80059-5},
doi = {10.1016/S0022-0000(05)80059-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BernEG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Eppstein94,
author = {David Eppstein},
title = {Finding the k Shortest Paths},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {154--165},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365697},
doi = {10.1109/SFCS.1994.365697},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein94,
author = {David Eppstein},
editor = {Daniel Dominic Sleator},
title = {Average Case Analysis of Dynamic Geometric Optimization},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {77--86},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314481},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/Eppstein94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein94a,
author = {David Eppstein},
editor = {Daniel Dominic Sleator},
title = {Clustering for Faster Network Simplex Pivots},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {160--166},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314490},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BernEEMT93,
author = {Marshall W. Bern and
Herbert Edelsbrunner and
David Eppstein and
Scott A. Mitchell and
Tiow Seng Tan},
title = {Edge Insertion for Optimal Triangulations},
journal = {Discret. Comput. Geom.},
volume = {10},
pages = {47--65},
year = {1993},
url = {https://doi.org/10.1007/BF02573962},
doi = {10.1007/BF02573962},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BernEEMT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EppsteinITTWY93,
author = {David Eppstein and
Giuseppe F. Italiano and
Roberto Tamassia and
Robert Endre Tarjan and
Jeffery R. Westbrook and
Moti Yung},
title = {Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic
Plane Graph},
journal = {J. Algorithms},
volume = {15},
number = {1},
pages = {173},
year = {1993},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EppsteinITTWY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Eppstein93,
author = {David Eppstein},
title = {Improved Bounds for Intersecting Triangles and Halving Planes},
journal = {J. Comb. Theory {A}},
volume = {62},
number = {1},
pages = {176--182},
year = {1993},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Eppstein93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Eppstein93,
author = {David Eppstein},
title = {Connectivity, graph minors, and subgraph multiplicity},
journal = {J. Graph Theory},
volume = {17},
number = {3},
pages = {409--416},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170314},
doi = {10.1002/JGT.3190170314},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Eppstein93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/DobkinE93,
author = {David P. Dobkin and
David Eppstein},
editor = {Chee Yap},
title = {Computing the Discrepancy},
booktitle = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
Diego, CA, USA, May 19-21, 1993},
pages = {47--52},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/160985.160997},
doi = {10.1145/160985.160997},
timestamp = {Mon, 14 Jun 2021 16:25:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/DobkinE93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ClarksonEMST93,
author = {Kenneth L. Clarkson and
David Eppstein and
Gary L. Miller and
Carl Sturtivant and
Shang{-}Hua Teng},
editor = {Chee Yap},
title = {Approximating Center Points with Iterated Radon Points},
booktitle = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
Diego, CA, USA, May 19-21, 1993},
pages = {91--98},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/160985.161004},
doi = {10.1145/160985.161004},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/ClarksonEMST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EppsteinMT93,
author = {David Eppstein and
Gary L. Miller and
Shang{-}Hua Teng},
editor = {Chee Yap},
title = {A Deterministic Linear Time Algorithm for Geometric Separators and
its Applications},
booktitle = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
Diego, CA, USA, May 19-21, 1993},
pages = {99--108},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/160985.161005},
doi = {10.1145/160985.161005},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EppsteinMT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernE93,
author = {Marshall W. Bern and
David Eppstein},
editor = {Chee Yap},
title = {Worst-Case Bounds for Subadditive Geometric Graphs},
booktitle = {Proceedings of the Ninth Annual Symposium on Computational GeometrySan
Diego, CA, USA, May 19-21, 1993},
pages = {183--188},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/160985.161018},
doi = {10.1145/160985.161018},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernE93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinE93,
author = {David Eppstein and
Jeff Erickson},
editor = {Vijaya Ramachandran},
title = {Iterated Nearest Neighbors and Finding Minimal Polytopes},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {64--73},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313612},
timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinE93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EppsteinGIS93,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Separator based sparsification for dynamic planar graph algorithms},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {208--217},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167159},
doi = {10.1145/167088.167159},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EppsteinGIS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BernET93,
author = {Marshall W. Bern and
David Eppstein and
Shang{-}Hua Teng},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Parallel Construction of Quadtrees and Quality Triangulations},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {188--199},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_247},
doi = {10.1007/3-540-57155-8\_247},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BernET93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Eppstein92,
author = {David Eppstein},
title = {Finding the \emph{k} Smallest Spanning Trees},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {237--248},
year = {1992},
url = {https://doi.org/10.1007/BF01994879},
doi = {10.1007/BF01994879},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Eppstein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinORW92,
author = {David Eppstein and
Mark H. Overmars and
G{\"{u}}nter Rote and
Gerhard J. Woeginger},
title = {Finding Minimum Area k-gons},
journal = {Discret. Comput. Geom.},
volume = {7},
pages = {45--58},
year = {1992},
url = {https://doi.org/10.1007/BF02187823},
doi = {10.1007/BF02187823},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/EppsteinORW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Eppstein92,
author = {David Eppstein},
title = {Parallel Recognition of Series-Parallel Graphs},
journal = {Inf. Comput.},
volume = {98},
number = {1},
pages = {41--55},
year = {1992},
url = {https://doi.org/10.1016/0890-5401(92)90041-D},
doi = {10.1016/0890-5401(92)90041-D},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Eppstein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernE92,
author = {Marshall W. Bern and
David Eppstein},
title = {Polynomial-size nonobtuse triangulation of polygons},
journal = {Int. J. Comput. Geom. Appl.},
volume = {2},
number = {3},
pages = {241--255},
year = {1992},
url = {https://doi.org/10.1142/S0218195992000159},
doi = {10.1142/S0218195992000159},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernE92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernE92a,
author = {Marshall W. Bern and
David Eppstein},
title = {Erratum: Polynomial-size nonobtuse triangulation of polygons},
journal = {Int. J. Comput. Geom. Appl.},
volume = {2},
number = {4},
pages = {449--450},
year = {1992},
url = {https://doi.org/10.1142/S0218195992000305},
doi = {10.1142/S0218195992000305},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernE92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Eppstein92,
author = {David Eppstein},
title = {Dynamic Three-Dimensional Linear Programming},
journal = {{INFORMS} J. Comput.},
volume = {4},
number = {4},
pages = {360--368},
year = {1992},
url = {https://doi.org/10.1287/ijoc.4.4.360},
doi = {10.1287/IJOC.4.4.360},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Eppstein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGGI92,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {I:} Linear Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {519--545},
year = {1992},
url = {https://doi.org/10.1145/146637.146650},
doi = {10.1145/146637.146650},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGGI92a,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {II:} Convex and Concave Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {546--567},
year = {1992},
url = {https://doi.org/10.1145/146637.146656},
doi = {10.1145/146637.146656},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EppsteinITTWY92,
author = {David Eppstein and
Giuseppe F. Italiano and
Roberto Tamassia and
Robert Endre Tarjan and
Jeffery R. Westbrook and
Moti Yung},
title = {Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph},
journal = {J. Algorithms},
volume = {13},
number = {1},
pages = {33--54},
year = {1992},
url = {https://doi.org/10.1016/0196-6774(92)90004-V},
doi = {10.1016/0196-6774(92)90004-V},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EppsteinITTWY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EppsteinHTY92,
author = {David Eppstein and
Lane A. Hemachandra and
James Tisdall and
B{\"{u}}lent Yener},
title = {Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity
Classes},
journal = {Math. Syst. Theory},
volume = {25},
number = {1},
pages = {23--36},
year = {1992},
url = {https://doi.org/10.1007/BF01368782},
doi = {10.1007/BF01368782},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EppsteinHTY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernDE92,
author = {Marshall W. Bern and
David P. Dobkin and
David Eppstein},
editor = {David Avis},
title = {Triangulating Polygons without Large Angles},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {222--231},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142722},
doi = {10.1145/142675.142722},
timestamp = {Mon, 14 Jun 2021 16:24:47 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernDE92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EppsteinGIN92,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Amnon Nissenzweig},
title = {Sparsification-A Technique for Speeding up Dynamic Graph Algorithms
(Extended Abstract)},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {60--69},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267818},
doi = {10.1109/SFCS.1992.267818},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EppsteinGIN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgarwalEM92,
author = {Pankaj K. Agarwal and
David Eppstein and
Jir{\'{\i}} Matousek},
title = {Dynamic Half-Space Reporting, Geometric Optimization, and Minimum
Spanning Trees},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {80--89},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267816},
doi = {10.1109/SFCS.1992.267816},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgarwalEM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BernEEMT92,
author = {Marshall W. Bern and
Herbert Edelsbrunner and
David Eppstein and
Scott A. Mitchell and
Tiow Seng Tan},
editor = {Imre Simon},
title = {Edge Insertion for Optional Triangulations},
booktitle = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {583},
pages = {46--60},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0023816},
doi = {10.1007/BFB0023816},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BernEEMT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein92,
author = {David Eppstein},
editor = {Greg N. Frederickson},
title = {Approximating the Minimum Weight Triangulation},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {48--57},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139415},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/Eppstein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Eppstein92a,
author = {David Eppstein},
editor = {Greg N. Frederickson},
title = {New Algorithms for Minimum Area \emph{k}-gons},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {83--88},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139422},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Eppstein92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein91,
author = {David Eppstein},
title = {The Farthest Point Delaunay Triangulation Minimizes Angles},
journal = {Comput. Geom.},
volume = {1},
pages = {143--148},
year = {1991},
url = {https://doi.org/10.1016/0925-7721(92)90013-I},
doi = {10.1016/0925-7721(92)90013-I},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BernEY91,
author = {Marshall W. Bern and
David Eppstein and
F. Frances Yao},
title = {The expected extremes in a Delaunay triangulation},
journal = {Int. J. Comput. Geom. Appl.},
volume = {1},
number = {1},
pages = {79--91},
year = {1991},
url = {https://doi.org/10.1142/S0218195991000074},
doi = {10.1142/S0218195991000074},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BernEY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakE91,
author = {Marek Chrobak and
David Eppstein},
title = {Planar Orientations with Low Out-degree and Compaction of Adjacency
Matrices},
journal = {Theor. Comput. Sci.},
volume = {86},
number = {2},
pages = {243--266},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90020-3},
doi = {10.1016/0304-3975(91)90020-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakE91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernE91,
author = {Marshall W. Bern and
David Eppstein},
editor = {Robert L. Scot Drysdale},
title = {Polynomial-Size Nonobtuse Triangulation of Polygons},
booktitle = {Proceedings of the Seventh Annual Symposium on Computational Geometry,
North Conway, NH, USA, , June 10-12, 1991},
pages = {342--350},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/109648.109686},
doi = {10.1145/109648.109686},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernE91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Eppstein91,
author = {David Eppstein},
title = {Dynamic Three-Dimensional Linear Programming},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {488--494},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185410},
doi = {10.1109/SFCS.1991.185410},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Eppstein91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernEY91,
author = {Marshall W. Bern and
David Eppstein and
F. Frances Yao},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {The Expected Extremes in a Delaunay Triangulation},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {674--685},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_173},
doi = {10.1007/3-540-54233-7\_173},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BernEY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChrobakEIY91,
author = {Marek Chrobak and
David Eppstein and
Giuseppe F. Italiano and
Moti Yung},
editor = {Alok Aggarwal},
title = {Efficient Sequential and Parallel Algorithms for Computing Recovery
Points in Trees and Paths},
booktitle = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1991, San Francisco, California, {USA}},
pages = {158--167},
publisher = {{ACM/SIAM}},
year = {1991},
url = {http://dl.acm.org/citation.cfm?id=127787.127821},
timestamp = {Thu, 05 Jul 2018 07:28:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChrobakEIY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Eppstein91,
author = {David Eppstein},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Offline Algorithms for Dynamic Minimum Spanning Tree Problems},
booktitle = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
August 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {519},
pages = {392--399},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0028278},
doi = {10.1007/BFB0028278},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/Eppstein91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EppsteinFL90,
author = {David Eppstein and
Joan Feigenbaum and
Chung{-}Lun Li},
title = {Equipartitions of graphs},
journal = {Discret. Math.},
volume = {91},
number = {3},
pages = {239--248},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90233-8},
doi = {10.1016/0012-365X(90)90233-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EppsteinFL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Eppstein90,
author = {David Eppstein},
title = {Sequence Comparison with Mixed Convex and Concave Costs},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {85--101},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90031-9},
doi = {10.1016/0196-6774(90)90031-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Eppstein90,
author = {David Eppstein},
title = {Reset Sequences for Monotonic Automata},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {500--510},
year = {1990},
url = {https://doi.org/10.1137/0219033},
doi = {10.1137/0219033},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BernEPY90,
author = {Marshall W. Bern and
David Eppstein and
Paul E. Plassmann and
F. Frances Yao},
editor = {Jacob E. Goodman and
Richard Pollack and
William Steiger},
title = {Horizon Theorems for Lines and Polygons},
booktitle = {Discrete and Computational Geometry: Papers from the {DIMACS} Special
Year},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {6},
pages = {45--66},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/006/03},
doi = {10.1090/DIMACS/006/03},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BernEPY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernEG90,
author = {Marshall W. Bern and
David Eppstein and
John R. Gilbert},
title = {Provably Good Mesh Generation},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {231--241},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89542},
doi = {10.1109/FSCS.1990.89542},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernEG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinITTWY90,
author = {David Eppstein and
Giuseppe F. Italiano and
Roberto Tamassia and
Robert Endre Tarjan and
Jeffery R. Westbrook and
Moti Yung},
editor = {David S. Johnson},
title = {Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {1--11},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320177},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinITTWY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernDEG90,
author = {Marshall W. Bern and
David P. Dobkin and
David Eppstein and
Robert L. Grossman},
editor = {David S. Johnson},
title = {Visibility with a Moving Point of View},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {107--117},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320188},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernDEG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinGGI90,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
editor = {David S. Johnson},
title = {Sparse Dynamic Programming},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {513--522},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320238},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EppsteinGGI90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Eppstein90,
author = {David Eppstein},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Finding the k Smallest Spanning Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {38--47},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_76},
doi = {10.1007/3-540-52846-6\_76},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EppsteinG89,
author = {David Eppstein and
Zvi Galil},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {Parallel Algorithmic Techniques for Combinatorial Computation},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {304--318},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035768},
doi = {10.1007/BFB0035768},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EppsteinG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EppsteinGG88,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo},
title = {Speeding up Dynamic Programming},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {488--496},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21965},
doi = {10.1109/SFCS.1988.21965},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EppsteinGG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Eppstein88,
author = {David Eppstein},
editor = {Timo Lepist{\"{o}} and
Arto Salomaa},
title = {Reset Sequences for Finite Automata with Application to Design of
Parts Orienters},
booktitle = {Automata, Languages and Programming, 15th International Colloquium,
ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {317},
pages = {230--238},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19488-6\_119},
doi = {10.1007/3-540-19488-6\_119},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Eppstein88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/Eppstein85,
author = {David Eppstein},
editor = {Aravind K. Joshi},
title = {A Heuristic Approach to Program Inversion},
booktitle = {Proceedings of the 9th International Joint Conference on Artificial
Intelligence. Los Angeles, CA, USA, August 1985},
pages = {219--221},
publisher = {Morgan Kaufmann},
year = {1985},
url = {http://ijcai.org/Proceedings/85-1/Papers/040.pdf},
timestamp = {Tue, 20 Aug 2019 16:19:04 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/Eppstein85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-12 03:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
