Optimal tree 3-spanners in directed path graphs. - Hoàng-Oanh Le; Van Bang Le (Networks, 1999)

Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le (ISAAC, 2002)

On alpha-redundant vertices in P5-free graphs. - Andreas Brandstädt; Hoàng-Oanh Le; Van Bang Le (Inf. Process. Lett., 2002)

The NP-completeness of (1, r)-subcolorability of cubic graphs. - Hoàng-Oanh Le; Van Bang Le (Inf. Process. Lett., 2002)

Splitting a graph into disjoint induced paths or cycles. - Hoàng-Oanh Le; Van Bang Le; Haiko Müller (Discret. Appl. Math., 2003)

Structure and stability number of chair-, co-P- and gem-free graphs revisited. - Andreas Brandstädt; Hoàng-Oanh Le; Jean-Marie Vanherpe (Inf. Process. Lett., 2003)

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. - Andreas Brandstädt; Hoàng-Oanh Le; Raffaele Mosca (Int. J. Found. Comput. Sci., 2004)

Tree spanners on chordal graphs: complexity and algorithms. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le (Theor. Comput. Sci., 2004)

Contributions to clique-width of graphs. - Hoàng-Oanh Le (2004)

Clique-Width for Four-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (FCT, 2005)

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. - Andreas Brandstädt; Hoàng-Oanh Le; Raffaele Mosca (Discret. Appl. Math., 2005)

New Graph Classes of Bounded Clique-Width. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca (Theory Comput. Syst., 2005)

Clique-Width for 4-Vertex Forbidden Subgraphs. - Andreas Brandstädt; Joost Engelfriet; Hoàng-Oanh Le; Vadim V. Lozin (Theory Comput. Syst., 2006)

Tree Spanners for Bipartite Graphs and Probe Interval Graphs. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le; Ryuhei Uehara (Algorithmica, 2007)

On the Complexity of Matching Cut in Graphs of Fixed Diameter. - Hoàng-Oanh Le; Van Bang Le (ISAAC, 2016)

Matching Cut in Graphs with Large Minimum Degree. - Sun-Yuan Hsieh; Hoàng-Oanh Le; Van Bang Le; Sheng-Lung Peng (COCOON, 2019)

Constrained Representations of Map Graphs and Half-Squares. - Hoàng-Oanh Le; Van Bang Le (MFCS, 2019)

Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. - Hoàng-Oanh Le; Van Bang Le (Algorithmica, 2019)

A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. - Hoàng-Oanh Le; Van Bang Le (Theor. Comput. Sci., 2019)

Map graphs having witnesses of large girth. - Hoàng-Oanh Le; Van Bang Le (Theor. Comput. Sci., 2019)

Matching Cut in Graphs with Large Minimum Degree. - Chi-Yeh Chen; Sun-Yuan Hsieh; Hoàng-Oanh Le; Van Bang Le; Sheng-Lung Peng (Algorithmica, 2021)

Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. - Hoàng-Oanh Le; Van Bang Le (MFCS, 2022)

Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. - Hoàng-Oanh Le; Van Bang Le (WG, 2023)

The Complexity of Strong Conflict-Free Vertex-Connection k-colorability. - Sun-Yuan Hsieh; Hoàng-Oanh Le; Van Bang Le; Sheng-Lung Peng (COCOON (1), 2024)

The complexity of strong conflict-free vertex-connection k-colorability. - Sun-Yuan Hsieh; Hoàng-Oanh Le; Van Bang Le; Sheng-Lung Peng (CoRR, 2024)

On the d-Claw Vertex Deletion Problem. - Sun-Yuan Hsieh; Hoàng-Oanh Le; Van Bang Le; Sheng-Lung Peng (Algorithmica, 2024)

Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. - Hoàng-Oanh Le; Van Bang Le (Theory Comput. Syst., 2024)