<h2>LIPIcs, Volume 210, CP 2021</h2>
<ul>
<li>
<span class="authors">Laurent D. Michel</span>
<span class="title">LIPIcs, Volume 210, CP 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021">10.4230/LIPIcs.CP.2021</a>
</li>
<li>
<span class="authors">Laurent D. Michel</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.0">10.4230/LIPIcs.CP.2021.0</a>
</li>
<li>
<span class="authors">Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, and M.Grazia Speranza</span>
<span class="title">The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.1">10.4230/LIPIcs.CP.2021.1</a>
</li>
<li>
<span class="authors">Ferdinando Fioretto</span>
<span class="title">Constrained-Based Differential Privacy (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.2">10.4230/LIPIcs.CP.2021.2</a>
</li>
<li>
<span class="authors">Defeng Liu and Andrea Lodi</span>
<span class="title">Learning in Local Branching (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.3">10.4230/LIPIcs.CP.2021.3</a>
</li>
<li>
<span class="authors">João Araújo, Choiwah Chow, and Mikoláš Janota</span>
<span class="title">Filtering Isomorphic Models by Invariants (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.4">10.4230/LIPIcs.CP.2021.4</a>
</li>
<li>
<span class="authors">Shaowei Cai, Chuan Luo, Xindi Zhang, and Jian Zhang</span>
<span class="title">Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.5">10.4230/LIPIcs.CP.2021.5</a>
</li>
<li>
<span class="authors">Markus Iser and Tomáš Balyo</span>
<span class="title">Unit Propagation with Stable Watches (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.6">10.4230/LIPIcs.CP.2021.6</a>
</li>
<li>
<span class="authors">Anissa Kheireddine, Etienne Renault, and Souheib Baarir</span>
<span class="title">Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.7">10.4230/LIPIcs.CP.2021.7</a>
</li>
<li>
<span class="authors">Tuukka Korhonen and Matti Järvisalo</span>
<span class="title">Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.8">10.4230/LIPIcs.CP.2021.8</a>
</li>
<li>
<span class="authors">Hongbo Li, Minghao Yin, and Zhanshan Li</span>
<span class="title">Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.9">10.4230/LIPIcs.CP.2021.9</a>
</li>
<li>
<span class="authors">Guilherme de Azevedo Silveira</span>
<span class="title">Generating Magical Performances with Constraint Programming (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.10">10.4230/LIPIcs.CP.2021.10</a>
</li>
<li>
<span class="authors">Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby</span>
<span class="title">Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.11">10.4230/LIPIcs.CP.2021.11</a>
</li>
<li>
<span class="authors">Carlos Ansótegui, Jesús Ojeda, and Eduard Torres</span>
<span class="title">Building High Strength Mixed Covering Arrays with Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.12">10.4230/LIPIcs.CP.2021.12</a>
</li>
<li>
<span class="authors">Valentin Antuori, Tom Portoleau, Louis Rivière, and Emmanuel Hebrard</span>
<span class="title">On How Turing and Singleton Arc Consistency Broke the Enigma Code</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.13">10.4230/LIPIcs.CP.2021.13</a>
</li>
<li>
<span class="authors">Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, and Alain Nguyen</span>
<span class="title">Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.14">10.4230/LIPIcs.CP.2021.14</a>
</li>
<li>
<span class="authors">Blair Archibald, Kyle Burns, Ciaran McCreesh, and Michele Sevegnani</span>
<span class="title">Practical Bigraphs via Subgraph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.15">10.4230/LIPIcs.CP.2021.15</a>
</li>
<li>
<span class="authors">Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, and Helmut Simonis</span>
<span class="title">The Hybrid Flexible Flowshop with Transportation Times</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.16">10.4230/LIPIcs.CP.2021.16</a>
</li>
<li>
<span class="authors">Yiwei Bai, Di Chen, and Carla P. Gomes</span>
<span class="title">CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.17">10.4230/LIPIcs.CP.2021.17</a>
</li>
<li>
<span class="authors">Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec</span>
<span class="title">An Interval Constraint Programming Approach for Quasi Capture Tube Validation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.18">10.4230/LIPIcs.CP.2021.18</a>
</li>
<li>
<span class="authors">Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, and Adrien Varet</span>
<span class="title">Exhaustive Generation of Benzenoid Structures Sharing Common Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.19">10.4230/LIPIcs.CP.2021.19</a>
</li>
<li>
<span class="authors">Mohamed Sami Cherif, Djamal Habet, and Cyril Terrioux</span>
<span class="title">Combining VSIDS and CHB Using Restarts in SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.20">10.4230/LIPIcs.CP.2021.20</a>
</li>
<li>
<span class="authors">Martin C. Cooper and João Marques-Silva</span>
<span class="title">On the Tractability of Explaining Decisions of Classifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.21">10.4230/LIPIcs.CP.2021.21</a>
</li>
<li>
<span class="authors">Ágnes Cseh, Guillaume Escamocher, Begüm Genç, and Luis Quesada</span>
<span class="title">A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.22">10.4230/LIPIcs.CP.2021.22</a>
</li>
<li>
<span class="authors">Tomáš Dlask, Tomáš Werner, and Simon de Givry</span>
<span class="title">Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.23">10.4230/LIPIcs.CP.2021.23</a>
</li>
<li>
<span class="authors">Johannes K. Fichte, Markus Hecher, and Valentin Roland</span>
<span class="title">Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.24">10.4230/LIPIcs.CP.2021.24</a>
</li>
<li>
<span class="authors">Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, and Anas Shahab</span>
<span class="title">Complications for Computational Experiments from Modern Processors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.25">10.4230/LIPIcs.CP.2021.25</a>
</li>
<li>
<span class="authors">Cristian Galleguillos, Zeynep Kiziltan, and Ricardo Soto</span>
<span class="title">A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.26">10.4230/LIPIcs.CP.2021.26</a>
</li>
<li>
<span class="authors">Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, and Laurent Simon</span>
<span class="title">The Dungeon Variations Problem Using Constraint Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.27">10.4230/LIPIcs.CP.2021.27</a>
</li>
<li>
<span class="authors">Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo</span>
<span class="title">Refined Core Relaxation for Core-Guided MaxSAT Solving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.28">10.4230/LIPIcs.CP.2021.28</a>
</li>
<li>
<span class="authors">Nicolas Isoart and Jean-Charles Régin</span>
<span class="title">A Linear Time Algorithm for the k-Cutset Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.29">10.4230/LIPIcs.CP.2021.29</a>
</li>
<li>
<span class="authors">Nicolas Isoart and Jean-Charles Régin</span>
<span class="title">A k-Opt Based Constraint for the TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.30">10.4230/LIPIcs.CP.2021.30</a>
</li>
<li>
<span class="authors">Mikoláš Janota, António Morgado, José Fragoso Santos, and Vasco Manquinho</span>
<span class="title">The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.31">10.4230/LIPIcs.CP.2021.31</a>
</li>
<li>
<span class="authors">Peter Jonsson, Victor Lagerkvist, and Sebastian Ordyniak</span>
<span class="title">Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.32">10.4230/LIPIcs.CP.2021.32</a>
</li>
<li>
<span class="authors">Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent</span>
<span class="title">Learning TSP Requires Rethinking Generalization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.33">10.4230/LIPIcs.CP.2021.33</a>
</li>
<li>
<span class="authors">Markus Kirchweger and Stefan Szeider</span>
<span class="title">SAT Modulo Symmetries for Graph Generation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.34">10.4230/LIPIcs.CP.2021.34</a>
</li>
<li>
<span class="authors">Anton Korikov and J. Christopher Beck</span>
<span class="title">Counterfactual Explanations via Inverse Constraint Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.35">10.4230/LIPIcs.CP.2021.35</a>
</li>
<li>
<span class="authors">Benjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, and Martin Gebser</span>
<span class="title">Utilizing Constraint Optimization for Industrial Machine Workload Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.36">10.4230/LIPIcs.CP.2021.36</a>
</li>
<li>
<span class="authors">Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, and Felix Winter</span>
<span class="title">Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.37">10.4230/LIPIcs.CP.2021.37</a>
</li>
<li>
<span class="authors">Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, and Kun He</span>
<span class="title">Combining Clause Learning and Branch and Bound for MaxSAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.38">10.4230/LIPIcs.CP.2021.38</a>
</li>
<li>
<span class="authors">Bohan Li, Kai Wang, Yiyuan Wang, and Shaowei Cai</span>
<span class="title">Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.39">10.4230/LIPIcs.CP.2021.39</a>
</li>
<li>
<span class="authors">Luc Libralesso, François Delobel, Pascal Lafourcade, and Christine Solnon</span>
<span class="title">Automatic Generation of Declarative Models For Differential Cryptanalysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.40">10.4230/LIPIcs.CP.2021.40</a>
</li>
<li>
<span class="authors">Xiangshuang Liu, Ziyu Chen, Dingding Chen, and Junsong Gao</span>
<span class="title">A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.41">10.4230/LIPIcs.CP.2021.41</a>
</li>
<li>
<span class="authors">Jayanta Mandi, Rocsildes Canoy, Víctor Bucarey, and Tias Guns</span>
<span class="title">Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.42">10.4230/LIPIcs.CP.2021.42</a>
</li>
<li>
<span class="authors">Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, and Holger H. Hoos</span>
<span class="title">Statistical Comparison of Algorithm Performance Through Instance Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.43">10.4230/LIPIcs.CP.2021.43</a>
</li>
<li>
<span class="authors">Andreas Niskanen, Jeremias Berg, and Matti Järvisalo</span>
<span class="title">Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.44">10.4230/LIPIcs.CP.2021.44</a>
</li>
<li>
<span class="authors">Xiao Peng, Christine Solnon, and Olivier Simonin</span>
<span class="title">Solving the Non-Crossing MAPF with CP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.45">10.4230/LIPIcs.CP.2021.45</a>
</li>
<li>
<span class="authors">Luis Quesada and Kenneth N. Brown</span>
<span class="title">Positive and Negative Length-Bound Reachability Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.46">10.4230/LIPIcs.CP.2021.46</a>
</li>
<li>
<span class="authors">Alexander Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya Otpuschennikov, Vladimir Ulyantsev, and Alexey Ignatiev</span>
<span class="title">Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.47">10.4230/LIPIcs.CP.2021.47</a>
</li>
<li>
<span class="authors">Ilankaikone Senthooran, Pierre Le Bodic, and Peter J. Stuckey</span>
<span class="title">Optimising Training for Service Delivery</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.48">10.4230/LIPIcs.CP.2021.48</a>
</li>
<li>
<span class="authors">Ilankaikone Senthooran, Matthias Klapperstueck, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, and Maria Garcia de la Banda</span>
<span class="title">Human-Centred Feasibility Restoration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.49">10.4230/LIPIcs.CP.2021.49</a>
</li>
<li>
<span class="authors">Pouya Shati, Eldan Cohen, and Sheila McIlraith</span>
<span class="title">SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.50">10.4230/LIPIcs.CP.2021.50</a>
</li>
<li>
<span class="authors">Pavel Smirnov, Jeremias Berg, and Matti Järvisalo</span>
<span class="title">Pseudo-Boolean Optimization by Implicit Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.51">10.4230/LIPIcs.CP.2021.51</a>
</li>
<li>
<span class="authors">Boro Sofranac, Ambros Gleixner, and Sebastian Pokutta</span>
<span class="title">An Algorithm-Independent Measure of Progress for Linear Constraint Propagation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.52">10.4230/LIPIcs.CP.2021.52</a>
</li>
<li>
<span class="authors">Shannon Sweitzer and T. K. Satish Kumar</span>
<span class="title">Differential Programming via OR Methods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.53">10.4230/LIPIcs.CP.2021.53</a>
</li>
<li>
<span class="authors">Dimosthenis C. Tsouros and Kostas Stergiou</span>
<span class="title">Learning Max-CSPs via Active Constraint Acquisition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.54">10.4230/LIPIcs.CP.2021.54</a>
</li>
<li>
<span class="authors">Nils Merlin Ullmann, Tomáš Balyo, and Michael Klein</span>
<span class="title">Parallelizing a SAT-Based Product Configurator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.55">10.4230/LIPIcs.CP.2021.55</a>
</li>
<li>
<span class="authors">Mathieu Vavrille, Charlotte Truchet, and Charles Prud'homme</span>
<span class="title">Solution Sampling with Random Table Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.56">10.4230/LIPIcs.CP.2021.56</a>
</li>
<li>
<span class="authors">Tengbin Wang, Liqian Chen, Taoqing Chen, Guangsheng Fan, and Ji Wang</span>
<span class="title">Making Rigorous Linear Programming Practical for Program Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.57">10.4230/LIPIcs.CP.2021.57</a>
</li>
<li>
<span class="authors">Jiong Yang and Kuldeep S. Meel</span>
<span class="title">Engineering an Efficient PB-XOR Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.58">10.4230/LIPIcs.CP.2021.58</a>
</li>
<li>
<span class="authors">Ghiles Ziat, Matthieu Dien, and Vincent Botbol</span>
<span class="title">Automated Random Testing of Numerical Constrained Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.59">10.4230/LIPIcs.CP.2021.59</a>
</li>
<li>
<span class="authors">Roie Zivan, Omer Perry, Ben Rachmut, and William Yeoh</span>
<span class="title">The Effect of Asynchronous Execution and Message Latency on Max-Sum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2021.60">10.4230/LIPIcs.CP.2021.60</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing