 | 2009 |
|---|
| 50 |       | Andreas Brandstädt,
Martin Charles Golumbic,
Van Bang Le,
Marina Lipshteyn:
Path-Bicolorable Graphs.
Graph Theory, Computational Intelligence and Thought 2009: 172-182 |
| 49 | | Babak Farzad,
Lap Chi Lau,
Van Bang Le,
Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles.
STACS 2009: 397-408 |
| 48 | | Babak Farzad,
Lap Chi Lau,
Van Bang Le,
Nguyen Ngoc Tuy:
Computing Graph Roots Without Short Cycles
CoRR abs/0902.2150: (2009) |
| 47 | | Andreas Brandstädt,
Konrad Engel,
Hans-Dietrich O. F. Gronau,
Van Bang Le:
Preface.
Discrete Applied Mathematics 157(9): 1979 (2009) |
| 2008 |
|---|
| 46 | | Andreas Brandstädt,
Van Bang Le:
Simplicial Powers of Graphs.
COCOA 2008: 160-170 |
| 45 | | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Van Bang Le,
Sheng-Lung Peng:
Probe Ptolemaic Graphs.
COCOON 2008: 468-477 |
| 44 | | Andreas Brandstädt,
Van Bang Le,
R. Sritharan:
Structure and linear-time recognition of 4-leaf powers.
ACM Transactions on Algorithms 5(1): (2008) |
| 43 | | 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) |
| 2007 |
|---|
| 42 | | 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 |
| 41 | | Van Bang Le,
H. N. de Ridder:
Characterisations and Linear-Time Recognition of Probe Cographs.
WG 2007: 226-237 |
| 40 | | 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) |
| 39 | | Van Bang Le,
H. N. de Ridder:
Probe Split Graphs.
Discrete Mathematics & Theoretical Computer Science 9(1): (2007) |
| 38 | | 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) |
| 37 | | 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) |
| 2006 |
|---|
| 36 | | H. N. de Ridder,
Van Bang Le,
D. Bayer:
On probe classes of graphs.
Electronic Notes in Discrete Mathematics 27: 21 (2006) |
| 35 | | 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) |
| 34 | | Dieter Rautenbach,
Andreas Brandstädt,
Van Bang Le:
Distance-Hereditary 5-Leaf Powers.
Electronic Notes in Discrete Mathematics 27: 85-86 (2006) |
| 33 | | Andreas Brandstädt,
Van Bang Le:
Structure and linear time recognition of 3-leaf powers.
Inf. Process. Lett. 98(4): 133-138 (2006) |
| 2005 |
|---|
| 32 | | 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 |
| 31 | | Van Bang Le,
Raffaele Mosca,
Haiko Müller:
On Stable Cutsets in Claw-Free Graphs and Planar Graphs.
WG 2005: 163-174 |
| 30 | | Andreas Brandstädt,
Peter L. Hammer,
Van Bang Le,
Vadim V. Lozin:
Bisplit graphs.
Discrete Mathematics 299(1-3): 11-32 (2005) |
| 2004 |
|---|
| 29 | | Van Bang Le,
Jeremy Spinrad:
Consequences of an algorithm for bridged graphs.
Discrete Mathematics 280(1-3): 271-274 (2004) |
| 28 | | 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) |
| 27 | | Andreas Brandstädt,
Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use.
SIAM J. Discrete Math. 17(3): 341-360 (2004) |
| 26 | | 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) |
| 2003 |
|---|
| 25 | | 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 |
| 24 | | Van Bang Le:
Bipartite-perfect Graphs.
Discrete Applied Mathematics 127(3): 581-599 (2003) |
| 23 | | 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) |
| 22 | | 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) |
| 21 | | Van Bang Le,
Bert Randerath:
On stable cutsets in line graphs.
Theor. Comput. Sci. 1-3(301): 463-475 (2003) |
| 2002 |
|---|
| 20 | | 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 |
| 19 | | Luitpold Babel,
Andreas Brandstädt,
Van Bang Le:
Recognizing the P4-structure of claw-free graphs and a larger graph class.
Discrete Mathematics & Theoretical Computer Science 5(1): 127-146 (2002) |
| 18 | | 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) |
| 17 | | 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) |
| 2001 |
|---|
| 16 |  | Andreas Brandstädt,
Van Bang Le:
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings
Springer 2001 |
| 15 | | Jirí Fiala,
Klaus Jansen,
Van Bang Le,
Eike Seidel:
Graph Subcolorings: Complexity and Algorithms.
WG 2001: 154-165 |
| 14 | | Van Bang Le,
Bert Randerath:
On Stable Cutsets in Line Graphs.
WG 2001: 263-271 |
| 13 | | Chính T. Hoàng,
Van Bang Le:
P4-Colorings and P4-Bipartite Graphs.
Discrete Mathematics & Theoretical Computer Science 4(2): 109-122 (2001) |
| 2000 |
|---|
| 12 | | Andreas Brandstädt,
Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use.
WG 2000: 71-82 |
| 11 | | 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) |
| 10 | | Andreas Brandstädt,
Van Bang Le:
Recognizing the P4-structure of Block Graphs.
Discrete Applied Mathematics 99(1-3): 349-366 (2000) |
| 9 | | Chính T. Hoàng,
Van Bang Le:
On P4-transversals of perfect graphs.
Discrete Mathematics 216(1-3): 195-210 (2000) |
| 8 | | Chính T. Hoàng,
Van Bang Le:
Recognizing Perfect 2-Split Graphs.
SIAM J. Discrete Math. 13(1): 48-55 (2000) |
| 1999 |
|---|
| 7 | | Luitpold Babel,
Andreas Brandstädt,
Van Bang Le:
Recognizing the P4-structure of Bipartite Graphs.
Discrete Applied Mathematics 93(2-3): 157-168 (1999) |
| 6 | | Andreas Brandstädt,
Van Bang Le:
Tree- and Forest-perfect Graphs.
Discrete Applied Mathematics 95(1-3): 141-162 (1999) |
| 5 | | Van Bang Le:
Bipartite-Perfect Graphs.
Electronic Notes in Discrete Mathematics 3: 7-12 (1999) |
| 4 | | Hoàng-Oanh Le,
Van Bang Le:
Optimal tree 3-spanners in directed path graphs.
Networks 34(2): 81-87 (1999) |
| 1998 |
|---|
| 3 | | 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) |
| 1997 |
|---|
| 2 | | 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) |
| 1996 |
|---|
| 1 | | Van Bang Le:
Gallai graphs and anti-Gallai graphs.
Discrete Mathematics 159(1-3): 179-189 (1996) |
