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.CGShow all

3 papers · 2 filters

cs.CG2026

Improved Euclidean Shallow Light Trees

Hung Le, Shay Solomon, Cuong Than +2

For parameters $α, β \geq 1$ , a spanning tree $T$ of a weighted graph $G$ rooted at a designated vertex $r$ is called an $(α, β)$ -shallow-light tree (SLT) if (i) for every vertex $v$ ,…

cs.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…

cs.CG2026

A Polynomial Coreset for Furthest Neighbor in Planar Metrics

Kacper Kluk, Hung Le, Wojciech Nadara +3

A furthest neighbor data structure on a metric space $(V, dist)$ and a set $P \subseteq V$ answers the following query: given $v \in V$ , output $p \in P$ maximizing $\mathr…