David Eppstein

721 papers A* 63A 54B 51C 3Misc 6Journal 453Unranked 83

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. ESA David Eppstein, Michael T. Goodrich, Songyu Liu
2025	J	`jnl`	Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. CoRR David Eppstein, Michael T. Goodrich, Songyu Liu
2025	J	`jnl`	Better Late than Never: the Complexity of Arrangements of Polyhedra. CoRR Boris Aronov, Sang Won Bae, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer, Raimund Seidel
2025	J	`jnl`	Bicriteria Polygon Aggregation with Arbitrary Shapes. CoRR Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman J. Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, Jonas Sauer
2025	J	`jnl`	Computational Complexities of Folding. J. Inf. Process. David Eppstein
2025	B	`conf`	Computational Geometry with Probabilistically Noisy Primitive Operations. WADS David Eppstein, Michael T. Goodrich, Vinesh Sridhar
2025	J	`jnl`	Computational Geometry with Probabilistically Noisy Primitive Operations. CoRR David Eppstein, Michael T. Goodrich, Vinesh Sridhar
2025	—	`conf`	Decremental Greedy Polygons and Polyhedra Without Sharp Angles. CCCG David Eppstein
2025	J	`jnl`	Decremental Greedy Polygons and Polyhedra Without Sharp Angles. CoRR David Eppstein
2025	—	`conf`	Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness. CCCG David Eppstein, Michael T. Goodrich, Abraham M. Illickan, Claire A. To
2025	J	`jnl`	Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness. CoRR David Eppstein, Michael T. Goodrich, Abraham M. Illickan, Claire A. To
2025	A*	`conf`	Non-Euclidean Erdős-Anning Theorems. SoCG David Eppstein
2025	J	`jnl`	Noncrossing Longest Paths and Cycles. Graphs Comb. Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2025	J	`jnl`	On the Complexity of Embedding in Graph Products. Comput. Geom. Topol. Therese Biedl, David Eppstein, Torsten Ueckerdt
2025	J	`jnl`	On the expansion of Hanoi graphs. CoRR David Eppstein, Daniel Frishberg, William Maxwell
2025	J	`jnl`	Orthogonal Dissection into Few Rectangles. Discret. Comput. Geom. David Eppstein
2025	J	`jnl`	Stabbing Faces By a Convex Curve. CoRR David Eppstein
2025	A	`conf`	Stabbing Faces by a Convex Curve. GD David Eppstein
2025	A	`conf`	String Graph Obstacles of High Girth and of Bounded Degree. GD Maria Chudnovsky, David Eppstein, David Fischer
2025	J	`jnl`	String Graph Obstacles of High Girth and of Bounded Degree. CoRR Maria Chudnovsky, David Eppstein, David Fischer
2025	A	`conf`	Visualizing Treewidth. GD Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg
2025	J	`jnl`	Visualizing Treewidth. CoRR Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg
2025	—	`conf`	Zip-Tries: Simple Dynamic Data Structures for Strings. ACDA David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa
2025	J	`jnl`	Zip-Tries: Simple Dynamic Data Structures for Strings. CoRR David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa
2024	J	`jnl`	Computational Complexities of Folding. CoRR David Eppstein
2024	A	`conf`	Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. GD David Eppstein, Michael T. Goodrich, Abraham M. Illickan
2024	J	`jnl`	Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. CoRR David Eppstein, Michael T. Goodrich, Abraham M. Illickan
2024	J	`jnl`	Fast Schulze Voting Using Quickselect. CoRR Arushi Arora, David Eppstein, Randy Huynh
2024	—	`conf`	Maintaining Light Spanners via Minimal Updates. CCCG Hadi Khodabandeh, David Eppstein
2024	J	`jnl`	Maintaining Light Spanners via Minimal Updates. CoRR Hadi Khodabandeh, David Eppstein
2024	J	`jnl`	Non-Euclidean Erdős-Anning Theorems. CoRR David Eppstein
2024	J	`jnl`	Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. Algorithmica David Eppstein
2024	A	`conf`	Noncrossing Longest Paths and Cycles. GD Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024	J	`jnl`	Noncrossing Longest Paths and Cycles. CoRR Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024	J	`jnl`	On the Biplanarity of Blowups. J. Graph Algorithms Appl. David Eppstein
2024	J	`jnl`	Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
2024	J	`jnl`	The Widths of Strict Outerconfluent Graphs. Discret. Math. Theor. Comput. Sci. David Eppstein
2024	J	`jnl`	Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2024	—	`conf`	Well-Separated Multiagent Path Traversal. CCCG Gleb Dilman, David Eppstein, Valentin Polishchuk, Christiane Schmidt
2023	—	`conf`	A Parameterized Algorithm for Flat Folding. CCCG David Eppstein
2023	J	`jnl`	A Parameterized Algorithm for Flat Folding. CoRR David Eppstein
2023	J	`jnl`	A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica David Eppstein
2023	J	`jnl`	Angles of arc-polygons and Lombardi drawings of cacti. Comput. Geom. David Eppstein, Daniel Frishberg, Martha C. Osegueda
2023	—	`conf`	Geometric Graphs with Unbounded Flip-Width. CCCG David Eppstein, Rose McCarty
2023	J	`jnl`	Geometric Graphs with Unbounded Flip-Width. CoRR David Eppstein, Rose McCarty
2023	J	`jnl`	Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. Comput. Geom. Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl
2023	A*	`conf`	Improved Mixing for the Convex Polygon Triangulation Flip Walk. ICALP David Eppstein, Daniel Frishberg
2023	J	`jnl`	Locked and Unlocked Smooth Embeddings of Surfaces. Comput. Geom. Topol. David Eppstein
2023	J	`jnl`	Lower Bounds for Non-Adaptive Shortest Path Relaxation. CoRR David Eppstein
2023	B	`conf`	Lower Bounds for Non-adaptive Shortest Path Relaxation. WADS David Eppstein
2023	—	`conf`	Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) Alvin Chiu, David Eppstein, Michael T. Goodrich
2023	J	`jnl`	Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. CoRR Alvin Chiu, David Eppstein, Michael T. Goodrich
2023	A*	`conf`	Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. SoCG David Eppstein
2023	J	`jnl`	Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. CoRR David Eppstein
2023	—	`conf`	On the Biplanarity of Blowups. GD (1) David Eppstein
2023	—	`conf`	On the complexity of embedding in graph products. CCCG Therese Biedl, David Eppstein, Torsten Ueckerdt
2023	J	`jnl`	On the complexity of embedding in graph products. CoRR Therese Biedl, David Eppstein, Torsten Ueckerdt
2023	J	`jnl`	Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
2023	J	`jnl`	Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
2023	B	`conf`	Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. ISAAC David Eppstein, Daniel Frishberg
2023	J	`jnl`	The Complexity of Iterated Reversible Computation. TheoretiCS David Eppstein
2022	B	`conf`	Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. SPAA David Eppstein, Hadi Khodabandeh
2022	A	`conf`	Distributed Construction of Lightweight Spanners for Unit Ball Graphs. DISC David Eppstein, Hadi Khodabandeh
2022	—	`conf`	Finding Relevant Points for Nearest-Neighbor Classification. SOSA David Eppstein
2022	—	`conf`	Geodesic Paths Passing Through All Faces on A Polyhedron. JCDCGGG Erik D. Demaine, Martin L. Demaine, David Eppstein, Hiro Ito, Yuta Katayama, Wataru Maruyama, Yushi Uno
2022	J	`jnl`	Geometric Dominating Sets. CoRR Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl
2022	J	`jnl`	Improved mixing for the convex polygon triangulation flip walk. CoRR David Eppstein, Daniel Frishberg
2022	—	`conf`	Locked and Unlocked Smooth Embeddings of Surfaces. CCCG David Eppstein
2022	J	`jnl`	Locked and unlocked smooth embeddings of surfaces. CoRR David Eppstein
2022	J	`jnl`	On the treewidth of Hanoi graphs. Theor. Comput. Sci. David Eppstein, Daniel Frishberg, William Maxwell
2022	—	`conf`	Orthogonal Dissection into Few Rectangles. CCCG David Eppstein
2022	J	`jnl`	Orthogonal dissection into few rectangles. CoRR David Eppstein
2022	—	`conf`	Reflections in an Octagonal Mirror Maze. CCCG David Eppstein
2022	J	`jnl`	Reflections in an octagonal mirror maze. CoRR David Eppstein
2022	J	`jnl`	Stack-Number is Not Bounded by Queue-Number. Comb. Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
2022	J	`jnl`	Three-dimensional graph products with unbounded stack-number. CoRR David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
2022	J	`jnl`	Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
2021	B	`conf`	A Stronger Lower Bound on Parametric Minimum Spanning Trees. WADS David Eppstein
2021	J	`jnl`	A Stronger Lower Bound on Parametric Minimum Spanning Trees. CoRR David Eppstein
2021	—	`conf`	Angles of Arc-Polygons and Lombardi Drawings of Cacti. CCCG David Eppstein, Daniel Frishberg, Martha C. Osegueda
2021	J	`jnl`	Angles of Arc-Polygons and Lombardi Drawings of Cacti. CoRR David Eppstein, Daniel Frishberg, Martha C. Osegueda
2021	J	`jnl`	Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. J. Graph Algorithms Appl. David Eppstein
2021	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2021	J	`jnl`	Cubic planar graphs that cannot be drawn on few lines. J. Comput. Geom. David Eppstein
2021	J	`jnl`	Finding Relevant Points for Nearest-Neighbor Classification. CoRR David Eppstein
2021	A	`conf`	Limitations on Realistic Hyperbolic Graph Drawing. GD David Eppstein
2021	J	`jnl`	Limitations on Realistic Hyperbolic Graph Drawing. CoRR David Eppstein
2021	J	`jnl`	NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs. SIAM J. Comput. David Eppstein, Vijay V. Vazirani
2021	J	`jnl`	On Polyhedral Realization with Isosceles Triangles. Graphs Comb. David Eppstein
2021	A*	`conf`	On the Edge Crossings of the Greedy Spanner. SoCG David Eppstein, Hadi Khodabandeh
2021	Misc	`conf`	On the Treewidth of Hanoi Graphs. FUN David Eppstein, Daniel Frishberg, William Maxwell
2021	J	`jnl`	Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR David Eppstein, Hadi Khodabandeh
2021	B	`conf`	Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT David Eppstein, Siddharth Gupta, Elham Havvaei
2021	J	`jnl`	Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. CoRR David Eppstein, Siddharth Gupta, Elham Havvaei
2021	J	`jnl`	Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. CoRR David Eppstein, Daniel Frishberg
2021	J	`jnl`	The Complexity of Iterated Reversible Computation. CoRR David Eppstein
2021	B	`conf`	The Graphs of Stably Matchable Pairs. WG David Eppstein
2020	—	`conf`	Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein
2020	J	`jnl`	Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein
2020	J	`jnl`	Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
2020	J	`jnl`	Counting Polygon Triangulations is Hard. Discret. Comput. Geom. David Eppstein
2020	—	`conf`	Dynamic Products of Ranks. CCCG David Eppstein
2020	J	`jnl`	Dynamic Products of Ranks. CoRR David Eppstein
2020	J	`jnl`	Existence and Hardness of Conveyor Belts. Electron. J. Comb. Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson
2020	J	`jnl`	Face flips in origami tessellations. J. Comput. Geom. Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw
2020	J	`jnl`	Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2020	—	`conf`	Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
2020	J	`jnl`	Low-stretch spanning trees of graphs with bounded width. CoRR Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
2020	J	`jnl`	Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2020	—	`conf`	New Results in Sona Drawing: Hardness and TSP Separation. CCCG Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020	J	`jnl`	New Results in Sona Drawing: Hardness and TSP Separation. CoRR Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020	J	`jnl`	On Polyhedral Realization with Isosceles Triangles. CoRR David Eppstein
2020	J	`jnl`	On the Edge Crossings of the Greedy Spanner. CoRR David Eppstein, Hadi Khodabandeh
2020	J	`jnl`	On the treewidth of Hanoi graphs. CoRR David Eppstein, Daniel Frishberg, William Maxwell
2020	J	`jnl`	Parameterized Leaf Power Recognition via Embedding into Graph Products. Algorithmica David Eppstein, Elham Havvaei
2020	J	`jnl`	Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2020	—	`conf`	Simplifying Activity-On-Edge Graphs. SWAT David Eppstein, Daniel Frishberg, Elham Havvaei
2020	J	`jnl`	Simplifying Activity-on-Edge Graphs. CoRR David Eppstein, Daniel Frishberg, Elham Havvaei
2020	—	`conf`	Some Polycubes Have No Edge Zipper Unfolding. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke
2020	J	`jnl`	Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2020	J	`jnl`	Stack-number is not bounded by queue-number. CoRR Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
2020	J	`jnl`	The Graphs of Stably Matchable Pairs. CoRR David Eppstein
2020	J	`jnl`	Treetopes and Their Graphs. Discret. Comput. Geom. David Eppstein
2019	—	`conf`	Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CCCG David Eppstein
2019	J	`jnl`	Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CoRR David Eppstein
2019	B	`conf`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	A*	`conf`	Counting Polygon Triangulations is Hard. SoCG David Eppstein
2019	J	`jnl`	Counting Polygon Triangulations is Hard. CoRR David Eppstein
2019	J	`jnl`	Covering many points with a small-area box. J. Comput. Geom. Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2019	A*	`conf`	Cubic Planar Graphs That Cannot Be Drawn On Few Lines. SoCG David Eppstein
2019	J	`jnl`	Cubic Planar Graphs that cannot be Drawn on few Lines. CoRR David Eppstein
2019	J	`jnl`	Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. CoRR Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk
2019	J	`jnl`	Existence and hardness of conveyor belts. CoRR Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson
2019	J	`jnl`	Face flips in origami tessellations. CoRR Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw
2019	A*	`conf`	Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. SODA David Eppstein, Bruce A. Reed
2019	A	`conf`	Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
2019	J	`jnl`	Homotopy height, grid-major height and graph-drawing height. CoRR Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
2019	J	`jnl`	Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2019	B	`conf`	NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. SPAA David Eppstein, Vijay V. Vazirani
2019	B	`conf`	New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ISAAC Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk
2019	J	`jnl`	Realization and connectivity of the graphs of origami flat foldings. J. Comput. Geom. David Eppstein
2019	B	`conf`	Reconfiguring Undirected Paths. WADS Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	Reconfiguring Undirected Paths. CoRR Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	Some Polycubes Have No Edge-Unzipping. CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke
2019	J	`jnl`	Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2019	B	`conf`	Tracking Paths in Planar Graphs. ISAAC David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
2019	J	`jnl`	Tracking Paths in Planar Graphs. CoRR David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
2018	—	`ed.`	16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, Malmö, Sweden, June 18-20, 2018 SWAT David Eppstein
2018	J	`jnl`	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. J. Graph Algorithms Appl. Michael J. Bannister, David Eppstein
2018	J	`jnl`	Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs. J. Graph Algorithms Appl. David Eppstein
2018	Misc	`conf`	Faster Evaluation of Subtraction Games. FUN David Eppstein
2018	J	`jnl`	Faster Evaluation of Subtraction Games. CoRR David Eppstein
2018	J	`jnl`	Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. CoRR David Eppstein, Bruce A. Reed
2018	J	`jnl`	Flat foldings of plane graphs with prescribed angles and edge lengths. J. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2018	J	`jnl`	Folding Polyominoes into (Poly)Cubes. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2018	J	`jnl`	From Discrepancy to Majority. Algorithmica David Eppstein, Daniel S. Hirschberg
2018	—	`conf`	Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CCCG David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres
2018	J	`jnl`	Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CoRR David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres
2018	A	`conf`	Grid peeling and the affine curve-shortening flow. ALENEX David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2018	Misc	`conf`	Making Change in 2048. FUN David Eppstein
2018	J	`jnl`	Making Change in 2048. CoRR David Eppstein
2018	J	`jnl`	Minor-closed graph classes with bounded layered pathwidth. CoRR Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
2018	J	`jnl`	NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs. CoRR David Eppstein, Vijay V. Vazirani
2018	J	`jnl`	On the Planar Split Thickness of Graphs. Algorithmica David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2018	A*	`conf`	Optimally Sorting Evolving Data. ICALP Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Optimally Sorting Evolving Data. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. Michael J. Bannister, Sergio Cabello, David Eppstein
2018	B	`conf`	Parameterized Leaf Power Recognition via Embedding into Graph Products. IPEC David Eppstein, Elham Havvaei
2018	J	`jnl`	Parameterized Leaf Power Recognition via Embedding into Graph Products. CoRR David Eppstein, Elham Havvaei
2018	J	`jnl`	Planar and poly-arc Lombardi drawings. J. Comput. Geom. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg
2018	A	`conf`	Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	B	`conf`	Reactive Proximity Data Structures for Graphs. LATIN David Eppstein, Michael T. Goodrich, Nil Mamano
2018	J	`jnl`	Reactive Proximity Data Structures for Graphs. CoRR David Eppstein, Michael T. Goodrich, Nil Mamano
2018	A	`conf`	Realization and Connectivity of the Graphs of Origami Flat Foldings. GD David Eppstein
2018	J	`jnl`	Realization and Connectivity of the Graphs of Origami Flat Foldings. CoRR David Eppstein
2018	Misc	`conf`	Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. COCOON Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018	J	`jnl`	Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. CoRR Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018	J	`jnl`	Spanning Trees in Multipartite Geometric Graphs. Algorithmica Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2018	A*	`conf`	Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2018	J	`jnl`	Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. CoRR Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2018	B	`conf`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2018	J	`jnl`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2018	J	`jnl`	The Effect of Planarization on Width. J. Graph Algorithms Appl. David Eppstein
2018	B	`conf`	The Parameterized Complexity of Finding Point Sets with Hereditary Properties. IPEC David Eppstein, Daniel Lokshtanov
2018	J	`jnl`	The Parameterized Complexity of Finding Point Sets with Hereditary Properties. CoRR David Eppstein, Daniel Lokshtanov
2018	J	`jnl`	The Parametric Closure Problem. ACM Trans. Algorithms David Eppstein
2017	A*	`conf`	2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres
2017	C	`conf`	Algorithms for Stable Matching and Clustering in a Grid. IWCIA David Eppstein, Michael T. Goodrich, Nil Mamano
2017	J	`jnl`	Algorithms for Stable Matching and Clustering in a Grid. CoRR David Eppstein, Michael T. Goodrich, Nil Mamano
2017	B	`conf`	Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. SPAA David Eppstein, Michael T. Goodrich
2017	—	`conf`	Crossing Patterns in Nonplanar Road Networks. SIGSPATIAL/GIS David Eppstein, Siddharth Gupta
2017	J	`jnl`	Crossing Patterns in Nonplanar Road Networks. CoRR David Eppstein, Siddharth Gupta
2017	—	`conf`	Defining Equitable Geographic Districts in Road Networks via Stable Matching. SIGSPATIAL/GIS David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano
2017	J	`jnl`	Defining Equitable Geographic Districts in Road Networks via Stable Matching. CoRR David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano
2017	J	`jnl`	Folding Polyominoes into (Poly)Cubes. CoRR Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2017	—	`conf`	Forbidden Configurations in Discrete Geometry. CCCG David Eppstein
2017	J	`jnl`	Grid peeling and the affine curve-shortening flow. CoRR David Eppstein, Sariel Har-Peled, Gabriel Nivasch
2017	B	`conf`	K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. IPEC David Eppstein, Denis Kurz
2017	J	`jnl`	K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. CoRR David Eppstein, Denis Kurz
2017	J	`jnl`	Maximizing the sum of radii of disjoint balls or disks. J. Comput. Geom. David Eppstein
2017	B	`conf`	Maximum Plane Trees in Multipartite Geometric Graphs. WADS Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
2017	J	`jnl`	Rooted Cycle Bases. J. Graph Algorithms Appl. David Eppstein, J. Michael McCarthy, Brian E. Parrish
2017	B	`conf`	Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. ISAAC Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson
2017	J	`jnl`	Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. CoRR Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson
2017	J	`jnl`	Structure of Graphs with Locally Restricted Crossings. SIAM J. Discret. Math. Vida Dujmovic, David Eppstein, David R. Wood
2017	A	`conf`	The Effect of Planarization on Width. GD David Eppstein
2017	J	`jnl`	The Effect of Planarization on Width. CoRR David Eppstein
2017	A	`conf`	Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. GD David Eppstein
2017	J	`jnl`	Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. CoRR David Eppstein
2016	J	`jnl`	Adjacency-preserving spatial treemaps. J. Comput. Geom. Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
2016	A*	`conf`	All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
2016	J	`jnl`	Convex-Arc Drawings of Pseudolines. CoRR David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt
2016	J	`jnl`	Covering many points with a small-area box. CoRR Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2016	—	`conf`	Cuckoo Filter: Simplification and Analysis. SWAT David Eppstein
2016	J	`jnl`	Cuckoo Filter: Simplification and Analysis. CoRR David Eppstein
2016	J	`jnl`	Distance-Sensitive Planar Point Location. CoRR Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
2016	J	`jnl`	Distance-sensitive planar point location. Comput. Geom. Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
2016	J	`jnl`	Folding a paper strip to minimize thickness. J. Discrete Algorithms Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2016	B	`conf`	From Discrepancy to Majority. LATIN David Eppstein, Daniel S. Hirschberg
2016	—	`conf`	Maximizing the Sum of Radii of Disjoint Balls or Disks. CCCG David Eppstein
2016	J	`jnl`	Maximizing the Sum of Radii of Disjoint Balls or Disks. CoRR David Eppstein
2016	C	`conf`	Models and Algorithms for Graph Watermarking. ISC David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	J	`jnl`	Models and Algorithms for Graph Watermarking. CoRR David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	B	`conf`	On the Planar Split Thickness of Graphs. LATIN David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2016	J	`jnl`	Rigid origami vertices: conditions and forcing sets. J. Comput. Geom. Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi
2016	C	`conf`	Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. ATMOS Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
2016	J	`jnl`	Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
2016	J	`jnl`	Simple Recognition of Halin Graphs and Their Generalizations. J. Graph Algorithms Appl. David Eppstein
2016	J	`jnl`	Spanning Trees in Multipartite Geometric Graphs. CoRR Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2016	J	`jnl`	Strict confluent drawing. J. Comput. Geom. David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
2016	A	`conf`	Track Layout Is Hard. GD Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2016	A*	`conf`	Treetopes and their Graphs. SODA David Eppstein
2015	J	`jnl`	Approximate Greedy Clustering and Distance Selection for Graph Metrics. CoRR David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
2015	A	`conf`	Confluent Orthogonal Drawings of Syntax Diagrams. GD Michael J. Bannister, David A. Brown, David Eppstein
2015	J	`jnl`	Confluent Orthogonal Drawings of Syntax Diagrams. CoRR Michael J. Bannister, David A. Brown, David Eppstein
2015	B	`conf`	Contact Graphs of Circular Arcs. WADS Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015	J	`jnl`	Contact Representations of Sparse Planar Graphs. CoRR Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015	J	`jnl`	D3-Reducible Graphs. CoRR David Eppstein
2015	J	`jnl`	Erratum to: Antimatroids and Balanced Pairs. Order David Eppstein, Veit Wiechert
2015	A*	`conf`	Finding All Maximal Subsequences with Hereditary Properties. SoCG Drago Bokal, Sergio Cabello, David Eppstein
2015	—	`conf`	Folding Polyominoes into (Poly)Cubes. CCCG Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
2015	B	`conf`	Folding a Paper Strip to Minimize Thickness. WALCOM Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2015	J	`jnl`	From Discrepancy to Majority. CoRR David Eppstein, Daniel S. Hirschberg
2015	A	`conf`	Genus, Treewidth, and Local Crossing Number. GD Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	Genus, Treewidth, and Local Crossing Number. CoRR Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	Improved Grid Map Layout by Point Set Matching. Int. J. Comput. Geom. Appl. David Eppstein, Marc J. van Kreveld, Bettina Speckmann, Frank Staals
2015	J	`jnl`	K-Best Enumeration. Bull. EATCS David Eppstein
2015	J	`jnl`	Metric Dimension Parameterized by Max Leaf Number. CoRR David Eppstein
2015	J	`jnl`	Metric Dimension Parameterized by Max Leaf Number. J. Graph Algorithms Appl. David Eppstein
2015	A*	`conf`	Minimum Forcing Sets for Miura Folding Patterns. SODA Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull
2015	J	`jnl`	Near-linear-time deterministic plane Steiner spanners for well-spaced point sets. Comput. Geom. Glencora Borradaile, David Eppstein
2015	J	`jnl`	Planar Induced Subgraphs of Sparse Graphs. J. Graph Algorithms Appl. Glencora Borradaile, David Eppstein, Pingan Zhu
2015	A	`ed.`	Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015 ALENEX Ulrik Brandes, David Eppstein
2015	J	`jnl`	Ramified Rectilinear Polygons: Coordinatization by Dendrons. Discret. Comput. Geom. Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein
2015	B	`conf`	Rooted Cycle Bases. WADS David Eppstein, J. Michael McCarthy, Brian E. Parrish
2015	J	`jnl`	Rooted Cycle Bases. CoRR David Eppstein, J. Michael McCarthy, Brian E. Parrish
2015	J	`jnl`	The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2015	B	`conf`	The Parametric Closure Problem. WADS David Eppstein
2015	J	`jnl`	The Parametric Closure Problem. CoRR David Eppstein
2015	J	`jnl`	Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
2015	J	`jnl`	Treetopes and their Graphs. CoRR David Eppstein
2014	J	`jnl`	$k$-best enumeration. CoRR David Eppstein
2014	J	`jnl`	A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing. Discret. Comput. Geom. David Eppstein
2014	J	`jnl`	All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
2014	J	`jnl`	Antimatroids and Balanced Pairs. Order David Eppstein
2014	A	`conf`	Balanced Circle Packings for Planar Graphs. GD Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev
2014	J	`jnl`	Balanced Circle Packings for Planar Graphs. CoRR Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev
2014	A	`conf`	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. GD Michael J. Bannister, David Eppstein
2014	J	`jnl`	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. CoRR Michael J. Bannister, David Eppstein
2014	J	`jnl`	Diamond-kite adaptive quadrilateral meshing. Eng. Comput. David Eppstein
2014	J	`jnl`	Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity. J. Graph Algorithms Appl. David Eppstein
2014	J	`jnl`	ERGMs are Hard. CoRR Michael J. Bannister, William E. Devanny, David Eppstein
2014	A	`conf`	Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. GD Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014	J	`jnl`	Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. CoRR Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
2014	J	`jnl`	Folding a Paper Strip to Minimize Thickness. CoRR Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2014	J	`jnl`	Grid Minors in Damaged Grids. Electron. J. Comb. David Eppstein
2014	B	`conf`	Linear-Time Algorithms for Proportional Apportionment. ISAAC Zhanpeng Cheng, David Eppstein
2014	J	`jnl`	Linear-time Algorithms for Proportional Apportionment. CoRR Zhanpeng Cheng, David Eppstein
2014	J	`jnl`	Minimum Forcing Sets for Miura Folding Patterns. CoRR Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull
2014	A	`conf`	Planar Induced Subgraphs of Sparse Graphs. GD Glencora Borradaile, David Eppstein, Pingan Zhu
2014	J	`jnl`	Planar Induced Subgraphs of Sparse Graphs. CoRR Glencora Borradaile, David Eppstein, Pingan Zhu
2014	—	`conf`	Small Superpatterns for Dominance Drawing. ANALCO Michael J. Bannister, William E. Devanny, David Eppstein
2014	J	`jnl`	Steinitz Theorems for Simple Orthogonal Polyhedra. J. Comput. Geom. David Eppstein, Elena Mumford
2014	J	`jnl`	Superpatterns and Universal Point Sets. J. Graph Algorithms Appl. Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
2014	A	`conf`	The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. GD Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2014	J	`jnl`	The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2014	J	`jnl`	Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
2014	B	`conf`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2014	J	`jnl`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2013	J	`jnl`	Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. Discret. Comput. Geom. David Eppstein, Maarten Löffler
2013	J	`jnl`	Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2013	J	`jnl`	Combinatorial Pair Testing: Distinguishing Workers from Slackers CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2013	B	`conf`	Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2013	J	`jnl`	Confluent Hasse Diagrams. J. Graph Algorithms Appl. David Eppstein, Joseph A. Simons
2013	J	`jnl`	Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity. CoRR David Eppstein
2013	A	`conf`	Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. GD David Eppstein
2013	J	`jnl`	Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discret. Comput. Geom. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2013	A	`conf`	Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. GD Michael J. Bannister, David Eppstein, Joseph A. Simons
2013	J	`jnl`	Fixed parameter tractability of crossing minimization of almost-trees. CoRR Michael J. Bannister, David Eppstein, Joseph A. Simons
2013	J	`jnl`	Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. Erin W. Chambers, David Eppstein
2013	J	`jnl`	Grid Minors in Damaged Grids CoRR David Eppstein
2013	B	`conf`	Improved grid map layout by point set matching. PacificVis David Eppstein, Marc J. van Kreveld, Bettina Speckmann, Frank Staals
2013	—	`book`	Knowledge Spaces, Applications in Education Jean-Claude Falmagne, Dietrich Albert, Christopher Doble, David Eppstein, Xiangen Hu
2013	—	`ch.`	Learning Sequences: An Efficient Data Structure for Learning Spaces. Knowledge Spaces, Applications in Education David Eppstein
2013	J	`jnl`	Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM J. Exp. Algorithmics David Eppstein, Maarten Löffler, Darren Strash
2013	J	`jnl`	On 2-Site Voronoi Diagrams Under Geometric Distance Functions. J. Comput. Sci. Technol. Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina
2013	J	`jnl`	Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
2013	J	`jnl`	Parameterized Complexity of 1-Planarity CoRR Michael J. Bannister, Sergio Cabello, David Eppstein
2013	B	`conf`	Parameterized Complexity of 1-Planarity. WADS Michael J. Bannister, Sergio Cabello, David Eppstein
2013	—	`ch.`	Projection, Decomposition, and Adaption of Learning Spaces. Knowledge Spaces, Applications in Education David Eppstein
2013	—	`conf`	Set-Difference Range Queries. CCCG David Eppstein, Michael T. Goodrich, Joseph A. Simons
2013	J	`jnl`	Set-Difference Range Queries. CoRR David Eppstein, Michael T. Goodrich, Joseph A. Simons
2013	J	`jnl`	Small Superpatterns for Dominance Drawing. CoRR Michael J. Bannister, William E. Devanny, David Eppstein
2013	A	`conf`	Strict Confluent Drawing. GD David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
2013	J	`jnl`	Strict Confluent Drawing. CoRR David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
2013	A	`conf`	Superpatterns and Universal Point Sets. GD Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
2013	J	`jnl`	Superpatterns and Universal Point Sets. CoRR Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
2013	J	`jnl`	The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. J. Graph Algorithms Appl. David Eppstein
2013	A*	`conf`	The graphs of planar soap bubbles. SoCG David Eppstein
2013	—	`conf`	Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
2013	A*	`conf`	Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth
2012	J	`jnl`	Area-Universal and Constrained Rectangular Layouts. SIAM J. Comput. David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek
2012	J	`jnl`	Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing CoRR David Eppstein
2012	—	`conf`	Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing. IMR David Eppstein
2012	J	`jnl`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2012	J	`jnl`	Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2012	J	`jnl`	Force-Directed Graph Drawing Using Social Gravity and Scaling CoRR Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
2012	A	`conf`	Force-Directed Graph Drawing Using Social Gravity and Scaling. GD Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
2012	J	`jnl`	Inapproximability of Orthogonal Compaction. J. Graph Algorithms Appl. Michael J. Bannister, David Eppstein, Joseph A. Simons
2012	J	`jnl`	Lombardi Drawings of Graphs. J. Graph Algorithms Appl. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2012	J	`jnl`	Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets CoRR Glencora Borradaile, David Eppstein
2012	—	`conf`	Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG Glencora Borradaile, David Eppstein
2012	A	`conf`	On the Density of Maximal 1-Planar Graphs. GD Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
2012	J	`jnl`	Planar Lombardi Drawings for Subcubic Graphs CoRR David Eppstein
2012	A	`conf`	Planar Lombardi Drawings for Subcubic Graphs. GD David Eppstein
2012	—	`conf`	Randomized Speedup of the Bellman-Ford Algorithm. ANALCO Michael J. Bannister, David Eppstein
2012	Misc	`conf`	Solving Single-Digit Sudoku Subproblems. FUN David Eppstein
2012	J	`jnl`	Solving Single-digit Sudoku Subproblems CoRR David Eppstein
2012	J	`jnl`	The Graphs of Planar Soap Bubbles CoRR David Eppstein
2012	J	`jnl`	The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. J. Graph Algorithms Appl. David Eppstein, Emma S. Spiro
2012	A	`conf`	UOBPRM: A uniformly distributed obstacle-based PRM. IROS Hsin-Yi Yeh, Shawna L. Thomas, David Eppstein, Nancy M. Amato
2012	J	`jnl`	Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges CoRR Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth
2011	J	`jnl`	Adjacency-Preserving Spatial Treemaps CoRR Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
2011	B	`conf`	Adjacency-Preserving Spatial Treemaps. WADS Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
2011	J	`jnl`	Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension CoRR David Eppstein, Maarten Löffler
2011	—	`conf`	Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. SCG David Eppstein, Maarten Löffler
2011	J	`jnl`	Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	J	`jnl`	Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	—	`conf`	Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	A	`conf`	Confluent Hasse Diagrams. GD David Eppstein, Joseph A. Simons
2011	J	`jnl`	Confluent Hasse diagrams CoRR David Eppstein, Joseph A. Simons
2011	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. David Eppstein, Emden R. Gansner
2011	J	`jnl`	Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings CoRR Michael J. Bannister, David Eppstein
2011	A	`conf`	Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. GD Michael J. Bannister, David Eppstein
2011	J	`jnl`	Listing All Maximal Cliques in Large Sparse Real-World Graphs CoRR David Eppstein, Darren Strash
2011	B	`conf`	Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA David Eppstein, Darren Strash
2011	J	`jnl`	On 2-Site Voronoi Diagrams under Geometric Distance Functions CoRR Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina
2011	—	`conf`	On 2-Site Voronoi Diagrams under Geometric Distance Functions. ISVD Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina
2011	J	`jnl`	Optimal Angular Resolution for Face-Symmetric Drawings. J. Graph Algorithms Appl. David Eppstein, Kevin A. Wortman
2011	J	`jnl`	Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. J. Comput. Geom. David Eppstein
2011	J	`jnl`	Planar and Poly-Arc Lombardi Drawings CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler
2011	A	`conf`	Planar and Poly-arc Lombardi Drawings. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler
2011	J	`jnl`	Privacy-Enhanced Methods for Comparing Compressed DNA Sequences CoRR David Eppstein, Michael T. Goodrich, Pierre Baldi
2011	J	`jnl`	Randomized Speedup of the Bellman-Ford Algorithm CoRR Michael J. Bannister, David Eppstein
2011	J	`jnl`	Recognizing Partial Cubes in Quadratic Time. J. Graph Algorithms Appl. David Eppstein
2011	J	`jnl`	Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. David Eppstein, Michael T. Goodrich
2011	J	`jnl`	Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers David Eppstein, Michael T. Goodrich
2011	J	`jnl`	The Fibonacci Dimension of a Graph. Electron. J. Comb. Sergio Cabello, David Eppstein, Sandi Klavzar
2011	J	`jnl`	Tracking Moving Objects with Few Handovers CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler
2011	B	`conf`	Tracking Moving Objects with Few Handovers. WADS David Eppstein, Michael T. Goodrich, Maarten Löffler
2011	A*	`conf`	What's the difference?: efficient set reconciliation without prior context. SIGCOMM David Eppstein, Michael T. Goodrich, Frank C. Uyeda, George Varghese
2010	Misc	`conf`	Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. COCOON John Augustine, David Eppstein, Kevin A. Wortman
2010	J	`jnl`	Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. Discret. Math. Algorithms Appl. John Augustine, David Eppstein, Kevin A. Wortman
2010	J	`jnl`	Cloning Voronoi Diagrams via Retroactive Data Structures CoRR Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
2010	—	`conf`	Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
2010	J	`jnl`	Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discret. Math. Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein
2010	J	`jnl`	Densities of Minor-Closed Graph Families. Electron. J. Comb. David Eppstein
2010	J	`jnl`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area CoRR Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2010	A	`conf`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2010	J	`jnl`	Drawing Trees with Perfect Angular Resolution and Polynomial Area CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	A	`conf`	Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	—	`conf`	Extended Dynamic Subgraph Statistics Using COCOA (1) David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2010	J	`jnl`	Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics CoRR David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2010	J	`jnl`	Flows in One-Crossing-Minor-Free Graphs CoRR Erin W. Chambers, David Eppstein
2010	—	`conf`	Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) Erin W. Chambers, David Eppstein
2010	A	`ed.`	Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers GD David Eppstein, Emden R. Gansner
2010	—	`ch.`	Growth and Decay in Life-Like Cellular Automata. Game of Life Cellular Automata David Eppstein
2010	J	`jnl`	Happy Endings for Flip Graphs. J. Comput. Geom. David Eppstein
2010	J	`jnl`	Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. David Eppstein, Michael T. Goodrich, Darren Strash
2010	—	`conf`	Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) David Eppstein, Maarten Löffler, Darren Strash
2010	J	`jnl`	Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time CoRR David Eppstein, Maarten Löffler, Darren Strash
2010	—	`conf`	Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems David Eppstein, Maarten Löffler, Darren Strash
2010	J	`jnl`	Lombardi Drawings of Graphs CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	A	`conf`	Lombardi Drawings of Graphs. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	J	`jnl`	Optimal 3D Angular Resolution for Low-Degree Graphs CoRR David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
2010	A	`conf`	Optimal 3D Angular Resolution for Low-Degree Graphs. GD David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
2010	A*	`conf`	Paired Approximation Problems and Incompatible Inapproximabilities. SODA David Eppstein
2010	—	`conf`	Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD Matthew Dickerson, David Eppstein, Kevin A. Wortman
2010	J	`jnl`	Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data CoRR David Eppstein, Michael T. Goodrich, Roberto Tamassia
2010	—	`conf`	Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS David Eppstein, Michael T. Goodrich, Roberto Tamassia
2010	J	`jnl`	Questions answered. in theory.: http://cstheory.stackexchange.com/. SIGACT News Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. Sterling, Suresh Venkatasubramanian
2010	J	`jnl`	Regular Labelings and Geometric Structures CoRR David Eppstein
2010	—	`conf`	Regular Labelings and Geometric Structures. ISAAC (1) David Eppstein
2010	—	`conf`	Regular labelings and geometric structures. CCCG David Eppstein
2010	—	`conf`	Steinitz theorems for orthogonal polyhedra. SCG David Eppstein, Elena Mumford
2009	J	`jnl`	All maximal independent sets and dynamic dominance for sparse graphs. ACM Trans. Algorithms David Eppstein
2009	—	`conf`	Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). SCG Matthew T. Dickerson, David Eppstein
2009	J	`jnl`	Approximate topological matching of quad meshes. Vis. Comput. David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2009	J	`jnl`	Area-Universal Rectangular Layouts CoRR David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek
2009	—	`conf`	Area-universal rectangular layouts. SCG David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek
2009	J	`jnl`	Curvature Aware Fundamental Cycles. Comput. Graph. Forum Pablo Diaz-Gutierrez, David Eppstein, Meenakshisundaram Gopi
2009	J	`jnl`	Edges and switches, tunnels and bridges. Comput. Geom. David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
2009	J	`jnl`	Finding Large Clique Minors is Hard. J. Graph Algorithms Appl. David Eppstein
2009	J	`jnl`	Going Off-road: Transversal Complexity in Road Networks CoRR David Eppstein, Michael T. Goodrich, Lowell Trott
2009	—	`conf`	Going off-road: transversal complexity in road networks. GIS David Eppstein, Michael T. Goodrich, Lowell Trott
2009	J	`jnl`	Graph-Theoretic Solutions to Computational Geometry Problems CoRR David Eppstein
2009	B	`conf`	Graph-Theoretic Solutions to Computational Geometry Problems. WG David Eppstein
2009	A*	`conf`	Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA David Eppstein, Michael T. Goodrich, Darren Strash
2009	J	`jnl`	On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem CoRR Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
2009	B	`conf`	On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
2009	J	`jnl`	Optimal Angular Resolution for Face-Symmetric Drawings CoRR David Eppstein, Kevin A. Wortman
2009	J	`jnl`	Optimal Embedding Into Star Metrics CoRR David Eppstein, Kevin A. Wortman
2009	B	`conf`	Optimal Embedding into Star Metrics. WADS David Eppstein, Kevin A. Wortman
2009	J	`jnl`	Optimally fast incremental Manhattan plane embedding and planar tight span construction CoRR David Eppstein
2009	J	`jnl`	Orientation-Constrained Rectangular Layouts CoRR David Eppstein, Elena Mumford
2009	B	`conf`	Orientation-Constrained Rectangular Layouts. WADS David Eppstein, Elena Mumford
2009	J	`jnl`	Paired approximation problems and incompatible inapproximabilities CoRR David Eppstein
2009	A*	`conf`	Self-overlapping curves revisited. SODA David Eppstein, Elena Mumford
2009	J	`jnl`	Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Trans. Algorithms David Eppstein
2009	J	`jnl`	Steinitz Theorems for Orthogonal Polyhedra CoRR David Eppstein, Elena Mumford
2009	J	`jnl`	Testing bipartiteness of geometric intersection graphs. ACM Trans. Algorithms David Eppstein
2009	B	`conf`	The WADS David Eppstein, Emma S. Spiro
2009	J	`jnl`	The Fibonacci dimension of a graph CoRR Sergio Cabello, David Eppstein, Sandi Klavzar
2009	J	`jnl`	The h-Index of a Graph and its Application to Dynamic Subgraph Statistics CoRR David Eppstein, Emma S. Spiro
2008	J	`jnl`	Algorithms for media. Discret. Appl. Math. David Eppstein, Jean-Claude Falmagne
2008	—	`conf`	Approximate topological matching of quadrilateral meshes. Shape Modeling International David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2008	J	`jnl`	Dilation, smoothed distance, and minimization diagrams of convex functions CoRR Matthew Dickerson, David Eppstein, Kevin A. Wortman
2008	J	`jnl`	Finding Large Clique Minors is Hard CoRR David Eppstein
2008	J	`jnl`	Isometric Diamond Subgraphs CoRR David Eppstein
2008	A	`conf`	Isometric Diamond Subgraphs. GD David Eppstein
2008	J	`jnl`	Learning Sequences CoRR David Eppstein
2008	J	`jnl`	Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings CoRR David Eppstein, Michael T. Goodrich, Darren Strash
2008	—	`book`	Media theory - interdisciplinary applied mathematics. David Eppstein, Jean-Claude Falmagne, Sergei Ovchinnikov
2008	J	`jnl`	Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2008	A*	`conf`	Recognizing partial cubes in quadratic time. SODA David Eppstein
2008	J	`jnl`	Self-overlapping Curves Revisited CoRR David Eppstein, Elena Mumford
2008	J	`jnl`	Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geom. Appl. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2008	J	`jnl`	Straight Skeletons of Three-Dimensional Polyhedra CoRR Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
2008	A	`conf`	Straight Skeletons of Three-Dimensional Polyhedra. ESA Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
2008	J	`jnl`	Studying (Non-Planar) Road Networks Through an Algorithmic Lens CoRR David Eppstein, Michael T. Goodrich
2008	—	`conf`	Studying (non-planar) road networks through an algorithmic lens. GIS David Eppstein, Michael T. Goodrich
2008	J	`jnl`	Succinct Greedy Graph Drawing in the Hyperbolic Plane CoRR David Eppstein, Michael T. Goodrich
2008	A	`conf`	Succinct Greedy Graph Drawing in the Hyperbolic Plane. GD David Eppstein, Michael T. Goodrich
2008	A	`conf`	The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. GD David Eppstein
2008	J	`jnl`	Upright-Quad Drawing of st-Planar Learning Spaces. J. Graph Algorithms Appl. David Eppstein
2007	J	`jnl`	Confluent Layered Drawings. Algorithmica David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2007	J	`jnl`	Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2007	J	`jnl`	Drawings of planar graphs with few slopes and segments. Comput. Geom. Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
2007	J	`jnl`	Edges and Switches, Tunnels and Bridges CoRR David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
2007	B	`conf`	Edges and Switches, Tunnels and Bridges. WADS David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
2007	J	`jnl`	Foreword to special issue on SODA 2002. ACM Trans. Algorithms David Eppstein
2007	—	`conf`	Guard placement for efficient point-in-polygon proofs. SCG David Eppstein, Michael T. Goodrich, Nodari Sitchinava
2007	—	`conf`	Happy endings for flip graphs. SCG David Eppstein
2007	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2007	J	`jnl`	Interconnect Criticality-Driven Delay Relaxation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Love Singhal, Elaheh Bozorgzadeh, David Eppstein
2007	J	`jnl`	Minimum dilation stars. Comput. Geom. David Eppstein, Kevin A. Wortman
2007	J	`jnl`	On Verifying and Engineering the Well-gradedness of a Union-closed Family CoRR David Eppstein, Jean-Claude Falmagne, Hasan Uzun
2007	J	`jnl`	Recognizing Partial Cubes in Quadratic Time CoRR David Eppstein
2007	B	`conf`	Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS David Eppstein, Michael T. Goodrich
2007	J	`jnl`	Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters CoRR David Eppstein, Michael T. Goodrich
2007	A*	`conf`	Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. SODA David Eppstein
2007	J	`jnl`	The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing CoRR David Eppstein
2007	J	`jnl`	The Traveling Salesman Problem for Cubic Graphs. J. Graph Algorithms Appl. David Eppstein
2006	J	`jnl`	Approximate Weighted Farthest Neighbors and Minimum Dilation Stars CoRR John Augustine, David Eppstein, Kevin A. Wortman
2006	A	`conf`	Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
2006	J	`jnl`	Choosing Colors for Geometric Graphs via Color Space Embeddings CoRR Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
2006	J	`jnl`	Cubic Partial Cubes from Simplicial Arrangements. Electron. J. Comb. David Eppstein
2006	J	`jnl`	Guard Placement For Wireless Localization CoRR David Eppstein, Michael T. Goodrich, Nodari Sitchinava
2006	J	`jnl`	Happy endings for flip graphs CoRR David Eppstein
2006	J	`jnl`	Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms David Eppstein
2006	—	`conf`	Single Triangle Strip and Loop on Manifolds with Boundaries. SIBGRAPI Pablo Diaz-Gutierrez, David Eppstein, M. Gopi
2006	J	`jnl`	Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition CoRR David Eppstein
2006	J	`jnl`	The Effect of Faults on Network Expansion. Theory Comput. Syst. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
2006	—	`conf`	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. SWAT Josiah Carlson, David Eppstein
2006	J	`jnl`	Trees with Convex Faces and Optimal Angles CoRR Josiah Carlson, David Eppstein
2006	A	`conf`	Trees with Convex Faces and Optimal Angles. GD Josiah Carlson, David Eppstein
2006	A	`conf`	Upright-Quad Drawing of GD David Eppstein
2006	J	`jnl`	Upright-Quad Drawing of st-Planar Learning Spaces CoRR David Eppstein
2005	J	`jnl`	3-coloring in time O(1.3289 J. Algorithms Richard Beigel, David Eppstein
2005	A*	`conf`	All maximal independent sets and dynamic dominance for sparse graphs. SODA David Eppstein
2005	J	`jnl`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Confluent Layered Drawings CoRR David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Cubic Partial Cubes from Simplicial Arrangements CoRR David Eppstein
2005	A	`conf`	Delta-Confluent Drawings. GD David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Delta-confluent Drawings CoRR David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Hinged dissection of polyominoes and polyforms. Comput. Geom. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
2005	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005	B	`conf`	Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005	J	`jnl`	Memory reference caching for activity reduction on address buses. Microprocess. Microsystems Tony Givargis, David Eppstein
2005	—	`conf`	Minimum dilation stars. SCG David Eppstein, Kevin A. Wortman
2005	J	`jnl`	Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku CoRR David Eppstein
2005	J	`jnl`	Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR Lars Arge, David Eppstein, Michael T. Goodrich
2005	A*	`conf`	Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC Lars Arge, David Eppstein, Michael T. Goodrich
2005	J	`jnl`	The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data CoRR David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2005	J	`jnl`	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems CoRR Josiah Carlson, David Eppstein
2005	J	`jnl`	The lattice dimension of a graph. Eur. J. Comb. David Eppstein
2005	—	`conf`	The skip quadtree: a simple dynamic data structure for multidimensional data. SCG David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2004	J	`jnl`	Algorithms for Drawing Media CoRR David Eppstein
2004	A	`conf`	Algorithms for Drawing Media. GD David Eppstein
2004	J	`jnl`	All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs CoRR David Eppstein
2004	A	`conf`	Confluent Layered Drawings. GD David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2004	—	`conf`	Deterministic sampling and range counting in geometric data streams. SCG Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2004	J	`jnl`	Fast Approximation of Centrality. J. Graph Algorithms Appl. David Eppstein, Joseph Wang
2004	—	`conf`	Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC Jean Cardinal, David Eppstein
2004	J	`jnl`	Minimum Dilation Stars CoRR David Eppstein, Kevin A. Wortman
2004	J	`jnl`	Quasiconvex Programming CoRR David Eppstein
2004	A*	`conf`	Quasiconvex analysis of backtracking algorithms. SODA David Eppstein
2004	J	`jnl`	Single-Strip Triangulation of Manifolds with Arbitrary Topology CoRR M. Gopi, David Eppstein
2004	J	`jnl`	Single-Strip Triangulation of Manifolds with Arbitrary Topology. Comput. Graph. Forum M. Gopi, David Eppstein
2004	—	`conf`	Single-strip triangulation of manifolds with arbitrary topology. SCG David Eppstein, M. Gopi
2004	A*	`conf`	Testing bipartiteness of geometric intersection graphs. SODA David Eppstein
2004	J	`jnl`	The Effect of Faults on Network Expansion CoRR Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
2004	B	`conf`	The effect of faults on network expansion. SPAA Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
2004	—	`conf`	The geometric thickness of low degree graphs. SCG Christian A. Duncan, David Eppstein, Stephen G. Kobourov
2004	J	`jnl`	The lattice dimension of a graph CoRR David Eppstein
2004	J	`jnl`	Tiling space and slabs with acute tetrahedra. Comput. Geom. David Eppstein, John M. Sullivan, Alper Üngör
2003	A	`conf`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. GD Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2003	J	`jnl`	Deterministic Sampling and Range Counting in Geometric Data Streams CoRR Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2003	A*	`conf`	Dynamic generators of topologically embedded graphs. SODA David Eppstein
2003	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. David Eppstein
2003	A*	`conf`	Möbius-invariant natural neighbor interpolation. SODA Marshall W. Bern, David Eppstein
2003	—	`conf`	Optimized color gamuts for tiled displays. SCG Marshall W. Bern, David Eppstein
2003	J	`jnl`	Quasiconvex Analysis of Backtracking Algorithms CoRR David Eppstein
2003	A	`conf`	Selected Open Problems in Graph Drawing. GD Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
2003	J	`jnl`	Setting Parameters by Example. SIAM J. Comput. David Eppstein
2003	J	`jnl`	Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl. David Eppstein
2003	J	`jnl`	Testing Bipartiteness of Geometric Intersection Graphs CoRR David Eppstein
2003	J	`jnl`	The Geometric Thickness of Low Degree Graphs CoRR Christian A. Duncan, David Eppstein, Stephen G. Kobourov
2003	B	`conf`	The Traveling Salesman Problem for Cubic Graphs. WADS David Eppstein
2003	J	`jnl`	The traveling salesman problem for cubic graphs CoRR David Eppstein
2003	J	`jnl`	Tiling space and slabs with acute tetrahedra CoRR David Eppstein, John M. Sullivan, Alper Üngör
2003	J	`jnl`	Ununfoldable polyhedra with convex faces. Comput. Geom. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
2002	—	`conf`	A Steady State Model for Graph Power Law. WebDyn@WWW David Eppstein, Joseph Wang
2002	J	`jnl`	A steady state model for graph power laws CoRR David Eppstein, Joseph Wang
2002	J	`jnl`	Algorithms for Coloring Quadtrees. Algorithmica David Eppstein, Marshall W. Bern, Brad L. Hutchings
2002	J	`jnl`	Algorithms for Media CoRR David Eppstein, Jean-Claude Falmagne
2002	J	`jnl`	Beta-skeletons have unbounded dilation. Comput. Geom. David Eppstein
2002	J	`jnl`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way CoRR Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2002	J	`jnl`	Dynamic Generators of Topologically Embedded Graphs CoRR David Eppstein
2002	J	`jnl`	Flipping Cubical Meshes. Eng. Comput. Marshall W. Bern, David Eppstein, Jeff Erickson
2002	J	`jnl`	Moebius-Invariant Natural Neighbor Interpolation CoRR Marshall W. Bern, David Eppstein
2002	J	`jnl`	Multivariate Regression Depth. Discret. Comput. Geom. Marshall W. Bern, David Eppstein
2002	J	`jnl`	Optimized Color Gamuts for Tiled Displays CoRR Marshall W. Bern, David Eppstein
2002	A*	`ed.`	Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA. SODA David Eppstein
2002	J	`jnl`	Separating Thickness from Geometric Thickness CoRR David Eppstein
2002	A	`conf`	Separating Thickness from Geometric Thickness. GD David Eppstein
2002	J	`jnl`	The minimum expectation selection problem. Random Struct. Algorithms David Eppstein, George S. Lueker
2002	—	`conf`	Vertex-unfoldings of simplicial manifolds. SCG Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	A*	`conf`	Fast approximation of centrality. SODA David Eppstein, Joseph Wang
2001	J	`jnl`	Flipping Cubical Meshes CoRR Marshall W. Bern, David Eppstein, Jeff Erickson
2001	—	`conf`	Flipping Cubical Meshes. IMR Marshall W. Bern, David Eppstein
2001	J	`jnl`	Hinged Kite Mirror Dissection CoRR David Eppstein
2001	A*	`conf`	Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. SODA David Eppstein
2001	A*	`conf`	Internet packet filter management and rectangle geometry. SODA David Eppstein, S. Muthukrishnan
2001	J	`jnl`	Optimal Moebius Transformations for Information Visualization and Meshing CoRR Marshall W. Bern, David Eppstein
2001	B	`conf`	Optimal Möbius Transformations for Information Visualization and Meshing. WADS Marshall W. Bern, David Eppstein
2001	J	`jnl`	Optimization Over Zonotopes and Training Support Vector Machines CoRR Marshall W. Bern, David Eppstein
2001	B	`conf`	Optimization over Zonotopes and Training Support Vector Machines. WADS Marshall W. Bern, David Eppstein
2001	J	`jnl`	Separating Geometric Thickness from Book Thickness CoRR David Eppstein
2001	B	`conf`	Small Maximal Independent Sets and Faster Exact Graph Coloring. WADS David Eppstein
2001	J	`jnl`	Tangent Spheres and Triangle Centers. Am. Math. Mon. David Eppstein
2001	J	`jnl`	The Minimum Expectation Selection Problem CoRR David Eppstein, George S. Lueker
2001	J	`jnl`	The distribution of loop lengths in graphical models for turbo decoding. IEEE Trans. Inf. Theory Xianping Ge, David Eppstein, Padhraic Smyth
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Manifolds CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2001	J	`jnl`	Vertex-Unfoldings of Simplicial Polyhedra CoRR Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
2000	J	`jnl`	3-Coloring in Time O(1.3289^n) CoRR Richard Beigel, David Eppstein
2000	J	`jnl`	Clustering for faster network simplex pivots. Networks David Eppstein
2000	J	`jnl`	Computing the Depth of a Flat CoRR Marshall W. Bern, David Eppstein
2000	J	`jnl`	Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica David Eppstein
2000	J	`jnl`	Fast Approximation of Centrality CoRR David Eppstein, Joseph Wang
2000	J	`jnl`	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. ACM J. Exp. Algorithmics David Eppstein
2000	J	`jnl`	Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
2000	J	`jnl`	Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction CoRR David Eppstein
2000	J	`jnl`	Incremental and Decremental Maintenance of Planar Width. J. Algorithms David Eppstein
2000	J	`jnl`	Internet Packet Filter Management and Rectangle Geometry CoRR David Eppstein, S. Muthukrishnan
2000	—	`conf`	Multivariate regression depth. SCG Marshall W. Bern, David Eppstein
2000	J	`jnl`	One-Dimensional Peg Solitaire CoRR Cristopher Moore, David Eppstein
2000	J	`jnl`	One-Dimensional Peg Solitaire, and Duotaire CoRR Cristopher Moore, David Eppstein
2000	J	`jnl`	Phutball Endgames are Hard CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein
2000	J	`jnl`	Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein
2000	J	`jnl`	Regression Depth and Center Points. Discret. Comput. Geom. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
2000	J	`jnl`	Searching for Spaceships CoRR David Eppstein
2000	J	`jnl`	Small Maximal Independent Sets and Faster Exact Graph Coloring CoRR David Eppstein
2000	—	`ch.`	Spanning Trees and Spanners. Handbook of Computational Geometry David Eppstein
1999	J	`jnl`	Algorithms for Coloring Quadtrees CoRR David Eppstein, Marshall W. Bern, Brad L. Hutchings
1999	J	`jnl`	Beta-Skeletons have Unbounded Dilation CoRR David Eppstein
1999	—	`ch.`	Dynamic Graph Algorithms. Algorithms and Theory of Computation Handbook David Eppstein, Zvi Galil, Giuseppe F. Italiano
1999	J	`jnl`	Emerging Challenges in Computational Topology CoRR Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin
1999	J	`jnl`	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs CoRR David Eppstein
1999	J	`jnl`	Geometric Thickness of Complete Graphs CoRR Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
1999	J	`jnl`	Hinged Dissection of Polyominoes and Polyforms CoRR Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
1999	—	`conf`	Hinged dissections of polyominoes and polyforms. CCCG Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
1999	A*	`conf`	Incremental and Decremental Maintenance of Planar Width. SODA David Eppstein
1999	J	`jnl`	Linear complexity hexahedral mesh generation. Comput. Geom. David Eppstein
1999	J	`jnl`	Multivariate Regression Depth CoRR Marshall W. Bern, David Eppstein
1999	J	`jnl`	Optimal Point Placement for Mesh Smoothing. J. Algorithms Nina Amenta, Marshall W. Bern, David Eppstein
1999	J	`jnl`	PREFACE: Festschrift for Zvi Galil. J. Complex. David Eppstein, Giuseppe F. Italiano
1999	J	`jnl`	Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein, Shang-Hua Teng
1999	J	`jnl`	Quadrilateral Meshing by Circle Packing CoRR Marshall W. Bern, David Eppstein
1999	J	`jnl`	Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discret. Comput. Geom. David Eppstein, Jeff Erickson
1999	J	`jnl`	Setting Parameters by Example CoRR David Eppstein
1999	A*	`conf`	Setting Parameters by Example. FOCS David Eppstein
1999	A*	`conf`	Shortest Paths in an Arrangement with SODA David Eppstein, David Hart
1999	J	`jnl`	Subgraph Isomorphism in Planar Graphs and Related Problems CoRR David Eppstein
1999	J	`jnl`	Subgraph Isomorphism in Planar Graphs and Related Problems. J. Graph Algorithms Appl. David Eppstein
1999	J	`jnl`	The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding CoRR Xianping Ge, David Eppstein, Padhraic Smyth
1999	J	`jnl`	Ununfoldable Polyhedra with Convex Faces CoRR Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
1999	—	`conf`	Ununfoldable polyhedra. CCCG Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo
1998	A*	`conf`	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. SODA David Eppstein
1998	J	`jnl`	Finding the k Shortest Paths. SIAM J. Comput. David Eppstein
1998	J	`jnl`	Geometric Lower Bounds for Parametric Matroid Optimization. Discret. Comput. Geom. David Eppstein
1998	A	`conf`	Geometric Thickness of Complete Graphs. GD Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
1998	J	`jnl`	Incremental and Decremental Maintenance of Planar Width CoRR David Eppstein
1998	J	`jnl`	Linear Complexity Hexahedral Mesh Generation CoRR David Eppstein
1998	J	`jnl`	On triangulating three-dimensional polygons. Comput. Geom. Gill Barequet, Matthew Dickerson, David Eppstein
1998	J	`jnl`	Optimal Point Placement for Mesh Smoothing CoRR Nina Amenta, Marshall W. Bern, David Eppstein
1998	A*	`conf`	Parametric and Kinetic Minimum Spanning Trees. FOCS Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger
1998	—	`conf`	Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. SCG David Eppstein, Jeff Erickson
1998	J	`jnl`	Regression Depth and Center Points CoRR Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
1998	J	`jnl`	Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1998	J	`jnl`	The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Graph. Model. Image Process. Nina Amenta, Marshall W. Bern, David Eppstein
1997	B	`conf`	An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. WADS David Eppstein, David Hart
1997	J	`jnl`	Choosing Subsets with Maximum Weighted Average. J. Algorithms David Eppstein, Daniel S. Hirschberg
1997	J	`jnl`	Dynamic Connectivity in Digital Images. Inf. Process. Lett. David Eppstein
1997	J	`jnl`	Faster Circle Packing with Application to Non-Obtuse Triangulation. Int. J. Comput. Geom. Appl. David Eppstein
1997	A*	`conf`	Faster Construction of Planar Two-Centers. SODA David Eppstein
1997	J	`jnl`	Faster Geometric K-point MST Approximation. Comput. Geom. David Eppstein
1997	J	`jnl`	Minimum Range Balanced Cuts via Dynamic Subset Sums. J. Algorithms David Eppstein
1997	J	`jnl`	On Nearest-Neighbor Graphs. Discret. Comput. Geom. David Eppstein, Mike Paterson, F. Frances Yao
1997	A*	`conf`	Optimal Point Placement for Mesh Smoothing. SODA Nina Amenta, Marshall W. Bern, David Eppstein
1997	J	`jnl`	Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1996	J	`jnl`	Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1996	J	`jnl`	Average Case Analysis of Dynamic Geometric Optimization. Comput. Geom. David Eppstein
1996	J	`jnl`	Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. David P. Dobkin, David Eppstein, Don P. Mitchell
1996	—	`conf`	Linear Complexity Hexahedral Mesh Generation. SCG David Eppstein
1996	—	`conf`	On Triangulating Three-Dimensional Polygons. SCG Gill Barequet, Matthew Dickerson, David Eppstein
1996	J	`jnl`	Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1996	—	`conf`	Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT David Fernández-Baca, Giora Slutzki, David Eppstein
1996	J	`jnl`	Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. David Fernández-Baca, Giora Slutzki, David Eppstein
1995	A*	`conf`	3-Coloring in Time O(1.3446 FOCS Richard Beigel, David Eppstein
1995	J	`jnl`	3-Coloring in time O(1.3446 Electron. Colloquium Comput. Complex. Richard Beigel, David Eppstein
1995	J	`jnl`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae David Eppstein, Gary L. Miller, Shang-Hua Teng
1995	J	`jnl`	Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. Matthew Dickerson, David Eppstein
1995	J	`jnl`	Asymptotic Speed-Ups in Constructive Solid Geometry. Algorithmica David Eppstein
1995	A*	`conf`	Dihedral Bounds for Mesh Generation in High Dimensions. SODA Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert
1995	J	`jnl`	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. Discret. Comput. Geom. David Eppstein
1995	A*	`conf`	Geometric lower bounds for parametric matroid optimization. STOC David Eppstein
1995	A*	`conf`	Subgraph Isomorphism in Planar Graphs and Related Problems. SODA David Eppstein
1995	A	`conf`	The Centroid of Points with Approximate Weights. ESA Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter
1995	J	`jnl`	Triangulating polygons without large angles. Int. J. Comput. Geom. Appl. Marshall W. Bern, David P. Dobkin, David Eppstein
1994	J	`jnl`	Approximating the Minimum Weight Steiner Triangulation. Discret. Comput. Geom. David Eppstein
1994	J	`jnl`	Arboricity and Bipartite Subgraph Listing Algorithms. Inf. Process. Lett. David Eppstein
1994	A*	`conf`	Average Case Analysis of Dynamic Geometric Optimization. SODA David Eppstein
1994	A*	`conf`	Clustering for Faster Network Simplex Pivots. SODA David Eppstein
1994	A*	`conf`	Finding the k Shortest Paths FOCS David Eppstein
1994	J	`jnl`	Iterated Nearest Neighbors and Finding Minimal Polytopes. Discret. Comput. Geom. David Eppstein, Jeff Erickson
1994	J	`jnl`	Offline Algorithms for Dynamic Minimum Spanning Tree Problems. J. Algorithms David Eppstein
1994	J	`jnl`	On the Number of Minimal 1-Steiner Trees. Discret. Comput. Geom. Boris Aronov, Marshall W. Bern, David Eppstein
1994	J	`jnl`	Provably Good Mesh Generation. J. Comput. Syst. Sci. Marshall W. Bern, David Eppstein, John R. Gilbert
1994	J	`jnl`	Tree-weighted neighbors and geometric k smallest spanning trees. Int. J. Comput. Geom. Appl. David Eppstein
1994	J	`jnl`	Visibility with a Moving Point of View. Algorithmica Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
1993	—	`conf`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. SCG David Eppstein, Gary L. Miller, Shang-Hua Teng
1993	—	`conf`	Approximating Center Points with Iterated Radon Points. SCG Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1993	—	`conf`	Computing the Discrepancy. SCG David P. Dobkin, David Eppstein
1993	J	`jnl`	Connectivity, graph minors, and subgraph multiplicity. J. Graph Theory David Eppstein
1993	J	`jnl`	Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1993	J	`jnl`	Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan
1993	J	`jnl`	Improved Bounds for Intersecting Triangles and Halving Planes. J. Comb. Theory A David Eppstein
1993	A*	`conf`	Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA David Eppstein, Jeff Erickson
1993	B	`conf`	Parallel Construction of Quadtrees and Quality Triangulations. WADS Marshall W. Bern, David Eppstein, Shang-Hua Teng
1993	A*	`conf`	Separator based sparsification for dynamic planar graph algorithms. STOC David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1993	—	`conf`	Worst-Case Bounds for Subadditive Geometric Graphs. SCG Marshall W. Bern, David Eppstein
1992	A*	`conf`	Approximating the Minimum Weight Triangulation. SODA David Eppstein
1992	A*	`conf`	Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees FOCS Pankaj K. Agarwal, David Eppstein, Jirí Matousek
1992	J	`jnl`	Dynamic Three-Dimensional Linear Programming. INFORMS J. Comput. David Eppstein
1992	B	`conf`	Edge Insertion for Optional Triangulations. LATIN Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan
1992	J	`jnl`	Erratum: Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein
1992	J	`jnl`	Finding Minimum Area k-gons. Discret. Comput. Geom. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Finding the BIT David Eppstein
1992	J	`jnl`	Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1992	A*	`conf`	New Algorithms for Minimum Area SODA David Eppstein
1992	J	`jnl`	Parallel Recognition of Series-Parallel Graphs Inf. Comput. David Eppstein
1992	J	`jnl`	Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein
1992	J	`jnl`	Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Math. Syst. Theory David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener
1992	J	`jnl`	Sparse Dynamic Programming I: Linear Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	J	`jnl`	Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1992	A*	`conf`	Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) FOCS David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
1992	—	`conf`	Triangulating Polygons without Large Angles. SCG Marshall W. Bern, David P. Dobkin, David Eppstein
1991	A*	`conf`	Dynamic Three-Dimensional Linear Programming FOCS David Eppstein
1991	A*	`conf`	Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung
1991	B	`conf`	Offline Algorithms for Dynamic Minimum Spanning Tree Problems. WADS David Eppstein
1991	J	`jnl`	Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci. Marek Chrobak, David Eppstein
1991	—	`conf`	Polynomial-Size Nonobtuse Triangulation of Polygons. SCG Marshall W. Bern, David Eppstein
1991	A*	`conf`	The Expected Extremes in a Delaunay Triangulation. ICALP Marshall W. Bern, David Eppstein, F. Frances Yao
1991	J	`jnl`	The Farthest Point Delaunay Triangulation Minimizes Angles. Comput. Geom. David Eppstein
1991	J	`jnl`	The expected extremes in a Delaunay triangulation. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein, F. Frances Yao
1990	J	`jnl`	Equipartitions of graphs. Discret. Math. David Eppstein, Joan Feigenbaum, Chung-Lun Li
1990	—	`conf`	Finding the k Smallest Spanning Trees. SWAT David Eppstein
1990	—	`conf`	Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao
1990	A*	`conf`	Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung
1990	A*	`conf`	Provably Good Mesh Generation FOCS Marshall W. Bern, David Eppstein, John R. Gilbert
1990	J	`jnl`	Reset Sequences for Monotonic Automata. SIAM J. Comput. David Eppstein
1990	J	`jnl`	Sequence Comparison with Mixed Convex and Concave Costs. J. Algorithms David Eppstein
1990	A*	`conf`	Sparse Dynamic Programming. SODA David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
1990	A*	`conf`	Visibility with a Moving Point of View. SODA Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
1989	A*	`conf`	Parallel Algorithmic Techniques for Combinatorial Computation. ICALP David Eppstein, Zvi Galil
1988	A*	`conf`	Reset Sequences for Finite Automata with Application to Design of Parts Orienters. ICALP David Eppstein
1988	A*	`conf`	Speeding up Dynamic Programming FOCS David Eppstein, Zvi Galil, Raffaele Giancarlo
1985	A*	`conf`	A Heuristic Approach to Program Inversion. IJCAI David Eppstein