default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHon-Chan Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j21]Tzu-Liang Kung, Hon-Chan Chen, Chia-Hui Lin, Lih-Hsing Hsu:
Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes. Comput. J. 64(1): 27-37 (2021)
2010 – 2019
- 2019
- [j20]Hon-Chan Chen:
The R-Hyper-Panconnectedness of Faulty Crossed Cubes. J. Comput. 14(1): 44-51 (2019) - [c4]Hao-Yen Chang, Ping-Feng Wang, Hon-Chan Chen, Ye-Zheng Chen, Da-Ren Chen:
On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm. ICCE-TW 2019: 1-2 - 2018
- [j19]Tzu-Liang Kung
, Hon-Chan Chen:
Optimizing Hamiltonian panconnectedness for the crossed cube architecture. Appl. Math. Comput. 331: 287-296 (2018) - [j18]Hon-Chan Chen, Tzu-Liang Kung, Lih-Hsing Hsu:
An Augmented Pancyclicity Problem of Crossed Cubes. Comput. J. 61(1): 54-62 (2018) - [j17]Hon-Chan Chen:
The Panpositionable Pancyclicity of Locally Twisted Cubes. IEICE Trans. Inf. Syst. 101-D(12): 2902-2907 (2018) - [j16]Hon-Chan Chen:
The panpositionable panconnectedness of crossed cubes. J. Supercomput. 74(6): 2638-2655 (2018) - 2017
- [j15]Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai:
A note on path embedding in crossed cubes with faulty vertices. Inf. Process. Lett. 121: 34-38 (2017) - 2016
- [j14]Da-Ren Chen, Chiun-Chieh Hsu, Hon-Chan Chen:
A Slack Reclamation Method for Reducing the Speed Fluctuations on the DVFS Real-Time Scheduling. IEICE Trans. Electron. 99-C(8): 918-925 (2016) - 2015
- [j13]Hon-Chan Chen, Tzu-Liang Kung, Yun-Hao Zou, Hsin-Wei Mao:
The Fault-Tolerant Hamiltonian Problems of Crossed Cubes with Path Faults. IEICE Trans. Inf. Syst. 98-D(12): 2116-2122 (2015) - [j12]Tzu-Liang Kung, Hon-Chan Chen:
Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2670-2676 (2015) - [j11]Hon-Chan Chen, Tzu-Liang Kung, Li-Yen Hsu:
2-Disjoint-path-coverable panconnectedness of crossed cubes. J. Supercomput. 71(7): 2767-2782 (2015) - 2014
- [j10]Tzu-Liang Kung, Hon-Chan Chen:
Improving the panconnectedness property of locally twisted cubes. Int. J. Comput. Math. 91(9): 1863-1873 (2014) - [c3]Tzu-Liang Kung, Hon-Chan Chen, Lih-Hsing Hsu, Chi-Lun Wang:
Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks. ICS 2014: 67-76 - 2012
- [c2]Tzu-Liang Kung, Cheng-Kuan Lin, Jimmy J. M. Tan, Hon-Chan Chen, Hsing-Chung Chen:
Identifying Restricted-Faults in Multiprocessor Meshes under the PMC Diagnostic Model. IMIS 2012: 489-493 - 2011
- [j9]Hon-Chan Chen, Tzu-Liang Kung, Lih-Hsing Hsu:
Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions. Appl. Math. Comput. 217(24): 10058-10065 (2011) - 2010
- [j8]Chiu-Hsiung Liao, Ching-Te Wang, Hon-Chan Chen:
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update. Informatica 21(3): 349-359 (2010)
2000 – 2009
- 2009
- [j7]Hon-Chan Chen, Fu-Hsing Wang:
Additive tree 2-spanners of permutation graphs. Int. J. Comput. Math. 86(9): 1490-1497 (2009) - [j6]Chiu-Hsiung Liao, Hon-Chan Chen, Ching-Te Wang:
An Exquisite Mutual Authentication Scheme with Key Agreement Using Smart Card. Informatica (Slovenia) 33(2): 117-124 (2009) - 2008
- [j5]Hon-Chan Chen, Ting-Yem Ho:
The rook problem on saw-toothed chessboards. Appl. Math. Lett. 21(12): 1234-1237 (2008) - 2004
- [j4]Hon-Chan Chen:
Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 483-496 (2004) - 2002
- [c1]Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen:
Fault-Tolerant Routing on the Star Graph with Safety Vectors. ISPAN 2002: 301-
1990 – 1999
- 1997
- [j3]Hon-Chan Chen, Yue-Li Wang:
A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs. Inf. Process. Lett. 63(1): 13-18 (1997) - [j2]Yue-Li Wang, Hon-Chan Chen, Wei-Kai Liu:
A Parallel Algorithm for Constructing a Labeled Tree. IEEE Trans. Parallel Distributed Syst. 8(12): 1236-1240 (1997) - 1995
- [j1]Yue-Li Wang, Hon-Chan Chen, Chen-Yu Lee:
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs. Inf. Process. Lett. 56(2): 83-87 (1995)
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:05 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:
