Hoàng-Oanh Le

From MaRDI portal
Person:814930

Available identifiers

zbMath Open le.hoang-oanhMaRDI QIDQ814930

List of research outcomes





PublicationDate of PublicationType
Complexity of the cluster vertex deletion problem on \(H\)-free graphs2024-08-06Paper
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths2024-05-03Paper
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs2024-04-21Paper
On the \(d\)-claw vertex deletion problem2024-01-25Paper
https://portal.mardi4nfdi.de/entity/Q50923712022-07-21Paper
Matching cut in graphs with large minimum degree2021-04-19Paper
Matching cut in graphs with large minimum degree2020-02-24Paper
Hardness and structural results for half-squares of restricted tree convex bipartite graphs2019-10-17Paper
Map graphs having witnesses of large girth2019-05-17Paper
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter2019-05-02Paper
https://portal.mardi4nfdi.de/entity/Q46365342018-04-19Paper
Hardness and structural results for half-squares of restricted tree convex bipartite graphs2017-10-23Paper
Tree spanners for bipartite graphs and probe interval graphs.2010-01-12Paper
Structure and stability number of chair-, co-P- and gem-free graphs revisited2009-03-23Paper
Tree spanners for bipartite graphs and probe interval graphs2007-03-05Paper
Clique-width for 4-vertex forbidden subgraphs2006-10-25Paper
Fundamentals of Computation Theory2006-10-20Paper
New graph classes of bounded clique-width2006-02-08Paper
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH2005-10-19Paper
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width2005-02-22Paper
Tree spanners on chordal graphs: complexity and algorithms2004-10-27Paper
Additive Tree Spanners2004-01-08Paper
Splitting a graph into disjoint induced paths or cycles.2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q44259512003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44144852003-07-25Paper
The NP-completeness of (1,r)-subcolorability of cubic graphs2002-07-14Paper
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs2002-07-14Paper
Optimal tree 3-spanners in directed path graphs2001-05-02Paper
Complexity and algorithms for matching cut problems in graphs without long induced paths and cyclesN/APaper

Research outcomes over time

This page was built for person: Hoàng-Oanh Le