default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDuc A. Hoang 0001
Person information
- unicode name: Hoàng Anh Đức
- unicode name: ホアンアンドゥック
- affiliation: VNU University of Science, Vietnam National University, Hanoi, Vietnam
- affiliation: Kyoto University, Graduate School of Informatics, Japan
- affiliation: Kyushu Institute of Technology, School of Computer Science and Systems Engineering, Fukuoka, Japan
- affiliation (PhD 2018): Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Other persons with the same name
- Duc A. Hoang 0002 — Institute of Technologies, Hanoi, Vietnam
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Duc A. Hoang
:
On the complexity of distance-d independent set reconfiguration. Theor. Comput. Sci. 1009: 114682 (2024)- 2023
- [j4]David Avis, Duc A. Hoang:
On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39(3): 59 (2023) - [j3]David Avis, Duc A. Hoang:
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39(4): 88 (2023) - 2022
- [j2]Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita:
Reconfiguring k-Path Vertex Covers. IEICE Trans. Inf. Syst. 105-D(7): 1258-1272 (2022) - 2015
- [j1]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600: 132-142 (2015)
Conference and Workshop Papers
- 2023
- [c7]Duc A. Hoang:
On the Complexity of Distance-d Independent Set Reconfiguration. WALCOM 2023: 254-266 - 2020
- [c6]Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita:
Reconfiguring k-path Vertex Covers. WALCOM 2020: 133-145 - 2019
- [c5]Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara:
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CIAC 2019: 262-273 - 2017
- [c4]Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara:
Sliding Tokens on Block Graphs. WALCOM 2017: 460-471 - 2016
- [c3]Duc A. Hoang, Ryuhei Uehara:
Sliding Tokens on a Cactus. ISAAC 2016: 37:1-37:26 - 2015
- [c2]Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara:
Sliding Token on Bipartite Permutation Graphs. ISAAC 2015: 237-247 - 2014
- [c1]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400
Informal and Other Publications
- 2024
- [i10]Niranka Banerjee, Christian Engels, Duc A. Hoang:
Distance Recoloring. CoRR abs/2402.12705 (2024) - [i9]Niranka Banerjee, Christian Engels, Duc A. Hoang:
Directed Token Sliding. CoRR abs/2411.16149 (2024) - 2023
- [i8]David Avis, Duc A. Hoang:
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. CoRR abs/2301.00317 (2023) - [i7]Niranka Banerjee, Duc A. Hoang:
The Complexity of Distance-r Dominating Set Reconfiguration. CoRR abs/2310.00241 (2023) - 2022
- [i6]Duc A. Hoang:
TS-Reconfiguration of k-Path Vertex Covers in Caterpillars. CoRR abs/2203.11667 (2022) - [i5]David Avis, Duc A. Hoang:
On Reconfiguration Graph of Independent Sets under Token Sliding. CoRR abs/2203.16861 (2022) - [i4]Duc A. Hoang:
On The Complexity of Distance-d Independent Set Reconfiguration. CoRR abs/2208.07199 (2022) - 2019
- [i3]Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita:
Reconfiguring k-path vertex covers. CoRR abs/1911.03026 (2019) - 2018
- [i2]Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara:
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. CoRR abs/1806.08291 (2018) - 2014
- [i1]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR abs/1406.6576 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 18:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
