Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBin Sheng 0002
Person information
- affiliation: Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China
- affiliation (PhD 2017): Royal Holloway, University of London, Egham, UK
Other persons with the same name
- Bin Sheng — disambiguation page
- Bin Sheng 0001
![[0000-0001-8678-2784]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8678-2784")
(aka: Bing Sheng 0001) — Shanghai Jiao Tong University, Department of Computer Science and Engineering, China (and 2 more) - Bin Sheng 0003 — Southeast University, National Mobile Communication Research Lab, Nanjing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Bin Sheng, Gregory Z. Gutin:
Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. 953: 113798 (2023)- 2021
- [j9]Zemin Jin, Bin Sheng, Yuefang Sun:
The minimum size of a graph with given tree connectivity. Discuss. Math. Graph Theory 41(2): 409-425 (2021)
2010 – 2019
- 2019
- [j8]Ruijuan Li, Bin Sheng:
The second neighbourhood for bipartite tournaments. Discuss. Math. Graph Theory 39(2): 555-565 (2019) - [j7]Bin Sheng, Yuefang Sun:
An improved linear kernel for the cycle contraction problem. Inf. Process. Lett. 149: 14-18 (2019) - 2017
- [b1]Bin Sheng:
Polynomial and FPT algorithms for Chinese Postman, packing and acyclicity. Royal Holloway, University of London, Egham, UK, 2017 - [j6]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79(1): 211-229 (2017) - [j5]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217: 196-202 (2017) - [j4]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in edge-colored graphs. Discret. Math. 340(2): 1-8 (2017) - [j3]Gregory Z. Gutin, Bin Sheng, Magnus Wahlström:
Odd properly colored cycles in edge-colored graphs. Discret. Math. 340(4): 817-821 (2017) - [j2]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst. Sci. 84: 107-119 (2017) - [i8]Bin Sheng, Yuefang Sun:
An improved kernel for the cycle contraction problem. CoRR abs/1706.05628 (2017) - [i7]Bin Sheng, Ruijuan Li, Gregory Z. Gutin:
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs. CoRR abs/1707.06503 (2017) - 2016
- [j1]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116(6): 433-436 (2016) - [i6]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in Edge-Colored Graphs. CoRR abs/1601.01824 (2016) - 2015
- [c3]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC 2015: 43-54 - [i5]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR abs/1510.03564 (2015) - [i4]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR abs/1512.06283 (2015) - 2014
- [c2]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the k-Arc Chinese Postman Problem. ESA 2014: 530-541 - [c1]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG 2014: 250-262 - [i3]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR abs/1402.2137 (2014) - [i2]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the $k$-Arc Chinese Postman Problem. CoRR abs/1403.1512 (2014) - [i1]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR abs/1412.3023 (2014)
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-29 20:32 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:
