On inverse problems for the cycle graph operator. - Van Bang Le; Erich Prisner (Graphs Comb., 1992)

Perfect k-line graphs and k-total graphs. - Van Bang Le (J. Graph Theory, 1993)

Iteratedk-line graphs. - Van Bang Le; Erich Prisner (Graphs Comb., 1994)

Gallai graphs and anti-Gallai graphs. - Van Bang Le (Discret. Math., 1996)

Cycle-perfect graphs are perfect. - Van Bang Le (J. Graph Theory, 1996)

Duchet-type theorems for powers of HHD-free graphs. - Andreas Brandstädt; Van Bang Le; Thomas Szymczak (Discret. Math., 1997)

Wing-triangulated graphs are perfect. - Stefan Hougardy; Van Bang Le; Annegret Wagler (J. Graph Theory, 1997)

The Complexity of some Problems Related to Graph 3-colorability. - Andreas Brandstädt; Van Bang Le; Thomas Szymczak (Discret. Appl. Math., 1998)

Recognizing the P4-structure of Bipartite Graphs. - Luitpold Babel; Andreas Brandstädt; Van Bang Le (Discret. Appl. Math., 1999)

Tree- and Forest-perfect Graphs. - Andreas Brandstädt; Van Bang Le (Discret. Appl. Math., 1999)

A good characterization of cograph contractions. - Van Bang Le (J. Graph Theory, 1999)

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

On stable cutsets in graphs. - Andreas Brandstädt; Feodor F. Dragan; Van Bang Le; Thomas Szymczak (Discret. Appl. Math., 2000)

Recognizing the P4-structure of Block Graphs. - Andreas Brandstädt; Van Bang Le (Discret. Appl. Math., 2000)

On P4-transversals of perfect graphs. - Chính T. Hoàng; Van Bang Le (Discret. Math., 2000)

Some conjectures on perfect graphs. - Van Bang Le (Discuss. Math. Graph Theory, 2000)

Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles. - Andreas Brandstädt; Van Bang Le; Stephan Olariu (Graphs Comb., 2000)

Recognizing Perfect 2-Split Graphs. - Chính T. Hoàng; Van Bang Le (SIAM J. Discret. Math., 2000)

P4-Colorings and P4-Bipartite Graphs. - Chính T. Hoàng; Van Bang Le (Discret. Math. Theor. Comput. Sci., 2001)

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

Recognizing the P4-structure of claw-free graphs and a larger graph class. - Luitpold Babel; Andreas Brandstädt; Van Bang Le (Discret. Math. Theor. Comput. Sci., 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)

Stability number of bull- and chair-free graphs revisited. - Andreas Brandstädt; Chính T. Hoàng; Van Bang Le (Discret. Appl. Math., 2003)

Bipartite-perfect Graphs. - Van Bang Le (Discret. Appl. Math., 2003)

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

Graph Subcolorings: Complexity and Algorithms. - Jirí Fiala 001; Klaus Jansen; Van Bang Le; Eike Seidel (SIAM J. Discret. Math., 2003)

On stable cutsets in line graphs. - Van Bang Le; Bert Randerath (Theor. Comput. Sci., 2003)

Consequences of an algorithm for bridged graphs. - Van Bang Le; Jeremy P. Spinrad (Discret. Math., 2004)

Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. - Andreas Brandstädt; Van Bang Le; H. N. de Ridder (Inf. Process. Lett., 2004)

Split-Perfect Graphs: Characterizations and Algorithmic Use. - Andreas Brandstädt; Van Bang Le (SIAM J. Discret. Math., 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)

Bisplit graphs. - Andreas Brandstädt; Peter L. Hammer; Van Bang Le; Vadim V. Lozin (Discret. Math., 2005)

Distance-Hereditary 5-Leaf Powers. - Dieter Rautenbach; Andreas Brandstädt; Van Bang Le (Electron. Notes Discret. Math., 2006)

On probe classes of graphs. - H. N. de Ridder; Van Bang Le; Daniel Bayer (Electron. Notes Discret. Math., 2006)

Graph classes related to chordal graphs and chordal bipartite graphs. - Nguyen Ngoc Tuy; Jörg Bornemann; Van Bang Le (Electron. Notes Discret. Math., 2006)

Structure and linear time recognition of 3-leaf powers. - Andreas Brandstädt; Van Bang Le (Inf. Process. Lett., 2006)

Linear-time certifying recognition for partitioned probe cographs. - Van Bang Le; H. N. de Ridder (Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 2007)

Characterisations and Linear-Time Recognition of Probe Cographs. - Van Bang Le; H. N. de Ridder (WG, 2007)

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)

Probe Split Graphs. - Van Bang Le; H. N. de Ridder (Discret. Math. Theor. Comput. Sci., 2007)

New applications of clique separator decomposition for the Maximum Weight Stable Set problem. - Andreas Brandstädt; Van Bang Le; Suhail Mahfud (Theor. Comput. Sci., 2007)

On the complexity of 4-coloring graphs without long induced paths. - Van Bang Le; Bert Randerath; Ingo Schiermeyer (Theor. Comput. Sci., 2007)

Probe Ptolemaic Graphs. - David B. Chandler; Maw-Shang Chang; Ton Kloks; Van Bang Le; Sheng-Lung Peng (COCOON, 2008)

On stable cutsets in claw-free graphs and planar graphs. - Van Bang Le; Raffaele Mosca; Haiko Müller (J. Discrete Algorithms, 2008)

Structure and linear-time recognition of 4-leaf powers. - Andreas Brandstädt; Van Bang Le; R. Sritharan (ACM Trans. Algorithms, 2008)

Computing Graph Roots Without Short Cycles. - Babak Farzad; Lap Chi Lau; Van Bang Le; Nguyen Ngoc Tuy (STACS, 2009)

Hardness Results and Efficient Algorithms for Graph Powers. - Van Bang Le; Nguyen Ngoc Tuy (WG, 2009)

Preface. - Andreas Brandstädt; Konrad Engel; Hans-Dietrich O. F. Gronau; Van Bang Le (Discret. Appl. Math., 2009)

A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. - Andreas Brandstädt; Van Bang Le; Dieter Rautenbach (Discret. Math., 2009)

Probe threshold and probe trivially perfect graphs. - Daniel Bayer; Van Bang Le; H. N. de Ridder (Theor. Comput. Sci., 2009)

Simplicial powers of graphs. - Andreas Brandstädt; Van Bang Le (Theor. Comput. Sci., 2009)

The square of a block graph. - Van Bang Le; Nguyen Ngoc Tuy (Discret. Math., 2010)

Exact leaf powers. - Andreas Brandstädt; Van Bang Le; Dieter Rautenbach (Theor. Comput. Sci., 2010)

Recognizing Polar Planar Graphs Using New Results for Monopolarity. - Van Bang Le; Ragnar Nevries (ISAAC, 2011)

Two characterizations of chain partitioned probe graphs. - Van Bang Le (Ann. Oper. Res., 2011)

Path-Bicolorable Graphs. - Andreas Brandstädt; Martin Charles Golumbic; Van Bang Le; Marina Lipshteyn (Graphs Comb., 2011)

A good characterization of squares of strongly chordal split graphs. - Van Bang Le; Nguyen Ngoc Tuy (Inf. Process. Lett., 2011)

Complexity of Finding Graph Roots with Girth Conditions. - Babak Farzad; Lap Chi Lau; Van Bang Le; Nguyen Ngoc Tuy (Algorithmica, 2012)

Mixed unit interval graphs. - Mitre Costa Dourado; Van Bang Le; Fábio Protti; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Discret. Math., 2012)

Extremal Graphs Having No Stable Cutset. - Van Bang Le; Florian Pfender (Electron. J. Comb., 2013)

Integral mixed unit interval graphs. - Van Bang Le; Dieter Rautenbach (Discret. Appl. Math., 2013)

Squares of $3$-sun-free split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (CoRR, 2014)

Preface. - Andreas Brandstädt; Konrad Engel; Hans-Dietrich O. F. Gronau; Roger Labahn; Van Bang Le; Florian Pfender (Discret. Appl. Math., 2014)

On opposition graphs, coalition graphs, and bipartite permutation graphs. - Van Bang Le (Discret. Appl. Math., 2014)

A note on efficient domination in a superclass of P5-free graphs. - Andreas Brandstädt; Van Bang Le (Inf. Process. Lett., 2014)

Complexity and algorithms for recognizing polar and monopolar graphs. - Van Bang Le; Ragnar Nevries (Theor. Comput. Sci., 2014)

Complexity results for rainbow matchings. - Van Bang Le; Florian Pfender (Theor. Comput. Sci., 2014)

Forests and trees among Gallai graphs. - Felix Joos; Van Bang Le; Dieter Rautenbach (Discret. Math., 2015)

Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (Theor. Comput. Sci., 2015)

Characterizing and recognizing probe block graphs. - Van Bang Le; Sheng-Lung Peng (Theor. Comput. Sci., 2015)

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

Algorithms solving the Matching Cut problem. - Dieter Kratsch; Van Bang Le (Theor. Comput. Sci., 2016)

A unified approach to recognize squares of split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (Theor. Comput. Sci., 2016)

Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. - Feodor F. Dragan; Dieter Kratsch; Van Bang Le (Discret. Appl. Math., 2017)

Characterization and recognition of some opposition and coalition graph classes. - Van Bang Le; Thomas Podelleck (Discret. Appl. Math., 2017)

Good characterizations and linear time recognition for 2-probe block graphs. - Van Bang Le; Sheng-Lung Peng (Discret. Appl. Math., 2017)

On the complete width and edge clique cover problems. - Van Bang Le; Sheng-Lung Peng (J. Comb. Optim., 2018)

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: Kernelization, single-exponential time FPT, and exact exponential algorithms. - Christian Komusiewicz; Dieter Kratsch; Van Bang Le (Discret. Appl. Math., 2020)

Color-line and proper color-line graphs. - Van Bang Le; Florian Pfender (Discret. Appl. Math., 2020)

On the d-Claw Vertex Deletion Problem. - Sun-Yuan Hsieh; Van Bang Le; Sheng-Lung Peng (COCOON, 2021)

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)

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. - Petr A. Golovach; Christian Komusiewicz; Dieter Kratsch; Van Bang Le (J. Comput. Syst. Sci., 2022)

The perfect matching cut problem revisited. - Van Bang Le; Jan Arne Telle (Theor. Comput. Sci., 2022)

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

Maximizing Matching Cuts. - Van Bang Le; Felicia Lucke; Daniël Paulusma; Bernard Ries (CoRR, 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)

On Polynomial Kernelization for Stable Cutset. - Stefan Kratsch; Van Bang Le (WG, 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)

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. - Van Bang Le; Christian Rosenke (J. Graph Algorithms Appl., 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)