Accepted Papers

• Adrian Dumitrescu. Finding a Mediocre Player
• René Van Bevern, Oxana Yu. Tsidulko and Philipp Zschoche. Fixed-parameter algorithms for maximum-profit facility location under matroid constraints.
• Janka Chlebikova, Clément Dallard and Niklas Paulsen. Complexity of scheduling for DARP with soft ride times.
• Matthias Bentert and André Nichterlein. Parameterized Complexity of Diameter.
• Eleni C. Akrida, George Mertzios and Paul Spirakis. The temporal explorer who returns to the base.
• Sándor Fekete and Dominik Krupke. Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation.
• Miguel Coviello Gonzalez and Marek Chrobak. Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability.
• Duc A. Hoang, Amanj Khorramian and Ryuhei Uehara. Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.
• Alexander Göke, Dániel Marx and Matthias Mnich. Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set.
• Xing Shi Cai, Luc Devroye, Cecilia Holmgren and Fiona Skerman. k-cuts on a path.
• Paolo Penna and Laurent Viennot. Independent lazy better-response dynamics on network games.
• Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes. Eternal Domination in Grids.
• Vittorio Bilò, Laurent Gourves and Jerome Monnot. Project Games.
• Geevarghese Philip, Varun Rajan, Saket Saurabh and Prafullkumar Tale. Subset Feedback Vertex Set in Chordal and Split Graphs.
• Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono and Yota Otachi. Parameterized Complexity of Safe Set.
• Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi and Tom van der Zanden. Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
• Allan Barboza, Cid de Souza and Pedro de Rezende. Minimum Convex Partition of Point Sets.
• Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jerome Monnot and Florian Sikora. Extension of vertex cover and independent set in some classes of graphs and generalizations.
• Dariusz Dereniowski, Lukasz Kuszner and Robert Ostrowski. Searching by heterogeneous agents.
• Bugra Caskurlu and Fatih Erdem Kizilkaya. On Hedonic Games with Common Ranking Property.
• Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz and Manuel Sorge. Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors.
• Frank Kammer and Andrej Sajenko. Linear-Time In-Place DFS and BFS on the Restore Word RAM.
• Akanksha Agrawal, Sushmita Gupta, Pallavi Jain and R. Krithika. Quadratic Vertex Kernel for Split Vertex Deletion.
• Adam Kunysz. A Faster Algorithm for the Strongly Stable b-Matching Problem.
• Pratibha Choudhary, Pallavi Jain, R Krithika and Vibha Sahlot. Vertex Deletion on Split Graphs: Beyond 4-Hitting Set.
• Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. The Parameterized Position Heap of a Trie.
• Matthew P. Johnson. Turing Tumble is P(SPACE)-Complete.
• Emanuele Natale and Iliad Ramezani. On the Necessary Memory to Compute the Plurality in Multi-Agent Systems.
• Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik and Grzegorz Stachowiak. Fair Hitting Sequence problem: scheduling activities with varied frequency requirements.
• Ho Lam Pang and Leizhen Cai. Complexity of Vertex Switching on Edge-Bicolored