Phan-Thuan Do

Orcid: 0000-0002-7376-1818

According to our database1, Phan-Thuan Do authored at least 31 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Perpetual Sensor Networks with the Minimum Number of Mobile Chargers.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

A Q-learning-based Multipath Scheduler for Data Transmission Optimization in Heterogeneous Wireless Networks.
Proceedings of the 20th IEEE Consumer Communications & Networking Conference, 2023

2022
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three.
Discret. Math., 2022

A Deep Reinforcement Learning-based Adaptive Charging Policy for Wireless Rechargeable Sensor Networks.
CoRR, 2022

Constant approximation for opportunistic sensing in mobile air quality monitoring system.
Comput. Networks, 2022

A Reinforcement Learning-based Multipath Scheduling for Heterogeneous Wireless Networks.
Proceedings of the 8th IEEE World Forum on Internet of Things, 2022

An Empirical Study of MPQUIC Schedulers in Mobile Wireless Networks.
Proceedings of the 11th International Symposium on Information and Communication Technology, 2022

2021
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs.
Fundam. Informaticae, 2021

Realizing Mobile Air Quality Monitoring System: Architectural Concept and Device Prototype.
Proceedings of the 26th IEEE Asia-Pacific Conference on Communications, 2021

2020
Cycle time enhancement by simulated annealing for a practical assembly line balancing problem.
Informatica (Slovenia), 2020

An $\frac{e-1}{2e-1}$-Approximation Algorithm for Maximizing Coverage Capability in Mobile Air Quality Monitoring Systems.
Proceedings of the 19th IEEE International Symposium on Network Computing and Applications, 2020

A 1/2-Approximation Algorithm for Target Coverage Problem in Mobile Air Quality Monitoring Systems.
Proceedings of the IEEE Global Communications Conference, 2020

2019
Exhaustive generation for permutations avoiding (colored) regular sets of patterns.
Discret. Appl. Math., 2019

Simulated Annealing for the Assembly Line Balancing Problem in the Garment Industry.
Proceedings of the Tenth International Symposium on Information and Communication Technology, 2019

2018
A time-dependent model with speed windows for share-a-ride problems: A case study for Tokyo transportation.
Data Knowl. Eng., 2018

Machine Translation between Vietnamese and English: an Empirical Study.
CoRR, 2018

A dynamic programming algorithm for the maximum induced matching problem in permutation graphs.
Proceedings of the Ninth International Symposium on Information and Communication Technology, 2018

2017
Efficient maximum matching algorithms for trapezoid graphs.
Electron. J. Graph Theory Appl., 2017

Towards State-of-the-art English-Vietnamese Neural Machine Translation.
Proceedings of the Eighth International Symposium on Information and Communication Technology, 2017

Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
A practical dynamic share-a-ride problem with speed windows for Tokyo city.
Proceedings of the 2016 Eighth International Conference on Knowledge and Systems Engineering, 2016

2015
People and parcels sharing a taxi for Tokyo city.
Proceedings of the Sixth International Symposium on Information and Communication Technology, 2015

2014
Optimization of Survivable Mesh Long-Reach Hybrid WDM-TDM PONs.
JOCN, 2014

Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths.
Discret. Math., 2014

2013
ECO-generation for some restricted classes of compositions.
Comput. Sci. J. Moldova, 2013

An ant colony optimization algorithm for solving Group Steiner Problem.
Proceedings of the 2013 IEEE RIVF International Conference on Computing and Communication Technologies, 2013

An O(n(log n)<sup>3</sup>) algorithm for maximum matching in trapezoid graphs.
Proceedings of the 2013 IEEE RIVF International Conference on Computing and Communication Technologies, 2013

2012
An information content based partitioning method for the anatomical ontology matching task.
Proceedings of the Symposium on Information and Communication Technology 2012, 2012

2011
An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint.
Proceedings of the 2011 Symposium on Information and Communication Technology, 2011

2010
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem.
Proceedings of the 2010 Symposium on Information and Communication Technology, 2010

2004
Genetic Algorithm for Optimization of a Quadratic Function with Circular Matrix Problem.
Proceedings of the Actes de la Deuxieme Conference Internationale Associant Chercheurs Vietnamiens et Francophones en Informatique, 2004


  Loading...