default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBing Wang 0008
Person information
- affiliation: East China Normal University, Department of Mathematics, Shanghai Key Laboratory of PMMP, China
Other persons with the same name
- Bing Wang — disambiguation page
- Bing Wang 0001
![[0000-0002-7632-6512]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7632-6512")
— University of Connecticut, Computer Science and Engineering Department, Storrs, CT, USA (and 1 more) - Bing Wang 0002 — Shanghai University, School of Mechatronics and Automation, China
- Bing Wang 0003 — Nanyang Technological University, School of Electrical and Electronic Engineering, Singapore
- Bing Wang 0004 — Tongji University, Shanghai, China (and 2 more)
- Bing Wang 0005 — Virginia Polytechnic Institute and State University, Department of Computer Science, Falls Church, VA, USA
- Bing Wang 0006 — Shanghai Jiao Tong University, Department of Automation, Key Laboratory of System Control and Information Processing, China
- Bing Wang 0007 — Stony Brook University, Computer Science Department, Visual Analytics and Imaging Lab., NY, USA
- Bing Wang 0009 — National Digital Switching System Engineering and Technological Research Center, Zhengzhou, China
- Bing Wang 0010 — China University of Petroleum, State Key Laboratory of Petroleum Resources and Prospecting, Beijing, China
- Bing Wang 0011 — University of New South Wales, Canberra, Australia
- Bing Wang 0012 — University of York, UK
- Bing Wang 0013 — University at Oxford, UK (and 1 more)
- Bing Wang 0014 — Nanjing Normal University of Special Education, Nanjing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Changhong Lu, Rui Mao, Bing Wang:
Power domination in regular claw-free graphs. Discret. Appl. Math. 284: 401-415 (2020)
2010 – 2019
- 2019
- [j5]Changhong Lu, Bing Wang, Kan Wang, Yana Wu:
Paired-domination in claw-free graphs with minimum degree at least three. Discret. Appl. Math. 257: 250-259 (2019) - 2018
- [j4]Changhong Lu, Rui Mao, Bing Wang:
Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four. Ars Comb. 139: 393-409 (2018) - [j3]Changhong Lu, Bing Wang, Kan Wang:
Algorithm complexity of neighborhood total domination and (ρ, γnt)-graphs. J. Comb. Optim. 35(2): 424-435 (2018) - 2017
- [j2]Changhong Lu, Rui Mao, Bing Wang, Ping Zhang:
Cover k-Uniform Hypergraphs by Monochromatic Loose Paths. Electron. J. Comb. 24(4): 4 (2017) - [j1]Changhong Lu, Bing Wang, Ping Zhang:
Monochromatic loose path partitions in k-uniform hypergraphs. Discret. Math. 340(12): 2789-2791 (2017)
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-11-20 21:56 CET 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:
