Van Bang Le

Van Bang Le, Dieter Rautenbach: Integral mixed unit interval graphs. Discrete Applied Mathematics 161(7-8): 1028-1036 (2013)

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Complexity of Finding Graph Roots with Girth Conditions. Algorithmica 62(1-2): 38-53 (2012)

Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter: Mixed unit interval graphs. Discrete Mathematics 312(22): 3357-3363 (2012)

Van Bang Le, Dieter Rautenbach: Integral Mixed Unit Interval Graphs. COCOON 2012: 495-506

Van Bang Le: Two characterizations of chain partitioned probe graphs. Annals OR 188(1): 279-283 (2011)

Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graphs and Combinatorics 27(6): 799-819 (2011)

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

Van Bang Le, Ragnar Nevries: Recognizing Polar Planar Graphs Using New Results for Monopolarity. ISAAC 2011: 120-129

Van Bang Le, Nguyen Ngoc Tuy: The square of a block graph. Discrete Mathematics 310(4): 734-741 (2010)

Andreas Brandstädt, Van Bang Le, Dieter Rautenbach: Exact leaf powers. Theor. Comput. Sci. 411(31-33): 2968-2977 (2010)

Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le: Preface. Discrete Applied Mathematics 157(9): 1979 (2009)

Andreas Brandstädt, Van Bang Le, Dieter Rautenbach: A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discrete Mathematics 309(12): 3843-3852 (2009)

Daniel Bayer, Van Bang Le, H. N. de Ridder: Probe threshold and probe trivially perfect graphs. Theor. Comput. Sci. 410(47-49): 4812-4822 (2009)

Andreas Brandstädt, Van Bang Le: Simplicial powers of graphs. Theor. Comput. Sci. 410(52): 5443-5454 (2009)

Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn: Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles. STACS 2009: 397-408

Van Bang Le, Nguyen Ngoc Tuy: Hardness Results and Efficient Algorithms for Graph Powers. WG 2009: 238-249

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy: Computing Graph Roots Without Short Cycles. CoRR abs/0902.2150 (2009)

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

Andreas Brandstädt, Van Bang Le, R. Sritharan: Structure and linear-time recognition of 4-leaf powers. ACM Transactions on Algorithms 5(1) (2008)

Andreas Brandstädt, Van Bang Le: Simplicial Powers of Graphs. COCOA 2008: 160-170

David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng: Probe Ptolemaic Graphs. COCOON 2008: 468-477

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

Van Bang Le, H. N. de Ridder: Probe Split Graphs. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)

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

Van Bang Le, Bert Randerath, Ingo Schiermeyer: On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2): 330-335 (2007)

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

Van Bang Le, H. N. de Ridder: Characterisations and Linear-Time Recognition of Probe Cographs. WG 2007: 226-237

H. N. de Ridder, Van Bang Le, Daniel Bayer: On probe classes of graphs. Electronic Notes in Discrete Mathematics 27: 21 (2006)

Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le: Graph classes related to chordal graphs and chordal bipartite graphs. Electronic Notes in Discrete Mathematics 27: 73-74 (2006)

Dieter Rautenbach, Andreas Brandstädt, Van Bang Le: Distance-Hereditary 5-Leaf Powers. Electronic Notes in Discrete Mathematics 27: 85-86 (2006)

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

Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)

Andreas Brandstädt, Van Bang Le, Suhail Mahfud: New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT 2005: 516-527

Van Bang Le, Raffaele Mosca, Haiko Müller: On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174

Van Bang Le, Jeremy Spinrad: Consequences of an algorithm for bridged graphs. Discrete Mathematics 280(1-3): 271-274 (2004)

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. Inf. Process. Lett. 89(4): 165-173 (2004)

Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discrete Math. 17(3): 341-360 (2004)

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

Van Bang Le: Bipartite-perfect Graphs. Discrete Applied Mathematics 127(3): 581-599 (2003)

Andreas Brandstädt, Chính T. Hoàng, Van Bang Le: Stability number of bull- and chair-free graphs revisited. Discrete Applied Mathematics 131(1): 39-50 (2003)

Hoàng-Oanh Le, Van Bang Le, Haiko Müller: Splitting a graph into disjoint induced paths or cycles. Discrete Applied Mathematics 131(1): 199-212 (2003)

Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. SIAM J. Discrete Math. 16(4): 635-650 (2003)

Van Bang Le, Bert Randerath: On stable cutsets in line graphs. Theor. Comput. Sci. 1-3(301): 463-475 (2003)

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118

Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of claw-free graphs and a larger graph class. Discrete Mathematics & Theoretical Computer Science 5(1): 127-146 (2002)

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

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

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

Chính T. Hoàng, Van Bang Le: P4-Colorings and P4-Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 109-122 (2001)

Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165

Van Bang Le, Bert Randerath: On Stable Cutsets in Line Graphs. WG 2001: 263-271

Andreas Brandstädt, Van Bang Le (Eds.): Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Lecture Notes in Computer Science 2204, Springer 2001, isbn 3-540-42707-4

Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of Block Graphs. Discrete Applied Mathematics 99(1-3): 349-366 (2000)

Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak: On stable cutsets in graphs. Discrete Applied Mathematics 105(1-3): 39-50 (2000)

Chính T. Hoàng, Van Bang Le: On P₄-transversals of perfect graphs. Discrete Mathematics 216(1-3): 195-210 (2000)

Van Bang Le: Some conjectures on perfect graphs. Discussiones Mathematicae Graph Theory 20(1): 155-159 (2000)

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): 381-387 (2000)

Chính T. Hoàng, Van Bang Le: Recognizing Perfect 2-Split Graphs. SIAM J. Discrete Math. 13(1): 48-55 (2000)

Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82

Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P₄-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)

Andreas Brandstädt, Van Bang Le: Tree- and Forest-perfect Graphs. Discrete Applied Mathematics 95(1-3): 141-162 (1999)

Van Bang Le: Bipartite-Perfect Graphs. Electronic Notes in Discrete Mathematics 3: 7-12 (1999)

Van Bang Le: A good characterization of cograph contractions. Journal of Graph Theory 30(4): 309-318 (1999)

Hoàng-Oanh Le, Van Bang Le: Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999)

Andreas Brandstädt, Van Bang Le, Thomas Szymczak: The Complexity of some Problems Related to Graph 3-colorability. Discrete Applied Mathematics 89(1-3): 59-73 (1998)

Andreas Brandstädt, Van Bang Le, Thomas Szymczak: Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics 177(1-3): 9-16 (1997)

Stefan Hougardy, Van Bang Le, Annegret Wagler: Wing-triangulated graphs are perfect. Journal of Graph Theory 24(1): 25-31 (1997)

Van Bang Le: Gallai graphs and anti-Gallai graphs. Discrete Mathematics 159(1-3): 179-189 (1996)

Van Bang Le: Cycle-perfect graphs are perfect. Journal of Graph Theory 23(4): 351-353 (1996)

Van Bang Le, Erich Prisner: Iteratedk-line graphs. Graphs and Combinatorics 10(2-4): 193-203 (1994)

Van Bang Le: Perfect k-line graphs and k-total graphs. Journal of Graph Theory 17(1): 65-73 (1993)

Van Bang Le, Erich Prisner: On inverse problems for the cycle graph operator. Graphs and Combinatorics 8(2): 155-164 (1992)