| Publication | Date of Publication | Type |
|---|
| Integrating multi-armed bandit with local search for MaxSAT | 2025-01-17 | Paper |
| An efficient solution space exploring and descent method for packing equal spheres in a sphere | 2024-06-06 | Paper |
| MaxSAT resolution for regular propositional logic | 2023-11-16 | Paper |
| A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem | 2023-11-13 | Paper |
| On solving simplified diversified top-\(k\,s\)-plex problem | 2023-07-04 | Paper |
| Boosting branch-and-bound MaxSAT solvers with clause learning | 2022-09-16 | Paper |
| Clause tableaux for maximum and minimum satisfiability | 2021-12-22 | Paper |
| A resolution calculus for MinSAT | 2021-12-22 | Paper |
| Solving longest common subsequence problems via a transformation to the maximum clique problem | 2021-04-20 | Paper |
| Incremental Upper Bound for the Maximum Clique Problem | 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 | 2020-01-27 | Paper |
| Clause vivification by unit propagation in CDCL SAT solvers | 2020-01-20 | Paper |
| Breaking Cycle Structure to Improve Lower Bound for Max-SAT | 2019-04-26 | Paper |
| An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem | 2019-02-14 | Paper |
| On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem | 2018-07-11 | Paper |
| An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules | 2018-07-11 | Paper |
| A new upper bound for the maximum weight clique problem | 2018-05-31 | Paper |
| Minimum sum coloring problem: upper bounds for the chromatic strength | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282985 | 2017-07-18 | Paper |
| An exact algorithm with learning for the graph coloring problem | 2016-11-10 | Paper |
| Dynamic reduction heuristics for the rectangle packing area minimization problem | 2016-07-06 | Paper |
| An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem | 2016-04-19 | Paper |
| Heuristics for Solving the 2D Rectangle Packing Area Minimization Problem Basing on a Dynamic Reduction Method | 2014-06-30 | Paper |
| Optimizing with minimum satisfiability | 2012-11-15 | Paper |
| Resolution-based lower bounds in MaxSAT | 2010-11-19 | Paper |
| Exact MinSAT Solving | 2010-09-29 | Paper |
| Exploiting Cycle Structures in Max-SAT | 2009-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624095 | 2009-04-28 | Paper |
| Combining Adaptive Noise and Look-Ahead in Local Search for SAT | 2009-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604010 | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604008 | 2009-02-24 | Paper |
| Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers | 2008-09-09 | Paper |
| On Inconsistent Clause-Subsets for Max-SAT Solving | 2008-09-02 | Paper |
| A Preprocessor for Max-SAT Solvers | 2008-05-27 | Paper |
| Exploiting multivalued knowledge in variable selection heuristics for SAT solvers | 2007-10-12 | Paper |
| New heuristics for packing unequal circles into a circular container | 2006-05-16 | Paper |
| A parallelization scheme based on work stealing for a class of SAT solvers | 2006-01-23 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Greedy algorithms for packing unequal circles into a rectangular container | 2005-08-17 | Paper |
| Equivalent literal propagation in the DLL procedure | 2003-09-15 | Paper |
| On the limit of branching rules for hard random unsatisfiable 3-SAT | 2003-09-15 | Paper |
| A constraint-based approach to narrow search trees for satisfiability | 2002-07-25 | Paper |
| Parallelizing SATZ using dynamic workload balancing | 2001-09-24 | Paper |
| Equivalency reasoning to solve a class of hard SAT problems. | 2000-12-12 | Paper |
