The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- The Parametric Closure Problem (Q3449830) (← links)
- Rooted Cycle Bases (Q3449832) (← links)
- The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q3460399) (← links)
- Reset Sequences for Monotonic Automata (Q3476281) (← links)
- Sequence comparison with mixed convex and concave costs (Q3493226) (← links)
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS (Q3521595) (← links)
- Straight Skeletons of Three-Dimensional Polyhedra (Q3541082) (← links)
- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars (Q3578306) (← links)
- (Q3579509) (← links)
- Cloning Voronoi Diagrams via Retroactive Data Structures (Q3586477) (← links)
- Choosing Colors for Geometric Graphs Via Color Space Embeddings (Q3595461) (← links)
- Upright-Quad Drawing of st-Planar Learning Spaces (Q3595472) (← links)
- Trees with Convex Faces and Optimal Angles (Q3595489) (← links)
- Guard placement for efficient point-in-polygon proofs (Q3602853) (← links)
- Edges and Switches, Tunnels and Bridges (Q3603516) (← links)
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters (Q3603564) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing (Q3611839) (← links)
- Isometric Diamond Subgraphs (Q3611874) (← links)
- (Q3813298) (← links)
- Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614) (← links)
- Simultaneous strong separations of probabilistic and unambiguous complexity classes (Q3992020) (← links)
- Dynamic Three-Dimensional Linear Programming (Q4024308) (← links)
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS (Q4030350) (← links)
- (Q4036603) (← links)
- (Q4037435) (← links)
- Connectivity, graph minors, and subgraph multiplicity (Q4201396) (← links)
- (Q4206397) (← links)
- Separator-Based Sparsification II: Edge and Vertex Connectivity (Q4210152) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- (Q4230327) (← links)
- (Q4230329) (← links)
- (Q4234116) (← links)
- Optimal Point Placement for Mesh Smoothing (Q4238531) (← links)
- (Q4250231) (← links)
- (Q4252303) (← links)
- (Q4252399) (← links)
- (Q4252729) (← links)
- Sparse dynamic programming I (Q4302802) (← links)
- Sparse dynamic programming II (Q4302803) (← links)
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems (Q4312223) (← links)
- TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES (Q4312279) (← links)
- (Q4327371) (← links)
- (Q4335197) (← links)
- (Q4335206) (← links)
- Minimum Range Balanced Cuts via Dynamic Subset Sums (Q4339009) (← links)
- Choosing Subsets with Maximum Weighted Average (Q4349704) (← links)
- Faster Circle Packing with Application to Nonobtuse Triangulation (Q4365029) (← links)
- Sparsification—a technique for speeding up dynamic graph algorithms (Q4377592) (← links)
- (Q4407712) (← links)