Hoàng-Oanh Le

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 18

Top Venues

CoRR

Algorithmica

COCOON

MFCS

University of Rostock (PHD)

Education History

University of Rostock

PHD

Publications

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

Hoàng-Oanh Le.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hoàng-Oanh Le