Publications

In Preparation

  1. Duc A. Hoang.
    Token-Sliding Realizability for Complements, Cartesian-Products, and Grid Graph Families.
    Accepted to arXiv preprint.
    [ArXiv]
  2. Duc A. Hoang.
    On Realizing Reconfiguration Graphs of Cliques.
    Accepted to arXiv preprint.
    [ArXiv]

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.
    IEICE Transactions on Information and Systems E105.D:7, pp. 1258–1272 (2022).
    [DOI] [ArXiv] [HDL]
  3. Duc A. Hoang.
    TS-Reconfiguration of \(k\)-Path Vertex Covers in Caterpillars for \(k ≥4\).
    Theory and Applications of Graphs 10:1, article 8 (2023).
    [DOI] [ArXiv] [HDL]
  4. David Avis and Duc A. Hoang.
    On Reconfiguration Graphs of Independent Sets under Token Sliding.
    Graphs and Combinatorics 39:3, article 59 (2023).
    [DOI] [ArXiv] [HDL] [Graphs] [Correction]
  5. Duc A. Hoang.
    On the Complexity of Distance-\(d\) Independent Set Reconfiguration.
    Theoretical Computer Science 1009, article 114682 (2024).
    Selected paper in Special Issue of WALCOM 2023.
    [DOI] [ArXiv]
  6. David Avis and Duc A. Hoang.
    A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets.
    Ars Combinatoria 159, pp. 133–154 (2024).
    [DOI] [ArXiv] [HDL]
  7. Niranka Banerjee and Duc A. Hoang.
    The Complexity of Distance-\(r\) Dominating Set Reconfiguration.
    Journal of Combinatorial Optimization 51, article 25 (2026).
    Selected paper in Special Issue of COCOON 2024.
    [DOI] [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] [Flaws]
  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).
    [DOI] [HDL] [Slides] [Flaws]
  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]
  7. Duc A. Hoang.
    On the Complexity of Distance-\(d\) Independent Set Reconfiguration.
    In: Bertrand M. T. Lin, Chun-Cheng Lin, and Giuseppe Liotta (editors), Proceedings of WALCOM 2023. LNCS 13973, pp. 254–266. Springer (2023).
    [DOI] [ArXiv] [HDL] [Slides] [Video]
  8. Niranka Banerjee and Duc A. Hoang.
    The Complexity of Distance-\(r\) Dominating Set Reconfiguration.
    In: Yong Chen, Xiaofeng Gao, Xiaoming Sun, and An Zhang (editors), Proceedings of COCOON 2024, Part I. LNCS 15161, pp. 264–275. Springer (2025).
    [DOI] [ArXiv] [Slides]
  9. Quan N. Lam, Huu-An Phan, and Duc A. Hoang.
    A Note on Reconfiguration Graphs of Cliques.
    In: Neeldhara Misra, and Arti Pandey (editors), Proceedings of CALDAM 2026. LNCS 16445, pp. 416–427. Springer (2026).
    [DOI] [ArXiv] [Slides]
  10. Niranka Banerjee, Christian Engels, and Duc A. Hoang.
    Distance Recoloring.
    In: Yi Li, Frank Stephan, and Xiaoming Sun (editors), Proceedings of COCOON 2026. LNCS. Springer (2026).
    [ArXiv]

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]

Unpublished Manuscript

  1. Niranka Banerjee, Christian Engels, and Duc A. Hoang.
    Directed Token Sliding.
    Accepted to arXiv preprint.
    [ArXiv]

Our (my coauthors and I) manuscripts have been rejected from the following venues. The numbers inside parentheses indicate the number of manuscripts rejected from each venue.