[English/Tiếng Việt]

[Home]  [About]  [Activities]  [Publications]  [Events]  [Teaching]  [Misc] 

Publications


Research Interests

Co-authors

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.

List of Publications

Journal (Tạp chí)

  1. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, 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).
    [DOI] [ArXiv] [HDL]

Refereed International Conference (Hội thảo quốc tế)

  1. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada.
    Polynomial-Time Algorithm for Sliding Tokens on Trees.
    In: Hee-Kap Ahn, and Chan-Su Shin (editors), 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).
    [DOI] [ArXiv] [HDL] [Slides]
  2. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara.
    Sliding Token on Bipartite Permutation Graphs.
    In: Khaled Elbassioni, and Kazuhisa Makino (editors), 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]
  3. Duc A. Hoang, and Ryuhei Uehara.
    Sliding Tokens on a Cactus.
    In: Seok-Hee Hong (editor), 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).
    [DOI] [HDL] [Slides]
  4. Duc A. Hoang, Eli Fox-Epstein, and Ryuhei Uehara.
    Sliding Tokens on Block Graphs.
    In: Sheung-Hung Poon, Md. Saidur Rahman, and Hsu-Chun Yen (editors), 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]
  5. Duc A. Hoang, Amanj Khorramian, and Ryuhei Uehara.
    Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.
    In: Pinar Heggernes (editor), 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]
  6. Duc A. Hoang, Akira Suzuki, and Tsuyoshi Yagita.
    Reconfiguring \(k\)-Path Vertex Covers.
    In: M. Sohel Rahman, Kunihiko Sadakane, and Wing-Kin Sung (editors), 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).
    [DOI] [ArXiv] [Slides]

Thesis/Dissertation (Khóa luận/Luận án)

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

Valid CSS! Valid HTML 4.01 Transitional 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