Hoàng-Oanh Le

2007
15	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)
2006
14	EE	Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006)
2005
13	EE	Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
12	EE	Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca: Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. Discrete Applied Mathematics 145(2): 232-241 (2005)
11	EE	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005)
2004
10	EE	Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca: Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. 15(1): 163-185 (2004)
9	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
8	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
7	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)
6	EE	Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe: Structure and stability number of chair-, co-P- and gem-free graphs revisited. Inf. Process. Lett. 86(3): 161-167 (2003)
2002
5	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
4	EE	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. WG 2002: 57-67
3	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)
2	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)
1999
1	EE	Hoàng-Oanh Le, Van Bang Le: Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999)

Coauthor Index

1	Andreas Brandstädt	[2] [4] [5] [6] [8] [9] [10] [11] [12] [13] [14] [15]
2	Feodor F. Dragan	[4] [5] [8] [9] [11] [15]
3	Joost Engelfriet	[13] [14]
4	Van Bang Le	[1] [2] [3] [5] [7] [8] [9] [15]
5	Vadim V. Lozin	[13] [14]
6	Raffaele Mosca	[4] [10] [11] [12]
7	Haiko Müller	[7]
8	Ryuhei Uehara	[8] [15]
9	Jean-Marie Vanherpe	[6]