The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- (Q4967175) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- (Q5002769) (← links)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Finding the k smallest spanning trees (Q5056090) (← links)
- Parallel construction of quadtrees and quality triangulations (Q5060112) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5075349) (← links)
- Algorithms for Stable Matching and Clustering in a Grid (Q5077669) (← links)
- Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings (Q5084693) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
- (Q5088963) (← links)
- An efficient algorithm for shortest paths in vertical and horizontal segments (Q5096942) (← links)
- (Q5104352) (← links)
- (Q5111875) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Face flips in origami tessellations (Q5132647) (← links)
- Egyptian Fractions with Denominators from Sequences Closed Under Doubling (Q5154719) (← links)
- The graphs of planar soap bubbles (Q5174457) (← links)
- Folding a Paper Strip to Minimize Thickness (Q5176577) (← links)
- Skip-webs (Q5177225) (← links)
- Graph Drawing (Q5193162) (← links)
- Randomized Speedup of the Bellman–Ford Algorithm (Q5194707) (← links)
- Small Superpatterns for Dominance Drawing (Q5194761) (← links)
- Adjacency-Preserving Spatial Treemaps (Q5199239) (← links)
- Tracking Moving Objects with Few Handovers (Q5199257) (← links)
- Grid peeling and the affine curve-shortening flow (Q5232728) (← links)
- Covering many points with a small-area box (Q5233323) (← links)
- Realization and Connectivity of the Graphs of Origami Flat Foldings (Q5233325) (← links)
- Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection (Q5240224) (← links)
- Separator based sparsification for dynamic planar graph algorithms (Q5248488) (← links)
- Planar Induced Subgraphs of Sparse Graphs (Q5250134) (← links)
- Listing All Maximal Cliques in Large Sparse Real-World Graphs (Q5266538) (← links)
- Rooted Cycle Bases (Q5278052) (← links)
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry (Q5280496) (← links)
- (Q5290264) (← links)
- The Traveling Salesman Problem for Cubic Graphs (Q5301405) (← links)
- Upright-Quad Drawing of st-Planar Learning Spaces (Q5301428) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- Multivariate regression depth (Q5361543) (← links)
- Optimized color gamuts for tiled displays (Q5361633) (← links)
- Deterministic sampling and range counting in geometric data streams (Q5361666) (← links)
- The geometric thickness of low degree graphs (Q5361688) (← links)
- Minimum Forcing Sets for Miura Folding Patterns (Q5363026) (← links)
- Finding All Maximal Subsequences with Hereditary Properties (Q5368691) (← links)
- Cuckoo Filter: Simplification and Analysis (Q5369510) (← links)
- The skip quadtree (Q5370625) (← links)
- Minimum dilation stars (Q5370628) (← links)
- Area-universal rectangular layouts (Q5370726) (← links)