Concepedia

Hung Le

HL

5

Publications

102

Citations

5

H-Index

2017

Active since

Affiliations

Columbia University(Current)

Oregon State University

Hung Le is an author at Columbia University specializing in computational geometry, computer science, and computational complexity.

ORCID

Top concepts

Publications per year

2017–2021

5

Publications

5

Truly Optimal Euclidean Spanners

Hung Le, Shay Solomon · 2019 · 31 citations

Optimal Dynamic Program for r-Domination Problems over Tree Decompositions

Glencora Borradaile, Hung Le · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017 · 26 citations · Full text

On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs

Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein et al. · 2020 · 24 citations

Clan embeddings into trees, and low treewidth graphs

Arnold Filtser, Hung Le · 2021 · 11 citations

, , +13

A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph

Hung Le · Graphs and Combinatorics · 2018 · 10 citations

Rows per page

1–5 of 5