The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q2936922) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q2936927) (← links)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (Q2936933) (← links)
- Metric Dimension Parameterized by Max Leaf Number (Q2941747) (← links)
- Linear-Time Algorithms for Proportional Apportionment (Q2942662) (← links)
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms (Q2944526) (← links)
- Deterministic sampling and range counting in geometric data streams (Q2944553) (← links)
- Genus, Treewidth, and Local Crossing Number (Q2959745) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Happy endings for flip graphs (Q2968066) (← links)
- (Q2968080) (← links)
- Steinitz Theorems for Orthogonal Polyhedra (Q2968117) (← links)
- Strict Confluent Drawing (Q2970442) (← links)
- Adjacency-preserving spatial treemaps (Q2970446) (← links)
- Rigid Origami Vertices: Conditions and Forcing Sets (Q2970449) (← links)
- Combinatorics and Geometry of Finite and Infinite Squaregraphs (Q3013137) (← links)
- (Q3033316) (← links)
- Flows in One-Crossing-Minor-Free Graphs (Q3060737) (← links)
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (Q3060751) (← links)
- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures (Q3066151) (← links)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (Q3073671) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q3073673) (← links)
- APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS (Q3084690) (← links)
- (Q3129922) (← links)
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs (Q3132856) (← links)
- (Q3138871) (← links)
- (Q3138884) (← links)
- (Q3138931) (← links)
- (Q3138950) (← links)
- (Q3140402) (← links)
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics (Q3143753) (← links)
- Inapproximability of Orthogonal Compaction (Q3144115) (← links)
- Tangent Spheres and Triangle Centers (Q3146541) (← links)
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (Q3183459) (← links)
- Orientation-Constrained Rectangular Layouts (Q3183461) (← links)
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- Finding Large Clique Minors is Hard (Q3184610) (← links)
- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket (Q3191209) (← links)
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings (Q3223969) (← links)
- Faster Evaluation of Subtraction Games (Q3301007) (← links)
- (Q3301008) (← links)
- Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms (Q3303782) (← links)
- (Q3359791) (← links)
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way (Q3378507) (← links)
- Approximate Greedy Clustering and Distance Selection for Graph Metrics (Q3387276) (← links)
- Improved Grid Map Layout by Point Set Matching (Q3449120) (← links)
- Contact Graphs of Circular Arcs (Q3449800) (← links)