![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 43 matches
- 2024
- 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) - 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) - Hoang Nhat Khang Vo, Duc Dong Le, Tran Minh Dat Phan, Tan Sang Nguyen, Quoc Nguyen Pham, Ngoc Oanh Tran, Quang Duc Nguyen, Tran Minh Hieu Vo, Tho Quan:
Revitalizing Bahnaric Language through Neural Machine Translation: Challenges, Strategies, and Promising Outcomes. AAAI 2024: 23360-23368 - Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR abs/2402.04931 (2024) - 2023
- Le T. T. An
, Hoang T. K. Anh, Luu M. Anh, Mai T. Mien, Phan T. K. Oanh:
Integrating Network Information Into Credit Classification Models. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 31(Supplement-2): 181-196 (2023) - Iman Bint Talha, Oanh T. M. Tran, Due T. Ong, Thuy T. Hoang, Tuan A. Khuong, Dennis Wong, Karen Ho, Natacha Borecky, Mary Rickard, Sarah Lewis, Patrick C. Brennan, Phuong Dung Trieu:
A progress in diagnostic performances of Vietnamese doctors in reading mammograms with different Level of breast density via the VIETRAD program. Medical Imaging: Image Perception, Observer Performance, and Technology Assessment 2023 - Hoàng-Oanh Le, Van Bang Le:
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. WG 2023: 417-431 - 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
- Hoàng-Oanh Le, Van Bang Le:
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. MFCS 2022: 68:1-68:10 - 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
- 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) - Thi-Oanh Ha, Hoang-Nhat Tran, Hong-Quan Nguyen, Thanh-Hai Tran, Phuong-Dung Nguyen, Huong-Giang Doan, Van-Toi Nguyen, Hai Vu
, Thi-Lan Le:
Improvement of People Counting by Pairing Head and Face Detections from Still Images. MAPR 2021: 1-6 - 2020
- Oanh Tran Thi Kim
, Nguyen Hoang Tran
, Chuan Pham
, Tuan LeAnh
, My T. Thai
, Choong Seon Hong
:
Parking Assignment: Minimizing Parking Expenses and Balancing Parking Demand Among Multiple Parking Lots. IEEE Trans Autom. Sci. Eng. 17(3): 1320-1331 (2020) - Tra Huong Thi Le, Nguyen Hoang Tran, Yan Kyaw Tun
, Oanh Tran Thi Kim, Kitae Kim, Choong Seon Hong
:
Sharing Incentive Mechanism, Task Assignment and Resource Allocation for Task Offloading in Vehicular Mobile Edge Computing. NOMS 2020: 1-8 - 2019
- 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) - 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) - Hoàng-Oanh Le, Van Bang Le
:
Map graphs having witnesses of large girth. Theor. Comput. Sci. 772: 143-148 (2019) - 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 - Oanh T. K. Tran, Minh T. H. Le, Anh T. P. Hoang, Dan N. Tran:
The Impact of Oil Shocks on Exchange Rates in Southeast Asian Countries - A Markov-Switching Approach. ECONVN 2019: 779-794 - Hoàng-Oanh Le, Van Bang Le:
Constrained Representations of Map Graphs and Half-Squares. MFCS 2019: 13:1-13:15 - 2018
- 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) - Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR abs/1804.11102 (2018) - Hoàng-Oanh Le, Van Bang Le:
Map graphs having witnesses of large girth. CoRR abs/1812.04102 (2018) - 2017
- 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
- Ngoc-Anh Thi Le, Thi-Oanh Ngo, Huyen-Trang Thi Lai, Hoang-Quynh Le
, Hai-Chau Nguyen, Quang-Thuy Ha
:
An Experimental Study on Cholera Modeling in Hanoi. ACIIDS (2) 2016: 230-240 - Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC 2016: 50:1-50:12 - 2009
- Oanh Thi Tran, Cuong Anh Le, Quang-Thuy Ha
, Quynh Hoang Le
:
An Experimental Study on Vietnamese POS Tagging. IALP 2009: 23-27 - 2007
- 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
- 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
- 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)
skipping 13 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 04:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint