Hung Le

activity

20242026

most citedOptimal Padded Decomposition For Bounded Treewidth Graphs

2 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2026 · cs.DSShow all

2 papers · 2 filters

cs.DS2026

Three trees suffice for a constant stretch in minor-free graphs

Hung Le, Huy Pham, Cuong Than +1

In this short note, we show that $H$ -minor-free graphs have a tree cover with $3$ trees and constant stretch for any fixed graph $H$ . The number of trees matches the recent lower b…

cs.DS2026

Planar Embedding of Okamura-Seymour Quasimetrics in Polynomial Time with an Application to Distributed SSSP

Hung Le, Hector Tierno, Shuang Yang

A quasi-metric $(T, δ_{T})$ is an Okamura-Seymour quasimetric if there exists an edge-weighted planar embedded directed graph $G = (V, E, w)$ such that $T$ is a set of terminals on the…