default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTseng-Kuei Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j14]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)- 2012
- [j13]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) - 2011
- [j12]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) - 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) - 2008
- [j10]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) - 2006
- [j9]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
On embedding cycles into faulty twisted cubes. Inf. Sci. 176(6): 676-690 (2006) - 2005
- [j8]Tseng-Kuei Li:
Cycle embedding in star graphs with edge faults. Appl. Math. Comput. 167(2): 891-900 (2005) - [j7]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Pancyclicity of the Möbius Cubes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 346-352 (2005) - 2004
- [j6]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hyper hamiltonian laceability on edge fault star graph. Inf. Sci. 165(1-2): 59-71 (2004) - [j5]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) - 2003
- [j4]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) - [j3]Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant cycle-embedding of crossed cubes. Inf. Process. Lett. 88(4): 149-154 (2003) - 2001
- [j2]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
The shuffle-cubes and their generalization. Inf. Process. Lett. 77(1): 35-41 (2001) - 2000
- [j1]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Optimum Congested Routing Strategy on Twisted Cubes. J. Interconnect. Networks 1(2): 115-134 (2000)
Conference and Workshop Papers
- 2010
- [c3]Chia-Jui Lai, Chang-Hsiung Tsai, Tseng-Kuei Li:
Embedding a k-D Torus into a Locally Twisted Cube. PDCAT 2010: 104-109 - 2009
- [c2]Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai, Tseng-Kuei Li:
Efficient Algorithms for Embedding Cycles in Augmented Cubes. ISPAN 2009: 596-600 - 2002
- [c1]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hamiltonian laceability on edge fault star graph. ICPADS 2002: 23-
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 22:48 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:
