Abstract is missing.
- Orchestrating Satisfiability EnginesLeonardo Mendonça de Moura. 1 [doi]
- Operations Research and Constraint Programming at GoogleLaurent Perron. 2 [doi]
- Solving Problems with CP: Four Common Pitfalls to AvoidJean-Charles Régin. 3-11 [doi]
- A Constraint Seeker: Finding and Ranking Global Constraints from ExamplesNicolas Beldiceanu, Helmut Simonis. 12-26 [doi]
- Bin Repacking Scheduling in Virtualized DatacentersFabien Hermenier, Sophie Demassey, Xavier Lorca. 27-41 [doi]
- Route Finder: Efficiently Finding k Shortest Paths Using Constraint ProgrammingMichel P. Lefebvre, Jean-François Puget, Petr Vilím. 42-53 [doi]
- The Design of Cryptographic S-Boxes Using CSPsVenkatesh Ramamoorthy, Marius-Calin Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo. 54-68 [doi]
- Optimal Carpet CuttingAndreas Schutt, Peter J. Stuckey, Andrew R. Verden. 69-84 [doi]
- A Hybrid Approach for Solving Real-World Nurse Rostering ProblemsMartin Stølevik, Tomas Eric Nordlander, Atle Riise, Helle Frøyseth. 85-99 [doi]
- Constraint Programming for Controller SynthesisGérard Verfaillie, Cédric Pralet. 100-114 [doi]
- Neuron Constraints to Model Complex Real-World ProblemsAndrea Bartolini, Michele Lombardi, Michela Milano, Luca Benini. 115-129 [doi]
- A Constraint Based Approach to Cyclic RCPSPAlessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano. 130-144 [doi]
- An Efficient Light Solver for Querying the Semantic WebVianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon. 145-159 [doi]
- On Guaranteeing Polynomially Bounded Search Tree SizeDavid A. Cohen, Martin C. Cooper, Martin J. Green, Dániel Marx. 160-171 [doi]
- A Framework for Decision-Based ConsistenciesJean-François Condotta, Christophe Lecoutre. 172-186 [doi]
- Hierarchically Nested Convex VCSPMartin C. Cooper, Stanislav Zivny. 187-194 [doi]
- Tractable TrianglesMartin C. Cooper, Stanislav Zivny. 195-209 [doi]
- On Minimal Weighted ClonesPáidí Creed, Stanislav Zivny. 210-224 [doi]
- Solving MAXSAT by Solving a Sequence of Simpler SAT InstancesJessica Davies, Fahiem Bacchus. 225-239 [doi]
- Filtering Algorithms for Discrete Cumulative Problems with Overloads of ResourceAlexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien. 240-255 [doi]
- Synthesis of Search Algorithms from High-Level CP ModelsSamir A. Mohamed Elsayed, Laurent Michel. 256-270 [doi]
- Revisiting the tree ConstraintJean-Guillaume Fages, Xavier Lorca. 271-285 [doi]
- Half Reification and FlatteningThibaut Feydy, Zoltan Somogyi, Peter J. Stuckey. 286-301 [doi]
- The Parameterized Complexity of Local ConsistencySerge Gaspers, Stefan Szeider. 302-316 [doi]
- Symmetry Breaking in Numeric Constraint ProblemsAlexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras. 317-324 [doi]
- On Minimal Constraint NetworksGeorg Gottlob. 325-339 [doi]
- Structural Tractability of Constraint OptimizationGianluigi Greco, Francesco Scarcello. 340-355 [doi]
- Models and Strategies for Variants of the Job Shop Scheduling ProblemDiarmuid Grimes, Emmanuel Hebrard. 356-372 [doi]
- MaxRPC Algorithms Based on Bitwise OperationsJinsong Guo, Zhanshan Li, Liang Zhang, Xuena Geng. 373-384 [doi]
- Grid-Based SAT Solving with Iterative Partitioning and Clause LearningAntti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä. 385-399 [doi]
- Large Neighborhood Search for Dial-a-Ride ProblemsSiddhartha Jain, Pascal Van Hentenryck. 400-413 [doi]
- On Deciding MUS Membership with QBFMikolás Janota, João P. Marques Silva. 414-428 [doi]
- On the Relative Efficiency of DPLL and OBDDs with Axiom and JoinMatti Järvisalo. 429-437 [doi]
- Min CSP on Four Elements: Moving beyond SubmodularityPeter Jonsson, Fredrik Kuivinen, Johan Thapper. 438-453 [doi]
- Algorithm Selection and SchedulingSerdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann. 454-469 [doi]
- Incorporating Variance in Impact-Based SearchSerdar Kadioglu, Eoin O'Mahony, Philippe Refalo, Meinolf Sellmann. 470-477 [doi]
- A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource ConstraintsRoger Kameugne, Laure Pauline Fotso, Joseph Scott, Youcheu Ngo-Kateu. 478-492 [doi]
- A CSP Solver Focusing on fac VariablesÉric Grégoire, Jean-Marie Lagniez, Bertrand Mazure. 493-507 [doi]
- Constraint Reasoning and Kernel Clustering for Pattern Decomposition with ScalingRonan LeBras, Theodoros Damoulas, John M. Gregoire, Ashish Sabharwal, Carla P. Gomes, R. Bruce van Dover. 508-522 [doi]
- Solving Qualitative Constraints Involving LandmarksWeiming Liu, Sheng-sheng Wang, Sanjiang Li, Dayou Liu. 523-537 [doi]
- Searching for Doubly Self-orthogonal Latin SquaresRunming Lu, Sheng Liu, Jian Zhang. 538-545 [doi]
- QCSP on Partially Reflexive ForestsBarnaby Martin. 546-560 [doi]
- The Computational Complexity of Disconnected Cut and 2K 2-PartitionBarnaby Martin, Daniël Paulusma. 561-575 [doi]
- Reducing the Search Space of Resource Constrained DCOPsToshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Boi Faltings, Hiroshi Matsuo. 576-590 [doi]
- Proving Symmetries by Model TransformationChristopher Mears, Todd Niven, Marcel Jackson, Mark Wallace. 591-605 [doi]
- Value Ordering for Finding All Solutions: Interactions with Adaptive Variable OrderingDeepak Mehta, Barry O'Sullivan, Luis Quesada. 606-620 [doi]
- Boolean Equi-propagation for Optimized SAT EncodingAmit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey. 621-636 [doi]
- CP Models for Maximum Common Subgraph ProblemsSamba Ndojh Ndiaye, Christine Solnon. 637-644 [doi]
- Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy PropagationMuhammad Abdul Hakim Newton, Duc Nghia Pham, Abdul Sattar, Michael J. Maher. 645-659 [doi]
- Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality BoundsTenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings. 660-674 [doi]
- A More Efficient BDD-Based QBF SolverOswaldo Olivo, E. Allen Emerson. 675-690 [doi]
- Constraint Propagation for Efficient Inference in Markov LogicTivadar Papai, Parag Singla, Henry A. Kautz. 691-705 [doi]
- Octagonal Domains for Continuous ConstraintsMarie Pelleau, Charlotte Truchet, Frédéric Benhamou. 706-720 [doi]
- A Θ(n) Bound-Consistency Algorithm for the Increasing Sum ConstraintThierry Petit, Jean-Charles Régin, Nicolas Beldiceanu. 721-728 [doi]
- Automatic Generation of Constraints for Partial Symmetry BreakingChristopher Jefferson, Karen E. Petrie. 729-743 [doi]
- Beyond QCSP for Solving Control ProblemsCédric Pralet, Gérard Verfaillie. 744-758 [doi]
- On Mini-Buckets and the Min-fill Elimination OrderingEmma Rollon, Javier Larrosa. 759-773 [doi]
- Search CombinatorsTom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz, Peter J. Stuckey. 774-788 [doi]
- Variable Independence and Resolution Paths for Quantified Boolean FormulasAllen Van Gelder. 789-803 [doi]
- Pruning Rules for Constrained Optimisation for Conditional PreferencesNic Wilson, Walid Trabelsi. 804-818 [doi]
- Checking and Filtering Global Set ConstraintsJustin Yip, Pascal Van Hentenryck. 819-833 [doi]