Accepted papers

Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli and AlessandraTappini.On the Parameterized Complexity of $s$-club Cluster Deletion ProblemsOlav Bunte, Louis van Gool and Tim Willemse.On the Preservation of Properties when Changing Communication ModelsTimothée Martinod and Christian Laforest.Introduction to routing problems with mandatory transitionsAndrzej Lingas.Lower Bounds for Monotone $q$-Multilinear Boolean CircuitsAndris Ambainis and Ansis Zvirbulis.Quantum complexity for vector domination problemTom Friedetzky, David Kutner, George Mertzios, Iain Stewart and AmitabhTrehan.Payment Scheduling in the Interval Debt ModelP. S. Ardra, R. Krithika, Saket Saurabh and Roohani Sharma.Balanced Substructures in Bicolored GraphsJared Coleman, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce.Delivery to Safety with Two Cooperating RobotsOksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky,Alexander Wolff and Johannes Zink.The Complexity of Finding TanglesMichael Bekos, Henry Förster, Michael Kaufmann, Stephen Kobourov,Myroslav Kryven, Axel Kuckuk and Lena Schlipf.On the 2-Layer Window Width Minimization ProblemGiacomo Ortali and Ioannis Tollis.Dominance Drawings for DAGs with Bounded Modular WidthAvraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina andHillel Kugler.Learning through Imitation by using Formal VerificationEmmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer andPetra Wolf.Multi-Parameter Analysis of Finding Minors and Subgraphs inEdge-Periodic Temporal GraphsKai Kahler and Klaus Jansen.On the Complexity of Scheduling Problems With a Fixed Number of ParallelIdentical MachinesDuncan Adamson, Argyrios Deligkas, Vladimir Gusev and Igor Potapov.The k-center Problem for Classes of Cyclic WordsHironori Kiya, Yuto Okada, Hirotaka Ono and Yota Otachi.Sequentially Swapping Tokens: Further on Graph ClassesFilippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulosand Paul Spirakis.A spectral algorithm for finding maximum cliques in dense randomintersection graphsJonathan Klawitter, Felix Klesen, Moritz Niederer and Alexander Wolff.Visualizing Multispecies Coalescent Trees: Drawing Gene Trees InsideSpecies TreesHauke Brinkop and Klaus Jansen.Solving Cut-Problems in Quadratic Time for Graphs With Bounded TreewidthKevin Buchin, William Evans, Fabrizio Frati, Irina Kostitsyna, MaartenLöffler, Tim Ophelders and Alexander Wolff.Morphing Planar Graph Drawings Through 3DRica Gonen, Martin Koutecky, Roei Menashof and Nimrod Talmon.Heuristics for Opinion Diffusion via Local ElectionsYuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai.Space-Efficient STR-IC-LCS ComputationRobert Barish and Tetsuo Shibuya.Hardness of bounding influence via graph modificationSushmita Gupta, Pallavi Jain and Sanjay Seetharaman.More Effort Towards Multiagent KnapsackPiotr Wojciechowski and K. Subramani.A faster algorithm for determining the linear feasibility of systems ofBTVPI constraintsWalter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta,Alexander Wolff and Meirav Zehavi.Parameterized Approaches to Orthogonal Compaction