The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- From discrepancy to majority (Q1751093) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- The lattice dimension of a graph (Q1775025) (← links)
- Models and algorithms for graph watermarking (Q1799199) (← links)
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions (Q1809513) (← links)
- Asymptotic speed-ups in constructive solid geometry (Q1894301) (← links)
- Separator based sparsification. I: Planarity testing and minimum spanning trees (Q1915501) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Regression depth and center points. (Q1972305) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- On polyhedral realization with isosceles triangles (Q2042206) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Geometric dominating sets -- a minimum version of the no-three-in-line problem (Q2088885) (← links)
- Ununfoldable polyhedra with \(6\) vertices or \(6\) faces (Q2123289) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Reconfiguring undirected paths (Q2285101) (← links)
- Reactive proximity data structures for graphs (Q2294736) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- On 2-site Voronoi diagrams under geometric distance functions (Q2434572) (← links)
- Antimatroids and balanced pairs (Q2454046) (← links)
- Hinged dissection of polyominoes and polyforms (Q2486086) (← links)
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- The graphs of stably matchable pairs (Q2672447) (← links)
- (Q2768297) (← links)
- (Q2768314) (← links)
- (Q2768367) (← links)
- From Discrepancy to Majority (Q2802955) (← links)
- Parameterized Complexity of 1-Planarity (Q2842148) (← links)
- Combinatorial Pair Testing: Distinguishing Workers from Slackers (Q2842170) (← links)
- Optimal Angular Resolution for Face-Symmetric Drawings (Q2865043) (← links)
- Superpatterns and Universal Point Sets (Q2867659) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)
- Strict Confluent Drawing (Q2867672) (← links)
- Drawing Arrangement Graphs in Small Grids, or How to Play Planarity (Q2867680) (← links)
- Area-Universal and Constrained Rectangular Layouts (Q2910852) (← links)
- (Q2921700) (← links)
- Squarepants in a tree (Q2930253) (← links)
- All maximal independent sets and dynamic dominance for sparse graphs (Q2930264) (← links)
- (Q2934579) (← links)
- Planar Induced Subgraphs of Sparse Graphs (Q2936909) (← links)
- Balanced Circle Packings for Planar Graphs (Q2936919) (← links)