5 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 1 cited
Light spanners for bounded treewidth graphs imply light spanners for -minor-free graphs
Glencora Borradaile, Hung Le
Grigni and Hung~\cite{GH12} conjectured that H-minor-free graphs have -spanners that are light, that is, of weight times the weight of the minimum spanning tree f…
cs.DM2017★ 1 cited
Embedded-width: A variant of treewidth for plane graphs
Glencora Borradaile, Jeff Erickson, Hung Le +1
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call t…
cs.DS2015★ 5 cited
Optimal dynamic program for r-domination problems over tree decompositions
Glencora Borradaile, Hung Le
There has been recent progress in showing that the exponential dependence on treewidth in dynamic programming algorithms for solving NP-hard problems are optimal under the Strong E…