default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Chung-Kung Yen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Chih-Yuan Lin, Jia-Jie Liu, Yue-Li Wang, William Chung-Kung Yen, Chiun-Chieh Hsu:
The Outer-Paired Domination of Graphs. Int. J. Found. Comput. Sci. 33(2): 141-148 (2022)
2010 – 2019
- 2016
- [j12]Shun-Chieh Chang, William Chung-Kung Yen, Yue-Li Wang, Jia Jie Liu:
The connected p-median problem on block graphs. Optim. Lett. 10(6): 1191-1201 (2016) - [j11]William Chung-Kung Yen:
Weighted restrained domination in subclasses of planar graphs. Theor. Comput. Sci. 630: 13-25 (2016) - 2015
- [j10]Jia Jie Liu, Cindy Tzu-Hsin Wang, Yue-Li Wang, William Chung-Kung Yen:
The hub number of co-comparability graphs. Theor. Comput. Sci. 570: 15-21 (2015) - 2012
- [j9]William Chung-Kung Yen:
The connected p-center problem on block graphs with forbidden vertices. Theor. Comput. Sci. 426: 13-24 (2012) - [c7]Sheung-Hung Poon
, William Chung-Kung Yen, Chin-Ting Ung:
Domatic Partition on Several Classes of Graphs. COCOA 2012: 245-256 - 2011
- [j8]Jia Jie Liu, William Chung-Kung Yen, Yen-Ju Chen:
An Optimal Algorithm for Untangling Binary Trees via Rotations. Comput. J. 54(11): 1838-1844 (2011) - [j7]Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen:
The Hub Number of Sierpiński-Like Graphs. Theory Comput. Syst. 49(3): 588-600 (2011)
2000 – 2009
- 2008
- [j6]William Chung-Kung Yen:
Restricted independent domination problems on graphs. Comput. Syst. Sci. Eng. 23(6) (2008) - 2007
- [j5]William Chung-Kung Yen:
Edge-Orienting on Split, Planar and Treelike Graphs. Comput. J. 50(3): 357-368 (2007) - [j4]William Chung-Kung Yen, Paul P. Wang:
Guest editorial special issue on graph theory and its applications. Inf. Sci. 177(12): 2403-2404 (2007) - 2006
- [j3]William Chung-Kung Yen:
The edge-orientation problem and some of its variants on weighted graphs. Inf. Sci. 176(19): 2791-2816 (2006) - [c6]William Chung-Kung Yen:
Restricted Weighted Minimum Independent Domination on lk-starlike Graphs. CATA 2006: 25-29 - [c5]William Chung-Kung Yen, Chien-Tsai Chen:
The Connected p-Center Problem with Extension. JCIS 2006 - 2005
- [c4]Shin-Jer Yang, William Chung-Kung Yen, Ting-Yuan Yang:
Routing Design and Performance Evaluation of X-ARC on the Semi-Cactus Workflow. CATA 2005: 1-6 - 2003
- [j2]William Chung-Kung Yen:
The bottleneck independent domination on the classes of bipartite graphs and block graphs. Inf. Sci. 157: 199-215 (2003) - 2002
- [j1]William Chung-Kung Yen:
Bottleneck Domination and Bottleneck Independent Domination on Graphs. J. Inf. Sci. Eng. 18(2): 311-331 (2002) - [c3]Shin-Jer Yang, William Chung-Kung Yen, Yung-Cheng Chou:
Adaptive Routing Control of Workflow Systemon the Internet. CATA 2002: 354-359 - 2001
- [c2]Shin-Jer Yang, William Chung-Kung Yen:
The technology and application of FEDI on the internet. CATA 2001: 9-14 - [c1]William Chung-Kung Yen, Shin-Jer Yang:
The link-orientation problem on weighted networks. CATA 2001: 325-329
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 22:46 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:
