default search action
Shih-Shun Kao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung
, Chia-Wei Lee, Sun-Yuan Hsieh
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. J. Parallel Distributed Comput. 181: 104731 (2023) - 2022
- [b1]Shih-Shun Kao:
On some subgraph optimization problems for networks. (Sur quelques problèmes d'optimisation de sous-graphes pour les réseaux). National Cheng Kung University, Tainan City, Taiwan, 2022 - [j6]Florent Foucaud, Shih-Shun Kao
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319: 424-438 (2022) - 2021
- [j5]Yi-Cheng Yang, Shih-Shun Kao
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. IEEE Access 9: 16679-16691 (2021) - [c4]Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. AAIM 2021: 252-264 - 2020
- [j4]Jie-Fu Huang
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks. IEEE Access 8: 112333-112347 (2020) - [c3]Shih-Chia Chang, Li-Hsuan Chen
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. ICS 2020: 126-130 - [i1]Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. CoRR abs/2011.00029 (2020)
2010 – 2019
- 2019
- [j3]Sun-Yuan Hsieh
A Swap-Based Heuristic Algorithm for the Maximum $k$ -Plex Problem. IEEE Access 7: 110267-110278 (2019) - [j2]Shih-Shun Kao
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986 (2019) - [j1]Sun-Yuan Hsieh, Shih-Shun Kao
A Survey of Hub Location Problems. J. Interconnect. Networks 19(1): 1940005:1-1940005:14 (2019) - 2018
- [c2]Shih-Shun Kao
Constructing Independent Spanning Trees on Bubble-Sort Networks. COCOON 2018: 1-13 - 2017
- [c1]Shih-Shun Kao
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55
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 2025-01-09 12:56 CET 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: