generated by bibbase.org
  2024 (1)
Distance Recoloring. Banerjee, N.; Engels, C.; and Hoang, D. A. arXiv preprint. 2024.
Distance Recoloring [link] arxiv   link   bibtex  
  2023 (5)
The Complexity of Distance-$r$ Dominating Set Reconfiguration. Banerjee, N.; and Hoang, D. A. arXiv preprint. 2023.
The Complexity of Distance-$r$ Dominating Set Reconfiguration [link] arxiv   link   bibtex  
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. Avis, D.; and Hoang, D. A. arXiv preprint. 2023.
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets [link] hdl   A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets [link] arxiv   link   bibtex  
On Reconfiguration Graphs of Independent Sets under Token Sliding. Avis, D.; and Hoang, D. A. Graphs and Combinatorics, 39(3). 5 2023.
On Reconfiguration Graphs of Independent Sets under Token Sliding [link] hdl   On Reconfiguration Graphs of Independent Sets under Token Sliding [link] arxiv   On Reconfiguration Graphs of Independent Sets under Token Sliding [link] graphs   On Reconfiguration Graphs of Independent Sets under Token Sliding [link] correction   doi   link   bibtex  
On The Complexity of Distance-\(d\)\ Independent Set Reconfiguration. Hoang, D. A. In Lin, B. M. T.; Lin, C.; and Liotta, G., editor(s), Proceedings of WALCOM 2023, volume 13973, of LNCS, pages 254–266, 2023. Springer
On The Complexity of Distance-\(d\)\ Independent Set Reconfiguration [link] hdl   On The Complexity of Distance-\(d\)\ Independent Set Reconfiguration [link] arxiv   On The Complexity of Distance-\(d\)\ Independent Set Reconfiguration [pdf] slides   On The Complexity of Distance-\(d\)\ Independent Set Reconfiguration [link] video   doi   link   bibtex  
TS-Reconfiguration of \(k\)-Path Vertex Covers in Caterpillars for \(k ≥ 4\). Hoang, D. A. Theory and Applications of Graphs, 10(1). 4 2023.
TS-Reconfiguration of \(k\)-Path Vertex Covers in Caterpillars for \(k ≥ 4\) [link] hdl   TS-Reconfiguration of \(k\)-Path Vertex Covers in Caterpillars for \(k ≥ 4\) [link] arxiv   doi   link   bibtex  
  2022 (1)
Reconfiguring \(k\)-Path Vertex Covers. Hoang, D. A.; Suzuki, A.; and Yagita, T. IEICE Transactions on Information and Systems, E105.D(7): 1258–1272. 2022.
Reconfiguring \(k\)-Path Vertex Covers [link] hdl   Reconfiguring \(k\)-Path Vertex Covers [link] arxiv   doi   link   bibtex   16 downloads  
  2020 (1)
Reconfiguring \(k\)-Path Vertex Covers. Hoang, D. A.; Suzuki, A.; and Yagita, T. In Rahman, M. S.; Sadakane, K.; and Sung, W., editor(s), Proceedings of WALCOM 2020, volume 12049, of LNCS, pages 133–145, 2020. Springer
Reconfiguring \(k\)-Path Vertex Covers [link] arxiv   Reconfiguring \(k\)-Path Vertex Covers [pptx] slides   doi   link   bibtex   5 downloads  
  2019 (1)
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. Hoang, D. A.; Khorramian, A.; and Uehara, R. In Heggernes, P., editor(s), Proceedings of CIAC 2019, volume 11485, of LNCS, pages 262–273, 2019. Springer
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders [link] arxiv   Shortest Reconfiguration Sequence for Sliding Tokens on Spiders [pdf] slides   doi   link   bibtex   1 download  
  2018 (1)
Independent Set Reconfiguration and Related Problems for Some Restricted Graphs. Hoang, D. A. Ph.D. Thesis, Japan Advanced Institute of Science and Technology, June 2018.
Independent Set Reconfiguration and Related Problems for Some Restricted Graphs [link] hdl   Independent Set Reconfiguration and Related Problems for Some Restricted Graphs [pdf] slides   link   bibtex  
  2017 (1)
Sliding Tokens on Block Graphs. Hoang, D. A.; Fox-Epstein, E.; and Uehara, R. In Poon, S.; Rahman, M. S.; and Yen, H., editor(s), Proceedings of WALCOM 2017, volume 10167, of LNCS, pages 460–471, 2017. Springer We thank Mariana Teatini Ribeiro and Vin\'icius 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.
Sliding Tokens on Block Graphs [link] hdl   Sliding Tokens on Block Graphs [pdf] slides   doi   link   bibtex  
  2016 (1)
Sliding Tokens on a Cactus. Hoang, D. A.; and Uehara, R. In Hong, S., editor(s), Proceedings of ISAAC 2016, volume 64, of LIPIcs, pages 37:1–37:26, 2016. Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Sliding Tokens on a Cactus [link] hdl   Sliding Tokens on a Cactus [pdf] slides   doi   link   bibtex  
  2015 (3)
Sliding Token on Bipartite Permutation Graphs. Fox-Epstein, E.; Hoang, D. A.; Otachi, Y.; and Uehara, R. In Elbassioni, K.; and Makino, K., editor(s), Proceedings of ISAAC 2015, volume 9472, of LNCS, pages 237–247, 2015. Springer
Sliding Token on Bipartite Permutation Graphs [link] hdl   Sliding Token on Bipartite Permutation Graphs [pdf] slides   doi   link   bibtex   1 download  
Linear-Time Algorithm for Sliding Tokens on Trees. Demaine, E. D.; Demaine, M. L.; Fox-Epstein, E.; Hoang, D. A.; Ito, T.; Ono, H.; Otachi, Y.; Uehara, R.; and Yamada, T. Theoretical Computer Science, 600: 132–142. 2015.
Linear-Time Algorithm for Sliding Tokens on Trees [link] arxiv   Linear-Time Algorithm for Sliding Tokens on Trees [link] hdl   Linear-Time Algorithm for Sliding Tokens on Trees [pdf] pdf   doi   link   bibtex  
The Independent Set Reconfiguration Problem on Some Restricted Graphs. Hoang, D. A. Master's thesis, Japan Advanced Institute of Science and Technology, March 2015.
The Independent Set Reconfiguration Problem on Some Restricted Graphs [link] hdl   link   bibtex  
  2014 (1)
Polynomial-Time Algorithm for Sliding Tokens on Trees. Demaine, E. D.; Demaine, M. L.; Fox-Epstein, E.; Hoang, D. A.; Ito, T.; Ono, H.; Otachi, Y.; Uehara, R.; and Yamada, T. In Ahn, H.; and Shin, C., editor(s), Proceedings of ISAAC 2014, volume 8889, of LNCS, pages 389–400, 2014. Springer
Polynomial-Time Algorithm for Sliding Tokens on Trees [link] arxiv   Polynomial-Time Algorithm for Sliding Tokens on Trees [link] hdl   Polynomial-Time Algorithm for Sliding Tokens on Trees [pptx] slides   doi   link   bibtex