default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFu-Hsing Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Fu-Hsing Wang
, Shuo-I Wang:
Independent spanning trees on WK-recursive networks and WK-recursive pyramids. J. Supercomput. 78(7): 9879-9906 (2022)- 2020
- [j14]Shuo-I Wang, Fu-Hsing Wang:
Linear time algorithms for finding independent spanning trees on pyramid networks. J. Comb. Optim. 39(3): 826-848 (2020)
2010 – 2019
- 2019
- [c3]Fu-Hsing Wang, Cheng-Ju Hsu:
Rainbow Connection Number in Pyramid Networks. ICCMS 2019: 147-150 - [c2]Fu-Hsing Wang, Cheng-Ju Hsu:
Rainbow Colorings on WK-recursive Pyramids. ICICM 2019: 75-79 - 2017
- [j13]Shuo-I Wang, Fu-Hsing Wang:
Independent Spanning Trees in RTCC-Pyramids. Comput. J. 60(1): 13-26 (2017) - 2012
- [j12]Chan-Wei Chang, Ma-Lian Chia, Cheng-Ju Hsu, David Kuo, Li-Ling Lai, Fu-Hsing Wang:
Global defensive alliances of trees and Cartesian product of paths and cycles. Discret. Appl. Math. 160(4-5): 479-487 (2012) - [j11]Yue-Li Wang, Cheng-Ju Hsu, Jia Jie Liu, Ming-Tat Ko, Fu-Hsing Wang:
A New Subclass of Integer Linear Programming Problems and Its Applications. IEEE Trans. Computers 61(12): 1813-1822 (2012) - 2010
- [j10]Fu-Hsing Wang:
A note on leader election in directed split-stars and directed alternating group graphs. Int. J. Comput. Math. 87(11): 2450-2457 (2010) - [j9]Fu-Hsing Wang:
The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori. Int. J. Comput. Math. 87(12): 2677-2687 (2010)
2000 – 2009
- 2009
- [j8]Cheng-Ju Hsu, Fu-Hsing Wang, Yue-Li Wang:
Global defensive alliances in star graphs. Discret. Appl. Math. 157(8): 1924-1931 (2009) - [j7]Hon-Chan Chen, Fu-Hsing Wang:
Additive tree 2-spanners of permutation graphs. Int. J. Comput. Math. 86(9): 1490-1497 (2009) - 2008
- [j6]Fu-Hsing Wang:
An efficient distributed algorithm for canonical labeling on directed split-stars. Discret. Appl. Math. 156(18): 3475-3482 (2008) - 2006
- [j5]Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang:
The lower and upper forcing geodetic numbers of block-cactus graphs. Eur. J. Oper. Res. 175(1): 238-245 (2006) - 2005
- [j4]Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai:
Minimal feedback vertex sets in directed split-stars. Networks 45(4): 218-223 (2005) - 2004
- [j3]Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang:
Feedback vertex sets in star graphs. Inf. Process. Lett. 89(4): 203-208 (2004) - [c1]Fu-Hsing Wang, Cheng-Ru Hsu:
A Distributed Algorithm for Finding Minimal Feedback Vertex Sets in Directed Split-Stars. ISPAN 2004: 174-179 - 2003
- [j2]Fu-Hsing Wang, Jou-Ming Chang, Yue-Li Wang, Sun-Jen Huang:
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. J. Parallel Distributed Comput. 63(4): 481-487 (2003)
1990 – 1999
- 1992
- [j1]Maw-Shang Chang, Fu-Hsing Wang:
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs. Inf. Process. Lett. 43(6): 293-295 (1992)
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:43 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:
