David Eppstein
#6,837
Most Influential Person Now
British-American computer scientist
David Eppstein's AcademicInfluence.com Rankings
David Eppsteinmathematics Degrees
Mathematics
#591
World Rank
#1111
Historical Rank
#263
USA Rank
Graph Theory
#28
World Rank
#35
Historical Rank
#7
USA Rank
Geometry
#27
World Rank
#55
Historical Rank
#9
USA Rank
Measure Theory
#538
World Rank
#753
Historical Rank
#222
USA Rank
Download Badge
Computer Science Mathematics
David Eppstein's Degrees
- PhD Computer Science Columbia University
- Masters Computer Science Stanford University
- Bachelors Mathematics Stanford University
Similar Degrees You Can Earn
Why Is David Eppstein Influential?
(Suggest an Edit or Addition)According to Wikipedia, David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
David Eppstein's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Finding the k shortest paths (1994) (1802)
- MESH GENERATION AND OPTIMAL TRIANGULATION (1992) (678)
- Subgraph isomorphism in planar graphs and related problems (1995) (502)
- The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction (1998) (498)
- Sparsification-a technique for speeding up dynamic graph algorithms (1992) (423)
- Provably good mesh generation (1990) (416)
- Spanning Trees and Spanners (2000) (337)
- Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time (2010) (331)
- Diameter and Treewidth in Minor-Closed Graph Families (1999) (298)
- Listing All Maximal Cliques in Large Sparse Real-World Graphs (2011) (282)
- Reset Sequences for Monotonic Automata (1990) (246)
- Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions (1998) (216)
- Fast approximation of centrality (2000) (213)
- Dynamic Graph Algorithms (2010) (210)
- Optimal point placement for mesh smoothing (1997) (194)
- Maintenance of a minimum spanning forest in a dynamic planar graph (1990) (177)
- Internet packet filter management and rectangle geometry (2000) (174)
- Fast hierarchical clustering and other applications of dynamic closest pairs (1999) (169)
- Parallel Recognition of Series-Parallel Graphs (1992) (163)
- Sparse dynamic programming I: linear cost functions (1992) (153)
- What's the difference?: efficient set reconciliation without prior context (2011) (142)
- Approximation algorithms for geometric problems (1996) (142)
- Small Maximal Independent Sets and Faster Exact Graph Coloring (2000) (142)
- Arboricity and Bipartite Subgraph Listing Algorithms (1994) (141)
- 3-Coloring in Time O(1.3289^n) (2000) (141)
- Iterated nearest neighbors and finding minimal polytopes (1993) (140)
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way (2002) (140)
- Dynamic generators of topologically embedded graphs (2002) (121)
- Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices (1991) (120)
- Parallel Algorithmic Techniques for Combinatorial Computation (1988) (119)
- Faster construction of planar two-centers (1997) (119)
- Parallel Construction of Quadtrees and Quality Triangulations (1993) (117)
- The skip quadtree: a simple dynamic data structure for multidimensional data (2005) (113)
- The Traveling Salesman Problem for Cubic Graphs (2003) (111)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction (2000) (103)
- Studying (non-planar) road networks through an algorithmic lens (2008) (99)
- Computing the discrepancy with applications to supersampling patterns (1996) (95)
- Sparse dynamic programming II: convex and concave cost functions (1992) (86)
- Visibility with a moving point of view (1994) (86)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (1995) (83)
- Drawings of planar graphs with few slopes and segments (2006) (83)
- A steady state model for graph power laws (2002) (83)
- Knowledge Spaces, Applications in Education (2013) (81)
- Geometric Thickness of Complete Graphs (1998) (80)
- Sequence Comparison with Mixed Convex and Concave Costs (1990) (80)
- Approximating center points with iterative Radon points (1996) (79)
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics (2009) (78)
- Tiling space and slabs with acute tetrahedra (2003) (77)
- Quadrilateral Meshing by Circle Packing (1999) (77)
- Ununfoldable polyhedra with convex faces (1999) (76)
- Linear complexity hexahedral mesh generation (1996) (75)
- On the Density of Maximal 1-Planar Graphs (2012) (75)
- Foreword to special issue on SODA 2002 (2007) (75)
- Media theory (2007) (74)
- Area-Universal and Constrained Rectangular Layouts (2012) (73)
- Speeding up dynamic programming (1988) (73)
- Motorcycle Graphs: Canonical Quad Mesh Partitioning (2008) (72)
- Dihedral bounds for mesh generation in high dimensions (1995) (69)
- Dynamic three-dimensional linear programming (1991) (68)
- The expected extremes in a Delaunay triangulation (1991) (68)
- Edge insertion for optimal triangulations (1993) (67)
- Finding minimum areak-gons (1992) (66)
- Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes (2005) (65)
- The lattice dimension of a graph (2004) (65)
- 3-Coloring in time O(1.3446n): A no-MIS Algorithm (1995) (65)
- Lombardi Drawings of Graphs (2010) (64)
- Approximating center points with iterated radon points (1993) (62)
- Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters (2007) (62)
- Parametric and kinetic minimum spanning trees (1998) (61)
- The geometric thickness of low degree graphs (2003) (61)
- UOBPRM: A uniformly distributed obstacle-based PRM (2012) (60)
- Regression Depth and Center Points (1998) (60)
- Selected Open Problems in Graph Drawing (2003) (60)
- Single-strip triangulation of manifolds with arbitrary topology (2004) (59)
- Quasiconvex analysis of backtracking algorithms (2003) (59)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (2008) (58)
- Flipping Cubical Meshes (2001) (58)
- Sparse dynamic programming (1990) (56)
- Polynomial-size nonobtuse triangulation of polygons (1991) (56)
- Parameterized Complexity of 1-Planarity (2013) (55)
- A deterministic linear time algorithm for geometric separators and its applications (1993) (55)
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems (1991) (55)
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry (2011) (54)
- Emerging Challenges in Computational Topology (1999) (54)
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms (2006) (52)
- Structure of Graphs with Locally Restricted Crossings (2015) (52)
- Deterministic sampling and range counting in geometric data streams (2004) (52)
- Separator based sparsification for dynamic planar graph algorithms (1993) (52)
- All maximal independent sets and dynamic dominance for sparse graphs (2004) (50)
- Rigid origami vertices: conditions and forcing sets (2015) (50)
- Force-Directed Graph Drawing Using Social Gravity and Scaling (2012) (49)
- Finding the k Smallest Spanning Trees (1990) (48)
- Separating Thickness from Geometric Thickness (2002) (48)
- Confluent Layered Drawings (2004) (48)
- Randomized Speedup of the Bellman-Ford Algorithm (2011) (48)
- Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees (1996) (47)
- On triangulating three-dimensional polygons (1996) (47)
- Improved grid map layout by point set matching (2013) (47)
- Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition (2006) (45)
- Fat 4-polytopes and fatter 3-spheres (2002) (45)
- Growth and Decay in Life-Like Cellular Automata (2009) (44)
- Algorithms for Proximity Problems in Higher Dimensions (1995) (43)
- 3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm (1995) (42)
- Computing the discrepancy (1993) (41)
- Approximating the minimum weight steiner triangulation (1994) (41)
- Quasiconvex Programming (2004) (41)
- Skip-webs: efficient distributed data structures for multi-dimensional data sets (2005) (41)
- Hinged dissections of polyominoes and polyforms (1999) (40)
- Graph-Theoretic Solutions to Computational Geometry Problems (2009) (39)
- Triangulating polygons without large angles (1992) (38)
- Listing All Maximal Cliques in Large Sparse Real-World Graphs (2013) (38)
- Steinitz theorems for orthogonal polyhedra (2009) (38)
- Privacy-preserving data-oblivious geometric algorithms for geographic data (2010) (38)
- Zonohedra and Zonotopes (1995) (38)
- Geometric Lower Bounds for Parametric Matroid Optimization (1995) (38)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (2010) (37)
- Horizon Theorems for Lines and Polygons (1990) (37)
- Straight skeletons of three-dimensional polyhedra (2008) (37)
- Track Layouts, Layered Path Decompositions, and Leveled Planarity (2015) (37)
- Happy endings for flip graphs (2006) (36)
- Optimal Möbius Transformations for Information Visualization and Meshing (2001) (36)
- Using Sparsification for Parametric Minimum Spanning Tree Problems (1996) (36)
- Setting parameters by example (1999) (36)
- The Effect of Faults on Network Expansion (2004) (36)
- Dynamic half-space reporting, geometric optimization, and minimum spanning trees (1992) (35)
- The Farthest Point Delaunay Triangulation Minimizes Angles (1992) (34)
- Beta-skeletons have unbounded dilation (1999) (33)
- Delta-Confluent Drawings (2005) (33)
- Superpatterns and Universal Point Sets (2013) (33)
- Area-universal rectangular layouts (2009) (33)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (2014) (33)
- Minimum dilation stars (2004) (32)
- The Centroid of Points with Approximate Weights (1995) (32)
- A Heuristic Approach to Program Inversion (1985) (32)
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (2010) (31)
- Recognizing partial cubes in quadratic time (2007) (31)
- Cubic Partial Cubes from Simplicial Arrangements (2005) (30)
- Improved Bounds for Intersecting Triangles and Halving Planes (1993) (29)
- Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets (2008) (29)
- Approximating the minimum weight triangulation (1992) (28)
- Faster Circle Packing with Application to Non-Obtuse Triangulation (1997) (28)
- Searching for Spaceships (2000) (28)
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs (2014) (27)
- Optimized color gamuts for tiled displays (2002) (27)
- Crossing Patterns in Nonplanar Road Networks (2017) (27)
- Vertex-unfoldings of simplicial manifolds (2001) (27)
- K-Best Enumeration (2014) (26)
- Separator-Based Sparsification II: Edge and Vertex Connectivity (1999) (26)
- Guard placement for efficient point-in-polygon proofs (2007) (26)
- Combinatorics and Geometry of Finite and Infinite Squaregraphs (2009) (26)
- Planar and Poly-arc Lombardi Drawings (2011) (25)
- Cuckoo Filter: Simplification and Analysis (2016) (25)
- Testing bipartiteness of geometric intersection graphs (2003) (25)
- Planar Lombardi Drawings for Subcubic Graphs (2012) (24)
- Connectivity, graph minors, and subgraph multiplicity (1993) (23)
- New algorithms for minimum area k-gons (1992) (23)
- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket (2014) (23)
- Strict confluent drawing (2013) (22)
- Worst-case bounds for subadditive geometric graphs (1993) (22)
- Optimization over Zonotopes and Training Support Vector Machines (2001) (22)
- Self-overlapping curves revisited (2008) (22)
- 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection (2017) (22)
- Choosing Colors for Geometric Graphs via Color Space Embeddings (2006) (22)
- Dynamic Connectivity in Digital Images (1997) (21)
- Extended dynamic subgraph statistics using h-index parameterized data structures (2010) (21)
- Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. (1993) (20)
- Adjacency-preserving spatial treemaps (2011) (20)
- Deterministic sampling and range counting in geometric data streams (2003) (20)
- Representing all minimum spanning trees with applications to counting and generation (1995) (20)
- Multivariate Regression Depth (1999) (20)
- Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku (2005) (20)
- Improved Combinatorial Group Testing for Real-World Problem Sizes (2005) (20)
- Finding Large Clique Minors is Hard (2008) (19)
- On the Planar Split Thickness of Graphs (2015) (19)
- One-Dimensional Peg Solitaire, and Duotaire (2000) (19)
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters (2007) (18)
- Algorithms for Drawing Media (2004) (18)
- Isometric Diamond Subgraphs (2008) (18)
- Faster Geometric K-point MST Approximation (1997) (18)
- Forbidden Configurations in Discrete Geometry (2018) (18)
- Choosing Subsets with Maximum Weighted Average (1997) (16)
- Flows in One-Crossing-Minor-Free Graphs (2010) (16)
- The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (2014) (16)
- Average case analysis of dynamic geometric optimization (1994) (16)
- Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges (2012) (15)
- Trees with Convex Faces and Optimal Angles (2006) (15)
- Finding Common Ancestors and Disjoint Paths in DAGs (1999) (15)
- The Fibonacci Dimension of a Graph (2009) (15)
- Separating Geometric Thickness from Book Thickness (2001) (15)
- Clustering for faster network simplex pivots (1994) (15)
- Metric Dimension Parameterized by Max Leaf Number (2015) (14)
- Edges and Switches, Tunnels and Bridges (2007) (14)
- A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing (2014) (14)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (2013) (14)
- Media theory - interdisciplinary applied mathematics (2010) (14)
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing (2009) (14)
- Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction (2009) (14)
- Confluent Hasse Diagrams (2011) (14)
- Category-based routing in social networks: Membership dimension and the small-world phenomenon (2011) (13)
- Algorithms for media (2002) (13)
- On Verifying and Engineering the Well-gradedness of a Union-closed Family (2007) (13)
- Going off-road: transversal complexity in road networks (2009) (13)
- Minimum Forcing Sets for Miura Folding Patterns (2014) (13)
- Algorithms for Coloring Quadtrees (1999) (13)
- Ununfoldable polyhedra (1999) (13)
- Edge Insertion for Optional Triangulations (1992) (13)
- Upright-Quad Drawing of st-Planar Learning Spaces (2006) (13)
- The distribution of loop lengths in graphical models for turbo decoding (1999) (12)
- Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (2008) (12)
- Densities of Minor-Closed Graph Families (2010) (12)
- Models and Algorithms for Graph Watermarking (2016) (12)
- Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity (2018) (12)
- Minor-closed graph classes with bounded layered pathwidth (2018) (11)
- Finding All Maximal Subsequences with Hereditary Properties (2015) (11)
- An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments (1997) (11)
- Regular labelings and geometric structures (2010) (11)
- Balanced Circle Packings for Planar Graphs (2014) (11)
- Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity (2013) (11)
- Inapproximability of Orthogonal Compaction (2011) (11)
- Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures (2004) (11)
- Defining Equitable Geographic Districts in Road Networks via Stable Matching (2017) (11)
- Shortest paths in an arrangement with k line orientations (1999) (11)
- Tracking Paths in Planar Graphs (2019) (11)
- Privacy-Enhanced Methods for Comparing Compressed DNA Sequences (2011) (11)
- Automated Generation of Linkage Loop Equations for Planar One Degree-of-Freedom Linkages, Demonstrated up to 8-Bar (2015) (10)
- Minimum Range Balanced Cuts via Dynamic Subset Sums (1997) (10)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (2014) (10)
- Tree-weighted neighbors and geometric k smallest spanning trees (1994) (10)
- Paired approximation problems and incompatible inapproximabilities (2009) (10)
- Curvature Aware Fundamental Cycles (2009) (10)
- On the Parity of Graph Spanning Tree Numbers (2001) (10)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (2018) (10)
- Ramified Rectilinear Polygons: Coordinatization by Dendrons (2010) (10)
- Manhattan orbifolds (2006) (10)
- Sets of points with many halving lines (1992) (9)
- Stack-Number is Not Bounded by Queue-Number (2020) (9)
- Small Superpatterns for Dominance Drawing (2013) (9)
- Combinatorial Pair Testing: Distinguishing Workers from Slackers (2013) (9)
- Efficient algorithms for sequence analysis with concave and convex gap costs (1989) (9)
- Hinged Kite Mirror Dissection (2001) (9)
- Approximate Greedy Clustering and Distance Selection for Graph Metrics (2015) (9)
- Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection (2016) (9)
- NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs (2019) (9)
- Genus, Treewidth, and Local Crossing Number (2015) (9)
- Incremental and decremental maintenance of planar width (1998) (9)
- From Discrepancy to Majority (2015) (9)
- Spanning Trees in Multipartite Geometric Graphs (2016) (9)
- Learning Sequences (2008) (9)
- Linear-time algorithms for geometric graphs with sublinearly many crossings (2009) (8)
- Learning Sequences: An Efficient Data Structure for Learning Spaces (2013) (8)
- Simple Recognition of Halin Graphs and Their Generalizations (2015) (8)
- Efficient Algorithms for Sequence Analysis (1993) (8)
- The graphs of planar soap bubbles (2012) (8)
- Persistence, offline algorithms, and space compaction (1991) (8)
- Guard Placement For Wireless Localization (2006) (8)
- Phutball Endgames are Hard (2000) (8)
- Tangent Spheres and Triangle Centers (1999) (8)
- Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions) (2009) (8)
- Interconnect Criticality-Driven Delay Relaxation (2007) (8)
- Optimal 3D Angular Resolution for Low-Degree Graphs (2010) (7)
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs (2013) (7)
- Approximate topological matching of quad meshes (2009) (7)
- Tracking Moving Objects with Few Handovers (2011) (7)
- Finding thek smallest spanning trees (1992) (7)
- NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs (2018) (7)
- Reference Caching Using Unit Distance Redundant Codes for Activity Reduction on Address Buses (2002) (7)
- The Effect of Planarization on Width (2017) (7)
- Folding a paper strip to minimize thickness (2014) (7)
- A Steady State Model for Graph Power Law (2002) (6)
- Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs (2017) (6)
- Reconfiguring Undirected Paths (2019) (6)
- Planar Induced Subgraphs of Sparse Graphs (2014) (6)
- Cloning Voronoi Diagrams via Retroactive Data Structures (2010) (6)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (1992) (6)
- Linear-Time Algorithms for Proportional Apportionment (2014) (6)
- The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding (1999) (6)
- Universal Point Sets for Planar Graph Drawings with Circular Arcs (2013) (6)
- Algorithms for Stable Matching and Clustering in a Grid (2017) (6)
- On 2-Site Voronoi Diagrams Under Geometric Distance Functions (2011) (6)
- Grid Minors in Damaged Grids (2013) (6)
- ERGMs are Hard (2014) (6)
- Automated Generation of Linkage Loop Equations for Planar 1-DoF Linkages, Demonstrated up to 8-Bar (2014) (6)
- Contact Representations of Sparse Planar Graphs (2015) (6)
- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect (2018) (6)
- Maximum Plane Trees in Multipartite Geometric Graphs (2018) (6)
- Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension (2011) (6)
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems (2005) (6)
- Orientation-Constrained Rectangular Layouts (2009) (6)
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (2009) (5)
- Efficient sequential and parallel algorithms for computing recovery points in trees and paths (1991) (5)
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width (2019) (5)
- Möbius-invariant natural neighbor interpolation (2002) (5)
- Solving Single-Digit Sudoku Subproblems (2012) (5)
- Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings (2011) (5)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (2017) (5)
- Covering many points with a small-area box (2016) (5)
- Reset Sequences for Finite Automata with Application to Design of Parts Orienters (1988) (5)
- Diamond-kite adaptive quadrilateral meshing (2012) (5)
- Approximate topological matching of quadrilateral meshes (2008) (5)
- Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets (2012) (4)
- Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data (2018) (4)
- Optimal Embedding into Star Metrics (2009) (4)
- Three-dimensional graph products with unbounded stack-number (2022) (4)
- Single Triangle Strip and Loop on Manifolds with Boundaries (2006) (4)
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time (2018) (4)
- Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers (2010) (4)
- Optimal Angular Resolution for Face-Symmetric Drawings (2009) (4)
- Studying Geometric Graph Properties of Road Networks Through an Algorithmic Lens (2008) (4)
- Efficient algorithms with applications to molecular biology (1990) (4)
- Optimal Spanners for Unit Ball Graphs in Doubling Metrics (2021) (4)
- On the Edge Crossings of the Greedy Spanner (2020) (4)
- Speed-ups in constructive solid geometry (1992) (4)
- The Parametric Closure Problem (2015) (3)
- Counting Polygon Triangulations is Hard (2019) (3)
- Contact Graphs of Circular Arcs (2015) (3)
- Folding Polyominoes into (Poly)Cubes (2017) (3)
- Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics (2010) (3)
- Confluent Orthogonal Drawings of Syntax Diagrams (2015) (3)
- Convex-Arc Drawings of Pseudolines (2016) (3)
- Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing (2012) (3)
- Making Change in 2048 (2018) (3)
- Track Layout Is Hard (2016) (3)
- Reactive Proximity Data Structures for Graphs (2018) (3)
- New algorithms for minimum-measure simplices and one-dimensional weighted Voronoi diagrams (1992) (3)
- Some Polycubes Have No Edge-Unzipping (2019) (3)
- Cubic Planar Graphs that cannot be Drawn on few Lines (2019) (3)
- Optimally Sorting Evolving Data (2018) (3)
- Treetopes and Their Graphs (2015) (3)
- Maximizing the Sum of Radii of Disjoint Balls or Disks (2016) (3)
- Improved mixing for the convex polygon triangulation flip walk (2022) (3)
- Grid Peeling and the Affine Curve-Shortening Flow (2017) (3)
- Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains (2019) (3)
- One-Dimensional Peg Solitaire (2000) (3)
- PREFACE: Festschrift for Zvi Galil (1999) (2)
- The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing (2007) (2)
- Near-Linear-Time Deterministic Plane Steiner Spanners for Well-Spaced Point Sets (2013) (2)
- On the treewidth of Hanoi graphs (2020) (2)
- K-Best Solutions of MSO Problems on Tree-Decomposable Graphs (2017) (2)
- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars (2006) (2)
- Projection, Decomposition, and Adaption of Learning Spaces (2013) (2)
- On the number of minimal 1-Steiner trees (1994) (2)
- The minimum expectation selection problem (2001) (2)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (2018) (2)
- 8 APPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS (1995) (2)
- Limitations on Realistic Hyperbolic Graph Drawing (2021) (2)
- Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation (2010) (2)
- Finding Relevant Points for Nearest-Neighbor Classification (2021) (2)
- Fully dynamic maintenance of euclidean minimum spanning trees (1992) (2)
- Asymptotic speed-ups in constructive solid geometry (1995) (2)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (2018) (2)
- Fast optimal parallel algorithms for maximal matching in sparse graphs (1992) (2)
- Vertex-Unfoldings of Simplicial Polyhedra (2001) (2)
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION (1992) (2)
- Updating Widths and Maximum Spanning Trees using the Rotating Caliper Graph (2001) (2)
- Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra (2020) (2)
- Distance-Sensitive Planar Point Location (2013) (2)
- Dilation, smoothed distance, and minimization diagrams of convex functions (2008) (2)
- Really Straight Drawings I : Planar Graphs ∗ (2005) (2)
- Equipartitions of graphs (1991) (2)
- Speeding up Dynamic Programming with Application to the Computation of RNA Structure (1988) (1)
- Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching (2018) (1)
- Erratum: Polynomial-size nonobtuse triangulation of polygons (1992) (1)
- Homotopy height, grid-major height and graph-drawing height (2019) (1)
- Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes (2021) (1)
- 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (2015) (1)
- The Distribution of Cycle Lengths in Graphical Models for Turbo Decoding Technical Report (1999) (1)
- New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs (2019) (1)
- Angles of Arc-Polygons and Lombardi Drawings of Cacti (2021) (1)
- Some Polycubes Have No Edge Zipper Unfolding (2019) (1)
- Set-Difference Range Queries (2013) (1)
- One-to-one Point Set Matchings for Grid Map Layout ∗ (2012) (1)
- Face flips in origami tessellations (2019) (1)
- Existence and hardness of conveyor belts (2019) (1)
- Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings (2019) (1)
- Egyptian Fractions with Denominators from Sequences Closed Under Doubling (2021) (1)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (2012) (1)
- Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms (2018) (1)
- The Complexity of Iterated Reversible Computation (2021) (1)
- On the Planar Split Thickness of Graphs (2017) (1)
- On Polyhedral Realization with Isosceles Triangles (2020) (1)
- Geometric dominating sets - a minimum version of the No-Three-In-Line Problem (2022) (1)
- Memory reference caching for activity reduction on address buses (2005) (1)
- Low-stretch spanning trees of graphs with bounded width (2020) (1)
- Minimal Ununfoldable Polyhedron (2019) (1)
- Antimatroids and Balanced Pairs (2013) (1)
- Reflections in an octagonal mirror maze (2022) (1)
- Principles of Graph drawing (2008) (1)
- Realization and Connectivity of the Graphs of Origami Flat Foldings (2018) (1)
- Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication (2017) (1)
- The diameter of nearest neighbor graphs (1992) (1)
- Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs (2021) (1)
- Advanced Topics in Algorithms (2012) (0)
- Antimatroids and Balanced Pairs (2013) (0)
- Assigning chain-like tasks on a chain-like network of computers (2001) (0)
- Subquadratic nonobtuse triangulation of convex polygons (1991) (0)
- Orthogonal dissection into few rectangles (2022) (0)
- Sch¨ oning's random-restart hill-climbing k-SAT algorithm (2000) (0)
- The Complexity of Bendless Three-Dimensional (2013) (0)
- Diamond-kite adaptive quadrilateral meshing (2013) (0)
- Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time (2023) (0)
- Maximum Plane Trees in Multipartite Geometric Graphs (2018) (0)
- The Graphs of Stably Matchable Pairs (2020) (0)
- Erratum to: Antimatroids and Balanced Pairs (2014) (0)
- Rooted Cycle Bases (2015) (0)
- A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing (2014) (0)
- A Stronger Lower Bound on Parametric Minimum Spanning Trees (2021) (0)
- Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015 (2015) (0)
- 25 S ep 2 00 0 Computing the Depth of a Flat Marshall Bern (2008) (0)
- Spanning Trees in Multipartite Geometric Graphs (2017) (0)
- Front Matter, Table of Contents, Preface, Conference Organization (2018) (0)
- Title Balanced circle packings for planar graphs Permalink (2014) (0)
- Algorithms for sparse geometric graphs and social networks (2011) (0)
- Foundational Algorithms for Computational Distributed Robot Swarms (2008) (0)
- Discrete Algorithms Seminar Title: " Paired Approximation Problems and Incompatible Inapproximabilities " Title: " Guard Placement for Wireless Localization " (2010) (0)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (2020) (0)
- Cubic Partial Cubes from Simplicial Arrangements - eScholarship (2006) (0)
- Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics (2022) (0)
- Ramified Rectilinear Polygons: Coordinatization by Dendrons (2015) (0)
- Geometric Dominating Sets (2022) (0)
- Session details: Session 10A (2003) (0)
- Algorithms for geometric shortest paths along routes (2002) (0)
- A ug 1 99 9 Quadrilateral Meshing by Circle Packing Marshall Bern (2008) (0)
- Locked and unlocked smooth embeddings of surfaces (2022) (0)
- Cycle length distributions in graphical models for iterative decoding (2000) (0)
- Foundational Algorithms for Distributed Robot Swarms (2007) (0)
- The Maximum-Mean Subtree (2005) (0)
- Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension (2013) (0)
- Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
- Graphs excluding a fixed minor are $O(\sqrt{n})$-complete-blowups of a treewidth 4 graph (2022) (0)
- Distance-sensitive point location made easy (2014) (0)
- Solving some combinatorial problems embedded in trees (2008) (0)
- Simplifying Activity-on-Edge Graphs (2020) (0)
- Faster Evaluation of Subtraction Games (2018) (0)
- Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
- Proceedings of the 17th international conference on Graph Drawing (2009) (0)
- Erratum to: Antimatroids and Balanced Pairs (2015) (0)
- Track Layouts, Layered Path Decompositions, and Leveled Planarity (2018) (0)
- Ununfoldable polyhedra with 6 vertices or 6 faces (2021) (0)
- Treetopes and Their Graphs (2020) (0)
- D3-Reducible Graphs (2015) (0)
- Problems for the Barbados Graph Theory Workshop (2018) (0)
- On the Biplanarity of Blowups (2023) (0)
- Edge Insertion for Optimal Triangulations 1 Edge Insertion for Optimal Triangulations (1993) (0)
- Grigni : [ 22 ] Algorithms for Weak "-Nets (0)
- Feder and Motwani's randomized (k; 2)-CSP algorithm (2000) (0)
- Problems for the Barbados Graph Theory Workshop 2017 (2017) (0)
- Provably Good Mesh GenerationMarshall Bern (2008) (0)
- Rithms for Nding a Sparse K-connected Spanning Subgraph of a K-connected Graph", Tenance of a Minimum Spanning Forest in a Dy- Namic Planar Graph". 3.2 a Dynamic 2-edge Connectivity Algorithm (1995) (0)
- Distributed Construction of Lightweight Spanners for Unit Ball Graphs (2022) (0)
- Questions answered. in theory.: http://cstheory.stackexchange.com/ (2010) (0)
- Frederickson, \data Structures for On-line Updating of Minimum Spanning Trees", Siam (2007) (0)
- Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
- Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA (2002) (0)
- Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
- New Results in Sona Drawing: Hardness and TSP Separation (2020) (0)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (2018) (0)
- 3 The Maximum Bichromatic Plane Spanning Tree Problem r (2018) (0)
- C O ] 14 M ay 2 00 2 Fat 4-polytopes and fatter 3-spheres (2008) (0)
- Two-Site Voronoi Diagrams under Geometric Distance Functions (2011) (0)
- On the complexity of embedding in graph products (2023) (0)
- Dynamic Products of Ranks (2020) (0)
- RIGID ORIGAMI VERTICES : CONDITIONS AND FORCING (2016) (0)
- From Discrepancy to Majority (2017) (0)
This paper list is powered by the following services:
Other Resources About David Eppstein
What Schools Are Affiliated With David Eppstein?
David Eppstein is affiliated with the following schools:
