- Finding the k Shortest Paths David Eppstein
- Using Sparsification for Parametric Minimum Spanning Tree Problems
- Choosing Subsets with Maximum Weighted Average
- Eurographics Symposium on Geometry Processing 2008 Pierre Alliez and Szymon Rusinkiewicz
- Clustering for Faster Network Simplex Pivots David Eppstein
- Minimum dilation stars Eppstein and Wortman, SoCG 2005 Minimum Dilation Stars
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- Worst-Case Bounds for Subadditive Geometric Graphs Marshall Bern
- Arboricity and Bipartite Subgraph Listing Algorithms
- Optimal Point Placement for Mesh Smoothing Nina Amenta 1
- Global optimization of mesh quality D. Eppstein, Meshing Roundtable 20011 Global Optimization of Mesh Quality
- Updating Widths and Maximum Spanning Trees using the Rotating Caliper Graph
- Spanning Trees and Spanners David Eppstein
- Dihedral Bounds for Mesh Generation in High Dimensions Marshall Bern
- Persistence, Offline Algorithms, and Space Compaction
- An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments
- International Journal of Computational Geometry & Applications c World Scientific Publishing Company
- Squarepants in a Tree: Sum of Subtree Clustering and
- Quasiconvex analysis of backtracking algorithms D. Eppstein, UC Irvine, SODA 2004 Quasiconvex Analysis of Backtracking Algorithms
- Searching for Spaceships David Eppstein
- Pacific Graphics 2009 S. Lee, D. Lischinski, and Y. Yu
- Computational Geometry and Parametric Matroid Optimization
- Efficient Algorithms for Sequence Analysis David Eppstein 1
- International Journal of Computational Geometry & Applications, Vol. 2, No. 3 (1992) 241255 c World Scientific Publishing Company
- 3-Coloring in time O(1.3446n): a no-MIS algorithm
- The Diameter of Nearest Neighbor Graphs David Eppstein
- On Nearest-Neighbor Graphs David Eppstein 1
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Upright-Quad Drawing of st-Planar Learning Spaces
- Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein
- Optimal Mobius Transformations for Information Visualization and Meshing
- Linear Complexity Hexahedral Mesh Generation David Eppstein
- Sequence Comparison with Mixed Convex and Concave Costs David Eppstein
- Recognizing Partial Cubes in Quadratic Time
- Approximating the Minimum Weight Steiner Triangulation David Eppstein
- Parametric and Kinetic Minimum Spanning Trees Pankaj K. Agarwal 1
- Multivariate Regression Depth Marshall Bern
- A Heuristic Approach to Program Inversion David Eppstein
- On the NP-Completeness of Cryptarithms David Eppstein
- EFFICIENT ALGORITHMS FOR SEQUENCE ANALYSIS WITH CONCAVE AND CONVEX GAP COSTS
- Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices
- Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes
- The Farthest Point Delaunay Triangulation Minimizes Angles
- Finding the k Smallest Spanning Trees David Eppstein
- Improved Bounds for Intersecting Triangles and Halving Planes
- Connectivity, Graph Minors, and Subgraph Multiplicity
- Visibility with a Moving Point of View Marshall Bern
- Approximating the Minimum Weight Triangulation
- Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
- Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
- Improved Sparsification David Eppstein
- Average Case Analysis of Dynamic Geometric Optimization David Eppstein
- Faster Circle Packing with Application to Nonobtuse Triangulation
- Parallel Construction of Quadtrees and Quality Triangulations
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Choosing Subsets with Maximum Weighted Average David Eppstein Daniel S. Hirschberg
- Faster Geometric k-point MST Approximation
- Representing all Minimum Spanning Trees with Applications to Counting and Generation
- Linear Complexity Hexahedral Mesh Generation David Eppstein
- Zonohedra and Zonotopes David Eppstein*
- Using Sparsification for Parametric Minimum Spanning Tree Problems
- Faster Construction of Planar Two-centers David Eppstein
- Dynamic Connectivity in Digital Images David Eppstein
- On the Parity of Graph Spanning Tree Numbers David Eppstein
- Quadrilateral Meshing by Circle Packing Marshall Bern 1
- An Eigenvalue-less Eigenvector Algorithm. The eigenvectors of the real symmetric are the real solutions (r, s, t) for the system of equations
- Graphs for Dynamic Computational Geometry
- Fast Approximation of Centrality David Eppstein Joseph Wang
- Computing the Depth of a Flat Marshall Bern David Eppstein
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- Topological issues in hexahedral meshing D. Eppstein, UC Irvine, ATMCS 2001 Topological Issues in Hexahedral Meshing
- Triangles and Squares David Eppstein
- Algorithms for media D. Eppstein, UC Irvine, OSDA 2003 Algorithms for Media
- Dynamic generators of topologically embedded graphs D. Eppstein, UC Irvine, SODA 2003 Dynamic Generators
- Optimized color gamuts D. Eppstein, UC Irvine, SoCG 2003 Optimized Color Gamuts for Tiled Displays
- Robust statistics and arrangements D. Eppstein, UC Irvine, DIMACS 2003 Robust Statistics and Arrangements
- Bipartiteness of geometric intersection graphs D. Eppstein, UC Irvine, SODA 2004 Testing Bipartiteness of Geometric Intersection Graphs
- Algorithms for Drawing Media David Eppstein
- Algorithms for drawing media D. Eppstein, UC Irvine, Graph Drawing 2004 Algorithms for Drawing Media
- Maximal independent sets for sparse graphs D. Eppstein, UC Irvine, SODA 2005 All Maximal Independent Sets
- Improved Combinatorial Group Testing for Real-World
- The skip quadtree Eppstein, Goodrich, & Sun, SoCG 2005 The Skip Quadtree
- Trees with Convex Faces and Optimal Angles David Eppstein
- Edges and Switches, Tunnels and Bridges
- Paired Approximation Problems and Incompatible Inapproximabilities
- What's the Difference? Efficient Set Reconciliation without Prior Context
- Sets of Points with Many Halving Lines
- Parallel Algorithmic Techniques for Combinatorial Computation David Eppstein 1
- Average case analysis of dynamic geometric optimization
- Flipping cubical meshes D. Eppstein, Meshing Roundtable 20011 Flipping Cubical Meshes
- Mbius Transformations in Scientific Computing D. Eppstein, UC Irvine, SIAM CSE 2003 Mbius Transformations in Scientific Computing
- Algorithms for media D. Eppstein, UC Irvine, WADS 2007 Streaming Algorithms
- Graph-Theoretic Solutions to Computational Geometry Problems
- Delta-Confluent Drawings Michael T. Goodrich, David Eppstein, and Jeremy Meng
- Discussion of "Location-Scale Depth" by I. Mizera and C. H. Muller
- Speeding up Dynamic Programming David Eppstein 1,2
- The Centroid of Points with Approximate Weights
- Optimization Over Zonotopes and Training Support Vector Machines
- The Topology of Bendless Orthogonal Three-Dimensional Graph Drawing
- Principles of Graph Drawing David Eppstein
- The Topology of Bendless Orthogonal Three-Dimensional Graph Drawing
- Choosing Colors for Geometric Graphs Via Color Space Embeddings
- Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
- Beta-Skeletons Have Unbounded Dilation David Eppstein
- Quasiconvex programming D. Eppstein, UC Irvine, DIMACS 2003 Quasiconvex Programming
- Equipartitions of Graphs David Eppstein
- Mbius-invariant natural neighbor interpolation D. Eppstein, UC Irvine, SODA 2003 Mbius-Invariant Natural Neighbor Interpolation
- The Visual Computer manuscript No. (will be inserted by the editor)
- Parallel Recognition of Series-Parallel Graphs David Eppstein
- Isometric Diamond Subgraphs David Eppstein
- Speed-ups in Constructive Solid Geometry
- International Journal of Computational Geometry & Applications c World Scientific Publishing Company
- Notes on trilinear coordinates of a triangle David Eppstein
- Shortest Paths in an Arrangement with k Line Orientations David Eppstein 1 David W. Hart 2
- New Algorithms for Minimum Area k-gons
- Finding the k Shortest Paths David Eppstein
- Internet Packet Filter Management and Rectangle Geometry David Eppstein S. Muthukrishnan
- Algorithms for Proximity Problems in Higher Dimensions Matthew T. Dickerson
- Geometric Lower Bounds for Parametric Matroid Optimization
- On the Number of Minimal 1-Steiner Trees Boris Aronov
- Tree-Weighted Neighbors and Geometric k Smallest Spanning Trees
- A Deterministic Linear Time Algorithm for Geometric Separators and its Applications
- Faster Construction of Planar Two-centers David Eppstein
- Finding Common Ancestors and Disjoint Paths in DAGs
- Reset Sequences for Monotonic Automata David Eppstein
- TSP for cubic graphs D. Eppstein, UC Irvine, WADS 2003 The Traveling Salesman Problem for Cubic Graphs
- Geometry of Partial Cubes David Eppstein
- Dynamic Three-Dimensional Linear Programming
- MESH GENERATION AND OPTIMAL TRIANGULATION MARSHALL BERN
- Regular Labelings and Geometric Structures
- Finding Minimum Area k-gons David Eppstein
