| 2021 | Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. | Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak |
| 2021 | The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. | Mikols Janota, Antnio Morgado, Jos Fragoso Santos, Vasco Manquinho |
| 2021 | A k-Opt Based Constraint for the TSP. | Nicolas Isoart, Jean-Charles Rgin |
| 2021 | A Linear Time Algorithm for the k-Cutset Constraint. | Nicolas Isoart, Jean-Charles Rgin |
| 2021 | Unit Propagation with Stable Watches (Short Paper). | Ashlin Iser, Toms Balyo |
| 2021 | Refined Core Relaxation for Core-Guided MaxSAT Solving. | Hannes Ihalainen, Jeremias Berg, Matti Jrvisalo |
| 2021 | The Dungeon Variations Problem Using Constraint Programming. | Gal Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon |
| 2021 | A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications. | Cristian Galleguillos, Zeynep Kiziltan, Ricardo Soto |
| 2021 | Constrained-Based Differential Privacy (Invited Talk). | Ferdinando Fioretto |
| 2021 | Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
| 2021 | Complications for Computational Experiments from Modern Processors. | Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab |
| 2021 | Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations. | Toms Dlask, Toms Werner, Simon de Givry |
| 2021 | A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. | gnes Cseh, Guillaume Escamocher, Begm Gen, Luis Quesada |
| 2021 | On the Tractability of Explaining Decisions of Classifiers. | Martin C. Cooper, Joo Marques-Silva |
| 2021 | Combining VSIDS and CHB Using Restarts in SAT. | Mohamed Sami Cherif, Djamal Habet, Cyril Terrioux |
| 2021 | Exhaustive Generation of Benzenoid Structures Sharing Common Patterns. | Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet |
| 2021 | Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). | Shaowei Cai, Chuan Luo, Xindi Zhang, Jian Zhang |
| 2021 | An Interval Constraint Programming Approach for Quasi Capture Tube Validation. | Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, Stphane Le Mnec |
| 2021 | CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games. | Yiwei Bai, Di Chen, Carla P. Gomes |
| 2021 | The Hybrid Flexible Flowshop with Transportation Times. | Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis |
| 2021 | Practical Bigraphs via Subgraph Isomorphism. | Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani |
| 2021 | The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk). | Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza |
| 2021 | Filtering Isomorphic Models by Invariants (Short Paper). | Joo Arajo, Choiwah Chow, Mikols Janota |
| 2021 | On How Turing and Singleton Arc Consistency Broke the Enigma Code. | Valentin Antuori, Tom Portoleau, Louis Rivire, Emmanuel Hebrard |
| 2021 | Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem. | Valentin Antuori, Emmanuel Hebrard, Marie-Jos Huguet, Siham Essodaigui, Alain Nguyen |