D. Eppstein

发表

Parallel Algorithmic Techniques for Combinatorial Computation

D. Eppstein, Z. Galil, 1988 .

MESH GENERATION AND OPTIMAL TRIANGULATION

D. Eppstein, M. Bern, 1992 .

Fat 4-polytopes and fatter 3-spheres

G. Ziegler, D. Eppstein, G. Kuperberg, 2002, math/0204007.

Approximation algorithms for geometric problems

D. Eppstein, M. Bern, 1996 .

Efficient algorithms for sequence analysis with concave and convex gap costs

D. Eppstein, 1989 .

Dynamic three-dimensional linear programming

David Eppstein, D. Eppstein, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Persistence, offline algorithms, and space compaction

D. Eppstein, 1991 .

On the Planar Split Thickness of Graphs

David Eppstein, Giuseppe Liotta, Debajyoti Mondal, 2015, Algorithmica.

Foreword to special issue on SODA 2002

D. Eppstein, 2007, TALG.

The Centroid of Points with Approximate Weights

Leonidas J. Guibas, David Eppstein, Subhash Suri, 1995, ESA.

Sparse dynamic programming II: convex and concave cost functions

David Eppstein, Raffaele Giancarlo, Zvi Galil, 1992, JACM.

Efficient Algorithms for Sequence Analysis

D. Eppstein, Z. Galil, R. Giancarlo, 1993 .

Fast hierarchical clustering and other applications of dynamic closest pairs

David Eppstein, D. Eppstein, 1999, SODA '98.

Approximating center points with iterated radon points

David Eppstein, Kenneth L. Clarkson, Gary L. Miller, 1993, SCG '93.

Frederickson, \data Structures for On-line Updating of Minimum Spanning Trees", Siam

R. Tarjan, D. Eppstein, R. Tamassia, 2007 .

One-Dimensional Peg Solitaire, and Duotaire

David Eppstein, Cristopher Moore, D. Eppstein, 2000, ArXiv.

Efficient algorithms with applications to molecular biology

David Eppstein, Raffaele Giancarlo, Zvi Galil, 1990 .

Foundational Algorithms for Distributed Robot Swarms

D. Eppstein, M. Goodrich, N. Sitchinava, 2007 .

Linear complexity hexahedral mesh generation

D. Eppstein, 1998, Comput. Geom..

Finding Common Ancestors and Disjoint Paths in DAGs

D. Eppstein, 1999 .

Speed-ups in constructive solid geometry

D. Eppstein, 1992 .

Representing all minimum spanning trees with applications to counting and generation

D. Eppstein, 1995 .

Two-Site Voronoi Diagrams under Geometric Distance Functions

D. Eppstein, G. Barequet, K. Vyatkina, 2011 .

Approximation algorithms for geometric problems

D. Eppstein, M. Bern, 1996 .

Provably Good Mesh GenerationMarshall Bern

D. Eppstein, J. Gilbert, 2008 .

One-to-one Point Set Matchings for Grid Map Layout ∗

D. Eppstein, M. V. Kreveld, B. Speckmann, 2012 .

Finding the k Shortest Paths

David Eppstein, D. Eppstein, 1999, SIAM J. Comput..

Zonohedra and Zonotopes

David Eppstein, D. Eppstein, 1995 .

Clustering for faster network simplex pivots

D. Eppstein, 2000 .

Media theory

David Eppstein, D. Eppstein, 2007 .

Upright-Quad Drawing of st-Planar Learning Spaces

D. Eppstein, 2008, J. Graph Algorithms Appl..

Erratum to: Antimatroids and Balanced Pairs

David Eppstein, Veit Wiechert, D. Eppstein, 2015, Order.

Edge Insertion for Optimal Triangulations 1 Edge Insertion for Optimal Triangulations

S. Mitchell, D. Eppstein, M. Bern, 1993 .

Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace

Phokion G. Kolaitis, Stephen R. Mahaney, J. Feigenbaum, 2007 .

NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

D. Eppstein, V. Vazirani, 2018, SIAM J. Comput..

Models and Algorithms for Graph Watermarking pdf

David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, 2016, ISC.

Geometric Thickness of Complete Graphs

David Eppstein, Daniel S. Hirschberg, Michael B. Dillencourt, 1998, Graph Drawing.

The Complexity of Bendless Three-Dimensional

D. Eppstein, 2013 .

Internet packet filter management and rectangle geometry

David Eppstein, S. Muthukrishnan, D. Eppstein, 2000, SODA '01.

Finding the k Smallest Spanning Trees

David Eppstein, D. Eppstein, 1990, BIT.

The Distribution of Cycle Lengths in Graphical Models for Turbo Decoding Technical Report

Padhraic Smyth, D. Eppstein, Xianping Ge, 1999 .

Ununfoldable Polyhedra with 6 Vertices or 6 Faces

D. Eppstein, E. Demaine, H. Akitaya, 2021, Computational Geometry.

Distance-sensitive point location made easy

Mjm Marcel Roeloffzen, D. Eppstein, B. Aronov, 2014 .

C O ] 14 M ay 2 00 2 Fat 4-polytopes and fatter 3-spheres

G. Ziegler, D. Eppstein, G. Kuperberg, 2008 .

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra pdf

David Eppstein, Erik D. Demaine, Martin L. Demaine, 2020, CCCG.

Minimal Ununfoldable Polyhedron

D. Eppstein, E. Demaine, H. Akitaya, 2019 .

Extended dynamic subgraph statistics using h-index parameterized data structures

D. Eppstein, M. Goodrich, Darren Strash, 2010, Theor. Comput. Sci..

Deterministic sampling and range counting in geometric data streams

D. Eppstein, M. Goodrich, Amitabh Chaudhary, 2003, TALG.

MESH GENERATION AND OPTIMAL TRIANGULATION

David Eppstein, Marshall Bern, D. Eppstein, 1992 .

Linear complexity hexahedral mesh generation

D. Eppstein, 1998, Comput. Geom..

Quadrilateral Meshing by Circle Packing

D. Eppstein, M. Bern, 1999, Int. J. Comput. Geom. Appl..

Listing All Maximal Cliques in Large Sparse Real-World Graphs

D. Eppstein, M. Löffler, Darren Strash, 2013 .

Locked and unlocked smooth embeddings of surfaces

D. Eppstein, 2022, CCCG.

Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

D. Eppstein, 2000, SODA '01.

Near-Linear-Time Deterministic Plane Steiner Spanners for Well-Spaced Point Sets

D. Eppstein, G. Borradaile, 2013 .

80 90 37 v 2 2 6 Ju l 1 99 9 Regression Depth and Center Points

D. Eppstein, S. Teng, M. Bern, 2003 .

Drawings of planar graphs with few slopes and segments

D. Eppstein, V. Dujmovic, M. Suderman, 2006, Comput. Geom..

The Complexity of Iterated Reversible Computation

D. Eppstein, 2021, ArXiv.

Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics

D. Eppstein, Hadi Khodabandeh, 2022, SPAA.

Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

David Eppstein, Robert E. Tarjan, Moti Yung, 1993 .

Improved mixing for the convex polygon triangulation flip walk

D. Eppstein, Daniel Frishberg, 2022, ArXiv.

Fat 4-polytopes and fatter 3-spheres

G. Ziegler, D. Eppstein, G. Kuperberg, 2002, math/0204007.

Geometric dominating sets - a minimum version of the No-Three-In-Line Problem

D. Eppstein, O. Aichholzer, Eva-Maria Hainzl, 2022, Comput. Geom..

Proceedings of the 17th international conference on Graph Drawing

David Eppstein, Emden R. Gansner, D. Eppstein, 2009 .

Diameter and Treewidth in Minor-Closed Graph Families

D. Eppstein, 1999, Algorithmica.

Small Maximal Independent Sets and Faster Exact Graph Coloring

D. Eppstein, 2000, J. Graph Algorithms Appl..

RIGID ORIGAMI VERTICES : CONDITIONS AND FORCING

Jason S. Ku, Thomas C. Hull, Jason H. Cantarella, 2016 .

Distributed Construction of Lightweight Spanners for Unit Ball Graphs

D. Eppstein, Hadi Khodabandeh, 2022, DISC.

Treetopes and Their Graphs

D. Eppstein, 2020, Discrete & Computational Geometry.

Spanning Trees in Multipartite Geometric Graphs

D. Eppstein, M. Smid, P. Bose, 2016, Algorithmica.

Ramified Rectilinear Polygons: Coordinatization by Dendrons

D. Eppstein, H. Bandelt, V. Chepoi, 2015, Discrete & Computational Geometry.

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

D. Eppstein, M. Löffler, 2013, Discrete & Computational Geometry.

Manhattan orbifolds

D. Eppstein, 2006, math/0612109.

Orthogonal dissection into few rectangles

D. Eppstein, 2022, CCCG.

Title Balanced circle packings for planar graphs Permalink

D. Eppstein, S. Kobourov, M. Goodrich, 2014 .

25 S ep 2 00 0 Computing the Depth of a Flat Marshall Bern

D. Eppstein, 2008 .

Choosing Colors for Geometric Graphs via Color Space Embeddings

David Eppstein, Michael T. Goodrich, Michael B. Dillencourt, 2006, GD.

Approximate Greedy Clustering and Distance Selection for Graph Metrics pdf

David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos, 2015, J. Comput. Geom..

Succinct Greedy Graph Drawing in the Hyperbolic Plane

David Eppstein, Michael T. Goodrich, D. Eppstein, 2008, GD.

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings pdf

David Eppstein, Michael T. Goodrich, William E. Devanny, 2014, J. Graph Algorithms Appl..

Diamond-kite adaptive quadrilateral meshing

David Eppstein, D. Eppstein, 2012, Engineering with Computers.

Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing pdf

David Eppstein, D. Eppstein, 2012, IMR.

Quadrilateral Meshing by Circle Packing

David Eppstein, Marshall W. Bern, D. Eppstein, 1999, Int. J. Comput. Geom. Appl..

Tracking Paths in Planar Graphs

David Eppstein, Michael T. Goodrich, Pedro A. Matias, 2019, ISAAC.

Structure of Graphs with Locally Restricted Crossings

David Eppstein, David R. Wood, Vida Dujmovic, 2015, SIAM J. Discret. Math..

Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs

David Eppstein, D. Eppstein, 2018, J. Graph Algorithms Appl..

Crossing Patterns in Nonplanar Road Networks

David Eppstein, Siddharth Gupta, D. Eppstein, 2017, SIGSPATIAL/GIS.

Listing All Maximal Cliques in Large Sparse Real-World Graphs

David Eppstein, Darren Strash, D. Eppstein, 2011, JEAL.

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

David Eppstein, Maarten Löffler, Darren Strash, 2010, Exact Complexity of NP-hard Problems.

Computing the discrepancy with applications to supersampling patterns

David Eppstein, David P. Dobkin, Don P. Mitchell, 1996, TOGS.

Sparsification-a technique for speeding up dynamic graph algorithms

David Eppstein, Zvi Galil, Giuseppe F. Italiano, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms

David Eppstein, D. Eppstein, 2006, TALG.

Edge insertion for optimal triangulations

David Eppstein, Tiow Seng Tan, Herbert Edelsbrunner, 1993, Discret. Comput. Geom..

The expected extremes in a Delaunay triangulation

David Eppstein, F. Frances Yao, Marshall W. Bern, 1991, Int. J. Comput. Geom. Appl..

Provably good mesh generation

D. Eppstein, J. Gilbert, M. Bern, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Quasiconvex Programming pdf

David Eppstein, D. Eppstein, 2004, ArXiv.

A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing

David Eppstein, D. Eppstein, 2014, Discrete & Computational Geometry.

The graphs of planar soap bubbles pdf

David Eppstein, D. Eppstein, 2012, SoCG '13.

Optimal point placement for mesh smoothing

David Eppstein, Marshall W. Bern, Nina Amenta, 1997, SODA '97.

Cuckoo Filter: Simplification and Analysis pdf

David Eppstein, D. Eppstein, 2016, SWAT.

Set-Difference Range Queries pdf

David Eppstein, Michael T. Goodrich, Joseph A. Simons, 2013, CCCG.

Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures

Jean Cardinal, David Eppstein, D. Eppstein, 2004, ALENEX/ANALC.

Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science

Phokion G. Kolaitis, Stephen R. Mahaney, G. Neiger, 1996 .

Improved Combinatorial Group Testing for Real-World Problem Sizes

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg, 2005, WADS.

A steady state model for graph power laws

David Eppstein, Joseph Wang, D. Eppstein, 2002, ArXiv.

A Steady State Model for Graph Power Law

David Eppstein, Joseph Wang, D. Eppstein, 2002, WebDyn@WWW.

Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction

David Eppstein, D. Eppstein, 2009, J. Comput. Geom..

Finding minimum areak-gons

David Eppstein, Gerhard J. Woeginger, Günter Rote, 1992, Discret. Comput. Geom..

Randomized Speedup of the Bellman-Ford Algorithm pdf

David Eppstein, Michael J. Bannister, D. Eppstein, 2011, ANALCO.

Minimum Range Balanced Cuts via Dynamic Subset Sums

David Eppstein, D. Eppstein, 1997, J. Algorithms.

Finding the k shortest paths

David Eppstein, D. Eppstein, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

David Eppstein, D. Eppstein, 1991, J. Algorithms.

Maintenance of a minimum spanning forest in a dynamic planar graph

David Eppstein, Robert E. Tarjan, Moti Yung, 1990, SODA '90.

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems

David Eppstein, D. Eppstein, M. Jünger, 1994, GD.

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg, 2005, SIAM J. Comput..

Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices

Marek Chrobak, David Eppstein, D. Eppstein, 1991, Theor. Comput. Sci..

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics

David Eppstein, Michael T. Goodrich, Darren Strash, 2010, ArXiv.

Journal of Graph Algorithms and Applications the H-index of a Graph and Its Application to Dynamic Subgraph Statistics

David Eppstein, Emma S. Spiro, D. Eppstein, 2022 .

Knowledge Spaces, Applications in Education

David Eppstein, Jean-Claude Falmagne, Dietrich Albert, 2013 .

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data

David Eppstein, Michael T. Goodrich, William E. Devanny, 2018, ALENEX.

Algorithms for Stable Matching and Clustering in a Grid

David Eppstein, Michael T. Goodrich, Nil Mamano, 2017, IWCIA.

Sparse dynamic programming I: linear cost functions

David Eppstein, Raffaele Giancarlo, Zvi Galil, 1992, JACM.

The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction

David Eppstein, Nina Amenta, Marshall Bern, 1998, Graph. Model. Image Process..

What's the difference?: efficient set reconciliation without prior context

George Varghese, David Eppstein, Michael T. Goodrich, 2011, SIGCOMM.

Antimatroids and Balanced Pairs

David Eppstein, D. Eppstein, 2013, Order.

Optimized color gamuts for tiled displays

David Eppstein, Marshall W. Bern, D. Eppstein, 2002, SCG '03.

Graph-Theoretic Solutions to Computational Geometry Problems pdf

David Eppstein, D. Eppstein, 2009, WG.

Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs pdf

David Eppstein, Daniel Frishberg, D. Eppstein, 2021, ArXiv.

Linear complexity hexahedral mesh generation

David Eppstein, D. Eppstein, 1996, SCG '96.

On 2-Site Voronoi Diagrams Under Geometric Distance Functions

David Eppstein, Gill Barequet, Matthew Dickerson, 2011, Journal of Computer Science and Technology.

Testing bipartiteness of geometric intersection graphs

David Eppstein, D. Eppstein, 2003, SODA '04.

Visibility with a moving point of view

Robert L. Grossman, David Eppstein, David P. Dobkin, 1994, SODA '90.

Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters

David Eppstein, Michael T. Goodrich, D. Eppstein, 2007, IEEE Transactions on Knowledge and Data Engineering.

Dynamic Graph Algorithms

David Eppstein, Zvi Galil, Giuseppe F. Italiano, 2010, Algorithms and Theory of Computation Handbook.

The Traveling Salesman Problem for Cubic Graphs

David Eppstein, D. Eppstein, 2003, J. Graph Algorithms Appl..

Category-based routing in social networks: Membership dimension and the small-world phenomenon

David Eppstein, Maarten Löffler, Michael T. Goodrich, 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).

Straight Skeletons of Three-Dimensional Polyhedra pdf

Gill Barequet, Amir Vaxman, D. Eppstein, 2008, ESA.

Sparse dynamic programming

David Eppstein, Raffaele Giancarlo, Zvi Galil, 1990, SODA '90.

Succinct Greedy Geometric Routing Using Hyperbolic Geometry

David Eppstein, Michael T. Goodrich, D. Eppstein, 2011, IEEE Transactions on Computers.

Reset Sequences for Monotonic Automata

David Eppstein, D. Eppstein, 1990, SIAM J. Comput..

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection

David Eppstein, Michael T. Goodrich, William E. Devanny, 2016, ATMOS.

Lombardi Drawings of Graphs pdf

David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, 2010, J. Graph Algorithms Appl..

Dynamic generators of topologically embedded graphs

David Eppstein, D. Eppstein, 2002, SODA '03.

Sparsification—a technique for speeding up dynamic graph algorithms

David Eppstein, Zvi Galil, Giuseppe F. Italiano, 1997, JACM.

Dynamic Euclidean minimum spanning trees and extrema of binary functions

David Eppstein, D. Eppstein, 1995, Discret. Comput. Geom..

Separator-Based Sparsification II: Edge and Vertex Connectivity

David Eppstein, Zvi Galil, Giuseppe F. Italiano, 1999, SIAM J. Comput..

Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees

David Eppstein, Zvi Galil, Giuseppe F. Italiano, 1996, J. Comput. Syst. Sci..

Approximating the minimum weight triangulation

David Eppstein, D. Eppstein, 1992, SODA '92.

The skip quadtree: a simple dynamic data structure for multidimensional data

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun, 2005, SCG.

Average case analysis of dynamic geometric optimization

David Eppstein, D. Eppstein, 1994, SODA '94.

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs

David Eppstein, Vijay V. Vazirani, D. Eppstein, 2019, SPAA.

Parallel Recognition of Series-Parallel Graphs

David Eppstein, D. Eppstein, 1992, Inf. Comput..

On the complexity of embedding in graph products

D. Eppstein, T. Biedl, T. Ueckerdt, 2023, ArXiv.

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

David Eppstein, Giordano Da Lozzo, Siddharth Gupta, 2019, Algorithmica.

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity pdf

David Eppstein, Michael T. Goodrich, Giordano Da Lozzo, 2018, WG.

Parameterized Complexity of 1-Planarity

David Eppstein, Sergio Cabello, Michael J. Bannister, 2013, WADS.

Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms

David Eppstein, Michael T. Goodrich, Gill Barequet, 2018, ICALP.

Parallel Algorithmic Techniques for Combinatorial Computation

David Eppstein, Zvi Galil, D. Eppstein, 1988, ICALP.

Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition

David Eppstein, D. Eppstein, 2006, SODA '07.

All maximal independent sets and dynamic dominance for sparse graphs

David Eppstein, D. Eppstein, 2004, TALG.

K-Best Solutions of MSO Problems on Tree-Decomposable Graphs pdf

David Eppstein, Denis Kurz, D. Eppstein, 2017, IPEC.

K-Best Enumeration pdf

David Eppstein, D. Eppstein, 2014, Bull. EATCS.

Densities of Minor-Closed Graph Families

David Eppstein, D. Eppstein, 2010, Electron. J. Comb..

Regression Depth and Center Points

David Eppstein, Shang-Hua Teng, Marshall W. Bern, 1998, Discret. Comput. Geom..

Approximating center points with iterative Radon points

David Eppstein, Kenneth L. Clarkson, Gary L. Miller, 1996, Int. J. Comput. Geom. Appl..

Fast approximation of centrality

David Eppstein, Joseph Wang, D. Eppstein, 2000, SODA '01.

A deterministic linear time algorithm for geometric separators and its applications

David Eppstein, Gary L. Miller, Shang-Hua Teng, 1993, SCG '93.

The geometric thickness of low degree graphs

David Eppstein, Stephen G. Kobourov, Christian A. Duncan, 2003, SCG '04.

Algorithms for media

David Eppstein, Jean-Claude Falmagne, D. Eppstein, 2002, Discret. Appl. Math..

Setting parameters by example

David Eppstein, D. Eppstein, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Arboricity and Bipartite Subgraph Listing Algorithms

David Eppstein, D. Eppstein, 1994, Inf. Process. Lett..

Ramified Rectilinear Polygons: Coordinatization by Dendrons

David Eppstein, Hans-Jürgen Bandelt, Victor Chepoi, 2010, Discret. Comput. Geom..

Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers

David Eppstein, Emden R. Gansner, D. Eppstein, 2010, GD.

Privacy-Enhanced Methods for Comparing Compressed DNA Sequences pdf

David Eppstein, Michael T. Goodrich, Pierre Baldi, 2011, ArXiv.

Emerging Challenges in Computational Topology

Leonidas J. Guibas, David Eppstein, David P. Dobkin, 1999, ArXiv.

Treetopes and Their Graphs pdf

David Eppstein, D. Eppstein, 2015, SODA.

Steinitz theorems for orthogonal polyhedra pdf

David Eppstein, Elena Mumford, D. Eppstein, 2009, J. Comput. Geom..

UOBPRM: A uniformly distributed obstacle-based PRM

Nancy M. Amato, David Eppstein, Hsin-Yi Yeh, 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

ERGMs are Hard pdf

David Eppstein, William E. Devanny, Michael J. Bannister, 2014, ArXiv.

Tiling space and slabs with acute tetrahedra

David Eppstein, Alper Üngör, John M. Sullivan, 2003, Comput. Geom..

Dihedral bounds for mesh generation in high dimensions

David Eppstein, Marshall W. Bern, L. Paul Chew, 1995, SODA '95.

Hinged dissections of polyominoes and polyforms

David Eppstein, Erik D. Demaine, Martin L. Demaine, 1999, CCCG.

Track Layouts, Layered Path Decompositions, and Leveled Planarity

William E. Devanny, Michael J. Bannister, D. Eppstein, 2015, Algorithmica.

Force-Directed Graph Drawing Using Social Gravity and Scaling pdf

David Eppstein, Michael T. Goodrich, Michael J. Bannister, 2012, GD.

Tangent Spheres and Triangle Centers

D. Eppstein, 1999, Am. Math. Mon..

Area-Universal and Constrained Rectangular Layouts

Bettina Speckmann, David Eppstein, Kevin Verbeek, 2012, SIAM J. Comput..

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket pdf

David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, 2014, SEA.

Quasiconvex analysis of backtracking algorithms

David Eppstein, D. Eppstein, 2003, SODA '04.

Optimization over Zonotopes and Training Support Vector Machines

David Eppstein, Marshall W. Bern, D. Eppstein, 2001, WADS.

Cloning Voronoi Diagrams via Retroactive Data Structures pdf

David Eppstein, Michael T. Goodrich, Matthew Dickerson, 2010, ESA.

Dynamic half-space reporting, geometric optimization, and minimum spanning trees

David Eppstein, Jirí Matousek, Pankaj K. Agarwal, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Inapproximability of Orthogonal Compaction

David Eppstein, Michael J. Bannister, Joseph A. Simons, 2011, J. Graph Algorithms Appl..

Iterated nearest neighbors and finding minimal polytopes

David Eppstein, Jeff Erickson, D. Eppstein, 1993, SODA '93.

Flipping Cubical Meshes

David Eppstein, Marshall W. Bern, Jeff Erickson, 2001, Engineering with Computers.

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

David Eppstein, Maarten Löffler, D. Eppstein, 2011, SoCG '11.

Horizon Theorems for Lines and Polygons

David Eppstein, F. Frances Yao, Marshall W. Bern, 1990, Discrete and Computational Geometry.

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area

David Eppstein, Maarten Löffler, Erin W. Chambers, 2010, J. Graph Algorithms Appl..

Tangent Spheres and Triangle Centers

David Eppstein, D. Eppstein, 1999, The American mathematical monthly.

On the Biplanarity of Blowups

D. Eppstein, 2023, 2301.09246.

Polynomial-size nonobtuse triangulation of polygons

David Eppstein, Marshall W. Bern, D. Eppstein, 1991, SCG '91.

A Parameterized Algorithm for Flat Folding

D. Eppstein, 2023, CCCG.

Improved grid map layout by point set matching

Bettina Speckmann, David Eppstein, Frank Staals, 2013, 2013 IEEE Pacific Visualization Symposium (PacificVis).

On Polyhedral Realization with Isosceles Triangles

David Eppstein, D. Eppstein, 2020, Graphs and Combinatorics.

Ununfoldable polyhedra with convex faces

David Eppstein, Erik D. Demaine, Marshall W. Bern, 1999, Comput. Geom..

Assigning chain-like tasks on a chain-like network of computers

David Eppstein, Gerhard J. Woeginger, D. Eppstein, 2001, ACM-SIAM Symposium on Discrete Algorithms.

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees pdf

David Eppstein, Michael J. Bannister, Joseph A. Simons, 2013, GD.

Erratum: Polynomial-size nonobtuse triangulation of polygons

David Eppstein, Marshall Bern, D. Eppstein, 1992, International journal of computational geometry and applications.

Spanning Trees and Spanners

David Eppstein, D. Eppstein, 2000, Handbook of Computational Geometry.

Combinatorics and Geometry of Finite and Infinite Squaregraphs

David Eppstein, Hans-Jürgen Bandelt, Victor Chepoi, 2009, SIAM J. Discret. Math..

Studying (non-planar) road networks through an algorithmic lens

David Eppstein, Michael T. Goodrich, D. Eppstein, 2008, GIS '08.

Deterministic sampling and range counting in geometric data streams

D. Eppstein, M. Goodrich, Amitabh Chaudhary, 2003, TALG.

Skip-webs: efficient distributed data structures for multi-dimensional data sets pdf

David Eppstein, Michael T. Goodrich, Lars Arge, 2005, PODC '05.

Going off-road: transversal complexity in road networks

David Eppstein, Michael T. Goodrich, Lowell Trott, 2009, GIS.

Guard placement for efficient point-in-polygon proofs

David Eppstein, Michael T. Goodrich, Nodari Sitchinava, 2007, SCG '07.

Finding thek smallest spanning trees

David Eppstein, D. Eppstein, 1992 .

Product structure extension of the Alon--Seymour--Thomas theorem

D. Eppstein, Pat Morin, Piotr Micek, 2022, 2212.08739.

Genus, Treewidth, and Local Crossing Number pdf

David Eppstein, David R. Wood, Vida Dujmovic, 2015, GD.

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth pdf

David Eppstein, Michael J. Bannister, D. Eppstein, 2014, GD.

Grid Minors in Damaged Grids

David Eppstein, D. Eppstein, 2013, Electron. J. Comb..

Minor-closed graph classes with bounded layered pathwidth

David Eppstein, Pat Morin, David R. Wood, 2018, SIAM J. Discret. Math..

The Effect of Planarization on Width

David Eppstein, D. Eppstein, 2017, GD.

Separating Thickness from Geometric Thickness

David Eppstein, D. Eppstein, 2002, GD.

Separating Geometric Thickness from Book Thickness

David Eppstein, D. Eppstein, 2001, ArXiv.

Journal of Graph Algorithms and Applications Geometric Thickness of Complete Graphs

David Eppstein, Daniel S. Hirschberg, Michael B. Dillencourt, 2022 .

Strict confluent drawing

Bettina Speckmann, David Eppstein, Maarten Löffler, 2013, J. Comput. Geom..

Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

David Eppstein, Michael T. Goodrich, Matthew Dickerson, 2022 .

Geometric Graphs with Unbounded Flip-Width

D. Eppstein, Rose McCarty, 2023, ArXiv.

Cubic Planar Graphs that cannot be Drawn on few Lines pdf

David Eppstein, D. Eppstein, 2019, SoCG.

Journal of Graph Algorithms and Applications Drawing Arrangement Graphs in Small Grids, or How to Play Planarity pdf

David Eppstein, D. Eppstein, S. Wismath, 2022 .

The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

David Eppstein, D. Eppstein, 2009, GD.

The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing

David Eppstein, D. Eppstein, 2007, J. Graph Algorithms Appl..

Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

D. Eppstein, 2000, SODA '01.

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

Alexander Wolff, David Eppstein, Michael Kaufmann, 2013, J. Graph Algorithms Appl..

On the Edge Crossings of the Greedy Spanner

David Eppstein, Hadi Khodabandeh, D. Eppstein, 2020, SoCG.

Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions

David Eppstein, Jeff Erickson, D. Eppstein, 1998, SCG '98.

Faster construction of planar two-centers

David Eppstein, D. Eppstein, 1997, SODA '97.

Isometric Diamond Subgraphs

David Eppstein, D. Eppstein, 2008, GD.

Homotopy height, grid-major height and graph-drawing height

David Eppstein, Therese Biedl, Tim Ophelders, 2019, GD.

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

David Eppstein, Padhraic Smyth, Christopher DuBois, 2012, SODA.

Maximizing the Sum of Radii of Disjoint Balls or Disks

David Eppstein, D. Eppstein, 2016, CCCG.

Quasipolynomiality of the Smallest Missing Induced Subgraph

D. Eppstein, V. V. Williams, Andrea Lincoln, 2023, J. Graph Algorithms Appl..

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths pdf

David Eppstein, Erik D. Demaine, Ryuhei Uehara, 2014, GD.

The distribution of loop lengths in graphical models for turbo decoding

David Eppstein, Padhraic Smyth, Xianping Ge, 1999, IEEE Trans. Inf. Theory.

Simultaneous strong separations of probabilistic and unambiguous complexity classes

David Eppstein, Lane A. Hemaspaandra, Bülent Yener, 1992, Mathematical systems theory.

Small Superpatterns for Dominance Drawing pdf

David Eppstein, William E. Devanny, Michael J. Bannister, 2013, ANALCO.

Confluent Hasse Diagrams

David Eppstein, Joseph A. Simons, D. Eppstein, 2011, J. Graph Algorithms Appl..

Deterministic sampling and range counting in geometric data streams

David Eppstein, Michael T. Goodrich, Amitabha Bagchi, 2004, SCG '04.

Finding Large Clique Minors is Hard

David Eppstein, D. Eppstein, 2008, J. Graph Algorithms Appl..

Metric Dimension Parameterized by Max Leaf Number pdf

David Eppstein, D. Eppstein, 2015, J. Graph Algorithms Appl..

Forbidden Configurations in Discrete Geometry

David Eppstein, D. Eppstein, 2018, CCCG.

Speeding up dynamic programming

David Eppstein, Raffaele Giancarlo, Zvi Galil, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection

David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, 2017, PODS.

Parallel Construction of Quadtrees and Quality Triangulations

David Eppstein, Shang-Hua Teng, Marshall W. Bern, 1993, Int. J. Comput. Geom. Appl..

Asymptotic speed-ups in constructive solid geometry

David Eppstein, D. Eppstein, 1995, Algorithmica.

Adjacency-preserving spatial treemaps pdf

David Eppstein, Maarten Löffler, Martin Nöllenburg, 2011, J. Comput. Geom..

3-Coloring in time O(1.3446n): A no-MIS Algorithm

David Eppstein, Richard Beigel, D. Eppstein, 1995, Electron. Colloquium Comput. Complex..

Low-stretch spanning trees of graphs with bounded width pdf

David Eppstein, Glencora Borradaile, Amir Nayyeri, 2020, SWAT.

Worst-case bounds for subadditive geometric graphs

David Eppstein, Marshall W. Bern, D. Eppstein, 1993, SCG '93.

Parameterized Leaf Power Recognition via Embedding into Graph Products pdf

David Eppstein, Elham Havvaei, D. Eppstein, 2018, Algorithmica.

Simple Recognition of Halin Graphs and Their Generalizations

David Eppstein, D. Eppstein, 2015, J. Graph Algorithms Appl..

D3-Reducible Graphs pdf

David Eppstein, D. Eppstein, 2015, ArXiv.

Contact Representations of Sparse Planar Graphs pdf

David Eppstein, Michael Kaufmann, Stephen G. Kobourov, 2015, ArXiv.

Reconfiguring Undirected Paths

David Eppstein, Adam Hesterberg, Ryuhei Uehara, 2019, WADS.

Antimatroids and Balanced Pairs

D. Eppstein, 2013, Order.

Contact Graphs of Circular Arcs

David Eppstein, Michael Kaufmann, Stephen G. Kobourov, 2015, WADS.

Finding Relevant Points for Nearest-Neighbor Classification pdf

David Eppstein, D. Eppstein, 2021, SOSA.

The Effect of Faults on Network Expansion

Christian Scheideler, David Eppstein, Amitabha Bagchi, 2004, SPAA '04.

Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters

David Eppstein, Michael T. Goodrich, D. Eppstein, 2007, WADS.

On the treewidth of Hanoi graphs

David Eppstein, Daniel Frishberg, William Maxwell, 2020, FUN.

Problems for the Barbados Graph Theory Workshop

D. Eppstein, A. Scott, J. Fox, 2018 .

Problems for the Barbados Graph Theory Workshop 2017

D. Eppstein, A. Scott, J. Fox, 2017 .

Subgraph isomorphism in planar graphs and related problems

D. Eppstein, 1995, SODA '95.

Connectivity, graph minors, and subgraph multiplicity

David Eppstein, D. Eppstein, 1993, J. Graph Theory.

Rooted Cycle Bases

David Eppstein, J. Michael McCarthy, Brian E. Parrish, 2015, WADS.

Deterministic sampling and range counting in geometric data streams

D. Eppstein, M. Goodrich, Amitabh Chaudhary, 2004, SCG '04.

Deterministic sampling and range counting in geometric data streams

David Eppstein, Michael T. Goodrich, Amitabha Bagchi, 2003, TALG.

New algorithms for minimum area k-gons

David Eppstein, D. Eppstein, 1992, SODA '92.

Covering many points with a small-area box pdf

David Eppstein, Mark de Berg, Otfried Cheong, 2016, J. Comput. Geom..

Self-overlapping curves revisited

David Eppstein, Elena Mumford, D. Eppstein, 2008, SODA.

Distributed Construction of Lightweight Spanners for Unit Ball Graphs

D. Eppstein, Hadi Khodabandeh, 2021, DISC.

On the Biplanarity of Blowups

D. Eppstein, 2023, GD.

On the Planar Split Thickness of Graphs

D. Eppstein, S. Kobourov, A. Lubiw, 2015, Algorithmica.

Guard Placement For Wireless Localization pdf

David Eppstein, Michael T. Goodrich, Nodari Sitchinava, 2006, ArXiv.

Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation

David Eppstein, Matthew Dickerson, Kevin A. Wortman, 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

Dilation, smoothed distance, and minimization diagrams of convex functions pdf

David Eppstein, Matthew Dickerson, Kevin A. Wortman, 2008, ArXiv.

Sequence Comparison with Mixed Convex and Concave Costs

David Eppstein, D. Eppstein, 1990, J. Algorithms.

Faster Circle Packing with Application to Non-Obtuse Triangulation

David Eppstein, D. Eppstein, 1997, Int. J. Comput. Geom. Appl..

Searching for Spaceships

David Eppstein, D. Eppstein, 2000, ArXiv.

A Stronger Lower Bound on Parametric Minimum Spanning Trees

David Eppstein, D. Eppstein, 2021, Algorithmica.

Faster Evaluation of Subtraction Games

David Eppstein, D. Eppstein, 2018, FUN.

NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

David Eppstein, Vijay V. Vazirani, D. Eppstein, 2018, SIAM J. Comput..

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

D. Eppstein, 2023, SoCG.

Minimum Forcing Sets for Miura Folding Patterns

David Eppstein, Brad Ballinger, Mirela Damian, 2014, SODA.

The Complexity of Iterated Reversible Computation

D. Eppstein, 2021, TheoretiCS.

A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing

D. Eppstein, 2014, Discret. Comput. Geom..

Planar Lombardi Drawings for Subcubic Graphs pdf

David Eppstein, D. Eppstein, 2012, GD.

Curvature Aware Fundamental Cycles

David Eppstein, Meenakshisundaram Gopi, Pablo Diaz-Gutierrez, 2009, Comput. Graph. Forum.

Linear-Time Algorithms for Proportional Apportionment

David Eppstein, Zhanpeng Cheng, D. Eppstein, 2014, ISAAC.

3-Coloring in Time O(1.3289^n)

David Eppstein, Richard Beigel, D. Eppstein, 2000, J. Algorithms.

Satisfiability Coding Lemma

Stephen R. Mahaney, C. Dwork, G. Neiger, 2000 .

Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching

David Eppstein, Michael T. Goodrich, Manuel R. Torres, 2018, CCCG.

Orthogonal dissection into few rectangles

D. Eppstein, 2022, CCCG.

From Discrepancy to Majority

David Eppstein, Daniel S. Hirschberg, D. Eppstein, 2015, Algorithmica.

On triangulating three-dimensional polygons

David Eppstein, Gill Barequet, Matthew Dickerson, 1996, SCG '96.

Regular labelings and geometric structures pdf

David Eppstein, D. Eppstein, 2010, CCCG.

Locked and unlocked smooth embeddings of surfaces

D. Eppstein, 2022, CCCG.

Hinged Kite Mirror Dissection

D. Eppstein, 2001, ArXiv.

Linear-time algorithms for geometric graphs with sublinearly many crossings pdf

David Eppstein, Michael T. Goodrich, Darren Strash, 2009, SODA.

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

David Eppstein, Michael T. Goodrich, Darren Strash, 2008, SIAM J. Comput..

Algorithms for Proximity Problems in Higher Dimensions

David Eppstein, Matthew Dickerson, D. Eppstein, 1995, Comput. Geom..

On Nearest-Neighbor Graphs

David Eppstein, F. Frances Yao, Mike Paterson, 1992, ICALP.

Journal of Graph Algorithms and Applications Subgraph Isomorphism in Planar Graphs and Related Problems

D. Eppstein, 2022 .

Orientation-Constrained Rectangular Layouts

David Eppstein, Elena Mumford, D. Eppstein, 2009, WADS.

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes

David Eppstein, Elham Havvaei, Siddharth Gupta, 2021, FCT.

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time

David Eppstein, Bruce Reed, B. Reed, 2018, SODA.

Journal of Graph Algorithms and Applications Fast Approximation of Centrality

D. Eppstein, Joseph Wang, 2022 .

Privacy-preserving data-oblivious geometric algorithms for geographic data

David Eppstein, Michael T. Goodrich, Roberto Tamassia, 2010, GIS '10.

Journal of Graph Algorithms and Applications Optimal 3d Angular Resolution for Low-degree Graphs 174 Eppstein Et Al. Optimal 3d Angular Resolution for Low-degree Graphs

D. Eppstein, M. Nöllenburg, E. Mumford, 2022 .

A Heuristic Approach to Program Inversion

David Eppstein, D. Eppstein, 1985, IJCAI.

Track Layout Is Hard

David Eppstein, David R. Wood, Vida Dujmovic, 2016, GD.

Happy endings for flip graphs pdf

David Eppstein, D. Eppstein, 2006, SCG '07.

Optimal Möbius Transformations for Information Visualization and Meshing

David Eppstein, Marshall W. Bern, D. Eppstein, 2001, WADS.

Media theory - interdisciplinary applied mathematics

David Eppstein, Sergei Ovchinnikov, Jean-Claude Falmagne, 2010 .

Journal of Graph Algorithms and Applications Recognizing Partial Cubes in Quadratic Time 270 Eppstein Recognizing Partial Cubes in Quadratic Time

David Eppstein, D. Eppstein, 2022 .

Reset Sequences for Finite Automata with Application to Design of Parts Orienters

David Eppstein, D. Eppstein, 1988, ICALP.

Finding All Maximal Subsequences with Hereditary Properties

David Eppstein, Sergio Cabello, Drago Bokal, 2015, SoCG.

Maximum Plane Trees in Multipartite Geometric Graphs

D. Eppstein, M. Smid, P. Bose, 2018, Algorithmica.

3 The Maximum Bichromatic Plane Spanning Tree Problem r

D. Eppstein, M. Smid, P. Bose, 2018 .

Application Challenges to Computational Geometry: CG Impact Task Force Report

A. R. Forrest, B. Chazelle, D. Eppstein, 1999 .

The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems pdf

David Eppstein, Josiah Carlson, D. Eppstein, 2005, SWAT.

Determinant: Combinatorics, Algorithms, and Complexity

Phokion G. Kolaitis, Moshe Y. Vardi, Stephen R. Mahaney, 1997, Chic. J. Theor. Comput. Sci..