default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZishen Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Majun Shi, Zishen Yang, Wei Wang:
Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem. J. Comb. Optim. 45(1): 8 (2023)- [j13]Majun Shi, Zishen Yang, Wei Wang:
Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications. J. Optim. Theory Appl. 196(2): 516-543 (2023) - 2021
- [j12]Majun Shi, Zishen Yang, Wei Wang:
Minimum non-submodular cover problem with applications. Appl. Math. Comput. 410: 126442 (2021) - [j11]Xianliang Liu, Zishen Yang, Wei Wang:
The t-latency bounded strong target set selection problem in some kinds of special family of graphs. J. Comb. Optim. 41(1): 105-117 (2021) - [j10]Majun Shi, Zishen Yang, Donghyun Kim, Wei Wang:
Non-monotone submodular function maximization under k-system constraint. J. Comb. Optim. 41(1): 128-142 (2021) - [j9]Zishen Yang, Wei Wang, Donghyun Kim:
On multi-path routing for reliable communications in failure interdependent complex networks. J. Comb. Optim. 41(1): 170-196 (2021) - [j8]Zishen Yang, Wei Wang, Majun Shi:
Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling. J. Optim. Theory Appl. 188(3): 673-695 (2021) - [j7]Zishen Yang, Majun Shi, Wei Wang:
Greedy approximation for the minimum connected dominating set with labeling. Optim. Lett. 15(2): 685-700 (2021)
2010 – 2019
- 2019
- [j6]Xianliang Liu
, Zishen Yang, Wei Wang:
Some results for the two disjoint connected dominating sets problem. Discret. Math. Algorithms Appl. 11(6): 1950065:1-1950065:11 (2019) - [j5]Yuchao Li, Wei Wang, Zishen Yang:
The connected vertex cover problem in k-regular graphs. J. Comb. Optim. 38(2): 635-645 (2019) - 2018
- [j4]Xianliang Liu, Zishen Yang, Wei Wang:
Algorithm and complexity of the two disjoint connected dominating sets problem on trees. Appl. Math. Comput. 337: 419-427 (2018) - 2017
- [j3]Yuchao Li, Zishen Yang, Wei Wang:
Complexity and algorithms for the connected vertex cover problem in 4-regular graphs. Appl. Math. Comput. 301: 107-114 (2017) - [c2]Zishen Yang, Donghyun Kim, Wei Wang:
On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network. COCOA (2) 2017: 76-93 - 2016
- [j2]Xianliang Liu, Zishen Yang, Wei Wang:
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs. Discret. Appl. Math. 203: 111-116 (2016) - [j1]Xianliang Liu, Wei Wang, Donghyun Kim, Zishen Yang, Alade O. Tokuta, Yaolin Jiang:
The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs. Wirel. Networks 22(2): 553-562 (2016) - [c1]Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. N. Uma:
Cost effective mobile and static road side unit deployment for vehicular adhoc networks. ICNC 2016: 1-5
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 23:00 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:
