[English/Tiếng Việt]

- Graph Algorithms.
- Combinatorial Reconfiguration.

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Takehiro Ito, Amanj Khorramian, Hirotaka Ono, Yota Otachi, Akira Suzuki, Ryuhei Uehara, Tsuyoshi Yagita, Takeshi Yamada.

- DBLP.
- Google Scholar.
- Preprints on arXiv.
- Researchmap.

- Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein,[DOI] [ArXiv] [HDL]
__Duc A. Hoang__, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada.**Linear-Time Algorithm for Sliding Tokens on Trees**.*Theoretical Computer Science*600, pp. 132–142 (2015).

- Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein,[DOI] [ArXiv] [HDL] [Slides]
__Duc A. Hoang__, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada.In: Hee-Kap Ahn, and Chan-Su Shin (editors),**Polynomial-Time Algorithm for Sliding Tokens on Trees**.*Proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea, December 15-17, 2014*. Lecture Notes in Computer Science 8889, pp. 389–400. Springer (2014). - Eli Fox-Epstein,[DOI] [HDL] [Slides]
__Duc A. Hoang__, Yota Otachi, and Ryuhei Uehara.In: Khaled Elbassioni, and Kazuhisa Makino (editors),**Sliding Token on Bipartite Permutation Graphs**.*Proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, Nagoya, Japan, December 9-11, 2015*. Lecture Notes in Computer Science 9472, pp. 237–247. Springer (2015). - [DOI] [HDL] [Slides]
__Duc A. Hoang__, and Ryuhei Uehara.In: Seok-Hee Hong (editor),**Sliding Tokens on a Cactus**.*Proceedings of the 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, December 12-14, 2016*. Leibniz International Proceedings in Informatics 64, pp. 37:1–37:26. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2016). __Duc A. Hoang__, Eli Fox-Epstein, and Ryuhei Uehara.In: Sheung-Hung Poon, Md. Saidur Rahman, and Hsu-Chun Yen (editors),**Sliding Tokens on Block Graphs**.*Proceedings of the 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017*. Lecture Notes in Computer Science 10167, pp. 460–471. Springer (2017).We thank Mariana Teatini Ribeiro and Vinícius Fernandes dos Santos for pointing out a flaw in Proposition 6. So far, we have not been able to resolve this issue. See this note for more details.[DOI] [HDL] [Slides]- [DOI] [ArXiv] [Slides]
__Duc A. Hoang__, Amanj Khorramian, and Ryuhei Uehara.In: Pinar Heggernes (editor),**Shortest Reconfiguration Sequence for Sliding Tokens on Spiders**.*Proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, Rome, Italy, May 27-29, 2019*. Lecture Notes in Computer Science 11485, pp. 262–273. Springer (2019). - [DOI] [ArXiv] [Slides]
__Duc A. Hoang__, Akira Suzuki, and Tsuyoshi Yagita.In: M. Sohel Rahman, Kunihiko Sadakane, and Wing-Kin Sung (editors),**Reconfiguring \(k\)-Path Vertex Covers**.*Proceedings of the 14th International Conference and Workshop on Algorithms and Computation, WALCOM 2020, NUS, Singapore, March 3April 02, 2020*. Lecture Notes in Computer Science 12049, pp. 133–145. Springer (2020).

- [HDL]
__Duc A. Hoang__.Master's thesis. Japan Advanced Institute of Science and Technology (2015).**The Independent Set Reconfiguration Problem on Some Restricted Graphs**. - [HDL] [Slides]
__Duc A. Hoang__.PhD thesis. Japan Advanced Institute of Science and Technology (2018).**Independent Set Reconfiguration and Related Problems for Some Restricted Graphs**.

Back to top

Powered by Jekyll

The content on this site is shared under a CC BY-SA 4.0 license, unless otherwise noted Last Modified: October 05, 2020

Powered by Jekyll

The content on this site is shared under a CC BY-SA 4.0 license, unless otherwise noted Last Modified: October 05, 2020