default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-Chien Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c8]Ming-Chien Yang:
Reliability Evaluation of Star Graphs in Terms of Extra Edge Connectivity. ISPDC 2016: 416-419- 2015
- [c7]Ming-Chien Yang:
Super Connectivity of Component-Composition Networks. ACIT-CSI 2015: 274-277 - 2014
- [c6]Ming-Hour Yang, Ming-Chien Yang, Jia-Ning Luo
, Wei-Chun Hsu:
High accuracy and low storage hybrid IP traceback. CITS 2014: 1-5 - 2013
- [j17]Ming-Chien Yang:
Conditional diagnosability of balanced hypercubes under the PMC model. Inf. Sci. 222: 754-760 (2013) - [j16]Ming-Chien Yang:
Conditional diagnosability of matching composition networks under the MM∗ model. Inf. Sci. 233: 230-243 (2013) - [j15]Ming-Chien Yang:
Conditional diagnosability of balanced hypercubes under the MM∗ model. J. Supercomput. 65(3): 1264-1278 (2013) - [c5]Jia-Ning Luo, Ming-Hour Yang, Ming-Chien Yang:
An Anonymous Car Rental System Based on NFC. ISBAST 2013 - 2012
- [j14]Ming-Chien Yang:
Super connectivity of balanced hypercubes. Appl. Math. Comput. 219(3): 970-975 (2012) - [j13]Ming-Hour Yang, Ming-Chien Yang:
RIHT: A Novel Hybrid IP Traceback Scheme. IEEE Trans. Inf. Forensics Secur. 7(2): 789-797 (2012) - 2010
- [j12]Ming-Chien Yang:
Cycle embedding in star graphs with conditional edge faults. Appl. Math. Comput. 215(10): 3541-3546 (2010) - [j11]Ming-Chien Yang:
Embedding cycles of various lengths into star graphs with both edge and vertex faults. Appl. Math. Comput. 216(12): 3754-3760 (2010) - [j10]Ming-Chien Yang:
Bipanconnectivity of balanced hypercubes. Comput. Math. Appl. 60(7): 1859-1867 (2010) - [j9]Ming-Chien Yang:
Constructing edge-disjoint spanning trees in twisted cubes. Inf. Sci. 180(20): 4075-4083 (2010)
2000 – 2009
- 2009
- [j8]Ming-Chien Yang:
Path embedding in star graphs. Appl. Math. Comput. 207(2): 283-291 (2009) - [j7]Ming-Chien Yang:
Edge-fault-tolerant node-pancyclicity of twisted cubes. Inf. Process. Lett. 109(21-22): 1206-1210 (2009) - [c4]Ming-Chien Yang:
Node-Pancyclicity of Faulty Twisted Cubes. PDCAT 2009: 63-66 - [c3]Ming-Chien Yang:
Conditional Fault-Tolerant Cycle Embedding of Star Graphs. PDCAT 2009: 67-71 - 2007
- [j6]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J. Parallel Distributed Comput. 67(4): 362-368 (2007) - [j5]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Highly fault-tolerant cycle embeddings of hypercubes. J. Syst. Archit. 53(4): 227-232 (2007) - [j4]Ming-Chien Yang, Norman Sheng, Brandon Huang, Jethro Tu:
Collaboration of Set-Top Box and Residential Gateway Platforms. IEEE Trans. Consumer Electron. 53(3): 905-910 (2007) - 2006
- [j3]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) - [c2]Hsi-Feng Lu, Shu-Hao Chang, Bing-Jie Huang, Jiann-Liang Chen, Brandon Huang, Ming-Chien Yang:
Home network diagnosis system design. IMSA 2006: 101-106 - 2005
- [j2]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) - [c1]Ming-Chien Yang, Jimmy J. M. Tan, Lih-Hsing Hsu:
Cycles in Highly Faulty Hypercubes. FCS 2005: 101-110 - 2003
- [j1]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)
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-25 05:51 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:
