| 2021 | An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. | Boro Sofranac, Ambros M. Gleixner, Sebastian Pokutta |
| 2021 | Pseudo-Boolean Optimization by Implicit Hitting Sets. | Pavel Smirnov, Jeremias Berg, Matti Jrvisalo |
| 2021 | Generating Magical Performances with Constraint Programming (Short Paper). | Guilherme de Azevedo Silveira |
| 2021 | SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features. | Pouya Shati, Eldan Cohen, Sheila A. McIlraith |
| 2021 | Human-Centred Feasibility Restoration. | Ilankaikone Senthooran, Matthias Klapperstck, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, Maria Garcia de la Banda |
| 2021 | Optimising Training for Service Delivery. | Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey |
| 2021 | Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. | Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev |
| 2021 | Positive and Negative Length-Bound Reachability Constraints. | Luis Quesada, Kenneth N. Brown |
| 2021 | Solving the Non-Crossing MAPF with CP. | Xiao Peng, Christine Solnon, Olivier Simonin |
| 2021 | Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. | Andreas Niskanen, Jeremias Berg, Matti Jrvisalo |
| 2021 | Statistical Comparison of Algorithm Performance Through Instance Selection. | Tho Matricon, Marie Anastacio, Nathanal Fijalkow, Laurent Simon, Holger H. Hoos |
| 2021 | Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP. | Jayanta Mandi, Rocsildes Canoy, Vctor Bucarey, Tias Guns |
| 2021 | Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper). | Hongbo Li, Minghao Yin, Zhanshan Li |
| 2021 | Combining Clause Learning and Branch and Bound for MaxSAT. | Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Many, Djamal Habet, Kun He |
| 2021 | Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search. | Bohan Li, Kai Wang, Yiyuan Wang, Shaowei Cai |
| 2021 | Learning in Local Branching (Invited Talk). | Defeng Liu, Andrea Lodi |
| 2021 | A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems. | Xiang-Shuang Liu, Ziyu Chen, Dingding Chen, Junsong Gao |
| 2021 | Automatic Generation of Declarative Models For Differential Cryptanalysis. | Luc Libralesso, Franois Delobel, Pascal Lafourcade, Christine Solnon |
| 2021 | Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. | Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter |
| 2021 | Utilizing Constraint Optimization for Industrial Machine Workload Balancing. | Benjamin Kovcs, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, Martin Gebser |
| 2021 | Counterfactual Explanations via Inverse Constraint Programming. | Anton Korikov, J. Christopher Beck |
| 2021 | Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). | Tuukka Korhonen, Matti Jrvisalo |
| 2021 | SAT Modulo Symmetries for Graph Generation. | Markus Kirchweger, Stefan Szeider |
| 2021 | Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper). | Anissa Kheireddine, Etienne Renault, Souheib Baarir |
| 2021 | Learning TSP Requires Rethinking Generalization. | Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent |