default search action
David Eppstein
David Arthur Eppstein
Person information
- affiliation: University of California, Irvine, Department of Computer Science, Irvine, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2008
- [b1]David Eppstein, Jean-Claude Falmagne, Sergei Ovchinnikov:
Media theory - interdisciplinary applied mathematics. Springer 2008, ISBN 978-3-540-71696-9, pp. I-X, 1-328
Journal Articles
- 2025
- [j202]David Eppstein:
Orthogonal Dissection into Few Rectangles. Discret. Comput. Geom. 73(1): 129-148 (2025) - 2024
- [j201]David Eppstein:
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. Algorithmica 86(9): 3027-3053 (2024) - [j200]David Eppstein, Robert Hickingbotham
, Laura Merker, Sergey Norin, Michal T. Seweryn
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71(4): 1210-1237 (2024) - [j199]David Eppstein:
The Widths of Strict Outerconfluent Graphs. Discret. Math. Theor. Comput. Sci. 26(3) (2024) - [j198]David Eppstein:
On the Biplanarity of Blowups. J. Graph Algorithms Appl. 28(2): 83-99 (2024) - [j197]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - 2023
- [j196]David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica 85(6): 1738-1753 (2023) - [j195]David Eppstein:
Locked and Unlocked Smooth Embeddings of Surfaces. Comput. Geom. Topol. 2(2): 5:1-5:20 (2023) - [j194]Oswin Aichholzer
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. Comput. Geom. 108: 101913 (2023) - [j193]David Eppstein, Daniel Frishberg, Martha C. Osegueda
Angles of arc-polygons and Lombardi drawings of cacti. Comput. Geom. 112: 101982 (2023) - [j192]David Eppstein, Andrea Lincoln
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27(5): 329-339 (2023) - [j191]David Eppstein:
The Complexity of Iterated Reversible Computation. TheoretiCS 2 (2023) - 2022
- [j190]Vida Dujmovic, David Eppstein, Robert Hickingbotham
Stack-Number is Not Bounded by Queue-Number. Comb. 42(2): 151-164 (2022) - [j189]Hugo A. Akitaya, Erik D. Demaine
Ununfoldable polyhedra with 6 vertices or 6 faces. Comput. Geom. 103: 101857 (2022) - [j188]David Eppstein, Daniel Frishberg
On the treewidth of Hanoi graphs. Theor. Comput. Sci. 906: 1-17 (2022) - 2021
- [j187]Giordano Da Lozzo
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83(8): 2471-2502 (2021) - [j186]David Eppstein:
On Polyhedral Realization with Isosceles Triangles. Graphs Comb. 37(4): 1247-1269 (2021) - [j185]David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. J. Graph Algorithms Appl. 25(1): 549-562 (2021) - [j184]David Eppstein:
Cubic planar graphs that cannot be drawn on few lines. J. Comput. Geom. 12(1): 178-197 (2021) - [j183]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): 1014-1033 (2021) - 2020
- [j182]David Eppstein, Elham Havvaei
Parameterized Leaf Power Recognition via Embedding into Graph Products. Algorithmica 82(8): 2337-2359 (2020) - [j181]Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin
Existence and Hardness of Conveyor Belts. Electron. J. Comb. 27(4): 4 (2020) - [j180]David Eppstein:
Treetopes and Their Graphs. Discret. Comput. Geom. 64(2): 259-289 (2020) - [j179]David Eppstein:
Counting Polygon Triangulations is Hard. Discret. Comput. Geom. 64(4): 1210-1234 (2020) - [j178]David Eppstein, Sariel Har-Peled
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29(3): 306-316 (2020) - [j177]Gill Barequet, David Eppstein, Michael T. Goodrich
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. 11(1): 26-59 (2020) - [j176]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull
Face flips in origami tessellations. J. Comput. Geom. 11(1): 397-417 (2020) - [j175]David Eppstein, Sariel Har-Peled
Approximate greedy clustering and distance selection for graph metrics. J. Comput. Geom. 11(1): 629-652 (2020) - [j174]Vida Dujmovic, David Eppstein, Gwenaël Joret
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34(3): 1693-1709 (2020) - [j173]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: 332-343 (2020) - 2019
- [j172]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): 1512-1534 (2019) - [j171]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81(4): 1561-1583 (2019) - [j170]Mark de Berg
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [j169]David Eppstein:
Realization and connectivity of the graphs of origami flat foldings. J. Comput. Geom. 10(1): 257-280 (2019) - 2018
- [j168]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j167]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. Algorithmica 80(4): 1278-1297 (2018) - [j166]Ahmad Biniaz, Prosenjit Bose
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j165]Oswin Aichholzer
Folding Polyominoes into (Poly)Cubes. Int. J. Comput. Geom. Appl. 28(3): 197-226 (2018) - [j164]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22(1): 23-49 (2018) - [j163]David Eppstein:
The Effect of Planarization on Width. J. Graph Algorithms Appl. 22(3): 461-481 (2018) - [j162]David Eppstein:
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs. J. Graph Algorithms Appl. 22(3): 483-499 (2018) - [j161]Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. J. Graph Algorithms Appl. 22(4): 577-606 (2018) - [j160]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat foldings of plane graphs with prescribed angles and edge lengths. J. Comput. Geom. 9(1): 74-93 (2018) - [j159]Christian A. Duncan, David Eppstein, Michael T. Goodrich
Planar and poly-arc Lombardi drawings. J. Comput. Geom. 9(1): 328-355 (2018) - [j158]David Eppstein:
The Parametric Closure Problem. ACM Trans. Algorithms 14(1): 2:1-2:22 (2018) - 2017
- [j157]David Eppstein, J. Michael McCarthy
Rooted Cycle Bases. J. Graph Algorithms Appl. 21(4): 663-686 (2017) - [j156]David Eppstein:
Maximizing the sum of radii of disjoint balls or disks. J. Comput. Geom. 8(1): 316-339 (2017) - [j155]Vida Dujmovic, David Eppstein, David R. Wood
Structure of Graphs with Locally Restricted Crossings. SIAM J. Discret. Math. 31(2): 805-824 (2017) - 2016
- [j154]Boris Aronov
Distance-sensitive planar point location. Comput. Geom. 54: 17-31 (2016) - [j153]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36: 18-26 (2016) - [j152]David Eppstein:
Simple Recognition of Halin Graphs and Their Generalizations. J. Graph Algorithms Appl. 20(2): 323-346 (2016) - [j151]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann
Strict confluent drawing. J. Comput. Geom. 7(1): 22-46 (2016) - [j150]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-preserving spatial treemaps. J. Comput. Geom. 7(1): 100-122 (2016) - [j149]Zachary Abel, Jason H. Cantarella
Rigid origami vertices: conditions and forcing sets. J. Comput. Geom. 7(1): 171-184 (2016) - 2015
- [j148]Glencora Borradaile, David Eppstein:
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets. Comput. Geom. 49: 8-16 (2015) - [j147]Hans-Jürgen Bandelt, Victor Chepoi
Ramified Rectilinear Polygons: Coordinatization by Dendrons. Discret. Comput. Geom. 54(4): 771-797 (2015) - [j146]David Eppstein:
K-Best Enumeration. Bull. EATCS 115 (2015) - [j145]David Eppstein, Marc J. van Kreveld
Improved Grid Map Layout by Point Set Matching. Int. J. Comput. Geom. Appl. 25(2): 101-122 (2015) - [j144]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. J. Graph Algorithms Appl. 19(1): 281-297 (2015) - [j143]David Eppstein:
Metric Dimension Parameterized by Max Leaf Number. J. Graph Algorithms Appl. 19(1): 313-323 (2015) - [j142]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19(2): 619-656 (2015) - [j141]David Eppstein, Veit Wiechert:
Erratum to: Antimatroids and Balanced Pairs. Order 32(1): 145-146 (2015) - 2014
- [j140]David Eppstein:
Grid Minors in Damaged Grids. Electron. J. Comb. 21(3): 3 (2014) - [j139]David Eppstein:
A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing. Discret. Comput. Geom. 52(3): 515-550 (2014) - [j138]David Eppstein:
Diamond-kite adaptive quadrilateral meshing. Eng. Comput. 30(2): 223-235 (2014) - [j137]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. J. Graph Algorithms Appl. 18(2): 177-209 (2014) - [j136]David Eppstein:
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity. J. Graph Algorithms Appl. 18(2): 211-231 (2014) - [j135]Patrizio Angelini
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [j134]David Eppstein, Elena Mumford:
Steinitz Theorems for Simple Orthogonal Polyhedra. J. Comput. Geom. 5(1): 179-244 (2014) - [j133]David Eppstein:
Antimatroids and Balanced Pairs. Order 31(1): 81-99 (2014) - 2013
- [j132]Christian A. Duncan, David Eppstein, Michael T. Goodrich
Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discret. Comput. Geom. 49(2): 157-182 (2013) - [j131]David Eppstein, Maarten Löffler:
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. Discret. Comput. Geom. 50(1): 1-21 (2013) - [j130]Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams Under Geometric Distance Functions. J. Comput. Sci. Technol. 28(2): 267-277 (2013) - [j129]David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM J. Exp. Algorithmics 18 (2013) - [j128]David Eppstein:
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. J. Graph Algorithms Appl. 17(1): 35-55 (2013) - [j127]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013) - [j126]Erin W. Chambers
Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. 17(3): 201-220 (2013) - [j125]David Eppstein, Joseph A. Simons:
Confluent Hasse Diagrams. J. Graph Algorithms Appl. 17(7): 689-710 (2013) - [j124]David Eppstein, Michael T. Goodrich
Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. 514: 96-104 (2013) - 2012
- [j123]Christian A. Duncan, David Eppstein, Michael T. Goodrich
Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012) - [j122]Erin W. Chambers
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012) - [j121]David Eppstein, Emma S. Spiro
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. J. Graph Algorithms Appl. 16(2): 543-567 (2012) - [j120]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Inapproximability of Orthogonal Compaction. J. Graph Algorithms Appl. 16(3): 651-673 (2012) - [j119]David Eppstein, Elena Mumford, Bettina Speckmann
Area-Universal and Constrained Rectangular Layouts. SIAM J. Comput. 41(3): 537-564 (2012) - [j118]David Eppstein, Michael T. Goodrich
Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. 447: 44-52 (2012) - 2011
- [j117]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci Dimension of a Graph. Electron. J. Comb. 18(1) (2011) - [j116]David Eppstein, Emden R. Gansner:
Guest Editor's Foreword. J. Graph Algorithms Appl. 15(1): 3-5 (2011) - [j115]David Eppstein:
Recognizing Partial Cubes in Quadratic Time. J. Graph Algorithms Appl. 15(2): 269-293 (2011) - [j114]David Eppstein, Kevin A. Wortman:
Optimal Angular Resolution for Face-Symmetric Drawings. J. Graph Algorithms Appl. 15(4): 551-564 (2011) - [j113]David Eppstein:
Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. J. Comput. Geom. 2(1): 144-182 (2011) - [j112]David Eppstein, Michael T. Goodrich
Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers 60(11): 1571-1580 (2011) - [j111]David Eppstein, Michael T. Goodrich
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. 23(2): 297-306 (2011) - 2010
- [j110]David Eppstein:
Densities of Minor-Closed Graph Families. Electron. J. Comb. 17(1) (2010) - [j109]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. Discret. Math. Algorithms Appl. 2(4): 553-566 (2010) - [j108]David Eppstein:
Happy Endings for Flip Graphs. J. Comput. Geom. 1(1): 3-28 (2010) - [j107]David Eppstein, Michael T. Goodrich
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010) - [j106]Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discret. Math. 24(4): 1399-1440 (2010) - [j105]Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin
Questions answered. in theory.: http://cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010) - 2009
- [j104]Pablo Diaz-Gutierrez, David Eppstein, Meenakshisundaram Gopi:
Curvature Aware Fundamental Cycles. Comput. Graph. Forum 28(7): 2015-2024 (2009) - [j103]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and switches, tunnels and bridges. Comput. Geom. 42(8): 790-802 (2009) - [j102]David Eppstein:
Finding Large Clique Minors is Hard. J. Graph Algorithms Appl. 13(2): 197-204 (2009) - [j101]David Eppstein:
Testing bipartiteness of geometric intersection graphs. ACM Trans. Algorithms 5(2): 15:1-15:35 (2009) - [j100]David Eppstein:
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Trans. Algorithms 5(3): 29:1-29:24 (2009) - [j99]David Eppstein:
All maximal independent sets and dynamic dominance for sparse graphs. ACM Trans. Algorithms 5(4): 38:1-38:14 (2009) - [j98]David Eppstein, Michael T. Goodrich
Approximate topological matching of quad meshes. Vis. Comput. 25(8): 771-783 (2009) - 2008
- [j97]David Eppstein, Michael T. Goodrich
Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008) - [j96]David Eppstein, Jean-Claude Falmagne:
Algorithms for media. Discret. Appl. Math. 156(8): 1308-1320 (2008) - [j95]David Eppstein, Michael T. Goodrich
Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geom. Appl. 18(1/2): 131-160 (2008) - [j94]David Eppstein:
Upright-Quad Drawing of st-Planar Learning Spaces. J. Graph Algorithms Appl. 12(1): 51-72 (2008) - 2007
- [j93]David Eppstein, Michael T. Goodrich
Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007) - [j92]David Eppstein, Kevin A. Wortman:
Minimum dilation stars. Comput. Geom. 37(1): 27-37 (2007) - [j91]Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007) - [j90]David Eppstein:
The Traveling Salesman Problem for Cubic Graphs. J. Graph Algorithms Appl. 11(1): 61-81 (2007) - [j89]David Eppstein, Michael T. Goodrich
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36(5): 1360-1375 (2007) - [j88]David Eppstein:
Foreword to special issue on SODA 2002. ACM Trans. Algorithms 3(1): 1 (2007) - [j87]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms 3(2): 16 (2007) - [j86]Love Singhal, Elaheh Bozorgzadeh, David Eppstein:
Interconnect Criticality-Driven Delay Relaxation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(10): 1803-1817 (2007) - 2006
- [j85]David Eppstein:
Cubic Partial Cubes from Simplicial Arrangements. Electron. J. Comb. 13(1) (2006) - [j84]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. Theory Comput. Syst. 39(6): 903-928 (2006) - [j83]David Eppstein:
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms 2(4): 492-509 (2006) - 2005
- [j82]Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman:
Hinged dissection of polyominoes and polyforms. Comput. Geom. 31(3): 237-262 (2005) - [j81]David Eppstein:
The lattice dimension of a graph. Eur. J. Comb. 26(5): 585-592 (2005) - [j80]Richard Beigel, David Eppstein:
3-coloring in time O(1.3289n). J. Algorithms 54(2): 168-204 (2005) - [j79]Matthew Dickerson, David Eppstein, Michael T. Goodrich
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9(1): 31-52 (2005) - [j78]Tony Givargis, David Eppstein:
Memory reference caching for activity reduction on address buses. Microprocess. Microsystems 29(4): 145-153 (2005) - 2004
- [j77]M. Gopi, David Eppstein:
Single-Strip Triangulation of Manifolds with Arbitrary Topology. Comput. Graph. Forum 23(3): 371-380 (2004) - [j76]David Eppstein, John M. Sullivan, Alper Üngör:
Tiling space and slabs with acute tetrahedra. Comput. Geom. 27(3): 237-255 (2004) - [j75]David Eppstein, Joseph Wang:
Fast Approximation of Centrality. J. Graph Algorithms Appl. 8: 39-45 (2004) - 2003
- [j74]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003) - [j73]David Eppstein:
Guest Editor's Foreword. Discret. Comput. Geom. 30(1): 1-2 (2003) - [j72]David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl. 7(2): 131-140 (2003) - [j71]David Eppstein:
Setting Parameters by Example. SIAM J. Comput. 32(3): 643-653 (2003) - 2002
- [j70]David Eppstein, Marshall W. Bern, Brad L. Hutchings:
Algorithms for Coloring Quadtrees. Algorithmica 32(1): 87-94 (2002) - [j69]David Eppstein:
Beta-skeletons have unbounded dilation. Comput. Geom. 23(1): 43-52 (2002) - [j68]Marshall W. Bern, David Eppstein:
Multivariate Regression Depth. Discret. Comput. Geom. 28(1): 1-17 (2002) - [j67]Marshall W. Bern, David Eppstein, Jeff Erickson:
Flipping Cubical Meshes. Eng. Comput. 18(3): 173-187 (2002) - [j66]David Eppstein, George S. Lueker:
The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002) - 2001
- [j65]David Eppstein:
Tangent Spheres and Triangle Centers. Am. Math. Mon. 108(1): 63-66 (2001) - [j64]Xianping Ge, David Eppstein, Padhraic Smyth
The distribution of loop lengths in graphical models for turbo decoding. IEEE Trans. Inf. Theory 47(6): 2549-2553 (2001) - 2000
- [j63]David Eppstein:
Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica 27(3): 275-291 (2000) - [j62]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. Discret. Comput. Geom. 23(3): 305-323 (2000) - [j61]Marshall W. Bern, David Eppstein:
Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geom. Appl. 10(4): 347-360 (2000) - [j60]David Eppstein:
Incremental and Decremental Maintenance of Planar Width. J. Algorithms 37(2): 570-577 (2000) - [j59]David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. ACM J. Exp. Algorithmics 5: 1 (2000) - [j58]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000) - [j57]David Eppstein:
Clustering for faster network simplex pivots. Networks 35(3): 173-180 (2000) - 1999
- [j56]David Eppstein:
Linear complexity hexahedral mesh generation. Comput. Geom. 12(1-2): 3-16 (1999) - [j55]David Eppstein, Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discret. Comput. Geom. 22(4): 569-592 (1999) - [j54]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geom. Appl. 9(6): 517-532 (1999) - [j53]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. J. Algorithms 30(2): 302-322 (1999) - [j52]David Eppstein, Giuseppe F. Italiano:
PREFACE: Festschrift for Zvi Galil. J. Complex. 15(1): 1-3 (1999) - [j51]David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems. J. Graph Algorithms Appl. 3(3): 1-27 (1999) - 1998
- [j50]Gill Barequet, Matthew Dickerson, David Eppstein:
On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998) - [j49]Nina Amenta, Marshall W. Bern, David Eppstein:
The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Graph. Model. Image Process. 60(2): 125-135 (1998) - [j48]David Eppstein:
Geometric Lower Bounds for Parametric Matroid Optimization. Discret. Comput. Geom. 20(4): 463-476 (1998) - [j47]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer:
Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. 28(1): 341-381 (1998) - [j46]David Eppstein:
Finding the k Shortest Paths. SIAM J. Comput. 28(2): 652-673 (1998) - 1997
- [j45]David Eppstein:
Faster Geometric K-point MST Approximation. Comput. Geom. 8: 231-240 (1997) - [j44]David Eppstein, Mike Paterson, F. Frances Yao:
On Nearest-Neighbor Graphs. Discret. Comput. Geom. 17(3): 263-282 (1997) - [j43]David Eppstein:
Faster Circle Packing with Application to Non-Obtuse Triangulation. Int. J. Comput. Geom. Appl. 7(5): 485-492 (1997) - [j42]David Eppstein:
Dynamic Connectivity in Digital Images. Inf. Process. Lett. 62(3): 121-126 (1997) - [j41]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig:
Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5): 669-696 (1997) - [j40]David Eppstein:
Minimum Range Balanced Cuts via Dynamic Subset Sums. J. Algorithms 23(2): 375-385 (1997) - [j39]David Eppstein, Daniel S. Hirschberg:
Choosing Subsets with Maximum Weighted Average. J. Algorithms 24(1): 177-193 (1997) - 1996
- [j38]David Eppstein:
Average Case Analysis of Dynamic Geometric Optimization. Comput. Geom. 6: 45-68 (1996) - [j37]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant
Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6(3): 357-377 (1996) - [j36]David Eppstein, Zvi Galil, Giuseppe F. Italiano
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. 52(1): 3-27 (1996) - [j35]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996) - [j34]David P. Dobkin, David Eppstein, Don P. Mitchell:
Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. 15(4): 354-376 (1996) - 1995
- [j33]David Eppstein:
Asymptotic Speed-Ups in Constructive Solid Geometry. Algorithmica 13(5): 462-471 (1995) - [j32]Matthew Dickerson, David Eppstein:
Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5: 277-291 (1995) - [j31]David Eppstein:
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. Discret. Comput. Geom. 13: 111-122 (1995) - [j30]David Eppstein, Gary L. Miller, Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae 22(4): 309-329 (1995) - [j29]Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating polygons without large angles. Int. J. Comput. Geom. Appl. 5: 171-192 (1995) - 1994
- [j28]Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
Visibility with a Moving Point of View. Algorithmica 11(4): 360-378 (1994) - [j27]David Eppstein:
Approximating the Minimum Weight Steiner Triangulation. Discret. Comput. Geom. 11: 163-191 (1994) - [j26]David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes. Discret. Comput. Geom. 11: 321-350 (1994) - [j25]Boris Aronov
On the Number of Minimal 1-Steiner Trees. Discret. Comput. Geom. 12: 29-34 (1994) - [j24]David Eppstein:
Tree-weighted neighbors and geometric k smallest spanning trees. Int. J. Comput. Geom. Appl. 4(2): 229-238 (1994) - [j23]David Eppstein:
Arboricity and Bipartite Subgraph Listing Algorithms. Inf. Process. Lett. 51(4): 207-211 (1994) - [j22]David Eppstein:
Offline Algorithms for Dynamic Minimum Spanning Tree Problems. J. Algorithms 17(2): 237-250 (1994) - [j21]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994) - 1993
- [j20]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. 10: 47-65 (1993) - [j19]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) - [j18]David Eppstein:
Improved Bounds for Intersecting Triangles and Halving Planes. J. Comb. Theory A 62(1): 176-182 (1993) - [j17]David Eppstein:
Connectivity, graph minors, and subgraph multiplicity. J. Graph Theory 17(3): 409-416 (1993) - 1992
- [j16]David Eppstein:
Finding the k Smallest Spanning Trees. BIT 32(2): 237-248 (1992) - [j15]David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger:
Finding Minimum Area k-gons. Discret. Comput. Geom. 7: 45-58 (1992) - [j14]David Eppstein:
Parallel Recognition of Series-Parallel Graphs. Inf. Comput. 98(1): 41-55 (1992) - [j13]Marshall W. Bern, David Eppstein:
Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. 2(3): 241-255 (1992) - [j12]Marshall W. Bern, David Eppstein:
Erratum: Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. 2(4): 449-450 (1992) - [j11]David Eppstein:
Dynamic Three-Dimensional Linear Programming. INFORMS J. Comput. 4(4): 360-368 (1992) - [j10]David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming I: Linear Cost Functions. J. ACM 39(3): 519-545 (1992) - [j9]David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39(3): 546-567 (1992) - [j8]David Eppstein, Giuseppe F. Italiano
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) - [j7]David Eppstein, Lane A. Hemachandra
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. Math. Syst. Theory 25(1): 23-36 (1992) - 1991
- [j6]David Eppstein:
The Farthest Point Delaunay Triangulation Minimizes Angles. Comput. Geom. 1: 143-148 (1991) - [j5]Marshall W. Bern, David Eppstein, F. Frances Yao:
The expected extremes in a Delaunay triangulation. Int. J. Comput. Geom. Appl. 1(1): 79-91 (1991) - [j4]Marek Chrobak, David Eppstein:
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci. 86(2): 243-266 (1991) - 1990
- [j3]David Eppstein, Joan Feigenbaum, Chung-Lun Li
Equipartitions of graphs. Discret. Math. 91(3): 239-248 (1990) - [j2]David Eppstein:
Sequence Comparison with Mixed Convex and Concave Costs. J. Algorithms 11(1): 85-101 (1990) - [j1]David Eppstein:
Reset Sequences for Monotonic Automata. SIAM J. Comput. 19(3): 500-510 (1990)
Conference and Workshop Papers
- 2025
- [c250]David Eppstein:
Non-Euclidean Erdős-Anning Theorems. SoCG 2025: 46:1-46:15 - [c249]David Eppstein, Michael T. Goodrich, Songyu Liu:
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. ESA 2025: 69:1-69:17 - [c248]David Eppstein, Michael T. Goodrich, Vinesh Sridhar:
Computational Geometry with Probabilistically Noisy Primitive Operations. WADS 2025: 24:1-24:20 - 2024
- [c247]Hadi Khodabandeh, David Eppstein:
Maintaining Light Spanners via Minimal Updates. CCCG 2024: 1-15 - [c246]Gleb Dilman, David Eppstein, Valentin Polishchuk, Christiane Schmidt:
Well-Separated Multiagent Path Traversal. CCCG 2024: 137-144 - [c245]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c244]David Eppstein, Michael T. Goodrich
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. GD 2024: 39:1-39:17 - 2023
- [c243]David Eppstein:
A Parameterized Algorithm for Flat Folding. CCCG 2023: 35-42 - [c242]Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CCCG 2023: 77-88 - [c241]David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. CCCG 2023: 197-206 - [c240]David Eppstein:
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. SoCG 2023: 29:1-29:16 - [c239]David Eppstein:
On the Biplanarity of Blowups. GD (1) 2023: 3-17 - [c238]Alvin Chiu
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) 2023: 141-149 - [c237]David Eppstein, Daniel Frishberg:
Improved Mixing for the Convex Polygon Triangulation Flip Walk. ICALP 2023: 56:1-56:17 - [c236]David Eppstein, Daniel Frishberg:
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. ISAAC 2023: 30:1-30:13 - [c235]David Eppstein:
Lower Bounds for Non-adaptive Shortest Path Relaxation. WADS 2023: 416-429 - 2022
- [c234]David Eppstein:
Reflections in an Octagonal Mirror Maze. CCCG 2022: 129-134 - [c233]David Eppstein:
Locked and Unlocked Smooth Embeddings of Surfaces. CCCG 2022: 135-142 - [c232]David Eppstein:
Orthogonal Dissection into Few Rectangles. CCCG 2022: 143-150 - [c231]Erik D. Demaine, Martin L. Demaine, David Eppstein, Hiro Ito, Yuta Katayama, Wataru Maruyama, Yushi Uno:
Geodesic Paths Passing Through All Faces on A Polyhedron. JCDCGGG 2022: 184-209 - [c230]David Eppstein:
Finding Relevant Points for Nearest-Neighbor Classification. SOSA 2022: 68-78 - [c229]David Eppstein, Hadi Khodabandeh:
Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. SPAA 2022: 57-59 - [c228]David Eppstein, Hadi Khodabandeh:
Distributed Construction of Lightweight Spanners for Unit Ball Graphs. DISC 2022: 21:1-21:23 - 2021
- [c227]David Eppstein, Daniel Frishberg, Martha C. Osegueda:
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CCCG 2021: 56-64 - [c226]David Eppstein, Hadi Khodabandeh:
On the Edge Crossings of the Greedy Spanner. SoCG 2021: 33:1-33:17 - [c225]David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT 2021: 217-229 - [c224]David Eppstein, Daniel Frishberg
On the Treewidth of Hanoi Graphs. FUN 2021: 13:1-13:21 - [c223]David Eppstein:
Limitations on Realistic Hyperbolic Graph Drawing. GD 2021: 343-357 - [c222]David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. WADS 2021: 343-356 - [c221]David Eppstein:
The Graphs of Stably Matchable Pairs. WG 2021: 349-360 - 2020
- [c220]Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CCCG 2020: 63-72 - [c219]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge Zipper Unfolding. CCCG 2020: 101-105 - [c218]Erik D. Demaine, Martin L. Demaine, David Eppstein:
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CCCG 2020: 106-113 - [c217]David Eppstein:
Dynamic Products of Ranks. CCCG 2020: 199-205 - [c216]Glencora Borradaile, Erin Wolf Chambers
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT 2020: 15:1-15:19 - [c215]David Eppstein, Daniel Frishberg
Simplifying Activity-On-Edge Graphs. SWAT 2020: 24:1-24:14 - 2019
- [c214]David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CCCG 2019: 17-22 - [c213]David Eppstein:
Cubic Planar Graphs That Cannot Be Drawn On Few Lines. SoCG 2019: 32:1-32:15 - [c212]David Eppstein:
Counting Polygon Triangulations is Hard. SoCG 2019: 33:1-33:17 - [c211]Therese Biedl, Erin Wolf Chambers
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - [c210]Nil Mamano
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ISAAC 2019: 51:1-51:21 - [c209]David Eppstein, Michael T. Goodrich
Tracking Paths in Planar Graphs. ISAAC 2019: 54:1-54:17 - [c208]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC 2019: 9:1-9:17 - [c207]David Eppstein, Bruce A. Reed:
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. SODA 2019: 589-605 - [c206]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: 23-30 - [c205]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara
Reconfiguring Undirected Paths. WADS 2019: 353-365 - 2018
- [c204]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX 2018: 87-96 - [c203]David Eppstein, Sariel Har-Peled
Grid peeling and the affine curve-shortening flow. ALENEX 2018: 109-116 - [c202]David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres:
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CCCG 2018: 98-113 - [c201]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. COCOON 2018: 365-377 - [c200]David Eppstein:
Faster Evaluation of Subtraction Games. FUN 2018: 20:1-20:12 - [c199]David Eppstein:
Making Change in 2048. FUN 2018: 21:1-21:13 - [c198]David Eppstein:
Realization and Connectivity of the Graphs of Origami Flat Foldings. GD 2018: 541-554 - [c197]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
Optimally Sorting Evolving Data. ICALP 2018: 81:1-81:13 - [c196]Gill Barequet, David Eppstein, Michael T. Goodrich
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP 2018: 89:1-89:14 - [c195]David Eppstein, Daniel Lokshtanov:
The Parameterized Complexity of Finding Point Sets with Hereditary Properties. IPEC 2018: 11:1-11:14 - [c194]David Eppstein, Elham Havvaei:
Parameterized Leaf Power Recognition via Embedding into Graph Products. IPEC 2018: 16:1-16:14 - [c193]David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. LATIN 2018: 777-789 - [c192]Giordano Da Lozzo
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG 2018: 111-124 - 2017
- [c191]David Eppstein:
Forbidden Configurations in Discrete Geometry. CCCG 2017: 1 - [c190]David Eppstein:
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. GD 2017: 506-513 - [c189]David Eppstein:
The Effect of Planarization on Width. GD 2017: 560-572 - [c188]David Eppstein, Siddharth Gupta:
Crossing Patterns in Nonplanar Road Networks. SIGSPATIAL/GIS 2017: 40:1-40:9 - [c187]David Eppstein, Michael T. Goodrich
Defining Equitable Geographic Districts in Road Networks via Stable Matching. SIGSPATIAL/GIS 2017: 52:1-52:4 - [c186]Giordano Da Lozzo
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. ISAAC 2017: 24:1-24:14 - [c185]David Eppstein, Michael T. Goodrich, Nil Mamano:
Algorithms for Stable Matching and Clustering in a Grid. IWCIA 2017: 117-131 - [c184]David Eppstein, Denis Kurz:
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. IPEC 2017: 16:1-16:13 - [c183]David Eppstein, Michael T. Goodrich
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS 2017: 247-260 - [c182]David Eppstein, Michael T. Goodrich
Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. SPAA 2017: 137-139 - [c181]Ahmad Biniaz, Prosenjit Bose
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - 2016
- [c180]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. ATMOS 2016: 5:1-5:14 - [c179]David Eppstein:
Maximizing the Sum of Radii of Disjoint Balls or Disks. CCCG 2016: 260-265 - [c178]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG 2016: 22:1-22:16 - [c177]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layout Is Hard. GD 2016: 499-510 - [c176]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. ISC 2016: 283-301 - [c175]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. LATIN 2016: 390-402 - [c174]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415 - [c173]David Eppstein:
Treetopes and their Graphs. SODA 2016: 969-984 - [c172]David Eppstein:
Cuckoo Filter: Simplification and Analysis. SWAT 2016: 8:1-8:12 - 2015
- [c171]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt
Folding Polyominoes into (Poly)Cubes. CCCG 2015 - [c170]Drago Bokal, Sergio Cabello
Finding All Maximal Subsequences with Hereditary Properties. SoCG 2015: 240-254 - [c169]Vida Dujmovic, David Eppstein, David R. Wood
Genus, Treewidth, and Local Crossing Number. GD 2015: 87-98 - [c168]Michael J. Bannister, David A. Brown, David Eppstein:
Confluent Orthogonal Drawings of Syntax Diagrams. GD 2015: 260-271 - [c167]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. SODA 2015: 136-147 - [c166]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c165]David Eppstein:
The Parametric Closure Problem. WADS 2015: 327-338 - [c164]David Eppstein, J. Michael McCarthy
Rooted Cycle Bases. WADS 2015: 339-350 - [c163]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - 2014
- [c162]Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. ANALCO 2014: 92-103 - [c161]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. GD 2014: 1-12 - [c160]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Balanced Circle Packings for Planar Graphs. GD 2014: 125-136 - [c159]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. GD 2014: 149-161 - [c158]Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. GD 2014: 210-221 - [c157]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. GD 2014: 272-283 - [c156]Zhanpeng Cheng, David Eppstein:
Linear-Time Algorithms for Proportional Apportionment. ISAAC 2014: 581-592 - [c155]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA 2014: 162-173 - 2013
- [c154]David Eppstein, Marc J. van Kreveld, Bettina Speckmann
Improved grid map layout by point set matching. PacificVis 2013: 25-32 - [c153]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c152]David Eppstein, Michael T. Goodrich, Joseph A. Simons:
Set-Difference Range Queries. CCCG 2013 - [c151]David Eppstein:
The graphs of planar soap bubbles. SoCG 2013: 27-36 - [c150]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. GD 2013: 208-219 - [c149]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. GD 2013: 340-351 - [c148]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg
Strict Confluent Drawing. GD 2013: 352-363 - [c147]David Eppstein:
Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. GD 2013: 436-447 - [c146]Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA 2013: 856-864 - [c145]Michael J. Bannister, Sergio Cabello
Parameterized Complexity of 1-Planarity. WADS 2013: 97-108 - [c144]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS 2013: 316-327 - 2012
- [c143]Michael J. Bannister, David Eppstein:
Randomized Speedup of the Bellman-Ford Algorithm. ANALCO 2012: 41-47 - [c142]Glencora Borradaile, David Eppstein:
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG 2012: 297-302 - [c141]David Eppstein:
Solving Single-Digit Sudoku Subproblems. FUN 2012: 142-153 - [c140]David Eppstein:
Planar Lombardi Drawings for Subcubic Graphs. GD 2012: 126-137 - [c139]Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner
On the Density of Maximal 1-Planar Graphs. GD 2012: 327-338 - [c138]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. GD 2012: 414-425 - [c137]David Eppstein:
Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing. IMR 2012: 261-277 - [c136]Hsin-Yi Yeh, Shawna L. Thomas, David Eppstein, Nancy M. Amato:
UOBPRM: A uniformly distributed obstacle-based PRM. IROS 2012: 2655-2662 - 2011
- [c135]David Eppstein, Michael T. Goodrich
Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107 - [c134]David Eppstein, Maarten Löffler:
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. SCG 2011: 361-369 - [c133]David Eppstein, Joseph A. Simons:
Confluent Hasse Diagrams. GD 2011: 2-13 - [c132]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Planar and Poly-arc Lombardi Drawings. GD 2011: 308-319 - [c131]Michael J. Bannister, David Eppstein:
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. GD 2011: 367-378 - [c130]Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams under Geometric Distance Functions. ISVD 2011: 31-38 - [c129]David Eppstein, Michael T. Goodrich
What's the difference?: efficient set reconciliation without prior context. SIGCOMM 2011: 218-229 - [c128]Kevin Buchin
Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170 - [c127]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. WADS 2011: 362-373 - [c126]David Eppstein, Darren Strash
Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA 2011: 364-375 - 2010
- [c125]David Eppstein:
Regular labelings and geometric structures. CCCG 2010: 125-130 - [c124]David Eppstein, Michael T. Goodrich, Darren Strash
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141 - [c123]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. COCOON 2010: 90-99 - [c122]David Eppstein, Elena Mumford:
Steinitz theorems for orthogonal polyhedra. SCG 2010: 429-438 - [c121]Matthew T. Dickerson, David Eppstein, Michael T. Goodrich:
Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373 - [c120]Erin W. Chambers
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD 2010: 129-140 - [c119]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD 2010: 183-194 - [c118]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Lombardi Drawings of Graphs. GD 2010: 195-207 - [c117]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
Optimal 3D Angular Resolution for Low-Degree Graphs. GD 2010: 208-219 - [c116]David Eppstein, Michael T. Goodrich
Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22 - [c115]David Eppstein:
Regular Labelings and Geometric Structures. ISAAC (1) 2010: 1 - [c114]Erin W. Chambers
Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) 2010: 241-252 - [c113]David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414 - [c112]Matthew Dickerson, David Eppstein, Kevin A. Wortman:
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22 - [c111]David Eppstein:
Paired Approximation Problems and Incompatible Inapproximabilities. SODA 2010: 1076-1086 - 2009
- [c110]Matthew T. Dickerson, David Eppstein:
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). SCG 2009: 92-93 - [c109]David Eppstein, Elena Mumford, Bettina Speckmann
Area-universal rectangular layouts. SCG 2009: 267-276 - [c108]David Eppstein, Michael T. Goodrich
Going off-road: transversal complexity in road networks. GIS 2009: 23-32 - [c107]David Eppstein, Michael T. Goodrich
Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159 - [c106]David Eppstein, Elena Mumford:
Self-overlapping curves revisited. SODA 2009: 160-169 - [c105]Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker:
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS 2009: 242-253 - [c104]David Eppstein, Elena Mumford:
Orientation-Constrained Rectangular Layouts. WADS 2009: 266-277 - [c103]David Eppstein, Emma S. Spiro
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. WADS 2009: 278-289 - [c102]David Eppstein, Kevin A. Wortman:
Optimal Embedding into Star Metrics. WADS 2009: 290-301 - [c101]David Eppstein:
Graph-Theoretic Solutions to Computational Geometry Problems. WG 2009: 1-16 - 2008
- [c100]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160 - [c99]David Eppstein, Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane. GD 2008: 14-25 - [c98]David Eppstein:
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. GD 2008: 78-89 - [c97]David Eppstein:
Isometric Diamond Subgraphs. GD 2008: 384-389 - [c96]David Eppstein, Michael T. Goodrich
Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16 - [c95]David Eppstein, Michael T. Goodrich
Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92 - [c94]David Eppstein:
Recognizing partial cubes in quadratic time. SODA 2008: 1258-1266 - 2007
- [c93]David Eppstein, Michael T. Goodrich
Guard placement for efficient point-in-polygon proofs. SCG 2007: 27-36 - [c92]David Eppstein:
Happy endings for flip graphs. SCG 2007: 92-101 - [c91]David Eppstein:
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. SODA 2007: 29-38 - [c90]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and Switches, Tunnels and Bridges. WADS 2007: 77-88 - [c89]David Eppstein, Michael T. Goodrich:
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS 2007: 637-648 - 2006
- [c88]Josiah Carlson, David Eppstein:
Trees with Convex Faces and Optimal Angles. GD 2006: 77-88 - [c87]David Eppstein:
Upright-Quad Drawing of st -Planar Learning Spaces. GD 2006: 282-293 - [c86]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD 2006: 294-305 - [c85]Pablo Diaz-Gutierrez, David Eppstein, M. Gopi:
Single Triangle Strip and Loop on Manifolds with Boundaries. SIBGRAPI 2006: 221-228 - [c84]Josiah Carlson, David Eppstein:
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. SWAT 2006: 400-410 - 2005
- [c83]David Eppstein, Michael T. Goodrich
The skip quadtree: a simple dynamic data structure for multidimensional data. SCG 2005: 296-305 - [c82]David Eppstein, Kevin A. Wortman:
Minimum dilation stars. SCG 2005: 321-326 - [c81]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Delta-Confluent Drawings. GD 2005: 165-176 - [c80]Lars Arge, David Eppstein, Michael T. Goodrich
Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76 - [c79]David Eppstein:
All maximal independent sets and dynamic dominance for sparse graphs. SODA 2005: 451-459 - [c78]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98 - 2004
- [c77]Jean Cardinal, David Eppstein:
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119 - [c76]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
Deterministic sampling and range counting in geometric data streams. SCG 2004: 144-151 - [c75]Christian A. Duncan, David Eppstein, Stephen G. Kobourov
The geometric thickness of low degree graphs. SCG 2004: 340-346 - [c74]David Eppstein, M. Gopi:
Single-strip triangulation of manifolds with arbitrary topology. SCG 2004: 455-456 - [c73]David Eppstein:
Algorithms for Drawing Media. GD 2004: 173-183 - [c72]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. GD 2004: 184-194 - [c71]David Eppstein:
Quasiconvex analysis of backtracking algorithms. SODA 2004: 788-797 - [c70]David Eppstein:
Testing bipartiteness of geometric intersection graphs. SODA 2004: 860-868 - [c69]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The effect of faults on network expansion. SPAA 2004: 286-293 - 2003
- [c68]Marshall W. Bern, David Eppstein:
Optimized color gamuts for tiled displays. SCG 2003: 274-281 - [c67]Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. GD 2003: 1-12 - [c66]Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - [c65]Marshall W. Bern, David Eppstein:
Möbius-invariant natural neighbor interpolation. SODA 2003: 128-129 - [c64]David Eppstein:
Dynamic generators of topologically embedded graphs. SODA 2003: 599-608 - [c63]David Eppstein:
The Traveling Salesman Problem for Cubic Graphs. WADS 2003: 307-318 - 2002
- [c62]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. SCG 2002: 237-243 - [c61]David Eppstein:
Separating Thickness from Geometric Thickness. GD 2002: 150-161 - [c60]David Eppstein, Joseph Wang:
A Steady State Model for Graph Power Law. WebDyn@WWW 2002: 15-24 - 2001
- [c59]Marshall W. Bern, David Eppstein:
Flipping Cubical Meshes. IMR 2001 - [c58]David Eppstein, Joseph Wang:
Fast approximation of centrality. SODA 2001: 228-229 - [c57]David Eppstein:
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. SODA 2001: 329-337 - [c56]David Eppstein, S. Muthukrishnan:
Internet packet filter management and rectangle geometry. SODA 2001: 827-835 - [c55]Marshall W. Bern, David Eppstein:
Optimal Möbius Transformations for Information Visualization and Meshing. WADS 2001: 14-25 - [c54]Marshall W. Bern, David Eppstein:
Optimization over Zonotopes and Training Support Vector Machines. WADS 2001: 111-121 - [c53]David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. WADS 2001: 462-470 - 2000
- [c52]Marshall W. Bern, David Eppstein:
Multivariate regression depth. SCG 2000: 315-321 - 1999
- [c51]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo:
Ununfoldable polyhedra. CCCG 1999 - [c50]Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman:
Hinged dissections of polyominoes and polyforms. CCCG 1999 - [c49]David Eppstein:
Setting Parameters by Example. FOCS 1999: 309-318 - [c48]David Eppstein, David Hart:
Shortest Paths in an Arrangement with k Line Orientations. SODA 1999: 310-316 - [c47]David Eppstein:
Incremental and Decremental Maintenance of Planar Width. SODA 1999: 899-900 - 1998
- [c46]David Eppstein, Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. SCG 1998: 58-67 - [c45]Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger:
Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605 - [c44]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. GD 1998: 101-110 - [c43]David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. SODA 1998: 619-628 - 1997
- [c42]David Eppstein:
Faster Construction of Planar Two-Centers. SODA 1997: 131-138 - [c41]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. SODA 1997: 528-537 - [c40]David Eppstein, David Hart:
An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. WADS 1997: 234-247 - 1996
- [c39]Gill Barequet, Matthew Dickerson, David Eppstein:
On Triangulating Three-Dimensional Polygons. SCG 1996: 38-47 - [c38]David Eppstein:
Linear Complexity Hexahedral Mesh Generation. SCG 1996: 58-67 - [c37]David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160 - 1995
- [c36]Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter:
The Centroid of Points with Approximate Weights. ESA 1995: 460-472 - [c35]Richard Beigel, David Eppstein:
3-Coloring in Time O(1.3446n): A No-MIS Algorithm. FOCS 1995: 444-452 - [c34]Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196 - [c33]David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems. SODA 1995: 632-640 - [c32]David Eppstein:
Geometric lower bounds for parametric matroid optimization. STOC 1995: 662-671 - 1994
- [c31]David Eppstein:
Finding the k Shortest Paths. FOCS 1994: 154-165 - [c30]David Eppstein:
Average Case Analysis of Dynamic Geometric Optimization. SODA 1994: 77-86 - [c29]David Eppstein:
Clustering for Faster Network Simplex Pivots. SODA 1994: 160-166 - 1993
- [c28]David P. Dobkin, David Eppstein:
Computing the Discrepancy. SCG 1993: 47-52 - [c27]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant
Approximating Center Points with Iterated Radon Points. SCG 1993: 91-98 - [c26]David Eppstein, Gary L. Miller, Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. SCG 1993: 99-108 - [c25]Marshall W. Bern, David Eppstein:
Worst-Case Bounds for Subadditive Geometric Graphs. SCG 1993: 183-188 - [c24]David Eppstein, Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993: 64-73 - [c23]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer:
Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217 - [c22]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. WADS 1993: 188-199 - 1992
- [c21]Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating Polygons without Large Angles. SCG 1992: 222-231 - [c20]David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig:
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract). FOCS 1992: 60-69 - [c19]Pankaj K. Agarwal, David Eppstein, Jirí Matousek:
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. FOCS 1992: 80-89 - [c18]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optional Triangulations. LATIN 1992: 46-60 - [c17]David Eppstein:
Approximating the Minimum Weight Triangulation. SODA 1992: 48-57 - [c16]David Eppstein:
New Algorithms for Minimum Area k-gons. SODA 1992: 83-88 - 1991
- [c15]Marshall W. Bern, David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons. SCG 1991: 342-350 - [c14]David Eppstein:
Dynamic Three-Dimensional Linear Programming. FOCS 1991: 488-494 - [c13]Marshall W. Bern, David Eppstein, F. Frances Yao:
The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685 - [c12]Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung:
Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA 1991: 158-167 - [c11]David Eppstein:
Offline Algorithms for Dynamic Minimum Spanning Tree Problems. WADS 1991: 392-399 - 1990
- [c10]Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao:
Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry 1990: 45-66 - [c9]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. FOCS 1990: 231-241 - [c8]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11 - [c7]Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
Visibility with a Moving Point of View. SODA 1990: 107-117 - [c6]David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano:
Sparse Dynamic Programming. SODA 1990: 513-522 - [c5]David Eppstein:
Finding the k Smallest Spanning Trees. SWAT 1990: 38-47 - 1989
- [c4]David Eppstein, Zvi Galil:
Parallel Algorithmic Techniques for Combinatorial Computation. ICALP 1989: 304-318 - 1988
- [c3]David Eppstein, Zvi Galil, Raffaele Giancarlo:
Speeding up Dynamic Programming. FOCS 1988: 488-496 - [c2]David Eppstein:
Reset Sequences for Finite Automata with Application to Design of Parts Orienters. ICALP 1988: 230-238 - 1985
- [c1]David Eppstein:
A Heuristic Approach to Program Inversion. IJCAI 1985: 219-221
Parts in Books or Collections
- 2013
- [p5]David Eppstein:
Learning Sequences: An Efficient Data Structure for Learning Spaces. Knowledge Spaces, Applications in Education 2013: 287-304 - [p4]David Eppstein:
Projection, Decomposition, and Adaption of Learning Spaces. Knowledge Spaces, Applications in Education 2013: 305-322 - 2010
- [p3]David Eppstein:
Growth and Decay in Life-Like Cellular Automata. Game of Life Cellular Automata 2010: 71-97 - 2000
- [p2]David Eppstein:
Spanning Trees and Spanners. Handbook of Computational Geometry 2000: 425-461 - 1999
- [p1]David Eppstein, Zvi Galil, Giuseppe F. Italiano:
Dynamic Graph Algorithms. Algorithms and Theory of Computation Handbook 1999
Editorship
- 2018
- [e5]David Eppstein:
16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June 18-20, 2018, Malmö, Sweden. LIPIcs 101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-068-2 [contents] - 2015
- [e4]Ulrik Brandes, David Eppstein:
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. SIAM 2015, ISBN 978-1-61197-375-4 [contents] - 2013
- [e3]Jean-Claude Falmagne, Dietrich Albert
Knowledge Spaces, Applications in Education. Springer 2013, ISBN 978-3-642-35328-4 [contents] - 2010
- [e2]David Eppstein, Emden R. Gansner:
Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers. Lecture Notes in Computer Science 5849, Springer 2010, ISBN 978-3-642-11804-3 [contents] - 2002
- [e1]David Eppstein:
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA. ACM/SIAM 2002, ISBN 0-89871-513-X [contents]
Reference Works
- 2016
- [r1]David Eppstein:
k-Best Enumeration. Encyclopedia of Algorithms 2016: 1003-1006
Informal and Other Publications
- 2025
- [i248]David Eppstein, Michael T. Goodrich
Computational Geometry with Probabilistically Noisy Primitive Operations. CoRR abs/2501.07707 (2025) - [i247]David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa:
Zip-Tries: Simple Dynamic Data Structures for Strings. CoRR abs/2505.04953 (2025) - [i246]David Eppstein, Michael T. Goodrich, Songyu Liu:
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. CoRR abs/2505.10789 (2025) - [i245]Boris Aronov, Sang Won Bae, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer, Raimund Seidel:
Better Late than Never: the Complexity of Arrangements of Polyhedra. CoRR abs/2506.03960 (2025) - [i244]David Eppstein:
Decremental Greedy Polygons and Polyhedra Without Sharp Angles. CoRR abs/2507.04538 (2025) - [i243]Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman J. Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, Jonas Sauer
Bicriteria Polygon Aggregation with Arbitrary Shapes. CoRR abs/2507.11212 (2025) - [i242]David Eppstein:
Stabbing Faces By a Convex Curve. CoRR abs/2508.17549 (2025) - [i241]Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg:
Visualizing Treewidth. CoRR abs/2508.19935 (2025) - [i240]David Eppstein, Michael T. Goodrich, Abraham M. Illickan, Claire A. To
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness. CoRR abs/2508.20489 (2025) - [i239]Maria Chudnovsky, David Eppstein, David Fischer:
String Graph Obstacles of High Girth and of Bounded Degree. CoRR abs/2509.00278 (2025) - 2024
- [i238]David Eppstein:
Non-Euclidean Erdős-Anning Theorems. CoRR abs/2401.06328 (2024) - [i237]Hadi Khodabandeh, David Eppstein:
Maintaining Light Spanners via Minimal Updates. CoRR abs/2403.03290 (2024) - [i236]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - [i235]David Eppstein:
Computational Complexities of Folding. CoRR abs/2410.07666 (2024) - [i234]David Eppstein, Michael T. Goodrich, Abraham M. Illickan:
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. CoRR abs/2410.12083 (2024) - [i233]Arushi Arora, David Eppstein, Randy Huynh:
Fast Schulze Voting Using Quickselect. CoRR abs/2411.18790 (2024) - 2023
- [i232]David Eppstein:
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. CoRR abs/2303.00147 (2023) - [i231]Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CoRR abs/2303.17028 (2023) - [i230]David Eppstein:
Lower Bounds for Non-Adaptive Shortest Path Relaxation. CoRR abs/2305.09230 (2023) - [i229]David Eppstein, Andrea Lincoln
Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR abs/2306.11185 (2023) - [i228]David Eppstein:
A Parameterized Algorithm for Flat Folding. CoRR abs/2306.11939 (2023) - [i227]David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. CoRR abs/2306.12611 (2023) - [i226]Alvin Chiu, David Eppstein, Michael T. Goodrich
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. CoRR abs/2307.10527 (2023) - 2022
- [i225]David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood:
Three-dimensional graph products with unbounded stack-number. CoRR abs/2202.05327 (2022) - [i224]Oswin Aichholzer
Geometric Dominating Sets. CoRR abs/2203.13170 (2022) - [i223]David Eppstein:
Orthogonal dissection into few rectangles. CoRR abs/2206.10675 (2022) - [i222]David Eppstein:
Reflections in an octagonal mirror maze. CoRR abs/2206.11413 (2022) - [i221]David Eppstein:
Locked and unlocked smooth embeddings of surfaces. CoRR abs/2206.12989 (2022) - [i220]David Eppstein, Daniel Frishberg:
Improved mixing for the convex polygon triangulation flip walk. CoRR abs/2207.09972 (2022) - 2021
- [i219]David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. CoRR abs/2101.09918 (2021) - [i218]David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. CoRR abs/2105.05371 (2021) - [i217]David Eppstein, Hadi Khodabandeh:
Optimal Spanners for Unit Ball Graphs in Doubling Metrics. CoRR abs/2106.15234 (2021) - [i216]David Eppstein, Daniel Frishberg, Martha C. Osegueda:
Angles of Arc-Polygons and Lombardi Drawings of Cacti. CoRR abs/2107.03615 (2021) - [i215]David Eppstein:
Limitations on Realistic Hyperbolic Graph Drawing. CoRR abs/2108.07441 (2021) - [i214]David Eppstein:
Finding Relevant Points for Nearest-Neighbor Classification. CoRR abs/2110.06163 (2021) - [i213]David Eppstein, Daniel Frishberg:
Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. CoRR abs/2111.03898 (2021) - [i212]David Eppstein:
The Complexity of Iterated Reversible Computation. CoRR abs/2112.11607 (2021) - 2020
- [i211]David Eppstein, Daniel Frishberg, Elham Havvaei:
Simplifying Activity-on-Edge Graphs. CoRR abs/2002.01610 (2020) - [i210]David Eppstein, Hadi Khodabandeh:
On the Edge Crossings of the Greedy Spanner. CoRR abs/2002.05854 (2020) - [i209]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-stretch spanning trees of graphs with bounded width. CoRR abs/2004.08375 (2020) - [i208]David Eppstein, Daniel Frishberg, William Maxwell:
On the treewidth of Hanoi graphs. CoRR abs/2005.00179 (2020) - [i207]David Eppstein:
Dynamic Products of Ranks. CoRR abs/2007.08123 (2020) - [i206]Erik D. Demaine, Martin L. Demaine, David Eppstein:
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra. CoRR abs/2007.14525 (2020) - [i205]Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CoRR abs/2007.15784 (2020) - [i204]David Eppstein:
On Polyhedral Realization with Isosceles Triangles. CoRR abs/2009.00116 (2020) - [i203]David Eppstein:
The Graphs of Stably Matchable Pairs. CoRR abs/2010.09230 (2020) - [i202]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-number is not bounded by queue-number. CoRR abs/2011.04195 (2020) - 2019
- [i201]Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk:
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. CoRR abs/1902.06875 (2019) - [i200]David Eppstein:
Counting Polygon Triangulations is Hard. CoRR abs/1903.04737 (2019) - [i199]David Eppstein:
Cubic Planar Graphs that cannot be Drawn on few Lines. CoRR abs/1903.05256 (2019) - [i198]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. CoRR abs/1905.00518 (2019) - [i197]David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CoRR abs/1906.04401 (2019) - [i196]Erik D. Demaine, Martin L. Demaine, David Eppstein, Joseph O'Rourke:
Some Polycubes Have No Edge-Unzipping. CoRR abs/1907.08433 (2019) - [i195]David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias:
Tracking Paths in Planar Graphs. CoRR abs/1908.05445 (2019) - [i194]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy height, grid-major height and graph-drawing height. CoRR abs/1908.05706 (2019) - [i193]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 abs/1908.07668 (2019) - [i192]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR abs/1910.02057 (2019) - [i191]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. CoRR abs/1910.05667 (2019) - 2018
- [i190]David Eppstein, Vijay V. Vazirani:
NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs. CoRR abs/1802.00084 (2018) - [i189]David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. CoRR abs/1803.04555 (2018) - [i188]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR abs/1803.05465 (2018) - [i187]David Eppstein:
Faster Evaluation of Subtraction Games. CoRR abs/1804.06515 (2018) - [i186]David Eppstein:
Making Change in 2048. CoRR abs/1804.07396 (2018) - [i185]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. CoRR abs/1804.09411 (2018) - [i184]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Optimally Sorting Evolving Data. CoRR abs/1805.03350 (2018) - [i183]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. CoRR abs/1805.04055 (2018) - [i182]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. CoRR abs/1805.05443 (2018) - [i181]David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres:
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CoRR abs/1808.00561 (2018) - [i180]David Eppstein, Daniel Lokshtanov:
The Parameterized Complexity of Finding Point Sets with Hereditary Properties. CoRR abs/1808.02162 (2018) - [i179]David Eppstein:
Realization and Connectivity of the Graphs of Origami Flat Foldings. CoRR abs/1808.06013 (2018) - [i178]David Eppstein, Elham Havvaei:
Parameterized Leaf Power Recognition via Embedding into Graph Products. CoRR abs/1810.02452 (2018) - [i177]David Eppstein, Bruce A. Reed:
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. CoRR abs/1810.07825 (2018) - [i176]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-closed graph classes with bounded layered pathwidth. CoRR abs/1810.08314 (2018) - 2017
- [i175]David Eppstein, Denis Kurz:
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. CoRR abs/1703.02784 (2017) - [i174]David Eppstein, Michael T. Goodrich, Nil Mamano:
Algorithms for Stable Matching and Clustering in a Grid. CoRR abs/1704.02303 (2017) - [i173]David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano:
Defining Equitable Geographic Districts in Road Networks via Stable Matching. CoRR abs/1706.09593 (2017) - [i172]David Eppstein:
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. CoRR abs/1708.05152 (2017) - [i171]David Eppstein:
The Effect of Planarization on Width. CoRR abs/1708.05155 (2017) - [i170]David Eppstein, Siddharth Gupta:
Crossing Patterns in Nonplanar Road Networks. CoRR abs/1709.06113 (2017) - [i169]Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson:
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. CoRR abs/1710.00426 (2017) - [i168]David Eppstein, Sariel Har-Peled
Grid peeling and the affine curve-shortening flow. CoRR abs/1710.03960 (2017) - [i167]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. CoRR abs/1712.09317 (2017) - 2016
- [i166]David Eppstein, Mereke van Garderen, Bettina Speckmann
Convex-Arc Drawings of Pseudolines. CoRR abs/1601.06865 (2016) - [i165]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. CoRR abs/1602.00767 (2016) - [i164]David Eppstein:
Cuckoo Filter: Simplification and Analysis. CoRR abs/1604.06067 (2016) - [i163]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. CoRR abs/1605.09425 (2016) - [i162]David Eppstein:
Maximizing the Sum of Radii of Disjoint Balls or Disks. CoRR abs/1607.02184 (2016) - [i161]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich:
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. CoRR abs/1609.04512 (2016) - [i160]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - [i159]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - 2015
- [i158]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i157]David Eppstein:
D3-Reducible Graphs. CoRR abs/1502.05334 (2015) - [i156]David Eppstein:
The Parametric Closure Problem. CoRR abs/1504.04073 (2015) - [i155]David Eppstein, J. Michael McCarthy, Brian E. Parrish:
Rooted Cycle Bases. CoRR abs/1504.04931 (2015) - [i154]David Eppstein:
Metric Dimension Parameterized by Max Leaf Number. CoRR abs/1506.01749 (2015) - [i153]Vida Dujmovic, David Eppstein, David R. Wood:
Genus, Treewidth, and Local Crossing Number. CoRR abs/1506.04380 (2015) - [i152]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR abs/1506.09145 (2015) - [i151]David Eppstein, Sariel Har-Peled
Approximate Greedy Clustering and Distance Selection for Graph Metrics. CoRR abs/1507.01555 (2015) - [i150]Michael J. Bannister, David A. Brown, David Eppstein:
Confluent Orthogonal Drawings of Syntax Diagrams. CoRR abs/1509.00818 (2015) - [i149]David Eppstein:
Treetopes and their Graphs. CoRR abs/1510.03152 (2015) - [i148]David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. CoRR abs/1512.06488 (2015) - 2014
- [i147]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR abs/1404.0286 (2014) - [i146]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR abs/1408.1422 (2014) - [i145]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. CoRR abs/1408.4902 (2014) - [i144]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. CoRR abs/1408.5939 (2014) - [i143]Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. CoRR abs/1408.6321 (2014) - [i142]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. CoRR abs/1408.6771 (2014) - [i141]Zhanpeng Cheng, David Eppstein:
Linear-time Algorithms for Proportional Apportionment. CoRR abs/1409.2603 (2014) - [i140]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. CoRR abs/1410.2231 (2014) - [i139]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. CoRR abs/1411.6371 (2014) - [i138]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR abs/1411.7055 (2014) - [i137]Michael J. Bannister, William E. Devanny, David Eppstein:
ERGMs are Hard. CoRR abs/1412.1787 (2014) - [i136]David Eppstein:
$k$-best enumeration. CoRR abs/1412.5075 (2014) - 2013
- [i135]David Eppstein:
Grid Minors in Damaged Grids. CoRR abs/1303.1136 (2013) - [i134]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (2013) - [i133]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. CoRR abs/1305.0110 (2013) - [i132]David Eppstein, Michael T. Goodrich, Joseph A. Simons:
Set-Difference Range Queries. CoRR abs/1306.3482 (2013) - [i131]David Eppstein:
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity. CoRR abs/1308.0066 (2013) - [i130]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. CoRR abs/1308.0403 (2013) - [i129]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed parameter tractability of crossing minimization of almost-trees. CoRR abs/1308.5741 (2013) - [i128]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. CoRR abs/1308.6824 (2013) - [i127]Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. CoRR abs/1310.3770 (2013) - 2012
- [i126]David Eppstein:
Solving Single-digit Sudoku Subproblems. CoRR abs/1202.5074 (2012) - [i125]Glencora Borradaile, David Eppstein:
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CoRR abs/1206.2254 (2012) - [i124]David Eppstein:
Planar Lombardi Drawings for Subcubic Graphs. CoRR abs/1206.6142 (2012) - [i123]David Eppstein:
The Graphs of Planar Soap Bubbles. CoRR abs/1207.3761 (2012) - [i122]David Eppstein:
Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing. CoRR abs/1207.5082 (2012) - [i121]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. CoRR abs/1209.0748 (2012) - [i120]Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth:
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. CoRR abs/1209.5791 (2012) - 2011
- [i119]David Eppstein, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. CoRR abs/1103.0318 (2011) - [i118]David Eppstein, Maarten Löffler:
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. CoRR abs/1103.2575 (2011) - [i117]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011) - [i116]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011) - [i115]Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams under Geometric Distance Functions. CoRR abs/1105.4130 (2011) - [i114]David Eppstein, Michael T. Goodrich, Pierre Baldi:
Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. CoRR abs/1107.3593 (2011) - [i113]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). CoRR abs/1108.4675 (2011) - [i112]Michael J. Bannister, David Eppstein:
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. CoRR abs/1108.4705 (2011) - [i111]David Eppstein, Joseph A. Simons:
Confluent Hasse diagrams. CoRR abs/1108.5361 (2011) - [i110]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler:
Planar and Poly-Arc Lombardi Drawings. CoRR abs/1109.0345 (2011) - [i109]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). CoRR abs/1110.4499 (2011) - [i108]Michael J. Bannister, David Eppstein:
Randomized Speedup of the Bellman-Ford Algorithm. CoRR abs/1111.5414 (2011) - 2010
- [i107]David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems 2010 - [i106]Matthew T. Dickerson, David Eppstein, Michael T. Goodrich:
Cloning Voronoi Diagrams via Retroactive Data Structures. CoRR abs/1006.1921 (2010) - [i105]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. CoRR abs/1006.5440 (2010) - [i104]David Eppstein:
Regular Labelings and Geometric Structures. CoRR abs/1007.0221 (2010) - [i103]Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. CoRR abs/1007.1484 (2010) - [i102]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010) - [i101]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. CoRR abs/1009.0088 (2010) - [i100]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010) - [i99]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. CoRR abs/1009.0581 (2010) - [i98]David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics. CoRR abs/1009.0783 (2010) - [i97]David Eppstein, Michael T. Goodrich, Roberto Tamassia:
Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. CoRR abs/1009.1904 (2010) - 2009
- [i96]David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-Universal Rectangular Layouts. CoRR abs/0901.3924 (2009) - [i95]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci dimension of a graph. CoRR abs/0903.2507 (2009) - [i94]David Eppstein, Emma S. Spiro:
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. CoRR abs/0904.3741 (2009) - [i93]Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker:
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. CoRR abs/0904.3756 (2009) - [i92]David Eppstein, Elena Mumford:
Orientation-Constrained Rectangular Layouts. CoRR abs/0904.4312 (2009) - [i91]David Eppstein, Kevin A. Wortman:
Optimal Embedding Into Star Metrics. CoRR abs/0905.0283 (2009) - [i90]David Eppstein, Kevin A. Wortman:
Optimal Angular Resolution for Face-Symmetric Drawings. CoRR abs/0907.5474 (2009) - [i89]David Eppstein:
Graph-Theoretic Solutions to Computational Geometry Problems. CoRR abs/0908.3916 (2009) - [i88]David Eppstein:
Optimally fast incremental Manhattan plane embedding and planar tight span construction. CoRR abs/0909.1866 (2009) - [i87]David Eppstein:
Paired approximation problems and incompatible inapproximabilities. CoRR abs/0909.1870 (2009) - [i86]David Eppstein, Michael T. Goodrich, Lowell Trott:
Going Off-road: Transversal Complexity in Road Networks. CoRR abs/0909.2891 (2009) - [i85]David Eppstein, Elena Mumford:
Steinitz Theorems for Orthogonal Polyhedra. CoRR abs/0912.0537 (2009) - 2008
- [i84]David Eppstein:
Learning Sequences. CoRR abs/0803.4030 (2008) - [i83]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. CoRR abs/0805.0022 (2008) - [i82]David Eppstein, Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane. CoRR abs/0806.0341 (2008) - [i81]David Eppstein, Elena Mumford:
Self-overlapping Curves Revisited. CoRR abs/0806.1724 (2008) - [i80]David Eppstein:
Finding Large Clique Minors is Hard. CoRR abs/0807.0007 (2008) - [i79]David Eppstein:
Isometric Diamond Subgraphs. CoRR abs/0807.2218 (2008) - [i78]David Eppstein, Michael T. Goodrich:
Studying (Non-Planar) Road Networks Through an Algorithmic Lens. CoRR abs/0808.3694 (2008) - [i77]Matthew Dickerson, David Eppstein, Kevin A. Wortman:
Dilation, smoothed distance, and minimization diagrams of convex functions. CoRR abs/0812.0607 (2008) - [i76]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. CoRR abs/0812.0893 (2008) - 2007
- [i75]David Eppstein, Jean-Claude Falmagne, Hasan Uzun:
On Verifying and Engineering the Well-gradedness of a Union-closed Family. CoRR abs/0704.2919 (2007) - [i74]David Eppstein, Michael T. Goodrich:
Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. CoRR abs/0704.3313 (2007) - [i73]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann:
Edges and Switches, Tunnels and Bridges. CoRR abs/0705.0413 (2007) - [i72]David Eppstein:
Recognizing Partial Cubes in Quadratic Time. CoRR abs/0705.1025 (2007) - [i71]David Eppstein:
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. CoRR abs/0709.4087 (2007) - 2006
- [i70]John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. CoRR abs/cs/0602029 (2006) - [i69]David Eppstein, Michael T. Goodrich, Nodari Sitchinava:
Guard Placement For Wireless Localization. CoRR abs/cs/0603057 (2006) - [i68]David Eppstein:
Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition. CoRR abs/cs/0604034 (2006) - [i67]David Eppstein:
Upright-Quad Drawing of st-Planar Learning Spaces. CoRR abs/cs/0607094 (2006) - [i66]Josiah Carlson, David Eppstein:
Trees with Convex Faces and Optimal Angles. CoRR abs/cs/0607113 (2006) - [i65]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006) - [i64]David Eppstein:
Happy endings for flip graphs. CoRR abs/cs/0610092 (2006) - 2005
- [i63]Josiah Carlson, David Eppstein:
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. CoRR abs/cs/0503023 (2005) - [i62]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. CoRR abs/cs/0505048 (2005) - [i61]David Eppstein, Michael T. Goodrich, Jonathan Z. Sun:
The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. CoRR abs/cs/0507049 (2005) - [i60]Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005) - [i59]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. CoRR abs/cs/0507051 (2005) - [i58]David Eppstein:
Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku. CoRR abs/cs/0507053 (2005) - [i57]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Delta-confluent Drawings. CoRR abs/cs/0510024 (2005) - [i56]David Eppstein:
Cubic Partial Cubes from Simplicial Arrangements. CoRR abs/math/0510263 (2005) - 2004
- [i55]David Eppstein, Kevin A. Wortman:
Minimum Dilation Stars. CoRR abs/cs/0412025 (2004) - [i54]David Eppstein:
Quasiconvex Programming. CoRR abs/cs/0412046 (2004) - [i53]M. Gopi, David Eppstein:
Single-Strip Triangulation of Manifolds with Arbitrary Topology. CoRR cs.CG/0405036 (2004) - [i52]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. CoRR cs.DC/0404029 (2004) - [i51]David Eppstein:
The lattice dimension of a graph. CoRR cs.DS/0402028 (2004) - [i50]David Eppstein:
Algorithms for Drawing Media. CoRR cs.DS/0406020 (2004) - [i49]David Eppstein:
All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs. CoRR cs.DS/0407036 (2004) - 2003
- [i48]David Eppstein, John M. Sullivan, Alper Üngör:
Tiling space and slabs with acute tetrahedra. CoRR cs.CG/0302027 (2003) - [i47]David Eppstein:
Testing Bipartiteness of Geometric Intersection Graphs. CoRR cs.CG/0307023 (2003) - [i46]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003) - [i45]Christian A. Duncan, David Eppstein, Stephen G. Kobourov:
The Geometric Thickness of Low Degree Graphs. CoRR cs.CG/0312056 (2003) - [i44]David Eppstein:
The traveling salesman problem for cubic graphs. CoRR cs.DS/0302030 (2003) - [i43]David Eppstein:
Quasiconvex Analysis of Backtracking Algorithms. CoRR cs.DS/0304018 (2003) - 2002
- [i42]Marshall W. Bern, David Eppstein:
Moebius-Invariant Natural Neighbor Interpolation. CoRR cs.CG/0207081 (2002) - [i41]Marshall W. Bern, David Eppstein:
Optimized Color Gamuts for Tiled Displays. CoRR cs.CG/0212007 (2002) - [i40]Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. CoRR cs.CG/0212046 (2002) - [i39]David Eppstein, Joseph Wang:
A steady state model for graph power laws. CoRR cs.DM/0204001 (2002) - [i38]David Eppstein, Jean-Claude Falmagne:
Algorithms for Media. CoRR cs.DS/0206033 (2002) - [i37]David Eppstein:
Dynamic Generators of Topologically Embedded Graphs. CoRR cs.DS/0207082 (2002) - [i36]David Eppstein:
Separating Thickness from Geometric Thickness. CoRR math.CO/0204252 (2002) - 2001
- [i35]Marshall W. Bern, David Eppstein:
Optimal Moebius Transformations for Information Visualization and Meshing. CoRR cs.CG/0101006 (2001) - [i34]Marshall W. Bern, David Eppstein:
Optimization Over Zonotopes and Training Support Vector Machines. CoRR cs.CG/0105017 (2001) - [i33]David Eppstein:
Hinged Kite Mirror Dissection. CoRR cs.CG/0106032 (2001) - [i32]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra. CoRR cs.CG/0107023 (2001) - [i31]Marshall W. Bern, David Eppstein, Jeff Erickson:
Flipping Cubical Meshes. CoRR cs.CG/0108020 (2001) - [i30]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds. CoRR cs.CG/0110054 (2001) - [i29]David Eppstein, George S. Lueker:
The Minimum Expectation Selection Problem. CoRR cs.DS/0110011 (2001) - [i28]David Eppstein:
Separating Geometric Thickness from Book Thickness. CoRR math.CO/0109195 (2001) - 2000
- [i27]David Eppstein:
Searching for Spaceships. CoRR cs.AI/0004003 (2000) - [i26]Erik D. Demaine, Martin L. Demaine, David Eppstein:
Phutball Endgames are Hard. CoRR cs.CC/0008025 (2000) - [i25]Marshall W. Bern, David Eppstein:
Computing the Depth of a Flat. CoRR cs.CG/0009024 (2000) - [i24]David Eppstein, S. Muthukrishnan:
Internet Packet Filter Management and Rectangle Geometry. CoRR cs.CG/0010018 (2000) - [i23]Richard Beigel, David Eppstein:
3-Coloring in Time O(1.3289^n). CoRR cs.DS/0006046 (2000) - [i22]David Eppstein, Joseph Wang:
Fast Approximation of Centrality. CoRR cs.DS/0009005 (2000) - [i21]David Eppstein:
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction. CoRR cs.DS/0009006 (2000) - [i20]David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. CoRR cs.DS/0011009 (2000) - [i19]Cristopher Moore, David Eppstein:
One-Dimensional Peg Solitaire. CoRR math.CO/0006067 (2000) - [i18]Cristopher Moore, David Eppstein:
One-Dimensional Peg Solitaire, and Duotaire. CoRR math.CO/0008172 (2000) - 1999
- [i17]Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman:
Hinged Dissection of Polyominoes and Polyforms. CoRR cs.CG/9907018 (1999) - [i16]David Eppstein, Marshall W. Bern, Brad L. Hutchings:
Algorithms for Coloring Quadtrees. CoRR cs.CG/9907030 (1999) - [i15]David Eppstein:
Beta-Skeletons have Unbounded Dilation. CoRR cs.CG/9907031 (1999) - [i14]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink:
Ununfoldable Polyhedra with Convex Faces. CoRR cs.CG/9908003 (1999) - [i13]Marshall W. Bern, David Eppstein:
Quadrilateral Meshing by Circle Packing. CoRR cs.CG/9908016 (1999) - [i12]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:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - [i11]Marshall W. Bern, David Eppstein:
Multivariate Regression Depth. CoRR cs.CG/9912013 (1999) - [i10]Xianping Ge, David Eppstein, Padhraic Smyth:
The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding. CoRR cs.DM/9907002 (1999) - [i9]David Eppstein:
Setting Parameters by Example. CoRR cs.DS/9907001 (1999) - [i8]David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems. CoRR cs.DS/9911003 (1999) - [i7]David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. CoRR cs.DS/9912014 (1999) - [i6]Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999) - 1998
- [i5]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. CoRR cs.CG/9809037 (1998) - [i4]David Eppstein:
Incremental and Decremental Maintenance of Planar Width. CoRR cs.CG/9809038 (1998) - [i3]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. CoRR cs.CG/9809081 (1998) - [i2]David Eppstein:
Linear Complexity Hexahedral Mesh Generation. CoRR cs.CG/9809109 (1998) - 1995
- [i1]Richard Beigel, David Eppstein:
3-Coloring in time O(1.3446n): A no-MIS Algorithm. Electron. Colloquium Comput. Complex. TR95 (1995)
Coauthor Index
Erin W. Chambers
aka: Erin Wolf Chambers
aka: Erin Wolf Chambers
Matthew Dickerson
aka: Matthew T. Dickerson
aka: Matthew T. Dickerson
[j187] [j177] [j159] [j142] [j132] [j124] [j123] [j122] [j118] [j112] [j111] [j107] [j98] [j97] [j95] [j93] [j89] [j87] [j79] [c249] [c248] [c244] [c238] [c210] [c209] [c208] [c204] [c202] [c197] [c196] [c193] [c192] [c187] [c185] [c183] [c182] [c180] [c176] [c160] [c159] [c155] [c152] [c144] [c139] [c138] [c135] [c132] [c129] [c127] [c124] [c121] [c120] [c119] [c118] [c116] [c108] [c107] [c105] [c100] [c99] [c96] [c95] [c93] [c89] [c86] [c83] [c81] [c80] [c78] [c76] [c72] [c67] [c66] [i248] [i247] [i246] [i241] [i240] [i234] [i226] [i201] [i195] [i192] [i189] [i188] [i185] [i184] [i182] [i181] [i174] [i173] [i163] [i161] [i147] [i146] [i145] [i133] [i132] [i121] [i117] [i114] [i113] [i110] [i109] [i106] [i101] [i100] [i99] [i98] [i97] [i93] [i86] [i83] [i82] [i78] [i76] [i74] [i69] [i65] [i62] [i61] [i60] [i59] [i57] [i46] [i40]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-04 01:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: