default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunqiang Peng 0001
Person information
- affiliation: University of Electronic Science and Technology of China, Sichuan, China
- unicode name: 彭俊强
Other persons with the same name
- Junqiang Peng 0002 — Tianjin Polytechnic University, Tianjin, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j5]Jingyang Zhao
, Mingyu Xiao, Junqiang Peng, Ziliang Xiong:
Better approximation algorithms for clustered TSP and subgroup planning. Comput. Oper. Res. 191: 107471 (2026)- [j4]Junqiang Peng, Mingyu Xiao:
A fast algorithm for maximum satisfiability above half number of clauses. Theor. Comput. Sci. 1078: 116020 (2026) - [j3]Binglin Tao, Mingyu Xiao, Junqiang Peng, Zimo Sheng, Bakh Khoussainov:
Optimal Shielding to Guarantee Region-Based Connectivity Between Multiple Pairs of Nodes. IEEE Trans. Netw. 34: 3564-3579 (2026) - [c8]Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao:
How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? AAAI 2026: 17276-17283 - [c7]Junqiang Peng, Tian Bai, Jingyang Zhao, Mingyu Xiao:
Sustained Vertex Cover on Temporal Graphs. WWW 2026: 822-833 - [i7]Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao:
How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? CoRR abs/2601.08530 (2026) - [i6]Yuxi Liu, Junqiang Peng, Mingyu Xiao:
The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods. CoRR abs/2602.13422 (2026) - [i5]Huairui Chu, Yuxi Liu, Daniel Lokshtanov, Junqiang Peng, Kangyi Tian, Mingyu Xiao:
Faster Parameterized Vertex Multicut. CoRR abs/2602.13981 (2026) - [i4]Sanjay Jain, Junqiang Peng, Frank Stephan, Haoyun Tang, Mingyu Xiao:
New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions. CoRR abs/2605.14093 (2026) - 2025
- [j2]Junqiang Peng, Mingyu Xiao:
Fast exact algorithms for the SAT problem with bounded occurrences of variables. Theor. Comput. Sci. 1029: 115037 (2025) - [c6]Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong:
Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. AAAI 2025: 26742-26749 - [c5]Junqiang Peng, Zimo Sheng, Mingyu Xiao:
New Algorithms for #2-SAT and #3-SAT. IJCAI 2025: 2666-2674 - [i3]Jinping Lei, Toru Takisaka, Junqiang Peng, Mingyu Xiao:
Systematic Parameter Decision in Approximate Model Counting. CoRR abs/2504.05874 (2025) - [i2]Junqiang Peng, Zimo Sheng, Mingyu Xiao:
New Algorithms for #2-SAT and #3-SAT. CoRR abs/2507.14504 (2025) - 2024
- [c4]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for MaxSAT above Half Number of Clauses. IJCAI 2024: 1935-1943 - 2023
- [j1]Junqiang Peng, Mingyu Xiao:
Further improvements for SAT in terms of formula length. Inf. Comput. 294: 105085 (2023) - [c3]Junqiang Peng, Mingyu Xiao:
Fast Algorithms for SAT with Bounded Occurrences of Variables. IJCAI 2023: 2004-2012 - 2022
- [c2]Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng:
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM 2022: 1109-1118 - 2021
- [c1]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for SAT in Terms of Formula Length. SAT 2021: 436-452 - [i1]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for SAT in Terms of Formula Length. CoRR abs/2105.06131 (2021)
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 2026-06-12 21:28 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:
