| 2024 | COCOON | The Complexity of Strong Conflict-Free Vertex-Connection k-colorability. | Sun-Yuan Hsieh, Hong-Oanh Le, Van Bang Le, Sheng-Lung Peng |
| 2024 | WG | On Polynomial Kernelization for Stable Cutset. | Stefan Kratsch, Van Bang Le |
| 2023 | FCT | Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. | Van Bang Le, Christian Rosenke |
| 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 |
| 2021 | COCOON | On the d-Claw Vertex Deletion Problem. | Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng |
| 2021 | STACS | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2021 | WG | The Perfect Matching Cut Problem Revisited. | Van Bang Le, Jan Arne Telle |
| 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 |
| 2015 | CIAC | Algorithms Solving the Matching Cut Problem. | Dieter Kratsch, Van Bang Le |
| 2015 | COCOON | On the Complete Width and Edge Clique Cover Problems. | Van Bang Le, Sheng-Lung Peng |
| 2014 | WG | Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. | Van Bang Le, Andrea Oversberg, Oliver Schaudt |
| 2012 | COCOON | Integral Mixed Unit Interval Graphs. | Van Bang Le, Dieter Rautenbach |
| 2011 | ISAAC | Recognizing Polar Planar Graphs Using New Results for Monopolarity. | Van Bang Le, Ragnar Nevries |
| 2009 | STACS | Computing Graph Roots Without Short Cycles. | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
| 2009 | WG | Hardness Results and Efficient Algorithms for Graph Powers. | Van Bang Le, Nguyen Ngoc Tuy |
| 2008 | COCOA | Simplicial Powers of Graphs. | Andreas Brandstdt, Van Bang Le |
| 2008 | COCOON | Probe Ptolemaic Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng |
| 2007 | WG | Characterisations and Linear-Time Recognition of Probe Cographs. | Van Bang Le, H. N. de Ridder |
| 2005 | FCT | New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. | Andreas Brandstdt, Van Bang Le, Suhail Mahfud |
| 2005 | WG | On Stable Cutsets in Claw-Free Graphs and Planar Graphs. | Van Bang Le, Raffaele Mosca, Haiko Mller |
| 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 |
| 2001 | WG | Graph Subcolorings: Complexity and Algorithms. | Jir Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
| 2001 | WG | On Stable Cutsets in Line Graphs. | Van Bang Le, Bert Randerath |
| 2000 | WG | Split-Perfect Graphs: Characterizations and Algorithmic Use. | Andreas Brandstdt, Van Bang Le |