| 2022 | Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. | gnes Cseh, Guillaume Escamocher, Luis Quesada |
| 2022 | Constraint Acquisition Based on Solution Counting. | Christopher Coulombe, Claude-Guy Quimper |
| 2022 | Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. | Vianney Copp, Xavier Gillard, Pierre Schaus |
| 2022 | Isomorphisms Between STRIPS Problems and Sub-Problems. | Martin C. Cooper, Arnaud Lequen, Frdric Maris |
| 2022 | From Crossing-Free Resolution to Max-SAT Resolution. | Mohamed Sami Cherif, Djamal Habet, Matthieu Py |
| 2022 | On Redundancy in Constraint Satisfaction Problems. | Clment Carbonnel |
| 2022 | A Constraint Programming Approach to Ship Refit Project Scheduling. | Raphal Boudreault, Vanessa Simard, Daniel Lafond, Claude-Guy Quimper |
| 2022 | Complexity of Minimum-Size Arc-Inconsistency Explanations. | Christian Bessiere, Clment Carbonnel, Martin C. Cooper, Emmanuel Hebrard |
| 2022 | Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation. | Senne Berden, Mohit Kumar, Samuel Kolb, Tias Guns |
| 2022 | Parallel Hybrid Best-First Search. | Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon de Givry |
| 2022 | Acquiring Maps of Interrelated Conjectures on Sharp Bounds. | Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rmi Douence, Ramiz Gindullin, Claude-Guy Quimper |
| 2022 | Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. | Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar |
| 2022 | Weisfeiler-Leman Invariant Promise Valued CSPs. | Libor Barto, Silvia Butti |
| 2022 | Improved Sample Complexity Bounds for Branch-And-Cut. | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik |
| 2022 | Fixed-Template Promise Model Checking Problems. | Kristina Asimi, Libor Barto, Silvia Butti |
| 2022 | Learning Constraint Programming Models from Data Using Generate-And-Aggregate. | Mohit Kumar, Samuel Kolb, Tias Guns |
| 2022 | A Framework for Generating Informative Benchmark Instances. | Nguyen Dang, zgr Akgn, Joan Espasa, Ian Miguel, Peter Nightingale |
| 2021 | The Effect of Asynchronous Execution and Message Latency on Max-Sum. | Roie Zivan, Omer Perry, Ben Rachmut, William Yeoh |
| 2021 | Automated Random Testing of Numerical Constrained Types. | Ghiles Ziat, Matthieu Dien, Vincent Botbol |
| 2021 | Engineering an Efficient PB-XOR Solver. | Jiong Yang, Kuldeep S. Meel |
| 2021 | Making Rigorous Linear Programming Practical for Program Analysis. | Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, Ji Wang |
| 2021 | Solution Sampling with Random Table Constraints. | Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme |
| 2021 | Parallelizing a SAT-Based Product Configurator. | Nils Merlin Ullmann, Toms Balyo, Michael Klein |
| 2021 | Learning Max-CSPs via Active Constraint Acquisition. | Dimosthenis C. Tsouros, Kostas Stergiou |
| 2021 | Differential Programming via OR Methods. | Shannon Sweitzer, T. K. Satish Kumar |