×
Author ID: le.hoang-oanh Recent zbMATH articles by "Hoàng-Oanh Le"
Published as: Le, Hoang-Oanh; Le, Hoàng-Oanh; Hoàng-Oanh Le; Le, H.-O.
External Links: MGP
Documents Indexed: 29 Publications since 1999, including 1 Additional arXiv Preprint
Co-Authors: 16 Co-Authors with 29 Joint Publications
754 Co-Co-Authors

Citations contained in zbMATH Open

27 Publications have been cited 275 times in 174 Documents Cited by Year
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
38
2006
Tree spanners on chordal graphs: complexity and algorithms. Zbl 1049.05075
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Le, Van Bang
29
2004
Gem- and co-gem-free graphs have bounded clique-width. Zbl 1101.68719
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
26
2004
Chordal co-gem-free and (\(P_{5}\),gem)-free graphs have bounded clique-width. Zbl 1084.05056
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
26
2005
New graph classes of bounded clique-width. Zbl 1084.68088
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
25
2005
Additive tree spanners. Zbl 1041.05024
Kratsch, Dieter; Le, Hoàng-Oanh; Müller, Haiko; Prisner, Erich; Wagner, Dorothea
22
2003
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1107.68062
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
15
2007
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Zbl 1422.68125
Le, Hoang-Oanh; Le, Van Bang
14
2019
Splitting a graph into disjoint induced paths or cycles. Zbl 1073.68031
Hoàng-Oanh Le; Van Bang Le; Müller, Haiko
12
2003
Matching cut in graphs with large minimum degree. Zbl 1512.68202
Chen, Chi-Yeh; Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
11
2021
Structure and stability number of chair-, co-P- and gem-free graphs revisited. Zbl 1173.68597
Brandstädt, Andreas; Le, Hoàng-Oanh; Vanherpe, Jean-Marie
8
2003
New graph classes of bounded clique-width. Zbl 1022.68090
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
7
2002
Optimal tree 3-spanners in directed path graphs. Zbl 0959.90065
Le, Hoàng-Oanh; Le, Van Bang
6
1999
On the complexity of matching cut in graphs of fixed diameter. Zbl 1398.68197
Le, Hoang-Oanh; Le, Van Bang
6
2016
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs. Zbl 1013.68290
Brandstädt, Andreas; Le, Hoàng-Oanh; Le, Van Bang
5
2002
Matching cut in graphs with large minimum degree. Zbl 1534.68171
Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
5
2019
The NP-completeness of (1,r)-subcolorability of cubic graphs. Zbl 1032.68122
Le, Hoàng-Oanh; Le, Van Bang
4
2002
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. Zbl 1434.68365
Le, Hoang-Oanh; Le, Van Bang
4
2019
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. Zbl 1431.68097
Le, Hoang-Oanh; Le, Van Bang
2
2017
Map graphs having witnesses of large girth. Zbl 1423.05180
Le, Hoang-Oanh; Le, Van Bang
2
2019
Complexity of the cluster vertex deletion problem on \(H\)-free graphs. Zbl 07893106
Le, Hoang-Oanh; Le van, Bang
2
2022
Tree spanners on chordal graphs: Complexity, algorithms, open problems. Zbl 1019.68073
Brandstädt, A.; Dragan, F. F.; Le, H.-O.; Le, V. B.
1
2002
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1255.68107
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
1
2003
Clique-width for four-vertex forbidden subgraphs. Zbl 1123.68086
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoàng-Oanh; Lozin, Vadim V.
1
2005
Complexity results for matching cut problems in graphs without long induced paths. Zbl 07842228
Le, Hoàng-Oanh; Le, Van Bang
1
2023
Constrained representations of map graphs and half-squares. Zbl 1541.05129
Le, Hoang-Oanh; Le van, Bang
1
2019
On the \(d\)-claw vertex deletion problem. Zbl 07795033
Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
1
2024
On the \(d\)-claw vertex deletion problem. Zbl 07795033
Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
1
2024
Complexity results for matching cut problems in graphs without long induced paths. Zbl 07842228
Le, Hoàng-Oanh; Le, Van Bang
1
2023
Complexity of the cluster vertex deletion problem on \(H\)-free graphs. Zbl 07893106
Le, Hoang-Oanh; Le van, Bang
2
2022
Matching cut in graphs with large minimum degree. Zbl 1512.68202
Chen, Chi-Yeh; Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
11
2021
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Zbl 1422.68125
Le, Hoang-Oanh; Le, Van Bang
14
2019
Matching cut in graphs with large minimum degree. Zbl 1534.68171
Hsieh, Sun-Yuan; Le, Hoang-Oanh; Le, Van Bang; Peng, Sheng-Lung
5
2019
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. Zbl 1434.68365
Le, Hoang-Oanh; Le, Van Bang
4
2019
Map graphs having witnesses of large girth. Zbl 1423.05180
Le, Hoang-Oanh; Le, Van Bang
2
2019
Constrained representations of map graphs and half-squares. Zbl 1541.05129
Le, Hoang-Oanh; Le van, Bang
1
2019
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. Zbl 1431.68097
Le, Hoang-Oanh; Le, Van Bang
2
2017
On the complexity of matching cut in graphs of fixed diameter. Zbl 1398.68197
Le, Hoang-Oanh; Le, Van Bang
6
2016
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1107.68062
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
15
2007
Clique-width for 4-vertex forbidden subgraphs. Zbl 1103.68088
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoang-Oanh; Lozin, Vadim V.
38
2006
Chordal co-gem-free and (\(P_{5}\),gem)-free graphs have bounded clique-width. Zbl 1084.05056
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
26
2005
New graph classes of bounded clique-width. Zbl 1084.68088
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
25
2005
Clique-width for four-vertex forbidden subgraphs. Zbl 1123.68086
Brandstädt, Andreas; Engelfriet, Joost; Le, Hoàng-Oanh; Lozin, Vadim V.
1
2005
Tree spanners on chordal graphs: complexity and algorithms. Zbl 1049.05075
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Le, Van Bang
29
2004
Gem- and co-gem-free graphs have bounded clique-width. Zbl 1101.68719
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele
26
2004
Additive tree spanners. Zbl 1041.05024
Kratsch, Dieter; Le, Hoàng-Oanh; Müller, Haiko; Prisner, Erich; Wagner, Dorothea
22
2003
Splitting a graph into disjoint induced paths or cycles. Zbl 1073.68031
Hoàng-Oanh Le; Van Bang Le; Müller, Haiko
12
2003
Structure and stability number of chair-, co-P- and gem-free graphs revisited. Zbl 1173.68597
Brandstädt, Andreas; Le, Hoàng-Oanh; Vanherpe, Jean-Marie
8
2003
Tree spanners for bipartite graphs and probe interval graphs. Zbl 1255.68107
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoang-Oanh; Le, Van Bang; Uehara, Ryuhei
1
2003
New graph classes of bounded clique-width. Zbl 1022.68090
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele
7
2002
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs. Zbl 1013.68290
Brandstädt, Andreas; Le, Hoàng-Oanh; Le, Van Bang
5
2002
The NP-completeness of (1,r)-subcolorability of cubic graphs. Zbl 1032.68122
Le, Hoàng-Oanh; Le, Van Bang
4
2002
Tree spanners on chordal graphs: Complexity, algorithms, open problems. Zbl 1019.68073
Brandstädt, A.; Dragan, F. F.; Le, H.-O.; Le, V. B.
1
2002
Optimal tree 3-spanners in directed path graphs. Zbl 0959.90065
Le, Hoàng-Oanh; Le, Van Bang
6
1999
all top 5

Cited by 207 Authors

25 Paulusma, Daniël
19 Dabrowski, Konrad Kazimierz
16 Lê Văn Băng
15 Dragan, Feodor F.
14 Brandstädt, Andreas
14 Lozin, Vadim Vladislavovich
9 Hoàng-Oanh Le
8 Hoàng, Chính T.
6 Golovach, Petr A.
6 Gurski, Frank
5 Huang, Shenwei
5 Köhler, Ekkehard
5 Maffray, Frédéric
5 Milanič, Martin
5 Mosca, Raffaele
5 Rautenbach, Dieter
4 Alrasheed, Hend
4 Bang-Jensen, Jørgen
4 Couto, Fernanda
4 Cunha, Luís Felipe Ignácio
4 Das, Anita
4 Ducoffe, Guillaume
4 Foley, Angèle M.
4 Habib, Michel
4 Kratsch, Dieter
4 Kwon, O. joung
4 Panda, Bhawani Sankar
4 Ries, Bernard
4 Souza, Uéverton S.
4 Wanke, Egon
4 Yan, Chenyu
4 Zamaraev, Victor A.
3 Ahn, Jungho
3 Bodlaender, Hans L.
3 Chepoi, Victor D.
3 Dai, Yingjun
3 Fraser, Dallas J.
3 Jaffke, Lars
3 Johnson, Matthew
3 Karthick, T.
3 Komusiewicz, Christian
3 Lima, Paloma T.
3 Lucke, Felicia
3 Malyshev, Dmitriĭ Sergeevich
3 Rotics, Udi
3 Rzążewski, Paweł
2 Aravind, N. R.
2 Balko, Martin
2 Blanché, Alexandre
2 Bonnet, Edouard
2 Brause, Christoph
2 Brettell, Nick
2 Chakraborty, Dibyayan
2 Chen, Hon-Chan
2 Corneil, Derek Gordon
2 Dourisboure, Yon
2 Duron, Julien
2 Eppstein, David Arthur
2 Fomin, Fedor V.
2 Gavoille, Cyril
2 Giakoumakis, Vassilis
2 Gómez, Renzo
2 Hamel, Angèle M.
2 Havet, Frédéric
2 Holmes, Kevin
2 Horsfield, Jake
2 Hsieh, Sun-Yuan
2 LaMantia, Tom P.
2 Lê, Ngoc Chi
2 Lima, Carlos Vinicius Gomes Costa
2 Lin, Lan
2 Lin, Yixun
2 Masařík, Tomáš
2 Miyazawa, Flavio Keidi
2 Munaro, Andrea
2 Novotná, Jana
2 Otachi, Yota
2 Paesani, Giacomo
2 Papoutsakis, Ioannis
2 Peng, Sheng-Lung
2 Pilipczuk, Michał
2 Rao, Michaël
2 Sau, Ignasi
2 Saxena, Roopam
2 Schiermeyer, Ingo
2 Stacho, Juraj
2 Szwarcfiter, Jayme Luiz
2 Telle, Jan Arne
2 Van Leeuwen, Erik Jan
2 Vaxès, Yann
2 Wakabayashi, Yoshiko
1 AbouEisha, Hassan
1 Abu-Ata, Muad
1 Abuadas, Tala
1 Agrawal, Akanksha
1 Akbari, Saieed
1 Alvarado, José D.
1 Alves, Sancrey Rodrigues
1 Angelini, Patrizio
1 Balogh, József
...and 107 more Authors

Citations by Year