The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (Q5390616) (← links)
- Algorithms and Data Structures (Q5394240) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q5404450) (← links)
- Superpatterns and Universal Point Sets (Q5417595) (← links)
- Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity (Q5417596) (← links)
- (Q5417691) (← links)
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs (Q5419482) (← links)
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes (Q5422490) (← links)
- (Q5458658) (← links)
- Fast hierarchical clustering and other applications of dynamic closest pairs (Q5463394) (← links)
- Quasiconvex Analysis of Backtracking Algorithms (Q5501340) (← links)
- (Q5501348) (← links)
- (Q5501789) (← links)
- (Q5501831) (← links)
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS (Q5687654) (← links)
- Graph Drawing (Q5711602) (← links)
- Graph Drawing (Q5711604) (← links)
- Simple Recognition of Halin Graphs and Their Generalizations (Q5739846) (← links)
- Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges (Q5741769) (← links)
- Maximizing the Sum of Radii of Disjoint Balls or Disks (Q5745395) (← links)
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems (Q5757882) (← links)
- Graph-Theoretic Solutions to Computational Geometry Problems (Q5851089) (← links)
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. (Q5875541) (← links)
- (Q5875617) (← links)
- (Q5875621) (← links)
- Confluent Hasse Diagrams (Q5891340) (← links)
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (Q5894095) (← links)
- Lombardi Drawings of Graphs (Q5894096) (← links)
- Lombardi Drawings of Graphs (Q5894484) (← links)
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (Q5894771) (← links)
- Confluent Hasse Diagrams (Q5895511) (← links)
- Graph Drawing (Q5896917) (← links)
- Graph Drawing (Q5897628) (← links)
- Algorithms and Data Structures (Q5900763) (← links)
- Maximum plane trees in multipartite geometric graphs (Q5915987) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Maximum plane trees in multipartite geometric graphs (Q5920099) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- (Q6059174) (← links)
- Simplifying Activity-On-Edge Graphs (Q6059189) (← links)
- The centroid of points with approximate weights (Q6102322) (← links)
- Angles of arc-polygons and lombardi drawings of cacti (Q6103170) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
- (Q6126509) (← links)
- (Q6179337) (← links)
- Lower bounds for non-adaptive shortest path relaxation (Q6179429) (← links)
- Regular Labelings and Geometric Structures (Q6219555) (← links)
- On the treewidth of Hanoi graphs (Q6339792) (← links)
- Stack-number is not bounded by queue-number (Q6353279) (← links)
- Three-dimensional graph products with unbounded stack-number (Q6390777) (← links)