Wednesday, June 12th
08:30-Registration desk opens

09:00-09:10

Welcome09:10-10:30

Session 1: Parameterized Algorithms
Chair: Blair Sullivan

09:10-09:30

Benjamin Merlin Bumpus, Bart M. P. Jansen and Jaime Venne. Fixed-Parameter Tractable
Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond

09:30-09:50

Yota Otachi, Akira Suzuki and Yuma Tamura. Finding Induced Subgraphs from Graphs with
Small Mim-Width

09:50-10:10

Fedor Fomin, Petr Golovach, Tuukka Korhonen and Saket Saurabh. Stability in Graphs with
Matroid Constraints

10:10-10:30

Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanič, Peter Muršič and RobertScheffler. The Simultaneous Interval Number: a New Width Parameter That Measures theSimilarity to Interval Graphs

10:30-11:00

Coffee11:00-11:50

Session 2: Invited Talk (Karen Aardal)
Chair: Hans Bodlaender

11:00-11:50
11:50-12:30

Karen Aardal. Machine-learning augmented enumeration for integer optimization, and beyond
Session 3: Optimization
Chair: Kazuo Iwama

11:50-12:10

Mohammad Salavatipour and Lijiangnan Tian. Approximation Algorithms for the Airport andRailway Problem

12:10-12:30

Zachary Friggstad and Hao Sun. A Logarithmic Integrality Gap for Generalizations of QuasiBipartite Instances of Directed Steiner Tree

12:30-13:40

Lunch

13:40-15:00

Session 4: Computational Geometry
Chair: Yushi Uno

13:40-14:00

Lotte Blank and Anne Driemel. Range Reporting for Time Series via Rectangle Stabbing

14:00-14:20

Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke and Bettina
Speckmann. Optimal in-Place Compaction of Sliding Cubes

14:20-14:40

Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel and Sampson Wong.
L-Budget Clustering of Curves

14:40-15:00

Auguste Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic and David Mount.
Delaunay Triangulations in the Hilbert Metric

15:00-15:30

Coffee15:30-16:30

Session 5: Data Structures / Parameterized Algorithms
Chair: Kazuo Iwama

15:30-15:50

Gerth Stølting Brodal and Sebastian Wild. Deterministic Cache-Oblivious Funnelselect

15:50-16:10

Ioana O. Bercea, Jakob Bæk Tejs Knudsen and Rasmus Pagh. Daisy Bloom Filters

16:10-16:30

Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl and Blair D. Sullivan. Correlation
Clustering with Vertex Splitting

16:35-17:00

SWAT Business MeetingThursday, June 13th
09:00-10:20

Session 6: Computational Geometry
Chair: Greg Bodwin

09:00-09:20

Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann andMilos Stojakovic. Optimizing Symbol Visibility Through Displacement

09:20-09:40

Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen and Valentin Polishchuk. Optimizing
Visibility-Based Search in Polygonal Domains

09:40-10:00

Josh Brunner, Kenneth Cheung, Erik Demaine, Jenny Diomidova, Christine Gregg, Hendrickson
Della and Irina Kostitsyna. Reconfiguration Algorithms for Cubic Modular Robots with Realistic
Movement Constraints

10:00-10:20

Eliot Robson and Sariel Har-Peled. No-Dimensional Tverberg Partitions Revisited

10:30-11:00

Coffee11:00-11:50

Session 7: Invited Talk (Greg Bodwin)
Chair: Michał Pilipczuk

11:00-11:50
11:50-12:30

Greg Bodwin. Turán-type problems in Theoretical Computer Science
Session 8: Approximation
Chair: Michał Pilipczuk

11:50-12:10

Seyed Parsa Darbouy and Zachary Friggstad. Approximating Minimum Sum Coloring withBundles

12:10-12:30

Benjamin Rockel-Wolff. A Fast 3-Approximation for the Capacitated Tree Cover Problem withEdge Loads

12:30-13:40

Lunch

13:40-15:00

Session 9: Parameterized Algorithms
Chair: Bart Jansen

13:40-14:00

Michael Levet, Puck Rombach and Nicholas Sieger. Canonizing Graphs of Bounded Rank-Widthin Parallel via Weisfeiler--Leman

14:00-14:20

Daniel Mock and Peter Rossmanith. Solving a Family of Multivariate Optimization and Decision
Problems on Classes of Bounded Expansion

14:20-14:40

Matthew Johnson, Barnaby Martin, Daniël Paulusma, Sukanya Pandey, Siani Smith and Erik Janvan Leeuwen. Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs

14:40-15:00

Lora Bailey, Heather Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne
Singgih, Grace Stadnyk and Alexander Wiedemann. Pairwise Rearrangement Is FixedParameter Tractable in the Single Cut-and-Join Model

15:00-15:30

Coffee15:30-16:50

Session 10: Graphs
Chair: Karen Aardal

15:30-15:50

Christian Ortlieb and Jens Schmidt. Toward Grünbaum's Conjecture

15:50-16:10

Therese Biedl, Prosenjit Bose and Babak Miraftab. On the Independence Number of 1-PlanarGraphs

16:10-16:30

Anand Louis, Rameesh Paul and Arka Ray. Sparse Cuts in Hypergraphs from Random Walks on
Simplicial Complexes

16:30-16:50

Cristina Bazgan, André Nichterlein and Sofia Vazquez Alferez. Destroying Densest Subgraphs Is
Hard

19:00-

Conference dinner on the island of Suomenlinna in the officer's club. (Public Transportation tickets
in registration package.)

Friday, June 14th
09:00-10:20

Session 11: Data Structures
Chair: Gerth Stølting Brodal

09:00-09:20

Philip Bille, Yakov Nekrich and Solon Pissis. Size-Constrained Weighted Ancestors withApplications

09:20-09:40

Idan Shabat and Ofer Neiman. Path-Reporting Distance Oracles with Linear Size

09:40-10:00

Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy and Kunihiko Sadakane.
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage

10:00-10:20

Stav Ashur and Sariel Har-Peled. Local Spanners Revisited

10:30-11:00

Coffee11:00-11:50

Session 12: Invited Talk (Michał Pilipczuk)Chair: Per Austrin

11:00-11:50
11:50-12:30

Michał Pilipczuk. Well-structured graphs through the lens of logic
Session 13: Parameterized Algorithms
Chair: Tuukka Korhonen

11:50-12:10

Bart M. P. Jansen and Ruben F. A. Verhaegh. Search-Space Reduction via Essential Vertices
Revisited: Vertex Multicut and Cograph Deletion

12:10-12:30

Naonori Kakimura and Ildikó Schlotter. Parameterized Complexity of Submodular Minimization
Under Uncertainty

12:30-13:40

Lunch

13:40-15:00

Session 14: Online Algorithms and Geometric Graphs
Chair: Petteri Kaski

13:40-14:00

Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li and Denis
Pankratov. On the Online Weighted Non-Crossing Matching Problem

14:00-14:20

Magnus Berg and Shahin Kamali. Online Bin Covering with Frequency Predictions

14:20-14:40

Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi
Uno and Alexander Wolff. Eliminating Crossings in Ordered Graphs

14:40-15:00

Gaétan Berthe, Marin Bougeret, Daniel Gonçalves and Jean-Florent Raymond. Subexponential
Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local
Radius

15:00-15:30

Coffee15:30-16:30

Session 15: Graph Algorithms and Colouring
Chair: Jukka Suomela

15:30-15:50

Robert Barish and Tetsuo Shibuya. Recognition and Proper Coloring of Unit Segment
Intersection Graphs

15:50-16:10

Aleksander Bjørn Grodt Christiansen, Eva Rotenberg and Juliette Marie Victoire Vlieghe.
Sparsity-Parameterised Dynamic Edge Colouring

16:10-16:30

Sayan Bhattacharya, Martin Costa, Nadav Panski and Shay Solomon. Arboricity-Dependent
Algorithms for Edge Coloring