Lê Văn Bằng: Research

Andreas Brandstädt, Van Bang Le, Dieter Rautenbach,
A Forbidden Induced Subgraph Characterization of Distance-hereditary 5-Leaf Powers, Discrete Math. 309 (2009) 3843-3852, pdf
Andreas Brandstädt, Van Bang Le, R. Sritharan,
Structure and Linear Time Recognition of 4-Leaf Powers, ACM Transactions on Algorithms 5 (2008), Article No. 11
Van Bang Le, Raffaele Mosca, Haiko Müller,
On Stable Cutsets in Claw-free Graphs and Planar Graphs, J. Discrete Algorithms 6 (2008) 256-276, pdf
Van Bang Le, Bert Randerath, Ingo Schiermeyer,
On the Complexity of 4-Coloring Graphs Without Long Induced Paths, Theoretical Computer Science 389 (1-2) (2007) 330-335, pdf
Jiri Fiala, Van Bang Le,
The Subchromatic Index of Graphs, Tatra Mountain Mathematical Publications 36 (2007) 129-146, pdf
Van Bang Le, Ernst de Ridder, Probe Split Graphs, Discrete Mathematics and Theoretical Computer Science 9 (2007) 207-238, pdf
Andreas Brandstädt, Feodor Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs, Algorithmica 47 (2007) 27-51, pdf
Andreas Brandstädt, Van Bang Le, Suhail Mahfud,
New Applications of the Clique Separator Decomposition for the Maximum Weight Stable Set Problem, Theoretical Computer Science 370 (2007) 229-239, pdf
Andreas Brandstädt, Van Bang Le,
Structure and Linear Time Recognition of 3-Leaf Powers, Information Processing Letters 98 (2006) 133-138, pdf
Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
Bisplit graphs, Discrete Mathematics 299 (1-3) (2005) 11-32, pdf
Van Bang Le, Jerry Spinrad, Consequences of an Algorithm for Bridged Graphs, Discrete Mathematics 280 (1-3) (2004) 271-274, pdf
Andreas Brandstädt, Van Bang Le, Split-perfect Graphs: Characterizations and Algorithmic Use,
SIAM J. Discrete Mathematics 17 (3) (2004) 341-360, pdf
Andreas Brandstädt, Van Bang Le, H.N. de Ridder,
Efficient Robust Algorithms for the Maximum Weight Stable Set Problem in Chair-free Graph Classes,
Information Processing Letters 89 (4) (2004) 165-173, pdf
Andreas Brandstädt, Feodor Dragan, Hoang-Oanh Le, Van Bang Le,
Tree Spanners on Chordal Graphs: Complexity and Algorithms, Theoretical Computer Science 310 (1-3) (2004) 329-354, pdf
Andreas Brandstädt, Chinh T. Hoang, Van Bang Le,
Stability Number of Bull- and Chair-free Graphs Revisited, Discrete Applied Mathematics 131 (1) (2003) 39-50, pdf
H.-Oanh Le, Van Bang Le, Haiko Müller,
Splitting a Graph Into Disjoint Induced Paths or Cycles, Discrete Applied Mathematics 131 (1) (2003) 199-212, pdf
Jiri Fiala, Klaus Jansen, Van Bang Le, Eike Seidel,
Graph Subcolorings: Complexity and Algorithms, SIAM J. Discrete Mathematics 16 (4) (2003) 635-650, pdf
Van Bang Le,
Bipartite-Perfect Graphs, Discrete Applied Mathematics 127 (3) (2003) 581-599
Van Bang Le, Bert Randerath,
On Stable Cutsets in Line Graphs, Theoretical Computer Science 301 (1-3) (2003) 463-475
Luitpold Babel, Andreas Brandstädt, Van Bang Le,
Recognizing the P₄ -Structure of Claw-free Graphs and a Larger Graph Class,
Discrete Mathematics and Theoretical Computer Science 5 (1) (2002) 127-146 (electronic)
Andreas Brandstädt, H.-Oanh Le, Van Bang Le,
On alpha-redundant Vertices in P₅ -free Graphs, Information Processing Letters 82 (3) (2002) 119-122
H.-Oanh Le, Van Bang Le,
The NP-Completeness of (1,r)-Subcolorability of Cubic Graphs, Information Processing Letters 81 (3) (2002) 157-162
Chinh T. Hoang, Van Bang Le,
P₄ -Colorings and P₄ -Bipartite Graphs, Discrete Mathematics and Theoretical Computer Science 4 (2) (2001) 109-122 (electronic)
Andreas Brandstädt, Van Bang Le & Stephan Olariu,
Efficiently Recognizing the P₄ -Structure of Trees and of Bipartite Graphs Without Short Cycles,
Graphs and Combinatorics 16 (4) (2000) 381-387
Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak,
On Stable Cut-Sets in Graphs, Discrete Applied Mathematics 105 (2000) 39-50, pdf
Van Bang Le,
Some Conjectures on Perfect Graphs, Discussiones Mathematicae Graph Theory 20 (2000) 155-159
Chinh T. Hoang, Van Bang Le,
Recognizing Perfect 2-Split Graphs, SIAM J. Discrete Mathematics 13 (2000) 48-55
Chinh T. Hoang, Van Bang Le,
On P₄ -Transversals of Perfect Graphs, Discrete Mathematics 216 (2000) 195-210
Andreas Brandstädt, Van Bang Le,
Recognizing the P₄ -structure of Block Graphs, Discrete Applied Mathematics 99 (1-3) (2000) 349-366
Luitpold Babel, Andreas Brandstädt, Van Bang Le,
Recognizing the P₄ -Structure of Bipartite Graphs, Discrete Applied Mathematics 93 (2-3) (1999) 157-168
Van Bang Le,
A Good Characterization of Cograph Contractions, J. Graph Theory 30 (1999) 309-318, pdf
H.-Oanh Le, Van Bang Le,
Optimal Tree 3-Spanners in Directed Path Graphs, Networks 34 (2) (1999) 81-87, pdf. Erratum
Andreas Brandstädt, Van Bang Le,
Tree- and Forest-Perfect Graphs, Discrete Applied Mathematics 95 (1-3) (1999) 141-162
Andreas Brandstädt, Van Bang Le, Thomas Szymczak,
The Complexity of Some Problems Related to Graph 3-Colorability,
Discrete Applied Mathematics 89 (1-3) (1998) 59-73
Andreas Brandstädt, Van Bang Le, Thomas Szymczak,
Duchet-Type Theorems for Powers of HHD-Free Graphs, Discrete Mathematics 177 (1997) 9-16
Stefan Hougardy, Van Bang Le & Annegret Wagler,
Wing-Triangulated Graphs Are Perfect, J. Graph Theory 24 (1997) 25-31
Van Bang Le,
Gallai Graphs and Anti-Gallai Graphs, Discrete Mathematics 159 (1996) 179-189, pdf
Van Bang Le,
Cycle-Perfect Graphs Are Perfect, J. Graph Theory 23 (1996) 351-353
Van Bang Le, Erich Prisner,
Iterated k-Line Graphs, Graphs and Combinatorics 10 (1994) 193-203
Van Bang Le,
Perfect k-Line Graphs and k-Total Graphs, J. Graph Theory 17 (1993) 65-73
Van Bang Le,
Mortality of Iterated Gallai Graphs, Periodica Mathematica Hungarica 27 (1993) 105-124, pdf
Van Bang Le, Erich Prisner,
On Inverse Problems of the Cycle Graph Operator, Graphs and Combinatorics 8 (1992) 155-164

To appear

A. Brandstädt, Van Bang Le,
Simplicial powers of graphs, Theoretical Computer Science. pdf
Daniel Bayer, Van Bang Le, H.N. (Ernst) de Ridder, Probe threshold and probe trivially perfect graphs, Theoretical Computer Science. pdf

Other

Van Bang Le, Ngoc Tuy Nguyen, Hardness results and efficient algorithms for graph powers, WG 2009.
Van Bang Le, Zsolt Tuza, Finding optimal rainbow connection is hard, Manuscript, 2009.
Babak Farzad, Lap Chi Lau, Van Bang Le, Ngoc Tuy Nguyen, Computing graph roots without short cycles, STACS 2009, pdf.
A. Brandstädt, M.C. Golumbic,Van Bang Le, M. Lipshteyn, Path-bicolorable graphs,
Lecture Notes in Computer Science 5420 (2009) 172-182 (Golumbic Festschrift), pdf .
Van Bang Le, Ngoc Tuy Nguyen, The square of a block graph, Manuscript, 2009.
A. Brandstädt, Van Bang Le,
Simplicial powers of graphs, COCOA 2008. Lecture Notes in Computer Science 5165 (2008) 160-170, pdf
David D. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng,
Probe ptolemaic graphs, COCOON 2008. Lecture Notes in Computer Science 5092 (2008) 468-477, pdf
Van Bang Le, H.N. (Ernst) de Ridder, Characterisations and linear-time recognition of probe cographs, WG 2007.
Lecture Notes in Computer Science 4769 (2007) 226-237, pdf
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach,
Exact Leaf Powers, Manuscript, November 2005
Andreas Brandstädt, Van Bang Le, Suhail Mahfud,
New Applications of the Clique Separator Decomposition for the Maximum Weight Stable Set Problem, FCT 2005,
Lecture Notes in Computer Science 3623 (2005) 516-527, pdf
Van Bang Le, Raffaele Mosca, Haiko Müller,
On Stable Cutsets in Claw-free Graphs and Planar Graphs, WG 2005, Lecture Notes in Computer Science 3787 (2005) 163-174, pdf
Andreas Brandstädt, Feodor Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs, WG 2003, Lecture Notes in Computer Science 2880 (2003) 106-118, pdf
Andreas Brandstädt, Feodor Dragan, Hoang-Oanh Le, Van Bang Le,
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems, ISAAC 2002, Lecture Notes in Computer Science 2518 (2002) 163-174
Jiri Fiala, Klaus Jansen, Van Bang Le, Eike Seidel, Graph Subcolorings: Complexity and Algorithms, WG 2001, Lecture Notes in Computer Science 2204 (2001) 154-165
Van Bang Le, Bert Randerath, On Stable Cutsets in Line Graphs, WG 2001, Lecture Notes in Computer Science 2204 (2001) 263-271
Andreas Brandstädt, Van Bang Le, Split-perfect Graphs: Characterizations and Algorithmic Use, WG 2000, Lecture Notes in Computer Science 1928 (2000) 71-82
Andreas Brandstädt, Van Bang Le & Stephan Olariu, Linear-Time Recognition of the P4-structure of Trees, Rutcor Research Report RRR 19-96, Rutgers University, 1996
Andreas Brandstädt, Feodor F. Dragan & Van Bang Le, Induced Cycles and Odd Powers of Graphs, Universität Rostock, FB Informatik, 1995. Preprint CS-09-95
Van Bang Le, P₄ -Structure in Special Graphs: Algorithms and Perfection, Habilitationsschrift, FB Informatik, Universität Rostock, 1999
Van Bang Le, Gallai-Graphs and Their Iteration Behavior, Dissertation, FB Mathematik, Technische Universität Berlin, 1994
Van Bang Le, Erich Prisner, Facet Graphs of Pure Simplical Complexes and Related Concepts, Universität Hamburg, Preprint No. 19, 1992
Van Bang Le, Forcing Graphs and Forbidden Subgraphs, Technische Universität Berlin, Preprint No. 281, 1991
Van Bang Le, Transitive Kantenforcierung und perfekte Graphen, Diplomarbeit, FB Mathematik, Technische Universität Berlin, 1988

Books & Editing

Andreas Brandstädt, Van Bang Le & Jerry Spinrad,
Graph Classes: A Survey, SIAM, Philadelphia, 1999.
Andreas Brandstädt, Van Bang Le (Eds.)
Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001) ,
Lecture Notes in Computer Science, Vol. 2204, Springer, 2001.
Andreas Brandstädt, Konrad Engel, Hans-Dietrich Gronau, Van Bang Le (Eds.)
Proceedings of the 3rd conference on Optimal Discrete Structures and Algorithms (ODSA 2006),
Discrete Applied Mathematics 157 (9) (2009).

Van Bang Le, Lehrstuhl für Theoretische Informatik. accessed since ,