◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hung Le

34 papers hereh-index 15562 citations41 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author12
  • middle author12
  • last author6

Across the 34 of 34 papers where every author was matched, so the position is known.

fields
  • cs.DS23
  • cs.CG6
  • math.CO4
  • cs.DM1
same name
  • Hung Le — 21 papers, h 18
  • Hung Le — 16 papers, h 10
  • Hung Le — 16 papers, h 2
  • Hung Le — 12 papers, h 3
  • Hung Le — 11 papers, h 7
  • Hung Le — 11 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

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 math.COShow all

4 papers · 1 filter

math.CO2026

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…

math.CO2026

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…

math.CO2017★ 2 cited

Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph

Glencora Borradaile, Hung Le, Melissa Sherman-Bennett

Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has a…

math.CO2016

A better bound on the largest induced forests in triangle-free planar graphs

Hung Le

It is well-known that there exists a triangle-free planar graph of n verticess such that the largest induced forest has size at most 85n​. Salavatipour proved that ther…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.