default search action
Qin Wang 0001
Person information
- affiliation: China Jiliang University, Department of Mathematics, Hangzhou, China
- affiliation (former): Zhengzhou University, Department of Mathematics, China
Other persons with the same name
- Qin Wang — disambiguation page
- Qin Wang 0002 — New York Institute of Technology, School of Engineering and Computing Sciences, NY, USA (and 2 more)
- Qin Wang 0003 — Beijing University of Technology, College of Life Science and Bioengineering, China
- Qin Wang 0004 — University of Science and Technology Beijing, School of Computer and Communication Engineering, China (and 1 more)
- Qin Wang 0005 — Tsinghua University, Department of Computer Science and Technology, Beijing, China
- Qin Wang 0006 — University of Jinan, School of Information Science and Engineering, China
- Qin Wang 0007 — University of Maryland, College Park, MD, USA
- Qin Wang 0008 — CSIRO, Data61, Eveleigh, Australia (and 1 more)
- Qin Wang 0009 — Shanghai Jiao Tong University, Department of Micro/Nano Electronics, China
- Qin Wang 0010 — University of California, San Francisco, CA, USA
- Qin Wang 0011 — Nanjing University of Posts and Telecommunications, Nanjing, China
- Qin Wang 0012 — Zhejiang Wanli University, Ningbo, China
- Qin Wang 0013 — ETH Zurich, Switzerland
- Qin Wang 0014 — South China University of Technology, Guangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Qin Wang, Tianyu Yang, Longshu Wu:
General restricted inverse assignment problems under l1 and l∞ norms. J. Comb. Optim. 44(3): 2040-2055 (2022) - 2021
- [j5]Longshu Wu, Qin Wang:
Degree conditions of nearly induced matching extendable graphs. Contributions Discret. Math. 16(3): 65-73 (2021)
2000 – 2009
- 2008
- [j4]Qin Wang, Jinjiang Yuan, Jianzhong Zhang:
An inverse model for the most uniform problem. Oper. Res. Lett. 36(1): 26-30 (2008) - 2005
- [j3]Qin Wang, Jinjiang Yuan:
4-regular claw-free IM-extendable graphs. Discret. Math. 294(3): 303-309 (2005) - 2003
- [j2]Jinjiang Yuan, Qin Wang:
Partition the vertices of a graph into induced matchings. Discret. Math. 263(1-3): 323-329 (2003) - 2001
- [j1]Qin Wang, Jinjiang Yuan:
Maximal IM-unextendable graphs. Discret. Math. 240(1-3): 295-298 (2001)
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-15 19:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint