default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuan-Kang Shih
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j12]Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao:
A study on degree characterization for hamiltonian-connected graphs. Ars Comb. 133: 297-316 (2017)- [c4]Yuan-Kang Shih, Mei-Ju Shih, Hung-Yu Wei:
Energy-Efficient D2D Discovery for Energy-Harvesting Proximal IoT Devices. VTC Spring 2017: 1-6 - 2014
- [j11]Yuan-Kang Shih, Hsun Su, Shin-Shin Kao:
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization. Int. J. Comput. Math. 91(9): 1931-1939 (2014) - [c3]Yuan-Kang Shih, Hung-Yu Wei:
A Soft Fault Detection Mechanism with High Accuracy on Machine-to-Machine Communication Networks. iThings/GreenCom/CPSCom 2014: 340-343 - 2012
- [j10]Cheng-Kuan Lin, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually Independent Hamiltonian Cycles in Some Graphs. Ars Comb. 106: 137-142 (2012) - [j9]Hsun Su, Yuan-Kang Shih, Shin-Shin Kao:
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem. Inf. Process. Lett. 112(21): 839-843 (2012) - 2011
- [j8]Yuan-Kang Shih, Shin-Shin Kao:
One-to-one disjoint path covers on k-ary n-cubes. Theor. Comput. Sci. 412(35): 4513-4530 (2011) - 2010
- [j7]Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually independent bipanconnected property of hypercube. Appl. Math. Comput. 217(8): 4017-4023 (2010) - [j6]Yuan-Kang Shih, Cheng-Kuan Lin, D. Frank Hsu, Jimmy J. M. Tan, Lih-Hsing Hsu:
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs. Int. J. Comput. Math. 87(10): 2212-2225 (2010) - [j5]Yuan-Kang Shih, Hui-Chun Chuang, Shin-Shin Kao, Jimmy J. M. Tan:
Mutually independent Hamiltonian cycles in dual-cubes. J. Supercomput. 54(2): 239-251 (2010) - [c2]Yuan-Hsiang Teng, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Two Spanning Disjoint Paths with Required Length in Arrangement Graphs. PDPTA 2010: 527-531
2000 – 2009
- 2009
- [j4]Yuan-Kang Shih, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
The bipanpositionable bipancyclic property of the hypercube. Comput. Math. Appl. 58(9): 1722-1724 (2009) - [j3]Tung-Yang Ho, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Conditional fault hamiltonian connectivity of the complete graph. Inf. Process. Lett. 109(12): 585-588 (2009) - [c1]Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
The Mutually Independent Bipanconnected Property for Hypercube. ISPAN 2009: 606-609 - 2008
- [j2]Yuan-Kang Shih, Yi-Chien Wu, Shin-Shin Kao, Jimmy J. M. Tan:
Vertex-bipancyclicity of the generalized honeycomb tori. Comput. Math. Appl. 56(11): 2848-2860 (2008) - [j1]Shin-Shin Kao, Jui-Chia Wu, Yuan-Kang Shih:
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks. J. Inf. Sci. Eng. 24(2): 615-625 (2008)
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:
