| 2022 | ICMLA | Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. | Meinolf Sellmann, Tapan Shah |
| 2021 | SAT | PyDGGA: Distributed GGA for Automatic Configuration. | Carlos Anstegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
| 2020 | AI | Empirical Confidence Models for Supervised Machine Learning. | Margarita P. Castro, Meinolf Sellmann, Zhaoyuan Yang, Nurali Virani |
| 2019 | AAAI | Consensual Affine Transformations for Partial Valuation Aggregation. | Hermann Schichl, Meinolf Sellmann |
| 2019 | CP | Exploiting Counterfactuals for Scalable Stochastic Optimization. | Stefan Kuhlemann, Meinolf Sellmann, Kevin Tierney |
| 2018 | CP | Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. | Carlos Anstegui, Meinolf Sellmann, Kevin Tierney |
| 2017 | AAAI | Reactive Dialectic Search Portfolios for MaxSAT. | Carlos Anstegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
| 2015 | AAAI | Predisaster Preparation of Transportation Networks. | Hermann Schichl, Meinolf Sellmann |
| 2015 | IJCAI | Model-Based Genetic Algorithms for Algorithm Configuration. | Carlos Anstegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney |
| 2014 | AAAI | MaxSAT by Improved Instance-Specific Algorithm Configuration. | Carlos Anstegui, Yuri Malitsky, Meinolf Sellmann |
| 2014 | AAAI | Parallel Restarted Search. | Andr A. Cir, Serdar Kadioglu, Meinolf Sellmann |
| 2013 | IJCAI | Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. | Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2013 | SAT | Snappy: A Simple Algorithm Portfolio. | Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann |
| 2012 | AAAI | Non-Model-Based Search Guidance for Set Partitioning Problems. | Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann |
| 2012 | CP | Parallel SAT Solver Selection and Scheduling. | Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2012 | CPAIOR | Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. | Yuri Malitsky, Meinolf Sellmann |
| 2012 | SAT | Learning Back-Clauses in SAT - (Poster Presentation). | Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2011 | AAAI | A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. | Siddhartha Jain, Ashish Sabharwal, Meinolf Sellmann |
| 2011 | CP | Algorithm Selection and Scheduling. | Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2011 | CP | Incorporating Variance in Impact-Based Search. | Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, Meinolf Sellmann |
| 2011 | SAT | Non-Model-Based Algorithm Portfolios for SAT. | Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2010 | AAAI | Filtering Bounded Knapsack Constraints in Expected Sublinear Time. | Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek |
| 2010 | CP | A Complete Multi-valued SAT Solver. | Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann |
| 2010 | CPAIOR | Upper Bounds on the Number of Solutions of Binary Integer Programs. | Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann |
| 2010 | ECAI | ISAC - Instance-Specific Algorithm Configuration. | Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, Kevin Tierney |
| 2009 | CP | A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. | Carlos Anstegui, Meinolf Sellmann, Kevin Tierney |
| 2009 | CP | Same-Relation Constraints. | Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivn |
| 2009 | CP | Dialectic Search. | Serdar Kadioglu, Meinolf Sellmann |
| 2009 | CP | On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. | Meinolf Sellmann |
| 2009 | CPAIOR | Backdoors to Combinatorial Optimization: Feasibility and Optimality. | Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann |
| 2009 | CPAIOR | The Polytope of Context-Free Grammar Constraints. | Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann |
| 2009 | ICTAI | Enhanced Inference for the Market Split Problem. | Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Meinolf Sellmann |
| 2009 | ICTAI | Stochastic Offline Programming. | Yuri Malitsky, Meinolf Sellmann |
| 2008 | AAAI | Efficient Context-Free Grammar Constraints. | Serdar Kadioglu, Meinolf Sellmann |
| 2008 | CP | Model Restarts for Structural Symmetry Breaking. | Daniel S. Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip |
| 2008 | CP | Length-Lex Bounds Consistency for Knapsack Constraints. | Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve |
| 2008 | CP | Dichotomic Search Protocols for Constrained Optimization. | Meinolf Sellmann, Serdar Kadioglu |
| 2008 | CPAIOR | The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. | Daniel H. Leventhal, Meinolf Sellmann |
| 2008 | CPAIOR | The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. | Meinolf Sellmann |
| 2007 | AAAI | Propagating Knapsack Constraints in Sublinear Time. | Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck |
| 2007 | CPAIOR | The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. | Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal |
| 2006 | AAAI | Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. | Meinolf Sellmann, Carlos Anstegui |
| 2006 | CP | Static and Dynamic Structural Symmetry Breaking. | Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck |
| 2006 | CP | Dynamic Symmetry Breaking Restarted. | Daniel S. Heller, Meinolf Sellmann |
| 2006 | CP | The Theory of Grammar Constraints. | Meinolf Sellmann |
| 2006 | CPAIOR | A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. | Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann |
| 2006 | CPAIOR | Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. | Claire Kenyon, Meinolf Sellmann |
| 2005 | CP | Approximated Consistency for the Automatic Recording Problem. | Meinolf Sellmann |
| 2005 | CPAIOR | Shorter Path Constraints for the Resource Constrained Shortest Path Problem. | Thorsten Gellermann, Meinolf Sellmann, Robert Wright |
| 2005 | IJCAI | Structural Symmetry Breaking. | Meinolf Sellmann, Pascal Van Hentenryck |
| 2004 | AAAI | The Practice of Approximated Consistency for Knapsack Constraints. | Meinolf Sellmann |
| 2004 | CP | Streamlined Constraint Reasoning. | Carla P. Gomes, Meinolf Sellmann |
| 2004 | CP | Theoretical Foundations of CP-Based Lagrangian Relaxation. | Meinolf Sellmann |
| 2004 | CPAIOR | The Challenge of Generating Spatially Balanced Scientific Experiment Designs. | Carla P. Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es |
| 2003 | CP | Approximated Consistency for Knapsack Constraints. | Meinolf Sellmann |
| 2003 | CP | Cost-Based Filtering for Shorter Path Constraints. | Meinolf Sellmann |
| 2003 | ESA | Multicommodity Flow Approximation Used for Exact Graph Partitioning. | Meinolf Sellmann, Norbert Sensen, Larissa Timajev |
| 2002 | CP | An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. | Meinolf Sellmann |
| 2002 | CP | Heuristic Constraint Propagation. | Meinolf Sellmann, Warwick Harvey |
| 2002 | ESA | Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. | Meinolf Sellmann, Georg Kliewer, Achim Koberstein |
| 2001 | CP | Symmetry Breaking. | Torsten Fahle, Stefan Schamberger, Meinolf Sellmann |
| 2001 | ESA | Coupling Variable Fixing Algorithms for the Automatic Recording Problem. | Meinolf Sellmann, Torsten Fahle |
| 1999 | CP | A Framework for Constraint Programming Based Column Generation. | Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann |