| 2024 | COCOON | The Complexity of Strong Conflict-Free Vertex-Connection k-colorability. | Sun-Yuan Hsieh, Hong-Oanh Le, Van Bang Le, Sheng-Lung Peng |
| 2023 | WG | Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. | Hong-Oanh Le, Van Bang Le |
| 2022 | MFCS | Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. | Hong-Oanh Le, Van Bang Le |
| 2019 | COCOON | Matching Cut in Graphs with Large Minimum Degree. | Sun-Yuan Hsieh, Hong-Oanh Le, Van Bang Le, Sheng-Lung Peng |
| 2019 | MFCS | Constrained Representations of Map Graphs and Half-Squares. | Hong-Oanh Le, Van Bang Le |
| 2017 | COCOON | Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. | Hong-Oanh Le, Van Bang Le |
| 2016 | ISAAC | On the Complexity of Matching Cut in Graphs of Fixed Diameter. | Hong-Oanh Le, Van Bang Le |
| 2005 | FCT | Clique-Width for Four-Vertex Forbidden Subgraphs. | Andreas Brandstdt, Joost Engelfriet, Hong-Oanh Le, Vadim V. Lozin |
| 2003 | WG | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2002 | ISAAC | Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le |
| 2002 | WG | New Graph Classes of Bounded Clique-Width. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Raffaele Mosca |