default search action
Shyue-Ming Tang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Hsin-Jung Lin, Shyue-Ming Tang
, Kung-Jui Pai
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks. Int. J. Found. Comput. Sci. 35(5): 535-550 (2024) - 2021
- [j14]Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor. Comput. Sci. 878-879: 102-112 (2021) - 2020
- [j13]Mei-Mei Gu
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279: 80-91 (2020)
2010 – 2019
- 2018
- [j12]Jou-Ming Chang
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. Comput. J. 61(1): 121-128 (2018) - [j11]Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li, Jou-Ming Chang
Cycle Embedding in Generalized Recursive Circulant Graphs. IEICE Trans. Inf. Syst. 101-D(12): 2916-2921 (2018) - 2017
- [c1]Shih-Shun Kao
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55 - 2014
- [j10]Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang
Completely Independent Spanning Trees on Some Interconnection Networks. IEICE Trans. Inf. Syst. 97-D(9): 2514-2517 (2014) - 2012
- [j9]Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li:
Generalized Recursive Circulant Graphs. IEEE Trans. Parallel Distributed Syst. 23(1): 87-93 (2012) - 2010
- [j8]Jinn-Shyong Yang, Jou-Ming Chang
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). Int. J. Found. Comput. Sci. 21(1): 73-90 (2010) - [j7]Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang
Independent Spanning Trees on Multidimensional Torus Networks. IEEE Trans. Computers 59(1): 93-102 (2010)
2000 – 2009
- 2009
- [j6]Jinn-Shyong Yang, Jou-Ming Chang
On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2. Theor. Comput. Sci. 410(21-23): 2001-2010 (2009) - 2007
- [j5]Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang
Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput. 33(1): 73-79 (2007) - [j4]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
Reducing the Height of Independent Spanning Trees in Chordal Rings. IEEE Trans. Parallel Distributed Syst. 18(5): 644-657 (2007) - 2004
- [j3]Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho:
The tree longest detour problem in a biconnected graph. Eur. J. Oper. Res. 155(3): 631-637 (2004) - [j2]Shyue-Ming Tang, Yue-Li Wang, Yung-Ho Leu:
Optimal Independent Spanning Trees on Hypercubes. J. Inf. Sci. Eng. 20(1): 143-156 (2004) - 2001
- [j1]Shyue-Ming Tang, Fu-Long Yeh, Yue-Li Wang:
An efficient algorithm for solving the homogeneous set sandwich problem. Inf. Process. Lett. 77(1): 17-22 (2001)
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-09-21 23:35 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: