Van Bang Le

2007
37	EE	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
36	EE	Van Bang Le, H. N. de Ridder: Characterisations and Linear-Time Recognition of Probe Cographs. WG 2007: 226-237
35	EE	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)
34	EE	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)
33	EE	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
32	EE	Andreas Brandstädt, Van Bang Le: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4): 133-138 (2006)
2005
31	EE	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
30	EE	Van Bang Le, Raffaele Mosca, Haiko Müller: On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174
29	EE	Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)
2004
28	EE	Van Bang Le, Jeremy Spinrad: Consequences of an algorithm for bridged graphs. Discrete Mathematics 280(1-3): 271-274 (2004)
27	EE	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)
26	EE	Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discrete Math. 17(3): 341-360 (2004)
25	EE	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
24	EE	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
23	EE	Van Bang Le: Bipartite-perfect Graphs. Discrete Applied Mathematics 127(3): 581-599 (2003)
22	EE	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)
21	EE	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)
20	EE	Van Bang Le, Bert Randerath: On stable cutsets in line graphs. Theor. Comput. Sci. 1-3(301): 463-475 (2003)
2002
19	EE	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
18	EE	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)
17	EE	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)
16	EE	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
15		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
14	EE	Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165
13	EE	Van Bang Le, Bert Randerath: On Stable Cutsets in Line Graphs. WG 2001: 263-271
12	EE	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
11	EE	Andreas Brandstädt, Van Bang Le: Split-Perfect Graphs: Characterizations and Algorithmic Use. WG 2000: 71-82
10		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)
9	EE	Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Block Graphs. Discrete Applied Mathematics 99(1-3): 349-366 (2000)
8	EE	Chính T. Hoàng, Van Bang Le: On P4-transversals of perfect graphs. Discrete Mathematics 216(1-3): 195-210 (2000)
7	EE	Chính T. Hoàng, Van Bang Le: Recognizing Perfect 2-Split Graphs. SIAM J. Discrete Math. 13(1): 48-55 (2000)
1999
6	EE	Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)
5	EE	Andreas Brandstädt, Van Bang Le: Tree- and Forest-perfect Graphs. Discrete Applied Mathematics 95(1-3): 141-162 (1999)
4	EE	Hoàng-Oanh Le, Van Bang Le: Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999)
1998
3	EE	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	EE	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	EE	Van Bang Le: Gallai graphs and anti-Gallai graphs. Discrete Mathematics 159(1-3): 179-189 (1996)

Coauthor Index

1	Luitpold Babel	[6] [18]
2	Andreas Brandstädt	[2] [3] [5] [6] [9] [10] [11] [15] [16] [18] [19] [21] [24] [25] [26] [27] [29] [31] [32] [34] [35]
3	Feodor F. Dragan	[10] [19] [24] [25] [35]
4	Jirí Fiala	[14]
5	Peter L. Hammer	[29]
6	Chính T. Hoàng	[7] [8] [12] [21]
7	Klaus Jansen	[14]
8	Hoàng-Oanh Le	[4] [16] [17] [19] [22] [24] [25] [35]
9	Vadim V. Lozin	[29]
10	Suhail Mahfud	[31] [34]
11	Raffaele Mosca	[30]
12	Haiko Müller	[22] [30]
13	Bert Randerath	[13] [20] [33]
14	H. N. de Ridder	[27] [36] [37]
15	Ingo Schiermeyer	[33]
16	Eike Seidel	[14]
17	Jeremy Spinrad	[28]
18	Thomas Szymczak	[2] [3] [10]
19	Ryuhei Uehara	[24] [35]