David Eppstein

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 197

Top Venues

CoRR

CCCG

J. Graph Algorithms Appl.

Graph Drawing

Publications

Hadi Khodabandeh, David Eppstein
Maintaining Light Spanners via Minimal Updates. CoRR (2024)
Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38 (3) (2024)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71 (4) (2024)
David Eppstein
Non-Euclidean Erdős-Anning Theorems. CoRR (2024)
David Eppstein
Lower Bounds for Non-adaptive Shortest Path Relaxation. WADS (2023)
David Eppstein
A Parameterized Algorithm for Flat Folding. CoRR (2023)
David Eppstein, Rose McCarty
Geometric Graphs with Unbounded Flip-Width. CoRR (2023)
David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27 (5) (2023)
Therese Biedl, David Eppstein, Torsten Ueckerdt
On the complexity of embedding in graph products. CoRR (2023)
David Eppstein, Daniel Frishberg
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. ISAAC (2023)
David Eppstein, Daniel Frishberg, Martha C. Osegueda
Angles of arc-polygons and Lombardi drawings of cacti. Comput. Geom. 112 (2023)
Alvin Chiu, David Eppstein, Michael T. Goodrich
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) (2023)
David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams
Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR (2023)
David Eppstein
On the Biplanarity of Blowups. GD (1) (2023)
David Eppstein
Lower Bounds for Non-Adaptive Shortest Path Relaxation. CoRR (2023)
David Eppstein
A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica 85 (6) (2023)
David Eppstein, Rose McCarty
Geometric Graphs with Unbounded Flip-Width. CCCG (2023)
Therese Biedl, David Eppstein, Torsten Ueckerdt
On the complexity of embedding in graph products. CCCG (2023)
David Eppstein
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. SoCG (2023)
David Eppstein, Daniel Frishberg
Improved Mixing for the Convex Polygon Triangulation Flip Walk. ICALP (2023)
David Eppstein
A Parameterized Algorithm for Flat Folding. CCCG (2023)
Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. Comput. Geom. 108 (2023)
David Eppstein
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. CoRR (2023)
David Eppstein
Locked and Unlocked Smooth Embeddings of Surfaces. Comput. Geom. Topol. 2 (2) (2023)
Alvin Chiu, David Eppstein, Michael T. Goodrich
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. CoRR (2023)
David Eppstein
The Complexity of Iterated Reversible Computation. TheoretiCS 2 (2023)
Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl
Geometric Dominating Sets. CoRR (2022)
David Eppstein
Orthogonal dissection into few rectangles. CoRR (2022)
David Eppstein
Reflections in an Octagonal Mirror Maze. CCCG (2022)
David Eppstein
Orthogonal Dissection into Few Rectangles. CCCG (2022)
David Eppstein
Reflections in an octagonal mirror maze. CoRR (2022)
David Eppstein, Daniel Frishberg, William Maxwell
On the treewidth of Hanoi graphs. Theor. Comput. Sci. 906 (2022)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-dimensional graph products with unbounded stack-number. CoRR (2022)
David Eppstein, Daniel Frishberg
Improved mixing for the convex polygon triangulation flip walk. CoRR (2022)
Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
Stack-Number is Not Bounded by Queue-Number. Comb. 42 (2) (2022)
David Eppstein, Hadi Khodabandeh
Distributed Construction of Lightweight Spanners for Unit Ball Graphs. DISC (2022)
Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. 103 (2022)
David Eppstein
Locked and unlocked smooth embeddings of surfaces. CoRR (2022)
David Eppstein
Finding Relevant Points for Nearest-Neighbor Classification. SOSA (2022)
David Eppstein, Hadi Khodabandeh
Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. SPAA (2022)
David Eppstein
Locked and Unlocked Smooth Embeddings of Surfaces. CCCG (2022)
David Eppstein, Hadi Khodabandeh
On the Edge Crossings of the Greedy Spanner. SoCG (2021)
David Eppstein, Siddharth Gupta, Elham Havvaei
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. CoRR (2021)
David Eppstein, Daniel Frishberg, Martha C. Osegueda
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CoRR (2021)
David Eppstein
On Polyhedral Realization with Isosceles Triangles. Graphs Comb. 37 (4) (2021)
David Eppstein
Cubic planar graphs that cannot be drawn on few lines. J. Comput. Geom. 12 (1) (2021)
David Eppstein, Daniel Frishberg
Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. CoRR (2021)
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83 (8) (2021)
David Eppstein
A Stronger Lower Bound on Parametric Minimum Spanning Trees. WADS (2021)
David Eppstein
Limitations on Realistic Hyperbolic Graph Drawing. Graph Drawing (2021)
David Eppstein
A Stronger Lower Bound on Parametric Minimum Spanning Trees. CoRR (2021)
David Eppstein, Daniel Frishberg, Martha C. Osegueda
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CCCG (2021)
David Eppstein, Siddharth Gupta, Elham Havvaei
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT (2021)
David Eppstein, Hadi Khodabandeh
Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR (2021)
David Eppstein, Daniel Frishberg, William Maxwell
On the Treewidth of Hanoi Graphs. FUN (2021)
David Eppstein
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. J. Graph Algorithms Appl. 25 (1) (2021)
David Eppstein, Vijay V. Vazirani
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs. SIAM J. Comput. 50 (3) (2021)
David Eppstein
Limitations on Realistic Hyperbolic Graph Drawing. CoRR (2021)
David Eppstein
The Complexity of Iterated Reversible Computation. CoRR (2021)
David Eppstein
Finding Relevant Points for Nearest-Neighbor Classification. CoRR (2021)
David Eppstein
The Graphs of Stably Matchable Pairs. WG (2021)
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. 806 (2020)
David Eppstein, Daniel Frishberg, William Maxwell
On the treewidth of Hanoi graphs. CoRR (2020)
Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
New Results in Sona Drawing: Hardness and TSP Separation. CCCG (2020)
David Eppstein, Daniel Frishberg, Elham Havvaei
Simplifying Activity-on-Edge Graphs. CoRR (2020)
Erik D. Demaine, Martin L. Demaine, David Eppstein
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CoRR (2020)
Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke
Some Polycubes Have No Edge Zipper Unfolding. CCCG (2020)
David Eppstein
Counting Polygon Triangulations is Hard. Discret. Comput. Geom. 64 (4) (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-stretch spanning trees of graphs with bounded width. CoRR (2020)
Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. 11 (1) (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT (2020)
David Eppstein
The Graphs of Stably Matchable Pairs. CoRR (2020)
David Eppstein
Dynamic Products of Ranks. CoRR (2020)
Erik D. Demaine, Martin L. Demaine, David Eppstein
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG (2020)
David Eppstein
Dynamic Products of Ranks. CCCG (2020)
Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
New Results in Sona Drawing: Hardness and TSP Separation. CoRR (2020)
David Eppstein, Sariel Har-Peled, Gabriel Nivasch
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29 (3) (2020)
Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34 (3) (2020)
David Eppstein
On Polyhedral Realization with Isosceles Triangles. CoRR (2020)
David Eppstein
Treetopes and Their Graphs. Discret. Comput. Geom. 64 (2) (2020)
Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood
Stack-number is not bounded by queue-number. CoRR (2020)
David Eppstein, Daniel Frishberg, Elham Havvaei
Simplifying Activity-On-Edge Graphs. SWAT (2020)
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
Existence and Hardness of Conveyor Belts. Electron. J. Comb. 27 (4) (2020)
David Eppstein, Hadi Khodabandeh
On the Edge Crossings of the Greedy Spanner. CoRR (2020)
Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw
Face flips in origami tessellations. J. Comput. Geom. 11 (1) (2020)
David Eppstein, Elham Havvaei
Parameterized Leaf Power Recognition via Embedding into Graph Products. Algorithmica 82 (8) (2020)
David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. 11 (1) (2020)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy Height, Grid-Major Height and Graph-Drawing Height. Graph Drawing (2019)
David Eppstein, Vijay V. Vazirani
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. SPAA (2019)
David Eppstein
Counting Polygon Triangulations is Hard. CoRR (2019)
David Eppstein, Bruce Reed
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. SODA (2019)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. CoRR (2019)
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
Existence and hardness of conveyor belts. CoRR (2019)
David Eppstein
Counting Polygon Triangulations is Hard. SoCG (2019)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. WADS (2019)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81 (4) (2019)
Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw
Face flips in origami tessellations. CoRR (2019)
David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
Tracking Paths in Planar Graphs. CoRR (2019)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy height, grid-major height and graph-drawing height. CoRR (2019)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81 (4) (2019)

David Eppstein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David Eppstein