5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CG2006★ 5 cited
Trees with Convex Faces and Optimal Angles
Josiah Carlson, David Eppstein
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among a…
cs.CG2005
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
Josiah Carlson, David Eppstein
We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When…