default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoàng-Oanh Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Sun-Yuan Hsieh, Hoàng-Oanh Le
, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. Algorithmica 86(2): 505-525 (2024)- [j16]Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. 68(2): 250-270 (2024) - [i7]Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR abs/2402.04931 (2024) - [i6]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
The complexity of strong conflict-free vertex-connection k-colorability. CoRR abs/2408.05865 (2024) - 2023
- [c10]Hoàng-Oanh Le, Van Bang Le:
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. WG 2023: 417-431 - [i5]Hoàng-Oanh Le, Van Bang Le:
Complexity results for matching cut problems in graphs without long induced paths. CoRR abs/2307.05402 (2023) - 2022
- [c9]Hoàng-Oanh Le, Van Bang Le:
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. MFCS 2022: 68:1-68:10 - [i4]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. CoRR abs/2203.06766 (2022) - 2021
- [j15]Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. Algorithmica 83(5): 1238-1255 (2021)
2010 – 2019
- 2019
- [j14]Hoàng-Oanh Le, Van Bang Le:
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. Algorithmica 81(11-12): 4258-4274 (2019) - [j13]Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. 770: 69-78 (2019) - [j12]Hoàng-Oanh Le, Van Bang Le:
Map graphs having witnesses of large girth. Theor. Comput. Sci. 772: 143-148 (2019) - [c8]Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. COCOON 2019: 301-312 - [c7]Hoàng-Oanh Le, Van Bang Le:
Constrained Representations of Map Graphs and Half-Squares. MFCS 2019: 13:1-13:15 - 2018
- [i3]Hoàng-Oanh Le, Van Bang Le:
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. CoRR abs/1804.05793 (2018) - [i2]Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR abs/1804.11102 (2018) - [i1]Hoàng-Oanh Le, Van Bang Le:
Map graphs having witnesses of large girth. CoRR abs/1812.04102 (2018) - 2017
- [c6]Hoàng-Oanh Le, Van Bang Le:
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. COCOON 2017: 359-370 - 2016
- [c5]Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC 2016: 50:1-50:12
2000 – 2009
- 2007
- [j11]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
- [j10]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
- [j9]Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca:
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. Discret. Appl. Math. 145(2): 232-241 (2005) - [j8]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) - [c4]Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196 - 2004
- [b1]Hoàng-Oanh Le:
Contributions to clique-width of graphs. University of Rostock, 2004, ISBN 3-86537-013-6, pp. 1-123 - [j7]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) - [j6]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
- [j5]Hoàng-Oanh Le, Van Bang Le, Haiko Müller:
Splitting a graph into disjoint induced paths or cycles. Discret. Appl. Math. 131(1): 199-212 (2003) - [j4]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) - [c3]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 - 2002
- [j3]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) - [j2]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) - [c2]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 - [c1]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67
1990 – 1999
- 1999
- [j1]Hoàng-Oanh Le, Van Bang Le:
Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
