Hung Le

activity

20152026

most citedOptimal dynamic program for r-domination problems over tree decompositions

5 citations · 27 across the 31 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency

Hung Le

Thorup [FOCS'01, JACM'04] and Klein [SODA'01] independently showed that there exists a $(1 + ε)$ -approximate distance oracle for planar graphs with $O (n (lo g n) ε^{- 1})$ space and $O…

cs.DS2022

Low Treewidth Embeddings of Planar and Minor-Free Metrics

Arnold Filtser, Hung Le

Cohen-Addad, Filtser, Klein and Le [FOCS'20] constructed a stochastic embedding of minor-free graphs of diameter $D$ into graphs of treewidth $O_{ε} (lo g n)$ with expected additive d…