Accepted Papers

• Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress)
  Alexander Nadel, Yam Slonimski, and Ofer Strichman
• Fair Constraint Satisfaction: An Approximate Algorithm and Preliminary Results
  Javier Larrosa, David García-Soriano, and Miguel Escribano
• On the use of ML and LLM for hard scheduling problems
  Guillaume Povéda and Florent Teichteil-Koenigsbuch
• Memorizing Unified Graph and Language Representations for SMT Algorithm Selection (accepted to CP 2026)
  Zhengyang Lu, Paul Sarnighausen-Cahn, Jiahao Chen, Arie Gurfinkel, Florin Manea, and Vijay Ganesh
• Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT (accepted to CP 2026)
  Jialu Zhang, Chu-Min Li, Sami Cherif, and Shuolin Li
• Pseudo-Boolean Conflict Analysis
  Benjamin Bogø, Wietze Koops, Jakob Nordström, and Alexander Tesch
• Quadratic Assignment Problems in Cost Function Networks (extended version of CPAIOR 2026)
  Guidio Sewa, Coralie Marchau, David Allouche, Simon de Givry, George Katsirelos, and Thomas Schiex
• Efficiently Solving Constraint Optimization Problems Using Learning-Based Techniques
  Romaissa Ghlib, Abdelkader Ouali, Jean-Luc Lamotte, and Samir Loudni
• Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization
  Benjamin Bogø, Xiamin Chen, Wietze Koops, Pinyan Lu, Jakob Nordström, Marc Vinyals, and Qingzhao Wu