Abstract is missing.
- Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SATÖzgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale. 3-12 [doi]
- Systematic Derivation of Bounds and Glue Constraints for Time-Series ConstraintsEkaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis. 13-29 [doi]
- An Adaptive Parallel SAT SolverGilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary. 30-48 [doi]
- Improved Linearization of Constraint Programming ModelsGleb Belov, Peter J. Stuckey, Guido Tack, Mark Wallace. 49-65 [doi]
- Impact of SAT-Based Preprocessing on Core-Guided MaxSAT SolvingJeremias Berg, Matti Järvisalo. 66-85 [doi]
- Multiobjective Optimization by Decision DiagramsDavid Bergman, André Augusto Ciré. 86-95 [doi]
- Dependency Schemes in QBF Calculi: Semantics and SoundnessOlaf Beyersdorff, Joshua Blinkhorn. 96-112 [doi]
- The Multirate Resource ConstraintAlessio Bonfietti, Alessandro Zanarini, Michele Lombardi, Michela Milano. 113-129 [doi]
- The Dichotomy for Conservative Constraint Satisfaction is Polynomially DecidableClément Carbonnel. 130-146 [doi]
- Propagation via Kernelization: The Vertex Cover ConstraintClément Carbonnel, Emmanuel Hebrard. 147-156 [doi]
- Breaking Symmetries in Graphs: The Nauty WayMichael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey. 157-172 [doi]
- Extending Broken Triangles and Enhanced Value-MergingMartin C. Cooper, Achref El Mouelhi, Cyril Terrioux. 173-188 [doi]
- A Bounded Path Propagator on Directed GraphsDiego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey. 189-206 [doi]
- Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-SetsJordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus. 207-223 [doi]
- Interval Constraints with Learning: Application to Air Traffic ControlThibaut Feydy, Peter J. Stuckey. 224-232 [doi]
- Backdoors to Tractable Valued CSPRobert Ganian, M. S. Ramanujan, Stefan Szeider. 233-250 [doi]
- Monte-Carlo Tree Search for the Maximum Satisfiability ProblemJack Goffinet, Raghuram Ramanujan. 251-267 [doi]
- A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal NetworksLuke Hunsberger, Roberto Posenato. 268-286 [doi]
- On Finding Minimum Satisfying AssignmentsAlexey Ignatiev, Alessandro Previti, Joao Marques-Silva. 287-297 [doi]
- Towards a Dynamic Decomposition of CSPs with Separators of Bounded SizePhilippe Jégou, Hanan Kanso, Cyril Terrioux. 298-315 [doi]
- Constraint Programming for Strictly Convex Integer Quadratically-Constrained ProblemsWen-Yang Ku, J. Christopher Beck. 316-332 [doi]
- A Global Constraint for Closed Frequent Pattern MiningNadjib Lazaar, Yahia Lebbah, Samir Loudni, Mehdi Maamar, Valentin Lemière, Christian Bessiere, Patrice Boizumault. 333-349 [doi]
- Clique and Constraint Models for Maximum Common (Connected) Subgraph ProblemsCiaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon. 350-368 [doi]
- Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate PartitioningHarsha Nagarajan, Mowen Lu, Emre Yamangil, Russell Bent. 369-387 [doi]
- Parallel Strategies SelectionAnthony Palmieri, Jean-Charles Régin, Pierre Schaus. 388-404 [doi]
- Learning Parameters for the Sequence Constraint from SolutionsÉmilie Picard-Cantin, Mathieu Bouchard, Claude-Guy Quimper, Jason Sweeney. 405-420 [doi]
- The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two ColorsTimon Hertli, Isabelle Hurbain, Sebastian Millius, Robin A. Moser, Dominik Scheder, May Szedlák. 421-437 [doi]
- Explaining Producer/Consumer ConstraintsAndreas Schutt, Peter J. Stuckey. 438-454 [doi]
- Learning from Learning SolversMaxim Shishmarev, Christopher Mears, Guido Tack, Maria Garcia de la Banda. 455-472 [doi]
- On Incremental Core-Guided MaxSAT SolvingXujie Si, Xin Zhang, Vasco M. Manquinho, Mikolás Janota, Alexey Ignatiev, Mayur Naik. 473-482 [doi]
- Modelling and Solving Multi-mode Resource-Constrained Project SchedulingRia Szeredi, Andreas Schutt. 483-492 [doi]
- A Nearly Exact Propagation Algorithm for Energetic Reasoning in \mathcal O(n^2 \log n)Alexander Tesch. 493-519 [doi]
- Efficient Filtering for the Unary Resource with Family-Based Transition TimesSascha Van Cauwelaert, Cyrille Dejemeppe, Jean-Noël Monette, Pierre Schaus. 520-535 [doi]
- A Constraint Programming Approach to Multi-Robot Task Allocation and Scheduling in Retirement HomesKyle E. C. Booth, Goldie Nejat, J. Christopher Beck. 539-555 [doi]
- Optimal Performance Tuning in Real-Time Systems Using Multi-objective Constrained OptimizationStefano Di Alesio. 556-574 [doi]
- SABIO: An Implementation of MIP and CP for Interactive Soccer QueriesRobinson Duque, Juan Francisco Díaz, Alejandro Arbelaez. 575-583 [doi]
- Constraint Programming Models for Chosen Key Differential CryptanalysisDavid Gerault, Marine Minier, Christine Solnon. 584-601 [doi]
- Solving a Supply-Delivery Scheduling Problem with Constraint ProgrammingKatherine Giles, Willem Jan van Hoeve. 602-617 [doi]
- Four-Bar Linkage Synthesis Using Non-convex OptimizationVincent Goulet, Wei Li, Hyunmin Cheong, Francesco Iorio, Claude-Guy Quimper. 618-635 [doi]
- Using Constraint Programming for the Urban Transit Crew Rescheduling ProblemXavier Lorca, Charles Prud'homme, Aurélien Questel, Benoît Rottembourg. 636-649 [doi]
- Optimizing Shortwave Radio Broadcast Resource Allocation via Pseudo-Boolean Constraint Solving and Local SearchFeifei Ma, Xin Gao, Minghao Yin, Linjie Pan, Ji-Wei Jin, Hai Liu, Jian Zhang. 650-665 [doi]
- Availability Optimization in Cloud-Based In-Memory Data GridsSamir Sebbah, Claire Bagley, Mike Colena, Serdar Kadioglu. 666-679 [doi]
- Online HVAC-Aware Occupancy Scheduling with Adaptive Temperature ControlBoonPing Lim, Hassan L. Hijazi, Sylvie Thiébaux, Menkes van den Briel. 683-700 [doi]
- Behavior Identification in Two-Stage Games for Incentivizing Citizen Science ExplorationYexiang Xue, Ian Davies, Daniel Fink, Christopher Wood, Carla P. Gomes. 701-717 [doi]
- Constraining Redundancy to Improve Protein DockingLudwig Krippahl, Pedro Barahona. 721-732 [doi]
- Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and StructureClément Viricel, David Simoncini, Sophie Barbe, Thomas Schiex. 733-750 [doi]
- Finding Alternative Musical ScalesJ. N. Hooker. 753-768 [doi]
- Assisted Lead Sheet Composition Using FlowComposerAlexandre Papadopoulos, Pierre Roy, François Pachet. 769-785 [doi]
- Enforcing Structure on Temporal Sequences: The Allen ConstraintPierre Roy, Guillaume Perez, Jean-Charles Régin, Alexandre Papadopoulos, François Pachet, Marco Marchini. 786-801 [doi]
- Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-Partition ArraysTsubasa Tanaka, Brian Bemman, David Meredith. 802-810 [doi]
- A Dynamic Programming-Based MCMC Framework for Solving DCOPs with GPUsFerdinando Fioretto, William Yeoh 0001, Enrico Pontelli. 813-831 [doi]
- Morphing Between Stable Matching ProblemsCiaran McCreesh, Patrick Prosser, James Trimble. 832-840 [doi]
- Using Graph-Based CSP to Solve the Address Translation ProblemMerav Aharoni, Yael Ben-Haim, Shai Doron, Anatoly Koyfman, Elena Tsanko, Michael Veksler. 843-858 [doi]
- Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis AlgorithmXiaojun Sun, Irina Ilioaea, Priyank Kalla, Florian Enescu. 859-875 [doi]