| Boosting evolutionary algorithm configuration | 0 | 0.34 | 2022 |
| PyDGGA: Distributed GGA for Automatic Configuration | 0 | 0.34 | 2021 |
| Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. | 0 | 0.34 | 2020 |
| Meta-Algorithms in Cognitive Computing. | 1 | 0.35 | 2017 |
| Learning a Reactive Restart Strategy to Improve Stochastic Search. | 1 | 0.39 | 2017 |
| Reactive Dialectic Search Portfolios for MaxSAT. | 4 | 0.44 | 2017 |
| MaxSAT by improved instance-specific algorithm configuration. | 7 | 0.45 | 2016 |
| Model-Based Genetic Algorithms for Algorithm Configuration. | 10 | 0.57 | 2015 |
| MaxSAT by Improved Instance-Specific Algorithm Configuration. | 8 | 0.51 | 2014 |
| Snappy: a simple algorithm portfolio | 7 | 0.43 | 2013 |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings | 32 | 1.73 | 2013 |
| Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. | 6 | 0.40 | 2013 |
| Algorithm portfolios based on cost-sensitive hierarchical clustering | 29 | 0.95 | 2013 |
| Parallel SAT solver selection and scheduling | 12 | 0.53 | 2012 |
| Instance-Specific algorithm configuration as a method for non-model-based portfolio generation | 14 | 0.59 | 2012 |
| Learning Back-Clauses in SAT - (Poster Presentation). | 0 | 0.34 | 2012 |
| Non-Model-Based Search Guidance for Set Partitioning Problems. | 3 | 0.42 | 2012 |
| Algorithm selection and scheduling | 31 | 1.24 | 2011 |
| Non-model-based algorithm portfolios for SAT | 15 | 0.64 | 2011 |
| A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. | 0 | 0.34 | 2011 |
| Incorporating variance in impact-based search | 3 | 0.45 | 2011 |
| Grammar constraints | 2 | 0.39 | 2010 |
| Upper bounds on the number of solutions of binary integer programs | 1 | 0.35 | 2010 |
| A complete multi-valued SAT solver | 6 | 0.56 | 2010 |
| Dynamic structural symmetry breaking for constraint satisfaction problems | 8 | 0.49 | 2009 |
| Special issue on constraint programming | 0 | 0.34 | 2009 |
| Approximated consistency for the automatic recording constraint | 2 | 0.37 | 2009 |
| Stochastic Offline Programming | 3 | 0.40 | 2009 |
| Backdoors to Combinatorial Optimization: Feasibility and Optimality | 12 | 0.61 | 2009 |
| Length-Lex Bounds Consistency For Knapsack Constraints | 4 | 0.47 | 2009 |
| The Polytope of Context-Free Grammar Constraints | 5 | 0.54 | 2009 |
| Static and dynamic structural symmetry breaking | 14 | 0.68 | 2009 |
| Enhanced Inference for the Market Split Problem | 3 | 0.51 | 2009 |
| A gender-based genetic algorithm for the automatic configuration of algorithms | 111 | 3.84 | 2009 |
| On decomposing Knapsack constraints for length-lex bounds consistency | 2 | 0.39 | 2009 |
| Efficient context-free grammar constraints | 6 | 0.58 | 2008 |
| The accuracy of search heuristics: an empirical study on knapsack problems | 3 | 0.40 | 2008 |
| The polytope of tree-structured binary constraint satisfaction problems | 2 | 0.38 | 2008 |
| Model Restarts for Structural Symmetry Breaking | 6 | 0.44 | 2008 |
| Dichotomic Search Protocols for Constrained Optimization | 7 | 0.54 | 2008 |
| Propagating knapsack constraints in sublinear time | 6 | 0.50 | 2007 |
| Cost-based Filtering for Shorter Path Constraints | 26 | 1.58 | 2007 |
| The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width | 6 | 0.51 | 2007 |
| Disco - Novo - GoGo: integrating local search and complete search with restarts | 8 | 0.62 | 2006 |
| Plan b: uncertainty/time trade-offs for linear and integer programming | 0 | 0.34 | 2006 |
| A totally unimodular description of the consistent value polytope for binary constraint programming | 5 | 0.50 | 2006 |
| Approximated Consistency for the Automatic Recording Problem | 2 | 0.41 | 2005 |
| Structural Symmetry Breaking | 23 | 1.12 | 2005 |
| Shorter path constraints for the resource constrained shortest path problem | 7 | 0.55 | 2005 |
| The practice of approximated consistency for Knapsack constraints | 8 | 0.66 | 2004 |
