Publications


Note: Traditionally, in most areas of mathematics and theoretical computer science, authors are listed in alphbetical order by last name.

In Preparation

  1. Duc A. Hoang.
    TS-Reconfiguration of k-Path Vertex Covers in Caterpillars.
    Accepted to arXiv preprint.
    [ArXiv]
  2. David Avis and Duc A. Hoang.
    On Reconfiguration Graph of Independent Sets under Token Sliding.
    Accepted to arXiv preprint.
    [ArXiv] [Graphs]

Journal

  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] [PDF]
  2. Duc A. Hoang, Akira Suzuki, and Tsuyoshi Yagita.
    Reconfiguring \(k\)-Path Vertex Covers.
    Accepted to IEICE Transactions on Information and Systems.
    [ArXiv]

Refereed International Conference

  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 ISAAC 2014. LNCS 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 ISAAC 2015. LNCS 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 ISAAC 2016. LIPIcs 64, pp. 37:1–37:26. Schloss Dagstuhl – Leibniz-Zentrum für 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 WALCOM 2017. LNCS 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 CIAC 2019. LNCS 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 WALCOM 2020. LNCS 12049, pp. 133–145. Springer (2020).
    [DOI] [ArXiv] [Slides]

Thesis/Dissertation

  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]