321 citations · 2k across the 200 of their papers we have counts for
1 paper · 2 filters
David Eppstein
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to whi…