1

Bounding and Computing Obstacle Numbers of Graphs

30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff

Combinatorial and Algorithmic Aspects of Monadic Stability

33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Sang Won Bae, Heejin Park, eds.), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Jan Niclas Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares

Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22) (Artur Czumaj, Qin Xin, eds.), volume 227 of LIPIcs, pages 4:1–4:19, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 42:1–42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer

CSP Beyond Tractable Constraint Languages

28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Jan Niclas Dreier, Sebastian Ordyniak, Stefan Szeider

Detours in Directed Graphs

39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1–29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Fedor v. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer.

Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna

Finding a Cluster in Incomplete Data

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

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Fine-grained Complexity of Partial Minimum Satisfiability

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt, ed.), pages 1774–1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

Ivan Bliznets, Danil Sagunov, Kirill Simonov

FPT Approximation for Fair Minimum-Load Clustering

17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Sayan Bandyapadhyay, Fedor v. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov