default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong-Chun Hsu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Pao-Lien Lai, Kuan-Ting Chen, Chien-Ping Chang, Hong-Chun Hsu
:
An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes. Parallel Process. Lett. 32(1&2): 2250002:1-2250002:18 (2022)
2010 – 2019
- 2014
- [j13]Hong-Chun Hsu, Kuang-Shyr Wu, Cheng-Kuan Lin, Chiou-Yng Lee, Chien-Ping Chang:
A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model. IEEE Trans. Computers 63(12): 2894-2904 (2014) - 2013
- [c9]Pao-Lien Lai, Kao-Lin Hu, Hong-Chun Hsu:
Cycles Embedding of Twisted Cubes. ICPP 2013: 1077-1081 - 2012
- [j12]Tseng-Kuei Li, Chang-Hsiung Tsai, Hong-Chun Hsu:
A fast fault-identification algorithm for bijective connection graphs using the PMC model. Inf. Sci. 187: 291-297 (2012) - [c8]Hong-Chun Hsu, Pao-Lien Lai:
Adaptive Diagnosis for Grids under the Comparison Model. AINA Workshops 2012: 1246-1251 - 2011
- [c7]Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai:
A Systematic Algorithm for Embedding Hamiltonian Cycle in Hierarchical Crossed Cubes. CSE 2011: 358-365 - 2010
- [j11]Chia-Jui Lai, Chang-Hsiung Tsai, Hong-Chun Hsu, Tseng-Kuei Li:
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube. Inf. Sci. 180(24): 5090-5100 (2010) - [j10]Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai, Iain A. Stewart:
A class of hierarchical graphs as topologies for interconnection networks. Theor. Comput. Sci. 411(31-33): 2912-2924 (2010) - [c6]Yen-Neng Peng, Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu:
The Existence of Two Mutually Independent Hamiltonian Cycles in Hypercube-Like Graphs. ISPA 2010: 24-28 - [c5]Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu:
Hamiltonian Cycle Embedding in Hierarchical Crossed Cubes. PDCAT 2010: 329-333
2000 – 2009
- 2009
- [j9]Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu:
Globally bi-3*-connected graphs. Discret. Math. 309(8): 1931-1946 (2009) - [j8]Pao-Lien Lai, Hong-Chun Hsu:
Constructing the nearly shortest path in crossed cubes. Inf. Sci. 179(14): 2487-2493 (2009) - [c4]Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai, Tseng-Kuei Li:
Efficient Algorithms for Embedding Cycles in Augmented Cubes. ISPAN 2009: 596-600 - [c3]Chang-Hsiung Tsai, Pao-Lien Lai, Hong-Chun Hsu:
Embed Geodesic Cycles into Mobius Cubes. PACCS 2009: 3-6 - 2008
- [j7]Pao-Lien Lai, Hong-Chun Hsu:
The two-equal-disjoint path cover problem of Matching Composition Network. Inf. Process. Lett. 107(1): 18-23 (2008) - 2007
- [j6]Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai:
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes. Inf. Process. Lett. 101(6): 227-232 (2007) - 2006
- [j5]Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The Spanning Connectivity of the (n, k)-star Graphs. Int. J. Found. Comput. Sci. 17(2): 415-434 (2006) - [c2]Pao-Lien Lai, Hong-Chun Hsu:
On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes. JCIS 2006 - 2005
- [j4]Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault hamiltonicity of augmented cubes. Parallel Comput. 31(1): 131-145 (2005) - 2004
- [j3]Hong-Chun Hsu, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. IEEE Trans. Computers 53(1): 39-53 (2004) - [c1]Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Ring Embedding in Faulty Augmented Cubes. ISPAN 2004: 155-161 - 2003
- [j2]Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu:
Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5): 271-275 (2003) - [j1]Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs. Networks 42(4): 189-201 (2003)
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 2024-04-24 23:18 CEST 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:
