6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.CG2010
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
Erin W. Chambers, David Eppstein, Michael T. Goodrich +1
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for th…
cs.DS2010★ 6 cited
Flows in One-Crossing-Minor-Free Graphs
Erin Chambers, David Eppstein
We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of…