Hoàng-Oanh Le

39 papers B 8Misc 2Journal 27Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles.
J. Comput. Syst. Sci.
Hoàng-Oanh Le, Van Bang Le
2026 J jnl
The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability.
Discret. Appl. Math.
Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2025 J jnl
The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability.
CoRR
Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2024 J jnl
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs.
Theory Comput. Syst.
Hoàng-Oanh Le, Van Bang Le
2024 J jnl
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs.
CoRR
Hoàng-Oanh Le, Van Bang Le
2024 J jnl
On the d-Claw Vertex Deletion Problem.
Algorithmica
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2024 — conf
The Complexity of Strong Conflict-Free Vertex-Connection k-colorability.
COCOON (1)
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2024 J jnl
The complexity of strong conflict-free vertex-connection
CoRR
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2023 B conf
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths.
WG
Hoàng-Oanh Le, Van Bang Le
2023 J jnl
Complexity results for matching cut problems in graphs without long induced paths.
CoRR
Hoàng-Oanh Le, Van Bang Le
2022 B conf
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs.
MFCS
Hoàng-Oanh Le, Van Bang Le
2022 J jnl
On the d-Claw Vertex Deletion Problem.
CoRR
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2021 J jnl
Matching Cut in Graphs with Large Minimum Degree.
Algorithmica
Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2019 J jnl
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter.
Theor. Comput. Sci.
Hoàng-Oanh Le, Van Bang Le
2019 B conf
Constrained Representations of Map Graphs and Half-Squares.
MFCS
Hoàng-Oanh Le, Van Bang Le
2019 J jnl
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs.
Algorithmica
Hoàng-Oanh Le, Van Bang Le
2019 J jnl
Map graphs having witnesses of large girth.
Theor. Comput. Sci.
Hoàng-Oanh Le, Van Bang Le
2019 Misc conf
Matching Cut in Graphs with Large Minimum Degree.
COCOON
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
2018 J jnl
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter.
CoRR
Hoàng-Oanh Le, Van Bang Le
2018 J jnl
Hardness and structural results for half-squares of restricted tree convex bipartite graphs.
CoRR
Hoàng-Oanh Le, Van Bang Le
2018 J jnl
Map graphs having witnesses of large girth.
CoRR
Hoàng-Oanh Le, Van Bang Le
2017 Misc conf
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs.
COCOON
Hoàng-Oanh Le, Van Bang Le
2016 B conf
On the Complexity of Matching Cut in Graphs of Fixed Diameter.
ISAAC
Hoàng-Oanh Le, Van Bang Le
2007 J jnl
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
Algorithmica
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2006 J jnl
Clique-Width for 4-Vertex Forbidden Subgraphs.
Theory Comput. Syst.
Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2005 J jnl
Chordal co-gem-free and (
Discret. Appl. Math.
Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2005 B conf
Clique-Width for Four-Vertex Forbidden Subgraphs.
FCT
Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
2005 J jnl
New Graph Classes of Bounded Clique-Width.
Theory Comput. Syst.
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2004 — —
Contributions to clique-width of graphs.
Hoàng-Oanh Le
2004 J jnl
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.
Int. J. Found. Comput. Sci.
Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2004 J jnl
Tree spanners on chordal graphs: complexity and algorithms.
Theor. Comput. Sci.
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2003 J jnl
Splitting a graph into disjoint induced paths or cycles.
Discret. Appl. Math.
Hoàng-Oanh Le, Van Bang Le, Haiko Müller
2003 J jnl
Structure and stability number of chair-, co-P- and gem-free graphs revisited.
Inf. Process. Lett.
Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe
2003 B conf
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
WG
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2002 B conf
New Graph Classes of Bounded Clique-Width.
WG
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2002 J jnl
On alpha-redundant vertices in P5-free graphs.
Inf. Process. Lett.
Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le
2002 J jnl
The NP-completeness of (1, r)-subcolorability of cubic graphs.
Inf. Process. Lett.
Hoàng-Oanh Le, Van Bang Le
2002 B conf
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.
ISAAC
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
1999 J jnl
Optimal tree 3-spanners in directed path graphs.
Networks
Hoàng-Oanh Le, Van Bang Le