David Eppstein

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discrete & Computational Geometry 49(2): 157-182 (2013)

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)

David Eppstein: The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. J. Graph Algorithms Appl. 17(1): 35-55 (2013)

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)

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. 17(3): 201-220 (2013)

Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth: Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA 2013: 856-864

David Eppstein: Grid Minors in Damaged Grids. CoRR abs/1303.1136 (2013)

Michael J. Bannister, Sergio Cabello, David Eppstein: Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (2013)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012)

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012)

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)

Michael J. Bannister, David Eppstein, Joseph A. Simons: Inapproximability of Orthogonal Compaction. J. Graph Algorithms Appl. 16(3): 651-673 (2012)

David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek: Area-Universal and Constrained Rectangular Layouts. SIAM J. Comput. 41(3): 537-564 (2012)

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. 447: 44-52 (2012)

Michael J. Bannister, David Eppstein: Randomized Speedup of the Bellman-Ford Algorithm. ANALCO 2012: 41-47

Glencora Borradaile, David Eppstein: Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG 2012: 297-302

David Eppstein: Solving Single-Digit Sudoku Subproblems. FUN 2012: 142-153

David Eppstein: Planar Lombardi Drawings for Subcubic Graphs. Graph Drawing 2012: 126-137

Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber: On the Density of Maximal 1-Planar Graphs. Graph Drawing 2012: 327-338

Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott: Force-Directed Graph Drawing Using Social Gravity and Scaling. Graph Drawing 2012: 414-425

Hsin-Yi Yeh, Shawna L. Thomas, David Eppstein, Nancy M. Amato: UOBPRM: A uniformly distributed obstacle-based PRM. IROS 2012: 2655-2662

David Eppstein: Solving Single-digit Sudoku Subproblems. CoRR abs/1202.5074 (2012)

Glencora Borradaile, David Eppstein: Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CoRR abs/1206.2254 (2012)

David Eppstein: Planar Lombardi Drawings for Subcubic Graphs. CoRR abs/1206.6142 (2012)

David Eppstein: The Graphs of Planar Soap Bubbles. CoRR abs/1207.3761 (2012)

David Eppstein: Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing. CoRR abs/1207.5082 (2012)

Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott: Force-Directed Graph Drawing Using Social Gravity and Scaling. CoRR abs/1209.0748 (2012)

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)

Sergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci Dimension of a Graph. Electr. J. Comb. 18(1) (2011)

David Eppstein, Emden R. Gansner: Guest Editor's Foreword. J. Graph Algorithms Appl. 15(1): 3-5 (2011)

David Eppstein: Recognizing Partial Cubes in Quadratic Time. J. Graph Algorithms Appl. 15(2): 269-293 (2011)

David Eppstein, Kevin A. Wortman: Optimal Angular Resolution for Face-Symmetric Drawings. J. Graph Algorithms Appl. 15(4): 551-564 (2011)

David Eppstein: Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. JoCG 2(1): 144-182 (2011)

David Eppstein, Michael T. Goodrich: Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers 60(11): 1571-1580 (2011)

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)

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. CASoN 2011: 102-107

David Eppstein, Maarten Löffler: Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. Symposium on Computational Geometry 2011: 361-369

David Eppstein, Joseph A. Simons: Confluent Hasse Diagrams. Graph Drawing 2011: 2-13

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-arc Lombardi Drawings. Graph Drawing 2011: 308-319

Michael J. Bannister, David Eppstein: Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. Graph Drawing 2011: 367-378

Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina: On 2-Site Voronoi Diagrams under Geometric Distance Functions. ISVD 2011: 31-38

David Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese: What's the difference?: efficient set reconciliation without prior context. SIGCOMM 2011: 218-229

Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170

David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. WADS 2011: 362-373

David Eppstein, Darren Strash: Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA 2011: 364-375

David Eppstein, Darren Strash: Listing All Maximal Cliques in Large Sparse Real-World Graphs. CoRR abs/1103.0318 (2011)

David Eppstein, Maarten Löffler: Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension. CoRR abs/1103.2575 (2011)

David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011)

Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira: Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011)

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)

David Eppstein, Michael T. Goodrich, Pierre Baldi: Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. CoRR abs/1107.3593 (2011)

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)

Michael J. Bannister, David Eppstein: Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. CoRR abs/1108.4705 (2011)

David Eppstein, Joseph A. Simons: Confluent Hasse diagrams. CoRR abs/1108.5361 (2011)

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)

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)

Michael J. Bannister, David Eppstein: Randomized Speedup of the Bellman-Ford Algorithm. CoRR abs/1111.5414 (2011)

David Eppstein: Densities of Minor-Closed Graph Families. Electr. J. Comb. 17(1) (2010)

John Augustine, David Eppstein, Kevin A. Wortman: Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. Discrete Math., Alg. and Appl. 2(4): 553-566 (2010)

David Eppstein: Happy Endings for Flip Graphs. JoCG 1(1): 3-28 (2010)

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010)

Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein: Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discrete Math. 24(4): 1399-1440 (2010)

Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian: Questions answered. in theory.: http: //cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010)

David Eppstein: Regular labelings and geometric structures. CCCG 2010: 125-130

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141

John Augustine, David Eppstein, Kevin A. Wortman: Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. COCOON 2010: 90-99

David Eppstein, Elena Mumford: Steinitz theorems for orthogonal polyhedra. Symposium on Computational Geometry 2010: 429-438

Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Graph Drawing 2010: 129-140

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Graph Drawing 2010: 183-194

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. Graph Drawing 2010: 195-207

David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. Graph Drawing 2010: 208-219

David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22

David Eppstein: Regular Labelings and Geometric Structures. ISAAC (1) 2010: 1

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) 2010: 241-252

David Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414

Matthew Dickerson, David Eppstein, Kevin A. Wortman: Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22

David Eppstein: Paired Approximation Problems and Incompatible Inapproximabilities. SODA 2010: 1076-1086

David Eppstein, Emden R. Gansner (Eds.): 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

Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. CoRR abs/1006.1921 (2010)

David Eppstein, Maarten Löffler, Darren Strash: Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. CoRR abs/1006.5440 (2010)

David Eppstein: Regular Labelings and Geometric Structures. CoRR abs/1007.0221 (2010)

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. CoRR abs/1007.1484 (2010)

David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg: Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010)

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)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010)

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)

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)

David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. CoRR abs/1009.1904 (2010)

Pablo Diaz-Gutierrez, David Eppstein, Meenakshisundaram Gopi: Curvature Aware Fundamental Cycles. Comput. Graph. Forum 28(7): 2015-2024 (2009)

David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and switches, tunnels and bridges. Comput. Geom. 42(8): 790-802 (2009)

David Eppstein: Finding Large Clique Minors is Hard. J. Graph Algorithms Appl. 13(2): 197-204 (2009)

David Eppstein: Testing bipartiteness of geometric intersection graphs. ACM Transactions on Algorithms 5(2) (2009)

David Eppstein: Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. ACM Transactions on Algorithms 5(3) (2009)

David Eppstein: All maximal independent sets and dynamic dominance for sparse graphs. ACM Transactions on Algorithms 5(4) (2009)

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quad meshes. The Visual Computer 25(8): 771-783 (2009)

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). Symposium on Computational Geometry 2009: 92-93

David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek: Area-universal rectangular layouts. Symposium on Computational Geometry 2009: 267-276

David Eppstein, Michael T. Goodrich, Lowell Trott: Going off-road: transversal complexity in road networks. GIS 2009: 23-32

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159

David Eppstein, Elena Mumford: Self-overlapping curves revisited. SODA 2009: 160-169

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

David Eppstein, Elena Mumford: Orientation-Constrained Rectangular Layouts. WADS 2009: 266-277

David Eppstein, Emma S. Spiro: The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. WADS 2009: 278-289

David Eppstein, Kevin A. Wortman: Optimal Embedding into Star Metrics. WADS 2009: 290-301

David Eppstein: Graph-Theoretic Solutions to Computational Geometry Problems. WG 2009: 1-16

David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek: Area-Universal Rectangular Layouts. CoRR abs/0901.3924 (2009)

Sergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci dimension of a graph. CoRR abs/0903.2507 (2009)

David Eppstein, Emma S. Spiro: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. CoRR abs/0904.3741 (2009)

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)

David Eppstein, Elena Mumford: Orientation-Constrained Rectangular Layouts. CoRR abs/0904.4312 (2009)

David Eppstein, Kevin A. Wortman: Optimal Embedding Into Star Metrics. CoRR abs/0905.0283 (2009)

David Eppstein, Kevin A. Wortman: Optimal Angular Resolution for Face-Symmetric Drawings. CoRR abs/0907.5474 (2009)

David Eppstein: Graph-Theoretic Solutions to Computational Geometry Problems. CoRR abs/0908.3916 (2009)

David Eppstein: Optimally fast incremental Manhattan plane embedding and planar tight span construction. CoRR abs/0909.1866 (2009)

David Eppstein: Paired approximation problems and incompatible inapproximabilities. CoRR abs/0909.1870 (2009)

David Eppstein, Michael T. Goodrich, Lowell Trott: Going Off-road: Transversal Complexity in Road Networks. CoRR abs/0909.2891 (2009)

David Eppstein, Elena Mumford: Steinitz Theorems for Orthogonal Polyhedra. CoRR abs/0912.0537 (2009)

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

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008)

David Eppstein, Jean-Claude Falmagne: Algorithms for media. Discrete Applied Mathematics 156(8): 1308-1320 (2008)

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geometry Appl. 18(1/2): 131-160 (2008)

David Eppstein: Upright-Quad Drawing of st-Planar Learning Spaces. J. Graph Algorithms Appl. 12(1): 51-72 (2008)

Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160

David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. Graph Drawing 2008: 14-25

David Eppstein: The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. Graph Drawing 2008: 78-89

David Eppstein: Isometric Diamond Subgraphs. Graph Drawing 2008: 384-389

David Eppstein, Michael T. Goodrich: Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92

David Eppstein: Recognizing partial cubes in quadratic time. SODA 2008: 1258-1266

David Eppstein: Learning Sequences. CoRR abs/0803.4030 (2008)

Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. CoRR abs/0805.0022 (2008)

David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. CoRR abs/0806.0341 (2008)

David Eppstein, Elena Mumford: Self-overlapping Curves Revisited. CoRR abs/0806.1724 (2008)

David Eppstein: Finding Large Clique Minors is Hard. CoRR abs/0807.0007 (2008)

David Eppstein: Isometric Diamond Subgraphs. CoRR abs/0807.2218 (2008)

David Eppstein, Michael T. Goodrich: Studying (Non-Planar) Road Networks Through an Algorithmic Lens. CoRR abs/0808.3694 (2008)

Matthew Dickerson, David Eppstein, Kevin A. Wortman: Dilation, smoothed distance, and minimization diagrams of convex functions. CoRR abs/0812.0607 (2008)

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. CoRR abs/0812.0893 (2008)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007)

David Eppstein, Kevin A. Wortman: Minimum dilation stars. Comput. Geom. 37(1): 27-37 (2007)

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)

David Eppstein: The Traveling Salesman Problem for Cubic Graphs. J. Graph Algorithms Appl. 11(1): 61-81 (2007)

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36(5): 1360-1375 (2007)

David Eppstein: Foreword to special issue on SODA 2002. ACM Transactions on Algorithms 3(1) (2007)

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms 3(2) (2007)

Love Singhal, Elaheh Bozorgzadeh, David Eppstein: Interconnect Criticality-Driven Delay Relaxation. IEEE Trans. on CAD of Integrated Circuits and Systems 26(10): 1803-1817 (2007)

David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard placement for efficient point-in-polygon proofs. Symposium on Computational Geometry 2007: 27-36

David Eppstein: Happy endings for flip graphs. Symposium on Computational Geometry 2007: 92-101

David Eppstein: Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. SODA 2007: 29-38

David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges. WADS 2007: 77-88

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

David Eppstein, Jean-Claude Falmagne, Hasan Uzun: On Verifying and Engineering the Well-gradedness of a Union-closed Family. CoRR abs/0704.2919 (2007)

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)

David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges. CoRR abs/0705.0413 (2007)

David Eppstein: Recognizing Partial Cubes in Quadratic Time. CoRR abs/0705.1025 (2007)

David Eppstein: The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. CoRR abs/0709.4087 (2007)

David Eppstein: Cubic Partial Cubes from Simplicial Arrangements. Electr. J. Comb. 13(1) (2006)

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)

David Eppstein: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Transactions on Algorithms 2(4): 492-509 (2006)

Josiah Carlson, David Eppstein: Trees with Convex Faces and Optimal Angles. Graph Drawing 2006: 77-88

David Eppstein: Upright-Quad Drawing of st -Planar Learning Spaces. Graph Drawing 2006: 282-293

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing 2006: 294-305

Pablo Diaz-Gutierrez, David Eppstein, M. Gopi: Single Triangle Strip and Loop on Manifolds with Boundaries. SIBGRAPI 2006: 221-228

Josiah Carlson, David Eppstein: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. SWAT 2006: 400-410

John Augustine, David Eppstein, Kevin A. Wortman: Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. CoRR abs/cs/0602029 (2006)

David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard Placement For Wireless Localization. CoRR abs/cs/0603057 (2006)

David Eppstein: Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition. CoRR abs/cs/0604034 (2006)

David Eppstein: Upright-Quad Drawing of st-Planar Learning Spaces. CoRR abs/cs/0607094 (2006)

Josiah Carlson, David Eppstein: Trees with Convex Faces and Optimal Angles. CoRR abs/cs/0607113 (2006)

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006)

David Eppstein: Happy endings for flip graphs. CoRR abs/cs/0610092 (2006)

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)

David Eppstein: The lattice dimension of a graph. Eur. J. Comb. 26(5): 585-592 (2005)

Richard Beigel, David Eppstein: 3-coloring in time O(1.3289ⁿ). J. Algorithms 54(2): 168-204 (2005)

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9(1): 31-52 (2005)

Tony Givargis, David Eppstein: Memory reference caching for activity reduction on address buses. Microprocessors and Microsystems 29(4): 145-153 (2005)

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The skip quadtree: a simple dynamic data structure for multidimensional data. Symposium on Computational Geometry 2005: 296-305

David Eppstein, Kevin A. Wortman: Minimum dilation stars. Symposium on Computational Geometry 2005: 321-326

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-Confluent Drawings. Graph Drawing 2005: 165-176

Lars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76

David Eppstein: All maximal independent sets and dynamic dominance for sparse graphs. SODA 2005: 451-459

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98

Josiah Carlson, David Eppstein: The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. CoRR abs/cs/0503023 (2005)

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. CoRR abs/cs/0505048 (2005)

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. CoRR abs/cs/0507049 (2005)

Lars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. CoRR abs/cs/0507051 (2005)

David Eppstein: Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku. CoRR abs/cs/0507053 (2005)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-confluent Drawings. CoRR abs/cs/0510024 (2005)

David Eppstein: Cubic Partial Cubes from Simplicial Arrangements. CoRR abs/math/0510263 (2005)

M. Gopi, David Eppstein: Single-Strip Triangulation of Manifolds with Arbitrary Topology. Comput. Graph. Forum 23(3): 371-380 (2004)

David Eppstein, John M. Sullivan, Alper Üngör: Tiling space and slabs with acute tetrahedra. Comput. Geom. 27(3): 237-255 (2004)

David Eppstein, Joseph Wang: Fast Approximation of Centrality. J. Graph Algorithms Appl. 8: 39-45 (2004)

Jean Cardinal, David Eppstein: Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. Symposium on Computational Geometry 2004: 144-151

Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The geometric thickness of low degree graphs. Symposium on Computational Geometry 2004: 340-346

David Eppstein, M. Gopi: Single-strip triangulation of manifolds with arbitrary topology. Symposium on Computational Geometry 2004: 455-456

David Eppstein: Algorithms for Drawing Media. Graph Drawing 2004: 173-183

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Graph Drawing 2004: 184-194

David Eppstein: Quasiconvex analysis of backtracking algorithms. SODA 2004: 788-797

David Eppstein: Testing bipartiteness of geometric intersection graphs. SODA 2004: 860-868

Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The effect of faults on network expansion. SPAA 2004: 286-293

David Eppstein, Kevin A. Wortman: Minimum Dilation Stars. CoRR abs/cs/0412025 (2004)

David Eppstein: Quasiconvex Programming. CoRR abs/cs/0412046 (2004)

M. Gopi, David Eppstein: Single-Strip Triangulation of Manifolds with Arbitrary Topology. CoRR cs.CG/0405036 (2004)

Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion. CoRR cs.DC/0404029 (2004)

David Eppstein: The lattice dimension of a graph. CoRR cs.DS/0402028 (2004)

David Eppstein: Algorithms for Drawing Media. CoRR cs.DS/0406020 (2004)

David Eppstein: All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs. CoRR cs.DS/0407036 (2004)

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)

David Eppstein: Guest Editor's Foreword. Discrete & Computational Geometry 30(1): 1-2 (2003)

David Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl. 7(2): 131-140 (2003)

David Eppstein: Setting Parameters by Example. SIAM J. Comput. 32(3): 643-653 (2003)

Marshall W. Bern, David Eppstein: Optimized color gamuts for tiled displays. Symposium on Computational Geometry 2003: 274-281

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing 2003: 1-12

Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539

Marshall W. Bern, David Eppstein: Möbius-invariant natural neighbor interpolation. SODA 2003: 128-129

David Eppstein: Dynamic generators of topologically embedded graphs. SODA 2003: 599-608

David Eppstein: The Traveling Salesman Problem for Cubic Graphs. WADS 2003: 307-318

David Eppstein, John M. Sullivan, Alper Üngör: Tiling space and slabs with acute tetrahedra. CoRR cs.CG/0302027 (2003)

David Eppstein: Testing Bipartiteness of Geometric Intersection Graphs. CoRR cs.CG/0307023 (2003)

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003)

Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The Geometric Thickness of Low Degree Graphs. CoRR cs.CG/0312056 (2003)

David Eppstein: The traveling salesman problem for cubic graphs. CoRR cs.DS/0302030 (2003)

David Eppstein: Quasiconvex Analysis of Backtracking Algorithms. CoRR cs.DS/0304018 (2003)

David Eppstein, Marshall W. Bern, Brad L. Hutchings: Algorithms for Coloring Quadtrees. Algorithmica 32(1): 87-94 (2002)

David Eppstein: Beta-skeletons have unbounded dilation. Comput. Geom. 23(1): 43-52 (2002)

Marshall W. Bern, David Eppstein: Multivariate Regression Depth. Discrete & Computational Geometry 28(1): 1-17 (2002)

Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. Eng. Comput. (Lond.) 18(3): 173-187 (2002)

David Eppstein, George S. Lueker: The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002)

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-unfoldings of simplicial manifolds. Symposium on Computational Geometry 2002: 237-243

David Eppstein: Separating Thickness from Geometric Thickness. Graph Drawing 2002: 150-161

David Eppstein (Ed.): 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

Marshall W. Bern, David Eppstein: Moebius-Invariant Natural Neighbor Interpolation. CoRR cs.CG/0207081 (2002)

Marshall W. Bern, David Eppstein: Optimized Color Gamuts for Tiled Displays. CoRR cs.CG/0212007 (2002)

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)

David Eppstein, Joseph Wang: A steady state model for graph power laws. CoRR cs.DM/0204001 (2002)

David Eppstein, Jean-Claude Falmagne: Algorithms for Media. CoRR cs.DS/0206033 (2002)

David Eppstein: Dynamic Generators of Topologically Embedded Graphs. CoRR cs.DS/0207082 (2002)

David Eppstein: Separating Thickness from Geometric Thickness. CoRR math.CO/0204252 (2002)

David Eppstein: Tangent Spheres and Triangle Centers. The American Mathematical Monthly 108(1): 63-66 (2001)

Xianping Ge, David Eppstein, Padhraic Smyth: The distribution of loop lengths in graphical models for turbo decoding. IEEE Transactions on Information Theory 47(6): 2549-2553 (2001)

David Eppstein, Joseph Wang: Fast approximation of centrality. SODA 2001: 228-229

David Eppstein: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. SODA 2001: 329-337

David Eppstein, S. Muthukrishnan: Internet packet filter management and rectangle geometry. SODA 2001: 827-835

Marshall W. Bern, David Eppstein: Optimal Möbius Transformations for Information Visualization and Meshing. WADS 2001: 14-25

Marshall W. Bern, David Eppstein: Optimization over Zonotopes and Training Support Vector Machines. WADS 2001: 111-121

David Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring. WADS 2001: 462-470

Marshall W. Bern, David Eppstein: Optimal Moebius Transformations for Information Visualization and Meshing. CoRR cs.CG/0101006 (2001)

Marshall W. Bern, David Eppstein: Optimization Over Zonotopes and Training Support Vector Machines. CoRR cs.CG/0105017 (2001)

David Eppstein: Hinged Kite Mirror Dissection. CoRR cs.CG/0106032 (2001)

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Polyhedra. CoRR cs.CG/0107023 (2001)

Marshall W. Bern, David Eppstein, Jeff Erickson: Flipping Cubical Meshes. CoRR cs.CG/0108020 (2001)

Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke: Vertex-Unfoldings of Simplicial Manifolds. CoRR cs.CG/0110054 (2001)

David Eppstein, George S. Lueker: The Minimum Expectation Selection Problem. CoRR cs.DS/0110011 (2001)

David Eppstein: Separating Geometric Thickness from Book Thickness. CoRR math.CO/0109195 (2001)

David Eppstein: Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica 27(3): 275-291 (2000)

Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points. Discrete & Computational Geometry 23(3): 305-323 (2000)

Marshall W. Bern, David Eppstein: Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geometry Appl. 10(4): 347-360 (2000)

David Eppstein: Incremental and Decremental Maintenance of Planar Width. J. Algorithms 37(2): 570-577 (2000)

David Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. ACM Journal of Experimental Algorithmics 5: 1 (2000)

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. 4(3): 5-17 (2000)

David Eppstein: Clustering for faster network simplex pivots. Networks 35(3): 173-180 (2000)

Marshall W. Bern, David Eppstein: Multivariate regression depth. Symposium on Computational Geometry 2000: 315-321

David Eppstein: Searching for Spaceships. CoRR cs.AI/0004003 (2000)

Erik D. Demaine, Martin L. Demaine, David Eppstein: Phutball Endgames are Hard. CoRR cs.CC/0008025 (2000)

Marshall W. Bern, David Eppstein: Computing the Depth of a Flat. CoRR cs.CG/0009024 (2000)

David Eppstein, S. Muthukrishnan: Internet Packet Filter Management and Rectangle Geometry. CoRR cs.CG/0010018 (2000)

Richard Beigel, David Eppstein: 3-Coloring in Time O(1.3289^n). CoRR cs.DS/0006046 (2000)

David Eppstein, Joseph Wang: Fast Approximation of Centrality. CoRR cs.DS/0009005 (2000)

David Eppstein: Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction. CoRR cs.DS/0009006 (2000)

David Eppstein: Small Maximal Independent Sets and Faster Exact Graph Coloring. CoRR cs.DS/0011009 (2000)

Cristopher Moore, David Eppstein: One-Dimensional Peg Solitaire. CoRR math.CO/0006067 (2000)

Cristopher Moore, David Eppstein: One-Dimensional Peg Solitaire, and Duotaire. CoRR math.CO/0008172 (2000)

David Eppstein: Linear complexity hexahedral mesh generation. Comput. Geom. 12(1-2): 3-16 (1999)

David Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete & Computational Geometry 22(4): 569-592 (1999)

Marshall W. Bern, David Eppstein, Shang-Hua Teng: Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geometry Appl. 9(6): 517-532 (1999)

Nina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. J. Algorithms 30(2): 302-322 (1999)

David Eppstein, Giuseppe F. Italiano: PREFACE: Festschrift for Zvi Galil. J. Complexity 15(1): 1-3 (1999)

David Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems. J. Graph Algorithms Appl. 3(3) (1999)

Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo: Ununfoldable polyhedra. CCCG 1999

Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman: Hinged dissections of polyominoes and polyforms. CCCG 1999

David Eppstein: Setting Parameters by Example. FOCS 1999: 309-318

David Eppstein, David Hart: Shortest Paths in an Arrangement with k Line Orientations. SODA 1999: 310-316

David Eppstein: Incremental and Decremental Maintenance of Planar Width. SODA 1999: 899-900

Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged Dissection of Polyominoes and Polyforms. CoRR cs.CG/9907018 (1999)

David Eppstein, Marshall W. Bern, Brad L. Hutchings: Algorithms for Coloring Quadtrees. CoRR cs.CG/9907030 (1999)

David Eppstein: Beta-Skeletons have Unbounded Dilation. CoRR cs.CG/9907031 (1999)

Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink: Ununfoldable Polyhedra with Convex Faces. CoRR cs.CG/9908003 (1999)

Marshall W. Bern, David Eppstein: Quadrilateral Meshing by Circle Packing. CoRR cs.CG/9908016 (1999)

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)

Marshall W. Bern, David Eppstein: Multivariate Regression Depth. CoRR cs.CG/9912013 (1999)

Xianping Ge, David Eppstein, Padhraic Smyth: The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding. CoRR cs.DM/9907002 (1999)

David Eppstein: Setting Parameters by Example. CoRR cs.DS/9907001 (1999)

David Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems. CoRR cs.DS/9911003 (1999)

David Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. CoRR cs.DS/9912014 (1999)

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. CoRR math.CO/9910185 (1999)

Gill Barequet, Matthew Dickerson, David Eppstein: On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998)

Nina Amenta, Marshall W. Bern, David Eppstein: The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Graphical Models and Image Processing 60(2): 125-135 (1998)

David Eppstein: Geometric Lower Bounds for Parametric Matroid Optimization. Discrete & Computational Geometry 20(4): 463-476 (1998)

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)

David Eppstein: Finding the k Shortest Paths. SIAM J. Comput. 28(2): 652-673 (1998)

David Eppstein, Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Symposium on Computational Geometry 1998: 58-67

Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger: Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605

Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg: Geometric Thickness of Complete Graphs. Graph Drawing 1998: 101-110

David Eppstein: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. SODA 1998: 619-628

Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng: Regression Depth and Center Points. CoRR cs.CG/9809037 (1998)

David Eppstein: Incremental and Decremental Maintenance of Planar Width. CoRR cs.CG/9809038 (1998)

Nina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. CoRR cs.CG/9809081 (1998)

David Eppstein: Linear Complexity Hexahedral Mesh Generation. CoRR cs.CG/9809109 (1998)

David Eppstein: Faster Geometric K-point MST Approximation. Comput. Geom. 8: 231-240 (1997)

David Eppstein, Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997)

David Eppstein: Faster Circle Packing with Application to Non-Obtuse Triangulation. Int. J. Comput. Geometry Appl. 7(5): 485-492 (1997)

David Eppstein: Dynamic Connectivity in Digital Images. Inf. Process. Lett. 62(3): 121-126 (1997)

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)

David Eppstein: Minimum Range Balanced Cuts via Dynamic Subset Sums. J. Algorithms 23(2): 375-385 (1997)

David Eppstein, Daniel S. Hirschberg: Choosing Subsets with Maximum Weighted Average. J. Algorithms 24(1): 177-193 (1997)

David Eppstein: Faster Construction of Planar Two-Centers. SODA 1997: 131-138

Nina Amenta, Marshall W. Bern, David Eppstein: Optimal Point Placement for Mesh Smoothing. SODA 1997: 528-537

David Eppstein, David Hart: An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. WADS 1997: 234-247

David Eppstein: Average Case Analysis of Dynamic Geometric Optimization. Comput. Geom. 6: 45-68 (1996)

Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating center points with iterative Radon points. Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996)

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. J. Comput. Syst. Sci. 52(1): 3-27 (1996)

David Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996)

David P. Dobkin, David Eppstein, Don P. Mitchell: Computing the Discrepancy with Applications to Supersampling Patterns. ACM Trans. Graph. 15(4): 354-376 (1996)

Gill Barequet, Matthew Dickerson, David Eppstein: On Triangulating Three-Dimensional Polygons. Symposium on Computational Geometry 1996: 38-47

David Eppstein: Linear Complexity Hexahedral Mesh Generation. Symposium on Computational Geometry 1996: 58-67

David Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160

David Eppstein: Asymptotic Speed-Ups in Constructive Solid Geometry. Algorithmica 13(5): 462-471 (1995)

Matthew Dickerson, David Eppstein: Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5: 277-291 (1995)

David Eppstein: Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. Discrete & Computational Geometry 13: 111-122 (1995)

David Eppstein, Gary L. Miller, Shang-Hua Teng: A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Inform. 22(4): 309-329 (1995)

Marshall W. Bern, David P. Dobkin, David Eppstein: Triangulating polygons without large angles. Int. J. Comput. Geometry Appl. 5: 171-192 (1995)

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

Richard Beigel, David Eppstein: 3-Coloring in Time O(1.3446ⁿ): A No-MIS Algorithm. FOCS 1995: 444-452

Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert: Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196

David Eppstein: Subgraph Isomorphism in Planar Graphs and Related Problems. SODA 1995: 632-640

David Eppstein: Geometric lower bounds for parametric matroid optimization. STOC 1995: 662-671

Richard Beigel, David Eppstein: 3-Coloring in time O(1.3446ⁿ): A no-MIS Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 2(33) (1995)

Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman: Visibility with a Moving Point of View. Algorithmica 11(4): 360-378 (1994)

David Eppstein: Approximating the Minimum Weight Steiner Triangulation. Discrete & Computational Geometry 11: 163-191 (1994)

David Eppstein, Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. Discrete & Computational Geometry 11: 321-350 (1994)

Boris Aronov, Marshall W. Bern, David Eppstein: On the Number of Minimal 1-Steiner Trees. Discrete & Computational Geometry 12: 29-34 (1994)

David Eppstein: Tree-weighted neighbors and geometric k smallest spanning trees. Int. J. Comput. Geometry Appl. 4(2): 229-238 (1994)

David Eppstein: Arboricity and Bipartite Subgraph Listing Algorithms. Inf. Process. Lett. 51(4): 207-211 (1994)

David Eppstein: Offline Algorithms for Dynamic Minimum Spanning Tree Problems. J. Algorithms 17(2): 237-250 (1994)

Marshall W. Bern, David Eppstein, John R. Gilbert: Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994)

David Eppstein: Finding the k Shortest Paths. FOCS 1994: 154-165

David Eppstein: Average Case Analysis of Dynamic Geometric Optimization. SODA 1994: 77-86

David Eppstein: Clustering for Faster Network Simplex Pivots. SODA 1994: 160-166