default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChang-Hsiung Tsai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j36]Tseng-Kuei Li, Meng-Jou Chien, Jheng-Cheng Chen, Chang-Hsiung Tsai:
Routing and wavelength assignment for augmented cubes in array-based wavelength-division-multiplexing optical networks. Int. J. Comput. Math. Comput. Syst. Theory 3(2): 92-105 (2018)- 2017
- [j35]Chang-Hsiung Tsai, Jheng-Cheng Chen:
Diagnosable evaluation of enhanced optical transpose interconnection system networks. Inf. Process. Lett. 118: 105-109 (2017) - 2015
- [j34]Chang-Hsiung Tsai:
The pessimistic diagnosability of alternating group graphs under the PMC model. Inf. Process. Lett. 115(2): 151-154 (2015) - [j33]Chang-Hsiung Tsai, Chia-Jui Lai:
A Linear Algorithm for Embedding of Cycles in Crossed Cubes with Edge-Pncyclic. J. Inf. Sci. Eng. 31(4): 1347-1355 (2015) - 2014
- [j32]Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai:
A Three-Round Adaptive Diagnostic Algorithm in a Distributed System Modeled by Dual-Cubes. Int. J. Found. Comput. Sci. 25(2): 125-140 (2014) - [j31]Chia-Jui Lai, Jheng-Cheng Chen, Chang-Hsiung Tsai:
A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes. Inf. Sci. 289: 1-7 (2014) - 2013
- [j30]Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai, Pao-Lien Lai:
A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube. Appl. Math. Comput. 219(19): 9885-9892 (2013) - [j29]Chang-Hsiung Tsai:
A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model. IEEE Trans. Computers 62(2): 259-267 (2013) - [j28]Chang-Hsiung Tsai, Jheng-Cheng Chen:
Fault isolation and identification in general biswapped networks under the PMC diagnostic model. Theor. Comput. Sci. 501: 62-71 (2013) - [j27]Pao-Lien Lai, Ming-Yi Chiu, Chang-Hsiung Tsai:
Three Round Adaptive Diagnosis in Hierarchical Multiprocessor Systems. IEEE Trans. Reliab. 62(3): 608-617 (2013) - 2012
- [j26]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) - [c10]Chia-Jui Lai, Chang-Hsiung Tsai:
A linear algorithm for embedding of cycles in crossed cubes. FSKD 2012: 2057-2060 - 2011
- [j25]Jheng-Cheng Chen, Chang-Hsiung Tsai:
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes. Inf. Sci. 181(3): 620-627 (2011) - [j24]Tseng-Kuei Li, Chia-Jui Lai, Chang-Hsiung Tsai:
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube. Theor. Comput. Sci. 412(22): 2418-2424 (2011) - [c9]Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai:
A Systematic Algorithm for Embedding Hamiltonian Cycle in Hierarchical Crossed Cubes. CSE 2011: 358-365 - [c8]Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai:
An Adaptive Diagnostic Algorithm for a Distributed System Modeled by Dual-cubes. CSE 2011: 366-370 - [c7]Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai:
Optimal adaptive parallel diagnosis for a distributed system modeled by dual-cubes. FSKD 2011: 1989-1993 - 2010
- [j23]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) - [j22]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) - [j21]Pao-Lien Lai, Chang-Hsiung Tsai:
Embedding of tori and grids into twisted cubes. Theor. Comput. Sci. 411(40-42): 3763-3773 (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]Chia-Jui Lai, Chang-Hsiung Tsai, Tseng-Kuei Li:
Embedding a k-D Torus into a Locally Twisted Cube. PDCAT 2010: 104-109 - [c4]Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu:
Hamiltonian Cycle Embedding in Hierarchical Crossed Cubes. PDCAT 2010: 329-333
2000 – 2009
- 2009
- [j20]Chang-Hsiung Tsai:
Fault-free cycles passing through prescribed paths in hypercubes with faulty edges. Appl. Math. Lett. 22(6): 852-855 (2009) - [c3]Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai, Tseng-Kuei Li:
Efficient Algorithms for Embedding Cycles in Augmented Cubes. ISPAN 2009: 596-600 - [c2]Chang-Hsiung Tsai, Pao-Lien Lai, Hong-Chun Hsu:
Embed Geodesic Cycles into Mobius Cubes. PACCS 2009: 3-6 - 2008
- [j19]Chang-Hsiung Tsai:
Fault-tolerant cycles embedded in hypercubes with mixed link and node failures. Appl. Math. Lett. 21(8): 855-860 (2008) - [j18]Chia-Jui Lai, Chang-Hsiung Tsai:
Embedding a family of meshes into twisted cubes. Inf. Process. Lett. 108(5): 326-330 (2008) - [j17]Chia-Jui Lai, Chang-Hsiung Tsai:
On embedding cycles into faulty dual-cubes. Inf. Process. Lett. 109(2): 147-150 (2008) - [j16]Chang-Hsiung Tsai, Tseng-Kuei Li:
Two construction schemes for cubic hamiltonian 1-node-hamiltonian graphs. Math. Comput. Model. 48(3-4): 656-661 (2008) - [j15]Chang-Hsiung Tsai:
Embedding of meshes in Möbius cubes. Theor. Comput. Sci. 401(1-3): 181-190 (2008) - 2007
- [j14]Chang-Hsiung Tsai, Shu-Yun Jiang:
Path bipancyclicity of hypercubes. Inf. Process. Lett. 101(3): 93-97 (2007) - [j13]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) - [j12]Chang-Hsiung Tsai:
Cycles embedding in hypercubes with node failures. Inf. Process. Lett. 102(6): 242-246 (2007) - [j11]Chang-Hsiung Tsai, Yung-Chun Lai:
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Inf. Sci. 177(24): 5590-5597 (2007) - 2004
- [j10]Y-Chuang Chen, Chang-Hsiung Tsai, Lih-Hsing Hsu, Jimmy J. M. Tan:
On some super fault-tolerant Hamiltonian graphs. Appl. Math. Comput. 148(3): 729-741 (2004) - [j9]Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
The super-connected property of recursive circulant graphs. Inf. Process. Lett. 91(6): 293-298 (2004) - [j8]Pao-Lien Lai, Jimmy J. M. Tan, Chang-Hsiung Tsai, Lih-Hsing Hsu:
The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model. IEEE Trans. Computers 53(8): 1064-1069 (2004) - [j7]Chang-Hsiung Tsai:
Linear array and ring embeddings in conditional faulty hypercubes. Theor. Comput. Sci. 314(3): 431-443 (2004) - 2003
- [j6]Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. Inf. Process. Lett. 87(2): 107-110 (2003) - [j5]Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin:
Cycle embedding in faulty wrapped butterfly graphs. Networks 42(2): 85-96 (2003) - 2002
- [j4]Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu:
Fault-tolerant hamiltonian laceability of hypercubes. Inf. Process. Lett. 83(6): 301-306 (2002) - [j3]Chang-Hsiung Tsai, Jimmy J. M. Tan, Yen-Chu Chuang, Lih-Hsing Hsu:
Hamiltonian Properties of Faulty Recursive Circulant Graphs. J. Interconnect. Networks 3(3-4): 273-289 (2002)
1990 – 1999
- 1999
- [j2]Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang:
The correct diameter of trivalent Cayley graphs. Inf. Process. Lett. 72(3-4): 109-111 (1999) - 1998
- [j1]Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai, Jeng-Yan Hwang:
The Recognition of Double Euler Trails in Series-Parallel Networks. J. Algorithms 28(2): 216-257 (1998) - 1991
- [c1]Lih-Hsing Hsu, Jeng-Yan Hwang, Tung-Yang Ho, Chang-Hsiung Tsai:
A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. ISA 1991: 316-325
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:21 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:
