The following pages link to David Eppstein (Q283880):
Displayed 50 items.
- (Q4407713) (← links)
- (Q4407719) (← links)
- (Q4422271) (← links)
- Small Maximal Independent Sets and Faster Exact Graph Coloring (Q4435347) (← links)
- (Q4464718) (← links)
- (Q4464720) (← links)
- (Q4471285) (← links)
- (Q4471349) (← links)
- (Q4488857) (← links)
- Subgraph Isomorphism in Planar Graphs and Related Problems (Q4505015) (← links)
- Geometric Thickness of Complete Graphs (Q4511256) (← links)
- Incremental and Decremental Maintenance of Planar Width (Q4521530) (← links)
- The distribution of loop lengths in graphical models for turbo decoding (Q4544693) (← links)
- Vertex-unfoldings of simplicial manifolds (Q4557559) (← links)
- Folding Polyominoes into (Poly)Cubes (Q4557731) (← links)
- Forbidden Configurations in Discrete Geometry (Q4569672) (← links)
- Treetopes and their Graphs (Q4575649) (← links)
- Parameterized Complexity of 1-Planarity (Q4600735) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- Flat foldings of plane graphs with prescribed angles and edge lengths (Q4626289) (← links)
- (Q4633821) (← links)
- (Q4633822) (← links)
- 3-coloring in time (Q4652410) (← links)
- (Q4657580) (← links)
- Fast Approximation of Centrality (Q4679080) (← links)
- QUADRILATERAL MESHING BY CIRCLE PACKING (Q4682180) (← links)
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS (Q4682197) (← links)
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLES (Q4698357) (← links)
- Setting Parameters by Example (Q4706222) (← links)
- (Q4763388) (← links)
- (Q4763392) (← links)
- (Q4778539) (← links)
- (Q4778547) (← links)
- (Q4778579) (← links)
- The minimum expectation selection problem (Q4798168) (← links)
- (Q4858443) (← links)
- (Q4886048) (← links)
- (Q4886099) (← links)
- The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing (Q4910552) (← links)
- Planar Lombardi Drawings for Subcubic Graphs (Q4912196) (← links)
- On the Density of Maximal 1-Planar Graphs (Q4912214) (← links)
- Force-Directed Graph Drawing Using Social Gravity and Scaling (Q4912222) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q4913761) (← links)
- Flows in One-Crossing-Minor-Free Graphs (Q4913762) (← links)
- (Q4945509) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Testing bipartiteness of geometric intersection graphs (Q4962781) (← links)