default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhan-Thuan Do
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Thanh Trung Nguyen, Minh Hai Vu
, Phi Le Nguyen, Phan-Thuan Do, Kien Nguyen:
A Q-learning-based Multipath Scheduler for Data Transmission Optimization in Heterogeneous Wireless Networks. CCNC 2023: 573-578- [c18]Minh Quang Le, Nguyen Nang Hung, Kien Nguyen, Phi Le Nguyen, Phan-Thuan Do:
Perpetual Sensor Networks with the Minimum Number of Mobile Chargers. SoICT 2023: 282-288 - 2022
- [j10]Viet Dung Nguyen, Phi Le Nguyen, Kien Nguyen, Phan-Thuan Do:
Constant approximation for opportunistic sensing in mobile air quality monitoring system. Comput. Networks 202: 108646 (2022) - [j9]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. Discret. Math. 345(2): 112684 (2022) - [c17]Minh Hai Vu, Giang T. T. Nguyen, Hai Dang Tran, Thanh Trung Nguyen, Phan-Thuan Do, Phi Le Nguyen, Kien Nguyen:
An Empirical Study of MPQUIC Schedulers in Mobile Wireless Networks. SoICT 2022: 193-200 - [c16]Thanh Trung Nguyen, Minh Hai Vu, Phi Le Nguyen, Phan-Thuan Do, Kien Nguyen:
A Reinforcement Learning-based Multipath Scheduling for Heterogeneous Wireless Networks. WF-IoT 2022: 1-2 - [i5]Ngoc Bui, Phi Le Nguyen, Viet Anh Nguyen, Phan-Thuan Do:
A Deep Reinforcement Learning-based Adaptive Charging Policy for Wireless Rechargeable Sensor Networks. CoRR abs/2208.07824 (2022) - 2021
- [j8]Viet Dung Nguyen, Ba-Thai Pham, Phan-Thuan Do:
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs. Fundam. Informaticae 182(3): 257-283 (2021) - [c15]Viet An Nguyen, Viet Hung Vu, Van-Sang Doan, Thanh-Hung Nguyen, Phan-Thuan Do, Kien Nguyen, Phi Le Nguyen, Minh Thuy Le:
Realizing Mobile Air Quality Monitoring System: Architectural Concept and Device Prototype. APCC 2021: 115-120 - [i4]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. CoRR abs/2103.10357 (2021) - [i3]Viet Dung Nguyen, Ba-Thai Pham, Phan-Thuan Do:
Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs. CoRR abs/2107.08480 (2021) - 2020
- [j7]Mai Huong Dinh, Viet-Dung Nguyen, Van Long Truong, Phan-Thuan Do, Thanh Thao Phan, Duc-Nghia Nguyen:
Cycle time enhancement by simulated annealing for a practical assembly line balancing problem. Informatica (Slovenia) 44(2) (2020) - [c14]Viet-Dung Nguyen, Phi-Le Nguyen, Trung Hieu Nguyen, Phan-Thuan Do:
A 1/2-Approximation Algorithm for Target Coverage Problem in Mobile Air Quality Monitoring Systems. GLOBECOM 2020: 1-6 - [c13]Viet Dung Nguyen, Phi-Le Nguyen, Trung Hieu Nguyen, Kien Nguyen, Phan-Thuan Do:
An $\frac{e-1}{2e-1}$-Approximation Algorithm for Maximizing Coverage Capability in Mobile Air Quality Monitoring Systems. NCA 2020: 1-4
2010 – 2019
- 2019
- [j6]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding (colored) regular sets of patterns. Discret. Appl. Math. 268: 44-53 (2019) - [c12]Mai Huong Dinh, Viet-Dung Nguyen, Van Long Truong, Phan-Thuan Do, Thanh Thao Phan, Duc-Nghia Nguyen:
Simulated Annealing for the Assembly Line Balancing Problem in the Garment Industry. SoICT 2019: 36-42 - 2018
- [j5]Phan-Thuan Do, Nguyen-Viet-Dung Nghiem, Ngoc-Quang Nguyen, Quang-Dung Pham:
A time-dependent model with speed windows for share-a-ride problems: A case study for Tokyo transportation. Data Knowl. Eng. 114: 67-85 (2018) - [c11]Viet-Dung Nguyen, Ba-Thai Pham, Viet-Hung Tran, Phan-Thuan Do:
A dynamic programming algorithm for the maximum induced matching problem in permutation graphs. SoICT 2018: 92-97 - [i2]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding a (colored) regular sets of patterns. CoRR abs/1809.00742 (2018) - [i1]Hong-Hai Phan-Vu, Viet-Trung Tran, Van-Nam Nguyen, Hoang-Vu Dang, Phan-Thuan Do:
Machine Translation between Vietnamese and English: an Empirical Study. CoRR abs/1810.12557 (2018) - 2017
- [j4]Phan-Thuan Do, Ngoc-Khang Le, Van-Thieu Vu:
Efficient maximum matching algorithms for trapezoid graphs. Electron. J. Graph Theory Appl. 5(1): 7-20 (2017) - [c10]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations. MACIS 2017: 306-319 - [c9]Hong-Hai Phan-Vu, Van-Nam Nguyen, Viet-Trung Tran, Phan-Thuan Do:
Towards State-of-the-art English-Vietnamese Neural Machine Translation. SoICT 2017: 120-126 - 2016
- [c8]Phan-Thuan Do, Nguyen-Viet-Dung Nghiem, Ngoc-Quang Nguyen, Duc-Nghia Nguyen:
A practical dynamic share-a-ride problem with speed windows for Tokyo city. KSE 2016: 55-60 - 2015
- [c7]Ngoc-Quang Nguyen, Nguyen-Viet-Dung Nghiem, Phan-Thuan Do, Khac Tuan Le, Minh-Son Nguyen, Naoto Mukai:
People and parcels sharing a taxi for Tokyo city. SoICT 2015: 90-97 - 2014
- [j3]Phan-Thuan Do, Dominique Rossin, Thi Thu Huong Tran:
Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths. Discret. Math. 320: 40-50 (2014) - [j2]T. Dieu Linh Truong, Phan-Thuan Do, Anh T. Pham:
Optimization of Survivable Mesh Long-Reach Hybrid WDM-TDM PONs. JOCN 6(1): 62-76 (2014) - 2013
- [j1]Jean-Luc Baril, Phan-Thuan Do:
ECO-generation for some restricted classes of compositions. Comput. Sci. J. Moldova 21(1): 97-119 (2013) - [c6]Ngoc-Khang Le, Phan-Thuan Do:
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs. RIVF 2013: 157-162 - [c5]Thai-Duong Nguyen, Phan-Thuan Do:
An ant colony optimization algorithm for solving Group Steiner Problem. RIVF 2013: 163-168 - 2012
- [c4]Dac-Thanh Tran, Duy-Hoa Ngo, Phan-Thuan Do:
An information content based partitioning method for the anatomical ontology matching task. SoICT 2012: 272-281 - 2011
- [c3]Phan-Thuan Do, Thai-Duong Nguyen, Quang-Dung Pham:
An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint. SoICT 2011: 29-35 - 2010
- [c2]Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuong-Vinh Ho:
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem. SoICT 2010: 1-8
2000 – 2009
- 2004
- [c1]Duc-Nghia Nguyen, Phan-Thuan Do:
Genetic Algorithm for Optimization of a Quadratic Function with Circular Matrix Problem. RIVF 2004: 221-226
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-05-26 00:47 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:
