19th Scandinavian Symposium on Algorithm Theory June 12-14, 2024. Helsinki, Finland
Paper submission deadline
(23:59 Anywhere on Earth)
Notification of acceptance
Early Registration Deadline
Symposium
All registration fees include the scientific program June 12-14, lunches, coffees, and the conference dinner on June 13. There is a student discount, but no travel grants. The early registration deadline is May 18.
Registration fees:
You can register by clicking here.
SWAT is committed to providing a safe, inclusive, and respectful conference experience for everyone. Harassment in any form will not be tolerated. If you are subjected to, or become aware of, any form of inappropriate or unethical behavior during the conference, please contact our SafeToC advocates, or the steering committee chair, program committee chair, or local chairs.
For further questions, please contact Jara Uitto or Sándor Kisfaludi-Bak.
Email: firstname.lastname@aalto.fi.
Conference webpage: swat2024.github.io/website/
Paper submission deadline: February 7, 2024 (AoE, anywhere on earth) Submission link: https://easychair.org/conferences/?conf=swat2024
SWAT (Scandinavian Symposium on Algorithm Theory), which alternates with the Algorithms and Data Structures Symposium (WADS), is a forum for researchers in the area of design and analysis of algorithms and data structures.
We invite submissions of papers presenting original research on algorithms and data structures. Though we welcome experiments, the theoretical results in the articles will be the main measure for evaluating their merits.
Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parameterized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms. The algorithmic problems considered may be motivated by applications, e.g. in optimization, geometry and topology, graph analysis, bioinformatics, visualization, string processing, information retrieval, machine learning, algorithmic game theory, or mechanism design.
Contributors must submit their papers using the Easychair system. Submissions should be in LIPIcs format (without font size, margin, or line spacing changes), and not exceed 15 pages including front page, but excluding references. See www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren for instructions. Additionally, if full details of proofs do not fit into the page limit, a clearly marked appendix containing the remaining details must be included; this appendix will not be regarded as part of the submission and will be considered only at the discretion of the program committee. Submissions deviating substantially from this format risk rejection without consideration of their merits.
Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the symposium, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal. However, we encourage authors to make a preprint of their paper available at a public repository such as arXiv. At least one author of every accepted paper is expected to register and present the paper at the symposium. Symposium proceedings will be published in the "Leibniz International Proceedings in Informatics" (LIPIcs) series. A prize will be awarded to the author(s) of the best student-authored paper. A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the paper in the submission process.
Paper submission deadline: February 7, 2024 (AoE, anywhere on earth)
Notification of acceptance: April 2, 2024
Program Committee Chair: Hans Bodlaender (Utrecht University, the Netherlands)
Local Organization: Sándor Kisfaludi-Bak, Alexandru Paler, Jara Uitto (Aalto University,
Espoo, Finland), Mikko Koivisto (University of Helsinki, Finland)
All questions about submissions should be emailed to the PC chair:
Hans Bodlaender (h.l.bodlaender at uu.nl)
SWAT 2024 will be held in Helsinki, the capital of Finland.
The venue is the freshly renovated
main
building of the University of Helsinki
in the heart of the city. It is close to a number of hotels, public transport and most of the
major sights in Helsinki.
Address: Fabianinkatu 33, 00170 Helsinki
Wednesday, June 12th | ||
08:30- | Registration desk opens | |
09:00-09:10 | Welcome | |
09:10-10:30 | Session 1: Parameterized Algorithms | |
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 Robert Scheffler. The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs | |
10:30-11:00 | Coffee | |
11:00-11:50 | Session 2: Invited Talk | |
11:00-11:50 | Karen Aardal. Machine-learning augmented enumeration for integer optimization, and beyond | |
11:50-12:30 | Session 3: Optimization | |
11:50-12:10 | Mohammad Salavatipour and Lijiangnan Tian. Approximation Algorithms for the Airport and Railway Problem | |
12:10-12:30 | Zachary Friggstad and Hao Sun. A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree | |
12:30-13:40 | Lunch | |
13:40-15:00 | Session 4: Computational Geometry | |
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 | Coffee | |
15:30-16:50 | Session 5: Data Structures | |
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 |
Thursday, June 13th | ||
09:00-10:20 | Session 6: Computational Geometry | |
09:00-09:20 | Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann and Milos 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 | Coffee | |
11:00-11:50 | Session 7: Invited Talk | |
11:00-11:50 | Greg Bodwin. Turán-type problems in Theoretical Computer Science | |
11:50-12:30 | Session 8: Approximation | |
11:50-12:10 | Seyed Parsa Darbouy and Zachary Friggstad. Approximating Minimum Sum Coloring with Bundles | |
12:10-12:30 | Benjamin Rockel-Wolff. A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads | |
12:30-13:40 | Lunch | |
13:40-15:00 | Session 9: Parameterized Algorithms | |
13:40-14:00 | Michael Levet, Puck Rombach and Nicholas Sieger. Canonizing Graphs of Bounded Rank-Width in 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 Jan van 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 Fixed-Parameter Tractable in the Single Cut-and-Join Model | |
15:00-15:30 | Coffee | |
15:30-16:50 | Session 10: Graphs | |
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-Planar Graphs | |
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 | |
09:00-09:20 | Philip Bille, Yakov Nekrich and Solon Pissis. Size-Constrained Weighted Ancestors with Applications | |
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 | Coffee | |
11:00-11:50 | Session 12: Invited Talk | |
11:00-11:50 | Michal Pilipczuk. Well-structured graphs through the lens of logic | |
11:50-12:30 | Session 13: Parameterized Algorithms | |
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 | |
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 Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects | |
15:00-15:30 | Coffee | |
15:30-16:50 | Session 15: Graph Algorithms and Colouring | |
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 |