| Publication | Date of Publication | Type |
|---|
PathLAD+: Towards effective exact methods for subgraph isomorphism problem
Artificial Intelligence | 2025-01-17 | Paper |
A local search approach to protocol verification
Theoretical Computer Science | 2024-08-20 | Paper |
Local Search For Satisfiability Modulo Integer Arithmetic Theories
ACM Transactions on Computational Logic | 2023-11-03 | Paper |
Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
Artificial Intelligence | 2023-01-04 | Paper |
Local Search for SMT on Linear Integer Arithmetic
| 2022-12-07 | Paper |
Improving Simulated Annealing for Clique Partitioning Problems
Journal of Artificial Intelligence Research | 2022-08-30 | Paper |
Better Decision Heuristics in CDCL through Local Search and Target Phases
Journal of Artificial Intelligence Research | 2022-08-30 | Paper |
Efficient local search for pseudo Boolean optimization
| 2022-03-22 | Paper |
Deep cooperation of CDCL and local search for SAT
| 2022-03-22 | Paper |
A clique-superposition model for social networks
Science China Information Sciences | 2021-12-15 | Paper |
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
Journal of Artificial Intelligence Research | 2021-05-25 | Paper |
Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
Artificial Intelligence | 2020-11-16 | Paper |
Towards faster local search for minimum weight vertex cover on massive graphs
Information Sciences | 2020-09-22 | Paper |
New heuristic approaches for maximum balanced biclique problem
Information Sciences | 2020-07-20 | Paper |
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
Journal of Combinatorial Optimization | 2020-04-27 | Paper |
SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
Artificial Intelligence | 2020-02-26 | Paper |
A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation
Artificial Intelligence | 2020-01-20 | Paper |
An automatic proving approach to parameterized verification
ACM Transactions on Computational Logic | 2019-02-07 | Paper |
Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
Journal of Artificial Intelligence Research | 2017-10-24 | Paper |
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
IEEE Transactions on Computers | 2017-05-16 | Paper |
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
Journal of Artificial Intelligence Research | 2017-02-17 | Paper |
CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
Artificial Intelligence | 2017-01-05 | Paper |
New local search methods for partial MaxSAT
Artificial Intelligence | 2016-10-21 | Paper |
Improving local search for random 3-SAT using quantitative configuration checking
| 2015-12-11 | Paper |
CCAnr: a configuration checking based local search solver for non-random satisfiability
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Local search for Boolean satisfiability with configuration checking and subscore
Artificial Intelligence | 2015-08-27 | Paper |
Scoring functions based on second level score for \(k\)-SAT with long clauses
The Journal of Artificial Intelligence Research (JAIR) | 2014-11-13 | Paper |
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research | 2013-05-02 | Paper |
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence | 2011-11-17 | Paper |
