December 15 (Tuesday)

---

14:50–15:00 Opening(Chair: Marcin Pilipczuk)

15:00–15:30 Best paper 1 (Chair: Marcin Pilipczuk)

Tuukka Korhonen
Finding Optimal Triangulations Parameterized by Edge Clique Cover

---

15:30–17:00 BLOCK 1 (Chair: Marcin Pilipczuk)

---

Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani and Daniel Paulusma
Bounding the Mim-Width of Hereditary Graph Classes

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann and Dusan Knop
Recognizing Proper Tree-Graphs

Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell and O-Joung Kwon
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

Ashwin Jacob, Fahad Panolan, Venkatesh Raman and Vibha Sahlot
Structural Parameterizations with Modulator Oblivion

Akanksha Agrawal and Ramanujan M. Sridharan
On the Parameterized Complexity of Clique Elimination Distance

Davis Issac, Andreas Emil Feldmann and Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem

---

17:00–18:30 NERODE PRIZE LECTURES (Chair: Hans Bodlaender)

Jianer Chen
On (Nearly) Linear-Time Parameterized Algorithms with Limited Local Resources

Dániel Marx
Important Separators: History and Techniques

---

18:45–19:30 BUSINESS MEETING

---

December 16 (Wednesday)

---

15:00–16:30 BLOCK 2 (Chair: Marthe Bonamy)

---

Daniel Lokshtanov, Amer Mouawad, Fahad Panolan and Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

Louis Dublois, Michael Lampis and Vangelis Paschos
New Algorithms for Mixed Dominating Set

Carl Einarson and Felix Reidl
A general kernelization technique for domination and independence problems in sparse classes

Marcelo Garlet Milani
A Polynomial Kernel for Funnel Arc Deletion Set

Eduard Eiben, William Lochet and Saket Saurabh
A Polynomial Kernel for Paw-Free Editing

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muehlenthaler and Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic

---

16:30–18:00 BLOCK 3 (Chair: Marc Roth)

---

Dishant Goyal, Ragesh Jaiswal and Amit Kumar
FPT Approximation for Constrained Metric k-Median/Means

Radek Hušek, Dušan Knop and Tomáš Masařík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Hans L. Bodlaender and Marieke van der Wegen
Parameterized Complexity of Scheduling Chains of Jobs with Delays

Jesper Nederlof and Céline Swennenhuis
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin and Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

Lukasz Kowalik and Konrad Majewski
The Asymmetric Travelling Salesman Problem in Sparse Digraphs

---

18:00–19:00 TUTORIAL(Chair: Yixin Cao)

---

Yoichi Iwata
LP Relaxations and Parameterized Algorithms

---

December 17 (Thursday)

---

15:00–15:30 Best paper 2 (Chair: Irene Muzi)

Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná and Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs

---

15:30–17:00 BLOCK 4 (Chair: Irene Muzi)

---

Leon Kellerhals and Tomohiro Koana
Parameterized Complexity of Geodetic Set

Fedor Fomin, Petr Golovach, William Lochet, Pranabendu Misra, Saket Saurabh and Roohani Sharma
Parameterized Complexity of Directed Spanner Problems

Ashwin Jacob, Diptapriyo Majumdar and Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes

Yasuaki Kobayashi and Yota Otachi
Parameterized Complexity of Graph Burning

Saket Saurabh and Prafullkumar Tale
On the Parameterized Complexity of Maximum Degree Contraction Problem

Joergen Bang-Jensen, Eduard Eiben, Gregory Gutin, Magnus Wahlström and Anders Yeo
Component Order Connectivity in Directed Graphs

---

17:00–18:15 PACE, EXACT TRACK (Chair: Łukasz Kowalik)

18:15–19:15 PACE, HEURISTIC TRACK (Chair: Łukasz Kowalik)

---