5 citations · 27 across the 31 of their papers we have counts for
34 papers
Fatness and Flatness
Arnold Filtser, Hung Le, Nikolas Mählmann +2
Fat minors are the metric analog of graph minors that are tailored to the analysis of metric (edge-weighted) graphs and, more generally, metric spaces having a suitable notion of s…
A Separator for Minor-Free Graphs Beyond the Flow Barrier
Hung Le
In 1990, Alon, Seymour, and Thomas gave the first balanced separator of size for any -minor-free graph, which has had numerous algorithmic applications. T…
Coarse Balanced Separators in Fat-Minor-Free Graphs
Édouard Bonnet, Hung Le, Marcin Pilipczuk +1
Fat minors are a coarse analogue of graph minors where the subgraphs modeling vertices and edges of the embedded graph are required to be distant from each other, instead of just b…
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
The notion of shortcut partition, introduced recently by Chang, Conroy, Le, Milenković, Solomon, and Than [CCLMST23], is a new type of graph partition into low-diameter clusters. R…
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Lightness Barrier
Hung Le, Shay Solomon, Cuong Than
An essential requirement of spanners in many applications is to be fault-tolerant: a -spanner of a metric space is called (vertex) -fault-tolerant (-FT) if it remains…
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
Recently the authors [CCLMST23] introduced the notion of shortcut partition of planar graphs and obtained several results from the partition, including a tree cover with tre…