Accepted papers

  • K. Subramani and Piotr Wojciechowski. Analyzing lattice point feasibility in UTVPI constraints.
  • Mohd. Hafiz Hasan and Pascal Van Hentenryck. A Column-Generation Algorithm for Evacuation Planning with Elementary Paths.
  • Tong Liu, Roberto Di Cosmo, Maurizio Gabbrielli and Jacopo Mauro. NightSplitter: a scheduling tool to optimize (sub)group activities.
  • John Hooker. Job Sequencing Bounds from Decision Diagrams.
  • Edward Lam and Pascal Van Hentenryck. Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows.
  • Victor Lagerqvist and Magnus Wahlström. Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra.
  • Erez Bilgory, Eyal Bin and Avi Ziv. Solving Constraint Satisfaction Problems Containing Vectors of Unknown Size.
  • Jean Marie Lagniez, Pierre Marquis and Anastasia Paparrizou. Defining and Evaluating Heuristics for the Compilation of Constraint Networks.
  • Mohamed Siala and Barry O’Sullivan. Rotation-Based Filtering for Stable Matching.
  • Cedric Pralet. An Incomplete Constraint-Based System for Scheduling With Renewable Resources.
  • Guillaume Perez and Jean-Charles Regin. MDDs: Sampling and Probability Constraints.
  • Ciaran McCreesh, Patrick Prosser, Kyle Simpson and James Trimble. On Maximum Weight Clique Algorithms, and How They Are Evaluated.
  • Emilie Picard-Cantin, Mathieu Bouchard, Claude-Guy Quimper and Jason Sweeney. Learning the Parameters of Global Constraints Using Branch-and-Bound.
  • Victor Dalmau. Conjunctions of Among Constraints.
  • Aws Albarghouthi, Paraschos Koutris, Mayur Naik and Calvin Smith. Constraint-Based Synthesis of Datalog Programs.
  • Roberto Amadini, Graeme Gange, Peter J. Stuckey and Guido Tack. A Novel Approach to String Constraint Solving.
  • Mohadeseh Ganji, James Bailey and Peter J. Stuckey. A New Declarative Framework for Constrained Community Detection.
  • Neng-Fa Zhou and Håkan Kjellerstrand. Optimizing SAT Encodings for Arithmetic Constraints.
  • Lucy Ham and Marcel Jackson. All or nothing: toward a promise problem dichotomy for constraint problems.
  • Kenneth D. Young, Thibaut Feydy and Andreas Schutt. Constraint Programming applied to the Multi-Skill Project Scheduling Problem.
  • Fahiem Bacchus, Matti Järvisalo, Paul Saikko and Antti Hyttinen. Reduced Cost Fixing in MaxSAT.
  • Jeremias Berg, Emilia Oikarinen, Matti Järvisalo and Kai Puolamäki. Minimum-Width Confidence Bands via Constraint Optimization.
  • Takehide Soh, Mutsunori Banbara, Naoyuki Tamura and Daniel Le Berre. Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation.
  • Adrian Goldwaser and Andreas Schutt. Optimal Torpedo Scheduling.
  • Linjie Pan, Jiwei Jin, Xin Gao, Wei Sun, Feifei Ma, Minghao Yin and Jian Zhang. Integrating ILP and SMT for Shortwave Radio Broadcast Resource Allocation and Frequency Assignment.
  • Anders Nicolai Knudsen, Marco Chiarandini and Kim S. Larsen. Constraint Handling in Flight Planning.
  • Tommaso Urli and Philip Kilby. Constraint-Based Fleet Design Optimisation for Multi-Compartment Split-Delivery Rich Vehicle Routing.
  • Ekaterina Arafailova, Nicolas Beldiceanu and Helmut Simonis. Generating Linear Invariants for a Conjunction of Automata Constraints.
  • Morten Mossige, Arnaud Gotlieb, Helge Spieker, Hein Meling and Mats Carlsson. Time-aware Test Case Execution Scheduling for Cyber-Physical Systems.
  • Gleb Belov, Tobias Czauderna, Maria Garcia de La Banda, Mark Wallace, Michael Wybrow and Amel Dzaferovic. An Optimization Model for 3D Pipe Routing with Flexibility Constraints.
  • Heytem Zitoun, Claude Michel, Laurent Michel and Michel Rueher. Search strategies for solving floating point constraint systems.
  • Fanghui Liu, Waldemar Cruz, Chujiao Ma, Gregory Johnson and Laurent Michel. A Tolerant Algebraic Side-Channel Attack on AES Using CP.
  • Guillaume Derval, Jean-Charles Regin and Pierre Schaus. Improved Filtering for the Bin-Packing with Cardinality Constraint.
  • Maxime Chabert and Christine Solnon. Constraint Programming for Multi-criteria Conceptual Clustering.
  • Grigori German, Olivier Briant, Hadrien Cambazard and Vincent Jost. Arc consistency via Linear Programming.
  • Atena M.Tabakhi, Tiep Le, Ferdinando Fioretto and William Yeoh. Preference Elicitation for DCOPs.
  • Simon De Givry and George Katsirelos. Clique Cuts in Weighted Constraint Satisfaction.
  • Jeremias Berg and Matti Järvisalo. Weight-Aware Core Extraction in SAT-Based MaxSAT Solving.
  • Ekaterina Arafailova, Nicolas Beldiceanu and Helmut Simonis. Among Implied Constraints for Two Families of Time-Series Constraints.
  • Hong Xu, Sven Koenig and T. K. Satish Kumar. A Constraint Composite Graph-Based ILP Encoding of the Weighted CSP.
  • Pierre Schaus, John Aoga and Tias Guns. CoverSize: A Global Constraint for Frequency-based Itemset Mining.
  • Willem-Jan Van Hoeve and Sridhar Tayur. Integer and Constraint Programming for Batch Annealing Process Planning.
  • Hélène Verhaeghe, Christophe Lecoutre, Yves Deville and Pierre Schaus. Extending Compact-Table to Basic Smart Tables.
  • Gael Glorian, Frederic Boussemart, Jean-Marie Lagniez, Christophe Lecoutre and Bertrand Mazure. Combining Nogoods in Restart-Based Search.
  • Jordi Coll, Miquel Bofill, Josep Suy and Mateu Villaret. An efficient SMT approach to solve MRCPSP/max instances with tight constraints on resources.
  • Anna Latour, Behrouz Babaki, Anton Dries, Angelika Kimmig, Guy Van den Broeck, Luc De Raedt and Siegfried Nijssen. Combining Stochastic Constraint Optimization and Probabilistic Programming: From Knowledge Compilation to Constraint Solving.

Journal & Sister Conferences Track Accepted Papers