default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnyu Yao
Person information
- affiliation: Zhejiang University, Hangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Longcheng Liu, Enyu Yao:
Capacity inverse minimum cost flow problems under the weighted Hamming distance. Optim. Lett. 10(6): 1257-1268 (2016)- 2013
- [j10]Biao Wu, Longcheng Liu, Enyu Yao:
Minimizing the maximum bump cost in linear extensions of a poset. J. Comb. Optim. 26(3): 509-519 (2013) - [j9]Longcheng Liu, Enyu Yao:
Weighted inverse maximum perfect matching problems under the Hamming distance. J. Glob. Optim. 55(3): 549-557 (2013) - 2012
- [c2]Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao:
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance. FAW-AAIM 2012: 26-35 - 2011
- [j8]Longcheng Liu, Biao Wu, Enyu Yao:
Minimizing the sum cost in linear extensions of a poset. J. Comb. Optim. 21(2): 247-253 (2011) - 2010
- [j7]Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao:
Inverse minimum cost flow problems under the weighted Hamming distance. Eur. J. Oper. Res. 207(1): 50-54 (2010) - [j6]Biao Wu, Enyu Yao, Longcheng Liu:
A polynomially solvable case of optimal linear extension problem of a poset. J. Comb. Optim. 20(4): 422-428 (2010)
2000 – 2009
- 2008
- [j5]Longcheng Liu, Enyu Yao:
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. Theor. Comput. Sci. 396(1-3): 28-34 (2008) - 2007
- [j4]Longcheng Liu, Enyu Yao:
A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance. Asia Pac. J. Oper. Res. 24(5): 725-736 (2007) - [j3]Wenqing Dou, Enyu Yao:
On rearrangeable multirate three-stage Clos networks. Theor. Comput. Sci. 372(1): 103-107 (2007) - [c1]Longcheng Liu, Enyu Yao:
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance. ESCAPE 2007: 375-383 - 2006
- [j2]Haiyan Lu, Enyu Yao, Liqun Qi
:
Some further results on minimum distribution cost flow problems. J. Comb. Optim. 11(4): 351-371 (2006) - 2005
- [j1]Yong He, Binwu Zhang, Enyu Yao:
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. J. Comb. Optim. 9(1): 91-100 (2005)
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:52 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:
