Schedule

This schedule is still subject to small changes. Virtual presentations are marked with *. Note that all times are given for Central European Summer Time (CEST).

Monday, September 5  (toggle details)
HS1 HS2 HS3 H-E.51 H-2.57 L-E.03
08:00 Registration desk opens
09:10 ESA A talk
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen and Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
ESA A talk*
Shahbaz Khan and Alexandru I. Tomescu
Optimizing the Safe Flow Decompositions in DAGs
ESA A talk
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo Silveira and Frank Staals
Efficient Fréchet distance queries for segments
09:30 ESA A talk
Jan Dreier, Sebastian Ordyniak and Stefan Szeider
SAT Backdoors: Depth Beats Size
ESA A talk
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru Tomescu and Lucia Williams
Width Helps and Hinders Splitting Flows
ESA A talk
Thijs van der Horst, Maarten Löffler and Frank Staals
Chromatic k-Nearest Neighbor Queries
chaired by Eduard Eiben chaired by Zeev Nutov chaired by Kisfaludi-Bak Sándor
09:50 Break
10:10 ESA A talk
Nikhil Bansal and Christian Coester
Online metric allocation and time-varying regularization
ESA A talk
Hans L. Bodlaender, Carla Groenland and Hugo Jacob
List Colouring Trees in Logarithmic Space
WABI talk*
Yoshihiko Suzuki and Gene Myers
Accurate K-mer Classification Using Read Profiles
10:30 ESA A talk
Rajmohan Rajaraman and Omer Wasim
Improved bounds for online balanced graph re-partitioning
ESA A talk
Ofer Neiman and Idan Shabat
A Unified Framework for Hopsets
WABI talk
Jens Zentgraf and Sven Rahmann
Fast gapped k-mer counting with subdivided multi-way bucketed Cuckoo hash tables
10:50 ESA A talk
Bernhard Haeupler, D. Ellis Hershkowitz and Goran Zuzic
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings
ESA A talk*
Oswin Aichholzer, Erik Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masarova, Mikhail Rudoy, Virginia Vassilevska Williams and Nicole Wein
Hardness of Token Swapping on Trees
WABI talk*
Sebastian Schmidt and Jarno Alanko
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time
chaired by Eduard Eiben chaired by Davide Bilò chaired by Christina Boucher
11:10 Break
11:30 ESA keynote: Saket Saurabh
12:30 Lunch
14:00 ESA A talk
Argyrios Deligkas, Michail Fasoulakis and Evangelos Markakis
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
ESA A talk
Martin Balko, Steven Chaplick, Siddharth Gupta, Robert Ganian, Michael Hoffmann, Pavel Valtr and Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs
WABI talk
Zsuzsanna Liptak, Francesco Masillo and Simon J. Puglisi
Suffix sorting via matching statistics
14:20 ESA A talk
Bento Natura, Meike Neuwohner and Stefan Weltge
The Pareto cover problem
ESA A talk
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi and Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited
WABI talk
Giulio Ermanno Pibiri
On Weighted K-Mer Dictionaries
14:40 ESA A talk
Jiehua Chen and Sanjukta Roy
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space
ESA A talk
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak and Stefan Szeider
Finding a Cluster in Incomplete Data
WABI talk
Taher Mun, Naga Sai Kavya Vaddadi and Ben Langmead
Pangenomic genotyping with the marker array
chaired by Sarel Cohen chaired by Saket Saurabh chaired by Travis Gagie
15:00 Break
15:20 ESA A talk
Zeev Nutov
Data structures for node connectivity queries
ESA A talk
Raghavendra Addanki, Andrew McGregor and Cameron Musco
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries
WABI talk
Pijus Simonaitis and Benjamin J. Raphael
A maximum parsimony principle for multichromosomal complex genome rearrangements
15:40 ESA A talk
Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff and Kevin Mann
Enumerating Minimal Connected Dominating Sets
ESA A talk
Thomas Erlebach, Murilo de Lima, Nicole Megow and Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
WABI talk
Marilia Braga, Leonie Brockmann, Katharina Klerx and Jens Stoye
A linear time algorithm for an extended version of the breakpoint double distance
16:00 ESA A talk*
Han Jiang, Shang-En Huang, Thatchaphol Saranurak and Tian Zhang
Vertex Sparsifiers for Hyperedge Connectivity
ESA A talk*
Or Zamir
Faster algorithm for Unique (k,2)-CSP
WABI talk
Diego P. Rubert and Marilia Braga
Gene orthology inference via large-scale rearrangements for partially assembled genomes
chaired by Philip Wellnitz chaired by Argyrios Deligkas chaired by Daniel Doerr
16:20 Break
16:40 ESA A talk
Kobi Bodek and Moran Feldman
Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case
ESA A talk
Valentin Bartier, Nicolas Bousquet and Amer Mouawad
Galactic Token Sliding
WABI business meeting
17:00 ESA A talk*
Sheng Yang, Samir Khuller, Sunav Choudhary, Kanak Mahadik and Subrata Mitra
Correlated Stochastic Knapsack with a Submodular Objective
ESA A talk
Daniel Blankenburg
Resource Sharing Revisited: Local Weak Duality and Optimal Convergence
17:20 ESA A talk*
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson and Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly
ESA A talk
Benjamin Merlin Bumpus, Bart M. P. Jansen and Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices
chaired by Andreas Wiese chaired by Roohani Sharma
17:40 Reception
 
 
Tuesday, September 6  (toggle details)
HS1 HS2 HS3 H-E.51 H-2.57 L-E.03
08:50 ESA A talk
Wojciech Nadara, Michał Pilipczuk and Marcin Smulewicz
Computing treedepth in polynomial space and linear fpt time
ESA S talk
Aleksander Łukasiewicz and Przemysław Uznański
Cardinality estimation using Gumbel distribution
WABI talk
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone and Lorenzo Tattini
phyBWT: Alignment-free phylogeny via eBWT positional clustering
ALGOCLOUD talk
A. Spitalas, K. Tsichlas
MAGMA: Proposing a Massive Historical Graph Management System
09:10 ESA A talk
Mark Jones, Mathias Weller and Leo van Iersel
Embedding phylogenetic trees in networks of low treewidth
ESA S talk
Sourav Chakraborty, Kuldeep S. Meel and N. V. Vinodchandran
Distinct Elements in Streams: An Algorithm for the (Text) Book
WABI talk
Adrián Goga and Andrej Baláž
Prefix-free parsing for building large tunnelled Wheeler graphs
ALGOCLOUD talk
D. Amaxilatis, I. Chatzigiannakis, T. Saradakos
Edge-Enabled Machine Learning for Solar Power Production Forecasting
09:30 ESA A talk
Tesshu Hanaka and Michael Lampis
Hedonic Games and Treewidth Revisited
ESA S talk*
Mohammad Ansari, Mohammad Saneian and Hamid Zarrabi-Zadeh
Simple Streaming Algorithms for Edge Coloring
WABI talk
Ahsan Sanaullah, Degui Zhi and Shaojie Zhang
Haplotype Threading Using the Positional Burrows-Wheeler Transform
ALGOCLOUD talk
A. Karras, C. Karras, A. Pervanas, S. Sioutas, C. Zaroliagis
SQL Query Optimization in Distributed NoSQL Databases for Cloud-based Applications
chaired by Paloma Thomé de Lima chaired by Jarno Alanko
09:50 Break
10:10 ESA A talk
Frederik Brüning, Jacobus Conradi and Anne Driemel
Faster Approximate Covering of Subcurves under the Fréchet Distance
ESA S talk
Jonas Ellert
Lyndon Arrays Simplified
WABI talk
Alitzel López Sánchez and Manuel Lafond
Predicting Horizontal Gene Transfers with Perfect Transfer Networks
ALGOCLOUD talk
E. Althaus, S. Funke, M. Schrauth
Privacy Preserving Queries of Shortest Path Distances
10:30 ESA A talk
Soh Kumabe and Yuichi Yoshida
Average sensitivity of the Knapsack Problem
ESA S talk
Travis Gagie
Simple worst-case optimal adaptive prefix-free coding
WABI talk
Konstantinn Bonnet, Tobias Marschall and Daniel Doerr
Constructing founder sets under allelic and non-allelic homologous recombination
ALGOCLOUD talk
S. Kontogiannis, P.-M. Machaira, A. Paraskevopoulos, K. Raftopoulos, C. Zaroliagis
Cloud-Based Urban Mobility Services
10:50 ESA A talk*
Zachary Friggstad and Mahya Jamshidian
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters
ESA S talk*
Alexander Tiskin
Fast RSK correspondence by doubling search
WABI talk*
Wei Wei and David Koslicki
WGSUniFrac: Applying UniFrac metric to Whole Genome Shotgun data
ALGOCLOUD talk*
K. Subramani, Piotr Wojciechowski and Alvaro Velasquez
An analysis of priority based bin packing
chaired by Sebastian Ordyniak chaired by Solon Pissis chaired by Thomas Vinar
11:10 Break
11:30 ESA keynote: Simon Puglisi
12:30 Lunch
14:00 ESA A best student paper
Zoe Xi and William Kuszmaul
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings
ESA B best student paper
Tim Zeitz and Nils Werner
Combining Predicted and Live Traffic with Time-Dependent A* Potentials
WABI talk
Mathieu Gascon and Nadia El-Mabrouk
Non-binary Tree Reconciliation with Endosymbiotic Gene Transfer
ALGOCLOUD talk
A. Karakasidis, G. Koloniari
More Sparking Soundex-based Privacy-Preserving Record Linkage
14:20 ESA S best paper (we wait for listeners of ESA B and ALGOCLOUD)
Alejandro Flores-Velazco
Improved Search of Relevant Points for Nearest-Neighbor Classification
WABI talk*
Baqiao Liu and Tandy Warnow
Fast and Accurate Species Trees from Weighted Internode Distances
14:40 ESA B best paper
Chris Schwiegelshohn and Omar Ali Sheikh-Omar
An Empirical Evaluation of k-Means Coresets
WABI talk
Giulia Bernardini, Leo van Iersel, Esther Julien and Leen Stougie
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning
chaired by Sven Rahmann
15:00 Break
15:20 ESA A best paper
Stefan Walzer
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold (extended abstract)
WABI talk
Eden Ozery, Meirav Zehavi and Michal Ziv-Ukelson
Algorithms for Structure Informed Genome Rearrangement
15:40 ESA Test-of-Time award
Andrew V. Goldberg and Jason D. Hartline
Competitive Auctions for Multiple Digital Goods
WABI talk
Daniel Gibney, Sharma V. Thankachan and Srinivas Aluru
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time
16:00 ESA Test-of-Time award
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross A. Lippert, and Russell Schwartz
SNPs Problems, Complexity, and Algorithms
chaired by Erin Molloy
16:20 Break
16:40 memorial lecture for Camil Demetrescu, Rolf Niedermeier and Gerhard Woeginger
17:25 End of talk, dinner venue opens
18:30 Conference Dinner
 
 
Wednesday, September 7  (toggle details)
HS1 HS2 HS3 H-E.51 H-2.57 L-E.03
08:50 ESA A talk
Łukasz Bożyk and Michał Pilipczuk
Polynomial kernel for immersion hitting in tournaments
ESA B talk
Owen Rouille and Clément Maria
Localized geometric moves to compute hyperbolic structures on triangulated 3-manifolds
Nerode prize winner: Bruno Courcelle ESA A talk
Davide Bilò, Gianlorenzo D’Angelo, Luciano Gualà, Stefano Leucci and Mirko Rossi
Sparse Temporal Spanners with Low Stretch
WABI talk
Clément Agret, Bastien Cazaux and Antoine Limasset
Toward optimal fingerprint indexing for large scale genomics
09:10 ESA A talk
Václav Blažej, Pratibha Choudhary, Dušan Knop, Šimon Schierreich, Ondřej Suchý and Tomáš Valla
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
ESA B talk
Lex de Kogel, Marc van Kreveld and Jordi L. Vermeulen
Abstract morphing using the Hausdorff distance and Voronoi diagrams
ESA A talk*
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh and Csaba Toth
Online Spanners in Metric Spaces
WABI talk
Yoshihiro Shibuya, Djamal Belazzougui and Gregory Kucherov
Efficient reconciliation of genomic datasets of high similarity
09:30 ESA A talk
Jakub Gajarský, Lars Jaffke, Paloma Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski and Uéverton Souza
Taming graphs with no large creatures and skinny ladders
ESA B talk*
Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu and Julian Shun
ParGeo: A Library for Parallel Computational Geometry
ESA A talk
Manoj Gupta and Dipan Dey
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
WABI talk
Ke Chen and Mingfu Shao
Locality-sensitive bucketing functions
chaired by Fedor Fomin chaired by Chris Schwiegelshohn chaired by Martin Schirneck chaired by Alberto Policriti
09:50 Break
10:10 ESA A talk
Jendrik Brachter and Pascal Schweitzer
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension
ESA B talk
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl and Takaaki Nishimoto
Computing NP-hard Repetitiveness Measures via MAX-SAT
IPEC talk
Robert Ganian and Viktoriia Korchemna
Slim Tree-Cut Width
ESA A talk
Anna Arutyunova and Heiko Röglin
The Price of Hierarchical Clustering
WABI talk
Bertrand Marchand, Sebastian Will, Sarah Berkemer, Laurent Bulteau and Yann Ponty
Fully-automated design of dynamic programming schemes for RNA folding with pseudoknots
10:30 ESA A talk
Florian Barth, Stefan Funke and Claudius Proissl
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions
ESA B talk
Andrew Goldberg, Yuanyuan Dong, Alexander Noe, Nikos Parotsidis, Mauricio Resende and Quico Spaen
A Local Search Algorithm for Large Maximum Weight Independent Set Problems
IPEC talk
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk and Michał Pilipczuk
On the Complexity of Problems on Tree-structured Graphs
ESA A talk
Georg Anegg, Laura Vargas Koch and Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems
WABI best paper
10:50 ESA A talk*
Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhoefer and Miklos Santha
Classical and quantum algorithms for variants of Subset-Sum via dynamic programming
ESA B talk
Aleksander Figiel, Vincent Froese, André Nichterlein and Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others
IPEC talk
Brage I. K. Bakkane and Lars Jaffke
On the hardness of generalized domination problems parameterized by mim-width
ESA A talk
Deeparnab Chakrabarty, Maryam Negahbani and Ankita Sarkar
Approximation Algorithms for Continuous Clustering and Facility Location Problems
chaired by Hendrik Molter chaired by Matthias Stallman chaired by Argyrios Deligkas chaired by Christina Boucher and Sven Rahmann
11:10 Break
11:30 WABI keynote: Leena Salmela
12:30 Lunch
14:00 ESA A talk
Miriam Goetze, Paul Jungeblut and Torsten Ueckerdt
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs
ESA B talk
Alexander Dobler, Manuel Sorge and Anaïs Villedieu
Turbocharging Heuristics for Weak Coloring Numbers
IPEC talk
Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper and Karol Węgrzycki
Computing Generalized Convolutions Faster Than Brute Force
ESA A talk
Susanne Albers and Sebastian Schubert
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities
WABI Pangenome Workshop
14:20 ESA A talk
Bartłomiej Bosek and Anna Zych-Pawlewicz
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget
ESA B talk
Evangelos Kosinas, Loukas Georgiadis, Giuseppe F. Italiano and Thodoris Dimas
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study
IPEC talk
Falko Hegerfeld and Stefan Kratsch
Towards exact structural thresholds for parameterized complexity
ESA A talk
Amit Chakrabarti and Themistoklis Haris
Counting Simplices in Hypergraph Streams
14:40 ESA A talk*
D Ellis Hershkowitz and Jason Li
O(1) Steiner Point Removal in Series-Parallel Graphs
ESA B talk*
Markus Chimani and Finn Stutzenstein
Spanner Approximations in Practice
IPEC talk
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit and Saket Saurabh
Exact Exponential Algorithms for Clustering Problems
ESA A talk
Chien-Chung Huang and François Sellier
Maximum Weight b-Matchings in Random-Order Streams
chaired by Thomas Erlebach chaired by Travis Gagie chaired by Ilan Cohen
15:00 Break
15:20 ESA A talk*
Debajyoti Kar, Arindam Khan and Andreas Wiese
Approximation Algorithms for ROUND-UFP and ROUND-SAP
ESA B talk
Marek Szykuła and Adam Zyzik
An Improved Algorithm for Finding the Shortest Synchronizing Words
PACE awards (poster session in foyer afterwards) ESA A talk
Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak and Antonis Skarlatos
Computing Smallest Convex Intersecting Polygons
WABI Pangenome Workshop
15:40 ESA A talk
Marten Maack, Simon Pukrop and Anna Rodriguez Rasmussen
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
ESA B talk
Thomas Bläsius and Philipp Fischbeck
On the External Validity of Average-Case Analyses of Graph Algorithms
ESA A talk
Justin Dallant and John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems
16:00 ESA A talk
Dušan Knop and Martin Koutecky
Scheduling Kernels via Configuration LP
ESA B talk
Arghya Bhattacharya, Helen Xu, Abiyaz Chowdhury, Rezaul A. Chowdhury, Rathish Das, Rob Johnson, Rishab Nithyanand and Michael A. Bender
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting
ESA A talk*
Esther Ezra and Micha Sharir
Intersection Searching amid Tetrahedra in 4-space and Efficient Continuous Collision Detection
chaired by Thomas Erlebach chaired by Simon Puglisi chaired by Philip Wellnitz
16:20 Break
16:40 ESA A talk
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon Pissis, Wojciech Rytter, Tomasz Walen and Wiktor Zuba
Approximate Circular Pattern Matching
ESA S talk
Syamantak Das and Andreas Wiese
A simpler QPTAS for scheduling jobs with precedence constraints
IPEC talk
Akanksha Agrawal, Saket Saurabh and Meirav Zehavi
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
ESA A talk
Monika Henzinger, Ami Paz and A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
WABI Pangenome Workshop
17:00 ESA A talk
Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov
Longest Cycle above Erdős–Gallai Bound
ESA S talk*
Henk Alkema, Mark de Berg, Leonidas Theocharous and Morteza Monemizadeh
TSP in a Simple Polygon
IPEC talk*
Yosuke Mizutani and Blair Sullivan
Improved Parameterized Complexity of Happy Set Problems
ESA A talk*
Younan Gao and Meng He
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product
17:20 ESA A talk*
Tamal Dey and Tao Hou
Fast Computation of Zigzag Persistence
ESA S talk
Radu Curticapean
Determinants from homomorphisms
IPEC talk*
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana and Abhishek Sahu
Parameterized Complexity of Perfectly Matched Sets
ESA A talk*
Sayan Bhattacharya, Thatchaphol Saranurak and Pattara Sukprasert
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary
chaired by Philip Wellnitz chaired by Anne Driemel chaired by Stefano Leucci
17:40 Break
17:50 ESA community meeting
 
 
Thursday, September 8  (toggle details)
HS1 HS2 HS3 H-E.51 H-2.57 L-E.03
08:50 IPEC talk
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes and Stéphan Thomassé
Twin-width VIII: delineation and win-wins
WABI Pangenome Workshop
09:10 IPEC talk
Hans L. Bodlaender, Carla Groenland and Hugo Jacob
On the parameterized complexity of computing tree-partitions
09:30 IPEC talk
Esther Galby, Daniel Marx, Philipp Schepper, Roohani Sharma and Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
09:50 Break
10:10 IPEC talk
Leon Kellerhals, Tomohiro Koana and Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
WAOA talk
Matej Lieskovský and Jiří Sgall
Graph burning and non-uniform $k$-centers for small treewidth
ATMOS talk
Lukas Graf, Tobias Harks and Prashant Palkar
Dynamic Traffic Assignment for Electric Vehicles
ALGOSENSORS talk
Nada Almalki and Othon Michail
On Geometric Shape Construction via Growth Operations
WABI Pangenome Workshop
10:30 IPEC talk
Johannes Blum, Yann Disser, Andreas Feldmann, Siddharth Gupta and Anna Zych-Pawlewicz
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension
WAOA talk
Moritz Buchem, Linda Kleist and Daniel Schmidt Genannt Waldschmidt
Scheduling with Machine Conflicts
ATMOS talk
Moritz Potthoff and Jonas Sauer
Efficient Algorithms for Fully Multimodal Journey Planning
ALGOSENSORS talk*
Matthew Connor and Othon Michail
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes
10:50 IPEC talk
Christian Komusiewicz and Nils Morawietz
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
WAOA talk*
Rajni Dabas, Naveen Garg, Neelima Gupta and Dilpreet Kaur
Locating Service and Charging stations
ATMOS talk
Spyros Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos and Christos Zaroliagis
REX: A Realistic Time-dependent Model for Multimodal Public Transport
ALGOSENSORS talk
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano and Alfredo Navarra
Molecular robots with chirality on grids
chaired by Niels Lindner chaired by Thomas Erlebach
11:10 Break
11:30 IPEC keynote: Eunjung Kim WABI Pangenome Workshop
12:30 Lunch
14:00 IPEC talk
Dániel Marx, Govind S. Sankar and Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
WAOA talk
Devin Smedira and David Shmoys
Scheduling Appointments Online: The Power of Deferred Decision-Making
ATMOS talk
Vera Grafe, Alexander Schiewe and Anita Schöbel
Delay Management with Integrated Decisions on the Vehicle Circulations
ALGOSENSORS talk
Davide Bilò, Gianlorenzo D’Angelo, Luciano Gualà, Stefano Leucci and Mirko Rossi
Blackout-tolerant Temporal Spanners
WABI Pangenome Workshop
14:20 IPEC talk
Guillaume Ducoffe
Obstructions to faster diameter computation: Asteroidal sets
WAOA talk
Evripidis Bampis, Bruno Escoffier and Michalis Xefteris
Canadian Traveller Problem with Predictions
ATMOS talk
Julian Patzner, Ralf Rückert and Matthias Müller-Hannemann
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport
ALGOSENSORS talk
George Mertzios, Othon Michail, Paul Spirakis, George Skretas and Michail Theofilatos
The Complexity of Growing a Graph
14:40 IPEC talk
Jelle Oostveen and Erik Jan van Leeuwen
Parameterized Complexity of Streaming Diameter and Connectivity Problems
WAOA talk
Andreas Abels, Leon Ladewig, Kevin Schewior and Moritz Stinzendörfer
Knapsack Secretary Through Boosting
ATMOS talk
Zuguang Gao, John R. Birge, Richard L.-Y. Chen and Maurice Cheung
Greedy Algorithms for the Freight Consolidation Problem
ALGOSENSORS talk
George Karakostas and Stavros Kolliopoulos
Resource time-sharing for IoT applications with deadlines
chaired by Spyros Kontogiannis chaired by Michael Segal
15:00 Break
15:20 ATMOS keynote: Christian Sommer WABI Pangenome Workshop
16:20 Break
16:40 IPEC best paper
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke and Paloma de Lima
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure
ATMOS talk
Torsten Klug, Thomas Schlechte and Markus Reuther
Does Laziness Pay Off? – A Lazy-Constraint Approach to Timetabling
ALGOSENSORS talk
Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti and Giuseppe Prencipe
Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone
WABI Pangenome Workshop
17:00 IPEC business meeting ATMOS talk
Kosuke Kawazoe, Takuto Yamauchi and Kenji Tei
A formulation of MIP train rescheduling at terminals in bidirectional double-track lines with a moving block and ATO
ALGOSENSORS talk*
Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam
Fault-Tolerant Graph Realizations in the Congested Clique
17:20 ATMOS talk
Enrico Bortoletto, Niels Lindner and Berenike Masing
Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling
ALGOSENSORS business meeting
chaired by Philine Schiewe chaired by Davide Bilò
17:40 Break
17:50 IPEC business meeting (continued) ATMOS business meeting ALGOSENSORS business meeting (continued)
 
 
Friday, September 9  (toggle details)
HS1 HS2 HS3 H-E.51 H-2.57 L-E.03
08:50 IPEC talk
Danny Hermelin, Yuval Itzhaki, Hendrik Molter and Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines
WAOA talk
Hsiang-Hsuan Liu and Jonathan Toole-Charignon
The Power of Amortized Recourse for Online Graph Problems
WABI Pangenome Workshop
09:10 IPEC talk
Maher Mallem, Claire Hanen and Alix Munier Kordon
Parameterized complexity of a parallel machine scheduling problem
WAOA talk
Júlia Baligács, Yann Disser, Nils Mosis and David Weckbecker
An Improved Algorithm for Open Online Dial-a-Ride
ATMOS talk
Ralf Borndörfer, Fabian Danecker and Martin Weiser
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization
ALGOSENSORS talk
Vishwanath Reddy Singireddy and Manjanna B
Dispersing Facilities on Planar Segment and Circle Amidst Repulsion
09:30 IPEC talk
Ishay Haviv
A Fixed-Parameter Algorithm for the Schrijver Problem
WAOA talk
Ilan Cohen
Stochastic graph exploration with limited resources
ATMOS talk
Marco Blanco, Ralf Borndoerfer and Pedro Maristany de Las Casas
An A* Algorithm for Flight Planning based on Idealized Vertical Profiles
ALGOSENSORS talk
Konstantinos Georgiou and Woojin Jang
Triangle Evacuation of 2 Agents in the Wireless Model
chaired by Matthias Muller-Hannemann chaired by George Skretas
09:50 Break
10:10 IPEC talk
Sayan Bandyapadhyay, Fedor Fomin, Petr Golovach, Nidhi Purohit and Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering
WAOA talk
Lisa Hellerstein, Devorah Kletenik, Naifeng Liu and R. Teal Witter
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem
ATMOS talk
Irene Heinrich, Philine Schiewe and Constantin Seebach
Algorithms and Hardness for Non-Pool-Based Line Planning
ALGOSENSORS invited talk: Roger Wattenhofer WABI Pangenome Workshop
10:30 IPEC talk
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier and Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time
WAOA talk
Fabian Klute, Sujoy Bhore and Jelle Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique
ATMOS talk
Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita Schöbel and Reena Urban
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties
10:50 IPEC talk
Eduard Eiben, Clément Rambaud and Magnus Wahlström
On the parameterized complexity of symmetric directed multicut
WAOA talk
Maike Buchin, Anne Driemel, Ioannis Psarros, Dennis Rohde and Koen van Greevenbroek
Approximating Length-Restricted Means under Dynamic Time Warping
ATMOS talk
Hector Gatt, Jean-Marie Freche, Fabien Lehuédé and Arnaud Laurent
A bilevel model for the frequency setting problem
chaired by Michael Segal
11:10 Break
11:30 WAOA keynote: Tobias Mömke WABI Pangenome Workshop
12:30 Lunch
14:00 End