Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and Alessandra
Tappini. On the Parameterized Complexity of $s$-club Cluster Deletion Problems Olav Bunte, Louis van Gool and Tim Willemse. On the Preservation of Properties when Changing Communication Models Timothée Martinod and Christian Laforest. Introduction to routing problems with mandatory transitions Andrzej Lingas. Lower Bounds for Monotone $q$-Multilinear Boolean Circuits Andris Ambainis and Ansis Zvirbulis. Quantum complexity for vector domination problem Tom Friedetzky, David Kutner, George Mertzios, Iain Stewart and Amitabh Trehan. Payment Scheduling in the Interval Debt Model P. S. Ardra, R. Krithika, Saket Saurabh and Roohani Sharma. Balanced Substructures in Bicolored Graphs Jared Coleman, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce. Delivery to Safety with Two Cooperating Robots Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff and Johannes Zink. The Complexity of Finding Tangles Michael Bekos, Henry Förster, Michael Kaufmann, Stephen Kobourov, Myroslav Kryven, Axel Kuckuk and Lena Schlipf. On the 2-Layer Window Width Minimization Problem Giacomo Ortali and Ioannis Tollis. Dominance Drawings for DAGs with Bounded Modular Width Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina and Hillel Kugler. Learning through Imitation by using Formal Verification Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer and Petra Wolf. Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs Kai Kahler and Klaus Jansen. On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines Duncan Adamson, Argyrios Deligkas, Vladimir Gusev and Igor Potapov. The k-center Problem for Classes of Cyclic Words Hironori Kiya, Yuto Okada, Hirotaka Ono and Yota Otachi. Sequentially Swapping Tokens: Further on Graph Classes Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis. A spectral algorithm for finding maximum cliques in dense random intersection graphs Jonathan Klawitter, Felix Klesen, Moritz Niederer and Alexander Wolff. Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees Hauke Brinkop and Klaus Jansen. Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth Kevin Buchin, William Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders and Alexander Wolff. Morphing Planar Graph Drawings Through 3D Rica Gonen, Martin Koutecky, Roei Menashof and Nimrod Talmon. Heuristics for Opinion Diffusion via Local Elections Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. Space-Efficient STR-IC-LCS Computation Robert Barish and Tetsuo Shibuya. Hardness of bounding influence via graph modification Sushmita Gupta, Pallavi Jain and Sanjay Seetharaman. More Effort Towards Multiagent Knapsack Piotr Wojciechowski and K. Subramani. A faster algorithm for determining the linear feasibility of systems of BTVPI constraints Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff and Meirav Zehavi. Parameterized Approaches to Orthogonal Compaction