| Publication | Date of Publication | Type |
|---|
Integrating multi-armed bandit with local search for MaxSAT
Artificial Intelligence | 2025-01-17 | Paper |
An efficient solution space exploring and descent method for packing equal spheres in a sphere
Computers & Operations Research | 2024-06-06 | Paper |
MaxSAT resolution for regular propositional logic
International Journal of Approximate Reasoning | 2023-11-16 | Paper |
A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
Computers & Operations Research | 2023-11-13 | Paper |
On solving simplified diversified top-\(k\,s\)-plex problem
Computers & Operations Research | 2023-07-04 | Paper |
Boosting branch-and-bound MaxSAT solvers with clause learning
AI Communications | 2022-09-16 | Paper |
Clause tableaux for maximum and minimum satisfiability
Logic Journal of the IGPL | 2021-12-22 | Paper |
A resolution calculus for MinSAT
Logic Journal of the IGPL | 2021-12-22 | Paper |
Solving longest common subsequence problems via a transformation to the maximum clique problem
Computers & Operations Research | 2021-04-20 | Paper |
Incremental Upper Bound for the Maximum Clique Problem
INFORMS Journal on Computing | 2020-11-09 | Paper |
| A tableau calculus for non-clausal maximum satisfiability | 2020-05-14 | Paper |
Local search for diversified top-\(k\) clique search problem
Computers & Operations Research | 2020-01-27 | Paper |
Clause vivification by unit propagation in CDCL SAT solvers
Artificial Intelligence | 2020-01-20 | Paper |
Breaking Cycle Structure to Improve Lower Bound for Max-SAT
Frontiers in Algorithmics | 2019-04-26 | Paper |
An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
Computers & Operations Research | 2019-02-14 | Paper |
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Computers & Operations Research | 2018-07-11 | Paper |
An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
Computers & Operations Research | 2018-07-11 | Paper |
A new upper bound for the maximum weight clique problem
European Journal of Operational Research | 2018-05-31 | Paper |
Minimum sum coloring problem: upper bounds for the chromatic strength
Discrete Applied Mathematics | 2017-10-17 | Paper |
| Solving maximum weight clique using maximum satisfiability reasoning | 2017-07-18 | Paper |
An exact algorithm with learning for the graph coloring problem
Computers & Operations Research | 2016-11-10 | Paper |
Dynamic reduction heuristics for the rectangle packing area minimization problem
European Journal of Operational Research | 2016-07-06 | Paper |
An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
The Journal of Artificial Intelligence Research (JAIR) | 2016-04-19 | Paper |
Heuristics for solving the 2D rectangle packing area minimization problem based on a dynamic reduction method
Journal of Software | 2014-06-30 | Paper |
Optimizing with minimum satisfiability
Artificial Intelligence | 2012-11-15 | Paper |
Resolution-based lower bounds in MaxSAT
Constraints | 2010-11-19 | Paper |
Exact MinSAT Solving
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Exploiting Cycle Structures in Max-SAT
Lecture Notes in Computer Science | 2009-07-07 | Paper |
New inference rules for Max-SAT
(available as arXiv preprint) | 2009-04-28 | Paper |
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
| The first and second Max-SAT evaluations | 2009-02-24 | Paper |
| A switching criterion for intensification and diversification in local search for SAT | 2009-02-24 | Paper |
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
On Inconsistent Clause-Subsets for Max-SAT Solving
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
A Preprocessor for Max-SAT Solvers
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
Annals of Mathematics and Artificial Intelligence | 2007-10-12 | Paper |
New heuristics for packing unequal circles into a circular container
Computers & Operations Research | 2006-05-16 | Paper |
A parallelization scheme based on work stealing for a class of SAT solvers
Journal of Automated Reasoning | 2006-01-23 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Greedy algorithms for packing unequal circles into a rectangular container
The Journal of the Operational Research Society | 2005-08-17 | Paper |
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics | 2003-09-15 | Paper |
On the limit of branching rules for hard random unsatisfiable 3-SAT
Discrete Applied Mathematics | 2003-09-15 | Paper |
A constraint-based approach to narrow search trees for satisfiability
Information Processing Letters | 2002-07-25 | Paper |
| Parallelizing SATZ using dynamic workload balancing | 2001-09-24 | Paper |
Equivalency reasoning to solve a class of hard SAT problems.
Information Processing Letters | 2000-12-12 | Paper |
