1

On Critical Node Problems with Vulnerable Vertices

Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan and Henning Fernau), volume 13270 of Lecture Notes in Computer Science, pages 494-508, 2022, Springer.

Jannik Schestag, Niels Gr{ü}ttemeier, Christian Komusiewicz, Frank Sommer

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT

17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell and Jesper Nederlof), volume 249 of LIPIcs, pages 32:1-32:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Rafael Kiesel, Andr{\'{e}} Schidler

Parallel Beam Search for Combinatorial Optimization

Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273-275, 2022, AAAI.

Frohner, Nikolaus, Gmys, Jan, Melab, Nourdine,, Günther Raidl, Talbi, El-Ghazali

Parameterised Partially-Predrawn Crossing Number

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 46:1-46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Thekla Hamm, Petr Hlinen{\'{y}}

Parameterized Algorithms for Upward Planarity

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 26:1-26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov

Pedant: A Certifying DQBF Solver

25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 20:1-20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Franz{-}Xaver Reichl, Friedrich Slivovsky

Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria

47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Stefan Szeider, Robert Ganian, Alexandra Silva

QCDCL with Cube Learning or Pure Literal Elimination - What is Best?

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 1781-1787, 2022, ijcai.org.
Note: Distinguished Paper Award

Benjamin B{ö}hm, Tomas Peitl, Olaf Beyersdorff

SAT Backdoors: Depth Beats Size

30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1-46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Jan Niclas Dreier, Sebastian Ordyniak, Stefan Szeider

SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 74:1-74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Andr{\'{e}} Schidler