|
Search the dblp DataBase
Hoàng-Oanh Le:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
Clique-Width for Four-Vertex Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP] FCT, 2005, pp:185-196 [Conf]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. [Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:163-174 [Conf]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. [Citation Graph (0, 0)][DBLP] WG, 2003, pp:106-118 [Conf]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
New Graph Classes of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP] WG, 2002, pp:57-67 [Conf]
- Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:145, n:2, pp:232-241 [Journal]
- Hoàng-Oanh Le, Van Bang Le, Haiko Müller
Splitting a graph into disjoint induced paths or cycles. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:199-212 [Journal]
- Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:163-185 [Journal]
- Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le
On alpha-redundant vertices in P5-free graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:3, pp:119-122 [Journal]
- Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe
Structure and stability number of chair-, co-P- and gem-free graphs revisited. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:3, pp:161-167 [Journal]
- Hoàng-Oanh Le, Van Bang Le
The NP-completeness of (1, r)-subcolorability of cubic graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:3, pp:157-162 [Journal]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
New Graph Classes of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:5, pp:623-645 [Journal]
- Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
Clique-Width for 4-Vertex Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:4, pp:561-590 [Journal]
- Hoàng-Oanh Le, Van Bang Le
Optimal tree 3-spanners in directed path graphs. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:2, pp:81-87 [Journal]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
Tree spanners on chordal graphs: complexity and algorithms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:329-354 [Journal]
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:1, pp:27-51 [Journal]
Search in 0.006secs, Finished in 0.007secs
|