◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hoàng-Oanh Le

9 papers hereh-index 12567 citations30 works total

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

author position
  • first author5
  • middle author3
  • last author1

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

fields
  • cs.DM4
  • cs.CC3
  • cs.DS2

identity via Semantic Scholar / OpenAlex

activity
20162025
most citedA complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

27 citations · 28 across the 9 of their papers we have counts for

collaborators
Showing 2025 · cs.DSShow all

1 paper · 2 filters

cs.DS2025

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability

Carl Feghali, Hoang-Oanh Le, Van Bang Le

This paper continues the study of a new variant of graph coloring with a connectivity constraint recently introduced by Hsieh et al. [COCOON 2024]. A path in a vertex-colored graph…

◍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.