<h2>LIPIcs, Volume 235, CP 2022</h2>
<ul>
<li>
<span class="authors">Christine Solnon</span>
<span class="title">LIPIcs, Volume 235, CP 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022">10.4230/LIPIcs.CP.2022</a>
</li>
<li>
<span class="authors">Christine Solnon</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.0">10.4230/LIPIcs.CP.2022.0</a>
</li>
<li>
<span class="authors">Donald E. Knuth</span>
<span class="title">All Questions Answered (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.1">10.4230/LIPIcs.CP.2022.1</a>
</li>
<li>
<span class="authors">Kristina Asimi, Libor Barto, and Silvia Butti</span>
<span class="title">Fixed-Template Promise Model Checking Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.2">10.4230/LIPIcs.CP.2022.2</a>
</li>
<li>
<span class="authors">Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik</span>
<span class="title">Improved Sample Complexity Bounds for Branch-And-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.3">10.4230/LIPIcs.CP.2022.3</a>
</li>
<li>
<span class="authors">Libor Barto and Silvia Butti</span>
<span class="title">Weisfeiler-Leman Invariant Promise Valued CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.4">10.4230/LIPIcs.CP.2022.4</a>
</li>
<li>
<span class="authors">Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, and T. K. Satish Kumar</span>
<span class="title">Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.5">10.4230/LIPIcs.CP.2022.5</a>
</li>
<li>
<span class="authors">Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, and Claude-Guy Quimper</span>
<span class="title">Acquiring Maps of Interrelated Conjectures on Sharp Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.6">10.4230/LIPIcs.CP.2022.6</a>
</li>
<li>
<span class="authors">Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, and Simon de Givry</span>
<span class="title">Parallel Hybrid Best-First Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.7">10.4230/LIPIcs.CP.2022.7</a>
</li>
<li>
<span class="authors">Senne Berden, Mohit Kumar, Samuel Kolb, and Tias Guns</span>
<span class="title">Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.8">10.4230/LIPIcs.CP.2022.8</a>
</li>
<li>
<span class="authors">Christian Bessiere, Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard</span>
<span class="title">Complexity of Minimum-Size Arc-Inconsistency Explanations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.9">10.4230/LIPIcs.CP.2022.9</a>
</li>
<li>
<span class="authors">Raphaël Boudreault, Vanessa Simard, Daniel Lafond, and Claude-Guy Quimper</span>
<span class="title">A Constraint Programming Approach to Ship Refit Project Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.10">10.4230/LIPIcs.CP.2022.10</a>
</li>
<li>
<span class="authors">Clément Carbonnel</span>
<span class="title">On Redundancy in Constraint Satisfaction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.11">10.4230/LIPIcs.CP.2022.11</a>
</li>
<li>
<span class="authors">Mohamed Sami Cherif, Djamal Habet, and Matthieu Py</span>
<span class="title">From Crossing-Free Resolution to Max-SAT Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.12">10.4230/LIPIcs.CP.2022.12</a>
</li>
<li>
<span class="authors">Martin C. Cooper, Arnaud Lequen, and Frédéric Maris</span>
<span class="title">Isomorphisms Between STRIPS Problems and Sub-Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.13">10.4230/LIPIcs.CP.2022.13</a>
</li>
<li>
<span class="authors">Vianney Coppé, Xavier Gillard, and Pierre Schaus</span>
<span class="title">Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.14">10.4230/LIPIcs.CP.2022.14</a>
</li>
<li>
<span class="authors">Christopher Coulombe and Claude-Guy Quimper</span>
<span class="title">Constraint Acquisition Based on Solution Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.15">10.4230/LIPIcs.CP.2022.15</a>
</li>
<li>
<span class="authors">Ágnes Cseh, Guillaume Escamocher, and Luis Quesada</span>
<span class="title">Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.16">10.4230/LIPIcs.CP.2022.16</a>
</li>
<li>
<span class="authors">Timothy Curry, Gabriel De Pace, Benjamin Fuller, Laurent Michel, and Yan (Lindsay) Sun</span>
<span class="title">DUELMIPs: Optimizing SDN Functionality and Security</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.17">10.4230/LIPIcs.CP.2022.17</a>
</li>
<li>
<span class="authors">Nguyen Dang, Özgür Akgün, Joan Espasa, Ian Miguel, and Peter Nightingale</span>
<span class="title">A Framework for Generating Informative Benchmark Instances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.18">10.4230/LIPIcs.CP.2022.18</a>
</li>
<li>
<span class="authors">Augustin Delecluse, Pierre Schaus, and Pascal Van Hentenryck</span>
<span class="title">Sequence Variables for Routing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.19">10.4230/LIPIcs.CP.2022.19</a>
</li>
<li>
<span class="authors">Jan Dreier, Sebastian Ordyniak, and Stefan Szeider</span>
<span class="title">CSP Beyond Tractable Constraint Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.20">10.4230/LIPIcs.CP.2022.20</a>
</li>
<li>
<span class="authors">Alexander Ek, Andreas Schutt, Peter J. Stuckey, and Guido Tack</span>
<span class="title">Explaining Propagation for Gini and Spread with Variable Mean</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.21">10.4230/LIPIcs.CP.2022.21</a>
</li>
<li>
<span class="authors">Joan Espasa, Ian Miguel, and Mateu Villaret</span>
<span class="title">Plotting: A Planning Problem with Complex Transitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.22">10.4230/LIPIcs.CP.2022.22</a>
</li>
<li>
<span class="authors">Hélène Fargier, Jérôme Mengin, and Nicolas Schmidt</span>
<span class="title">Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.23">10.4230/LIPIcs.CP.2022.23</a>
</li>
<li>
<span class="authors">Rebecca Gentzel, Laurent Michel, and Willem-Jan van Hoeve</span>
<span class="title">Heuristics for MDD Propagation in HADDOCK</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.24">10.4230/LIPIcs.CP.2022.24</a>
</li>
<li>
<span class="authors">Stephan Gocht, Ciaran McCreesh, and Jakob Nordström</span>
<span class="title">An Auditable Constraint Programming Solver</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.25">10.4230/LIPIcs.CP.2022.25</a>
</li>
<li>
<span class="authors">Marijn J. H. Heule, Anthony Karahalios, and Willem-Jan van Hoeve</span>
<span class="title">From Cliques to Colorings and Back Again</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.26">10.4230/LIPIcs.CP.2022.26</a>
</li>
<li>
<span class="authors">Amel Hidouri, Said Jabbour, and Badran Raddaoui</span>
<span class="title">On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.27">10.4230/LIPIcs.CP.2022.27</a>
</li>
<li>
<span class="authors">Ruth Hoffmann, Xu Zhu, Özgür Akgün, and Miguel A. Nacenta</span>
<span class="title">Understanding How People Approach Constraint Modelling and Solving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.28">10.4230/LIPIcs.CP.2022.28</a>
</li>
<li>
<span class="authors">Mohit Kumar, Samuel Kolb, and Tias Guns</span>
<span class="title">Learning Constraint Programming Models from Data Using Generate-And-Aggregate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.29">10.4230/LIPIcs.CP.2022.29</a>
</li>
<li>
<span class="authors">Daphné Lafleur, Sarath Chandar, and Gilles Pesant</span>
<span class="title">Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.30">10.4230/LIPIcs.CP.2022.30</a>
</li>
<li>
<span class="authors">Jimmy H. M. Lee and Allen Z. Zhong</span>
<span class="title">Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.31">10.4230/LIPIcs.CP.2022.31</a>
</li>
<li>
<span class="authors">Hongbo Li, Yaling Wu, Minghao Yin, and Zhanshan Li</span>
<span class="title">A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.32">10.4230/LIPIcs.CP.2022.32</a>
</li>
<li>
<span class="authors">Jheisson López, Alejandro Arbelaez, and Laura Climent</span>
<span class="title">Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.33">10.4230/LIPIcs.CP.2022.33</a>
</li>
<li>
<span class="authors">Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, and Quentin Cappart</span>
<span class="title">Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using Constraint Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.34">10.4230/LIPIcs.CP.2022.34</a>
</li>
<li>
<span class="authors">Isaac Rudich, Quentin Cappart, and Louis-Martin Rousseau</span>
<span class="title">Peel-And-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.35">10.4230/LIPIcs.CP.2022.35</a>
</li>
<li>
<span class="authors">Mate Soos, Priyanka Golia, Sourav Chakraborty, and Kuldeep S. Meel</span>
<span class="title">On Quantitative Testing of Samplers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.36">10.4230/LIPIcs.CP.2022.36</a>
</li>
<li>
<span class="authors">Fulya Trösser, Simon de Givry, and George Katsirelos</span>
<span class="title">Structured Set Variable Domains in Bayesian Network Structure Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.37">10.4230/LIPIcs.CP.2022.37</a>
</li>
<li>
<span class="authors">Felix Ulrich-Oltean, Peter Nightingale, and James Alfred Walker</span>
<span class="title">Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.38">10.4230/LIPIcs.CP.2022.38</a>
</li>
<li>
<span class="authors">Jie Wang, Dingding Chen, Ziyu Chen, Xiangshuang Liu, and Junsong Gao</span>
<span class="title">Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.39">10.4230/LIPIcs.CP.2022.39</a>
</li>
<li>
<span class="authors">Ruiwei Wang and Roland H. C. Yap</span>
<span class="title">CNF Encodings of Binary Constraint Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.40">10.4230/LIPIcs.CP.2022.40</a>
</li>
<li>
<span class="authors">Felix Winter, Sebastian Meiswinkel, Nysret Musliu, and Daniel Walkiewicz</span>
<span class="title">Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CP.2022.41">10.4230/LIPIcs.CP.2022.41</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