Junqiang Peng

Orcid: 0000-0003-2742-5562

Affiliations:
  • University of Electronic Science and Technology of China, Sichuan, China


According to our database1, Junqiang Peng authored at least 17 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions.
CoRR, May, 2026

Faster Parameterized Vertex Multicut.
CoRR, February, 2026

The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods.
CoRR, February, 2026

Optimal Shielding to Guarantee Region-Based Connectivity Between Multiple Pairs of Nodes.
IEEE Trans. Netw., 2026

A fast algorithm for maximum satisfiability above half number of clauses.
Theor. Comput. Sci., 2026

Better approximation algorithms for clustered TSP and subgroup planning.
Comput. Oper. Res., 2026

Sustained Vertex Cover on Temporal Graphs.
Proceedings of the ACM Web Conference 2026, 2026

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Systematic Parameter Decision in Approximate Model Counting.
CoRR, April, 2025

Fast exact algorithms for the SAT problem with bounded occurrences of variables.
Theor. Comput. Sci., 2025

New Algorithms for #2-SAT and #3-SAT.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
A Fast Algorithm for MaxSAT above Half Number of Clauses.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
Further improvements for SAT in terms of formula length.
Inf. Comput., October, 2023

Fast Algorithms for SAT with Bounded Occurrences of Variables.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures.
Proceedings of the IEEE INFOCOM 2022, 2022

2021
A Fast Algorithm for SAT in Terms of Formula Length.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021


  Loading...