Schedule – ALGO2025

Each standard talk of ESA, IPEC, ALGOCLOUD and ATMOS is assigned a 17 minutes slot, for WAOA it is 22 minutes, and for ALGOWIN it is 30 minutes. Each keynote talk is given a 60 minutes time slot.

Monday, September 15

0.03

0.03a

0.06

1.01

08:00	Registration desk opens
08:45	session chair: Anne Benoit	session chair: Shyan Akmal	session chair: Ivor van der Hoog
	ESA talk Gerth Stølting Brodal, Michael Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava and Rolf Svenning External-Memory Priority Queues with Optimal Insertions	ESA talk Koustav Bhanja and Asaf Petruschka Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity	ESA talk Mark de Berg and Sergio Cabello An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs
	ESA talk Vincent Jugé Efficient top-down updates in AVL trees	ESA talk Aikaterini Niklanovits, Kirill Simonov, Shaily Verma and Ziena Zeif Connected Partitions via Connected Dominating Sets	ESA talk Reut Levi and Yonatan Meiri Tolerant Testers for Subgraph-Freeness
	ESA talk Gerth Stølting Brodal, Casper Rysgaard and Rolf Svenning Buffered Partially-Persistent External-Memory Search Trees	ESA talk Zeev Nutov and Reut Cohen Bicriteria approximation for k-edge-connectivity	ESA talk Artur Czumaj, Christian Sohler and Stefan Walzer Testing Depth First Search Numbering
09:36	Coffee break
10:00	session chair: Artur Czumaj	session chair: Zeev Nutov	session chair: Anne Benoit
	ESA talk Matthias Bentert, Fedor Fomin, Petr Golovach and Laure Morelle Fault-Tolerant Matroid Bases	ESA talk Jacobus Conradi and Anne Driemel Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better	ESA talk Gianmarco Picarella, Marc van Kreveld, Frank Staals and Sjoerd de Vries Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
	ESA talk David Eppstein, Michael Goodrich and Songyu Liu Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing	ESA talk Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg and Lasse Wulf Fréchet Distance in Unweighted Planar Graphs	ESA talk László Kozma and Junqi Tan Faster exponential algorithms for cut problems via geometric data structures
	ESA talk Thomas Erlebach, Othon Michail and Nils Morawietz Recognizing and Realizing Temporal Reachability Graphs	ESA talk Thijs van der Horst, Marc van Kreveld, Tim Ophelders and Bettina Speckmann The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon	ESA talk Hugo Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane Souvaine and Leonidas Theocharous An Improved Bound for Plane Covering Paths
	ESA talk Soh Kumabe Max-Distance Sparsification for Diversification and Clustering	ESA talk Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter and Sampson Wong Property Testing of Curve Similarity	ESA talk Jean Cardinal and Yelena Yuditsky Compact Representation of Semilinear and Terrain-like Graphs
11:08	Coffee break
11:30	session chair: Haim Kaplan
	ESA keynote Bernhard Haeupler Length-Constrained Expanders


12:30	Lunch
14:00	session chair: Anne Benoit	session chair: Vincent Jugé	session chair: Marc van Kreveld
	ESA talk Baris Can Esmer and Dániel Marx Generalized Graph Packing Problems Parameterized by Treewidth	ESA talk Benjamin Aram Berendsohn Optimal antimatroid sorting	ESA talk Vincent Despré, Camille Lanuel, Marc Pouget and Monique Teillaud ε-Net Algorithm Implementation on Hyperbolic Surfaces
	ESA talk Laure Morelle, Ignasi Sau and Dimitrios M. Thilikos Graph modification of bounded size to minor-closed classes as fast as vertex deletion	ESA talk Pawel Gawrychowski and Adam Górkiewicz Better Indexing for Rectangular Pattern Matching	ESA talk Haitao Wang A Deterministic Partition Tree and Applications
	ESA talk Tatsuya Gima, Soh Kumabe and Yuichi Yoshida Courcelle’s Theorem for Lipschitz Continuity	ESA talk Jannik Olbrich Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars	ESA talk Minati De, Satyam Singh and Csaba Toth Online Hitting Sets for Disks of Bounded Radii
	ESA talk Narek Bojikian, Vera Chekan and Stefan Kratsch Tight Bounds for some Classical Problems Parameterized by Cutwidth	ESA talk Md. Hasin Abrar, Paul Medvedev and Giorgio Vinciguerra Efficiency of Learned Indexes on Genome Spectra	ESA talk Jack Spalding-Jamieson and Anurag Murty Naredla Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
15:08	Coffee break
15:30	session chair: Michał Pilipczuk	session chair: André Nichterlein	session chair: Bettina Speckmann
	ESA talk Radu Curticapean, Simon Döring and Daniel Neuen Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial	ESA talk Francisco Sena, Romeo Rizzi and Alexandru I. Tomescu Safe Sequences via Dominators in DAGs for Path-Covering Problems	ESA talk Ivor van der Hoog, Eva Rotenberg and Daniel Rutschmann A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
	ESA talk Joshua Marc Könen, Heiko Röglin and Tarek Stuck Parameterized Algorithms for Computing Pareto Sets	ESA talk Saman Ahmadi, Andrea Raith and Mahdi Jalili A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem	ESA talk Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann and Sampson Wong Instance-Optimal Imprecise Convex Hull
	ESA talk Thomas Depian, Simon D. Fink, Robert Ganian and Vaishali Surianarayanan Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms	ESA talk Henrik Reinstädtler, S M Ferdous, Alex Pothen, Bora Ucar and Christian Schulz Semi-Streaming Algorithms for Hypergraph Matching	ESA talk Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg and Tord Stordalen A Dynamic Piecewise-linear Geometric Index with Worst-case Guarantees
	ESA talk Éric Colin de Verdière and Petr Hlineny A Unified FPT Framework for Crossing Number Problems	ESA talk Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders and Daniel Seemaier Linear-Time Multilevel Graph Partitioning via Edge Sparsification	ESA talk Hugo Akitaya, Sándor Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock and Tobias Wallner Sliding Squares in Parallel
16:38	Coffee break
17:00	session chair: Nick Matsakis	session chair: Gerth Brodal	session chair: Michał Pilipczuk	session chair: Tizia Cattai
	ESA talk Martin Fürer, Carlos Hoppen and Vilmar Trevisan Fast Gaussian elimination for low treewidth matrices	ESA talk Nikhil Kumar, Jj Nan and Chaitanya Swamy Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique	ESA talk Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak and Shengzhe Wang Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts	ALGOCLOUD talk Vincenzo Taormina, Sergio Dimarca, Silvia Schilleci, Maria Del Mar Bosch Belmar, Francesco Paolo Mancuso, Ilenia Tinnirello, Gianluca Sarà and Domenico Garlisi A Federated Learning Approach for Predicting Marine Heat Waves
	ESA talk Nicolas Bousquet, Quentin Deschamps, Arnaud Mary, Amer Mouawad and Theo Pierron The tape reconfiguration problem and its consequences for dominating set reconfiguration	ESA talk Yotam Kenneth-Mordoch and Robert Krauthgamer Cut-Query Algorithms with Few Rounds	ESA talk Mariia Anapolska, Dario van den Boom, Christina Büsing and Timo Gersing A Faster Parametric Search for the Integral Quickest Transshipment Problem	ALGOCLOUD talk Mark Doyle, Theodoros Aslanidis and Dimitris Chatzopoulos Cooper: A Lightweight Event Recording and Visualization Framework for Data Center Simulations
	ESA talk Florian Hörsch and Dániel Marx Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern	ESA talk Surender Baswana, Koustav Bhanja and Anupam Roy Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut	ESA talk Umang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, Britta Peis and Laura Vargas Koch On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem	ALGOCLOUD talk Sonika Arora, Prashanth Josyula, Anant Kumar and Gangadharayya Hiremath Policy Agents for Zero-Trust Kubernetes: A Comprehensive Survey
17:51	Welcome Reception
21:00

Tuesday, September 16

	0.03	0.03a	0.06	1.01
08:45	session chair: Nick Matsakis	session chair: Francois Le Gall	session chair: Shyan Akmal	session chair: Theodoros Aslanidis
	ESA talk Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke and Paloma de Lima On Algorithmic Applications of F-Branchwidth	ESA talk Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh and James Sud Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings	ESA talk Geri Gokaj, Marvin Künnemann, Sabine Storandt and Carina Truschel (Multivariate) k-SUM as barrier to succinct computation	ALGOCLOUD talk Yani Ping and Rizos Sakellariou Duplication-Based Workflow Scheduling with Communication Awareness for Heterogeneous Cloud Computing Environments
	ESA talk Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov Edge Clique Partition and Cover Beyond Independence	ESA talk Yupan Liu and Qisheng Wang On estimating the quantum ℓ_α distance	ESA talk Bingbing Hu and Adam Polak Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems	ALGOCLOUD talk Mahtab Masoori, Lata Narayanan and Denis Pankratov Renting Servers in the Cloud: Empirical Study on Real-World Data
	ESA talk Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov and Magnus Wahlström Parameterized Approximability for Modular Linear Equations	ESA talk Wang Fang and Qisheng Wang Optimal Quantum Algorithm for Estimating Fidelity to a Pure State	ESA talk David Kühnemann, Adam Polak and Alon Rosen The Planted Orthogonal Vectors Problem	ALGOCLOUD talk Konstantinos Karathanasis, Spyros Kontogiannis and Christos Zaroliagis Task Orchestration in the Cloud Continuum via Multi-objective Evolutionary Algorithms
09:36	Coffee break
10:00	session chair: Nodari Sitchinava	session chair: Artur Czumaj	session chair: Chaitanya Swamy	session chair: Domenico Garlisi
	ESA talk Manuel Haag, Florian Kurpicz, Peter Sanders and Matthias Schimek Fast and Lightweight Distributed Suffix Array Construction	ESA talk Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner and Lasse Wulf On Finding l-th Smallest Perfect Matchings	ESA talk Michał Włodarczyk Going Beyond Surfaces in Diameter Approximation	ALGOCLOUD talk Pierluigi Locatelli, Tiziana Cattai, Pietro Spadaccino and Francesca Cuomo Secure Management of a Water Distribution Network in Multi-tenant Scenarios
	ESA talk Konstantinos Karathanasis, Spyros Kontogiannis and Christos Zaroliagis Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets	ESA talk Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco Servedio and Or Zamir Testing Sumsets is Hard	ESA talk Esther Galby, Paloma T. de Lima, Andrea Munaro and Amir Nikabadi Maximum List $r$-Colorable Induced Subgraphs in $kP_3$-free Graphs	ALGOCLOUD talk Mohan Xu and Lena Wiese Constrained Adaptive Partial Training for Federated Learning on Heterogeneous Clients
	ESA talk Pawel Garncarek, Dariusz Kowalski, Shay Kutten and Miguel A. Mosteiro Beeping Deterministic CONGEST Algorithms in Graphs	ESA talk Bruce W. Brewer and Haitao Wang An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs	ESA talk Klaus Jansen, Lis Pirotton and Malte Tutas The Support of Bin Packing is Exponential	ALGOCLOUD talk Joana Tirana, Andreas Chouliaras, Theodoros Aslanidis, John Byabazaire, Spyridon Mastorakis and Dimitris Chatzopoulos Split Learning based GAN training for non-IID Federated Learning
	ESA talk Nairen Cao, Steven Roche and Hsin-Hao Su Min-Max Correlation Clustering via Neighborhood Similarity	ESA talk Ernestine Großmann, Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz and Juliette Vlieghe From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation	ESA talk Dominik Scheder and Johannes Tantow PLS-completeness of string permutations	ALGOCLOUD talk Konstantinos Christopoulos, George Tsiamis and Konstantinos Tsichlas A Comparative Study of Local Community Detection Algorithms in Static Graphs
11:08	Coffee break
11:30	session chair: Anne Benoit
	ESA keynote Monika Henzinger Differential Privacy with Dynamic Inputs
12:30	Lunch
14:00	session chair: Domenico Garlisi
	ALGOCLOUD keynote Eiko Yoneki Optimising Computer Systems in High Dimensional and Complex Parameter Space
15:00	Coffee break
15:30	session chair: Anne Benoit
	ESA track A Best Paper Hans-Peter Lehmann, Peter Sanders, Stefan Walzer and Jonatan Ziegler Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
	ESA track B Best Paper Ahammed Ullah, S M Ferdous and Alex Pothen Weighted Matching in a Poly-Streaming Model
	ESA track S Best Paper Ivor van der Hoog, Eva Rotenberg and Daniel Rutschmann Simpler Universally Optimal Dijkstra
	ESA Best Student Paper Ekin Ergen Online Makespan Scheduling under Scenarios
16:50	Departure for banquet
18:00	Short excursion in the Wilanów Palace
18:30	Banquet

Wednesday, September 17

	0.03	0.03a	0.06	1.01
08:45	session chair: Radu Curticapean	session chair: Marc van Kreveld	session chair: Matthias Bentert	session chair: Yann Disser
	ESA talk Francois Le Gall Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians	ESA talk Nick Fischer, Elazar Goldenberg, Mursalin Habib and Karthik C. S. Hardness of Median and Center in the Ulam Metric	IPEC talk Marcelo Garlet Milani, Ken-Ichi Kawarabayashi, Jacob Stegemann and Nicola Lorenz Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors	ESA talk Loukas Georgiadis, Konstantinos Giannis and Giuseppe F. Italiano Faster dynamic 2-edge connectivity in directed graphs
	ESA talk Minbo Gao, Zhengfeng Ji and Qisheng Wang Quantum Approximate k-Minimum Finding	ESA talk Noam Horowicz and Tsvi Kopelowitz Color Distance Oracles and Snippets Separation Between Exact and Approximate Solutions	IPEC talk Michael Lampis and Manolis Vasilakis Parameterized Maximum Node-Disjoint Paths	ESA talk Monika Henzinger, Evangelos Kosinas, Robin Münk and Harald Räcke Efficient Contractions of Dynamic Graphs – with Applications
	ESA talk Henrique Ennes and Clément Maria Hardness of computation of quantum invariants on 3 manifolds with restricted topology	ESA talk Jonathan Dransfeld, Marvin Künnemann and Mirza Redzic Fine-Grained Classification Of Detecting Dominating Patterns	IPEC talk Tesshu Hanaka and Daisuke Tsuru On the Complexity of Secluded Path Problems	ESA talk Gernot Zöcklein, Simon Meierhans and Rasmus Kyng Bootstrapping Dynamic APSP via Sparsification
09:36	Coffee break
10:00	session chair: Chaitanya Swamy	session chair: Loukas Georgiadis	session chair: Erik Jan van Leeuwen	session chair: Andrew Goldberg
	ESA talk Chenhao Wang A 1/2-Approximation for Budgeted k-Submodular Maximization	ESA talk Sam Hiken and Nicole Wein Improved Hardness-of-Approximation for Token-Swapping	IPEC Best Paper Yael Berkman and Ishay Haviv Kernelization for H-Coloring	ESA talk Magnús Halldórsson, Nicolaos Matsakis and Pavel Veselý Streaming Diameter of High-Dimensional Points
	ESA talk Matej Lieskovský Deterministic Approximation Algorithm for Graph Burning	ESA talk Jens Schlöter On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms	IPEC talk Leonid Antipov and Stefan Kratsch Boundaried Kernelization via Representative Sets	ESA talk Nick Fischer, Melvin Kallmayer and Leo Wennmann A Simple Algorithm for Trimmed Multipoint Evaluation
	ESA talk Christian Coester and Jack Umenberger Smoothed Analysis of Online Metric Problems	ESA talk Ce Jin, Ryan Williams and Stan Zhang New Algorithms for Pigeonhole Equal Subset Sum	IPEC talk Christina Büsing, Maurice Draeger and Corinna Mathwieser Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints	ESA talk Laxman Dhulipala, Monika Henzinger, George Li, Quanquan Liu, A. R. Sricharan and Leqi Zhu Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
	ESA talk Stefan Walzer and Marvin Williams A Simple yet Exact Analysis of the MultiQueue	ESA talk Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin and Melanie Schmidt Connected k-Median with Disjoint and Non-disjoint Clusters	IPEC talk Tobias Friedrich, Kirill Simonov and Farehe Soheil Binary k-Center with Missing Entries: Structure Leads to Tractability	ESA talk Sina Bagheri Nezhad, Sayan Bandyapadhyay and Tianzhi Chen Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
11:08	Coffee break
11:30	session chair: Andrew Goldberg
	ESA Test of Time George Christodoulou, Elias Koutsoupias On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
12:30	Lunch
14:00	session chair: Michał Pilipczuk
	Nerode Prize keynote Jaroslav Nešetřil and Patrice Ossona de Mendez Sparsity and More
15:00	Coffee break
15:20	session chair: Vincent Jugé	session chair: Haim Kaplan	session chair: Andre Nichterlein	session chair: Gerth Brodal
	ESA talk Pawel Gawrychowski, Egor Gorbachev and Tomasz Kociumaka Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications	ESA talk Yann Disser and David Weckbecker Incremental Maximization for a Broad Class of Objectives	IPEC talk Bart M. P. Jansen, Jeroen S. K. Lamme and Ruben F. A. Verhaegh An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange	ESA talk Stefan Hermann MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
	ESA talk Yuto Nakashima, Jakub Radoszewski and Tomasz Waleń Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares	ESA talk Kiarash Banihashem, Mohammadtaghi Hajiaghayi, Jan Olkowski, Danny Mittal, Piotr Krysta and Dariusz Kowalski Beating Competitive Ratio 4 for Graphic Matroid Secretary	IPEC talk Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm and Shaily Verma Parameterized Complexity of Vehicle Routing	ESA talk Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Peter Sanders and Stefan Walzer Engineering Minimal k-Perfect Hash Functions
	ESA talk Ben Bals, Sebastiaan van Krieken, Solon Pissis, Leen Stougie and Hilde Verbeek When is String Reconstruction using de Bruijn Graphs Hard?	ESA talk Christian Bertram Online metric TSP	IPEC talk Mark Jones and Jannik Schestag Parameterized Algorithms for Diversity of Networks with Ecological Dependencies	ESA talk Michael Krivelevich and Maksim Zhukovskii Reconstructing random graphs from distance queries
	ESA talk Itai Boneh, Egor Gorbachev and Tomasz Kociumaka Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds	ESA talk Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Łukasz Jeż, Jiří Sgall and Agnieszka Tatarczuk A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs	IPEC talk Anton Herrmann, Christian Komusiewicz, Nils Morawietz and Frank Sommer Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set	ESA talk Ioannis Caragiannis, Nick Gravin and Zhile Jiang On the satisfiability of random 3-SAT formulas with k-wise independent clauses
	ESA talk Tomasz Kociumaka and Ali Shahali Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime	ESA talk Christian Konrad and Chhaya Trehan Constructing Long Paths in Graph Streams	IPEC talk Joanne Dumont, Michael Lampis, Mathieu Liedloff, Anthony Perez and Ioan Todinca On maximum 2-clubs	ESA talk Jeff Giliberti and David Harris Improved parallel derandomization via finite automata with applications
16:45	Coffee break
17:00	session chair: Erik Jan van Leeuwen
	IPEC keynote Martin Koutecky Parameterized Algorithms via and for Integer Programming
18:00
18:05	ESA business meeting

Thursday, September 18

	0.03	0.03a	0.06	1.01
08:45	session chair: Erik Jan van Leeuwen?		session chair: José Verschae	session chair: Giuseppe Prencipe
	IPEC talk Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman and Meirav Zehavi A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma		WAOA talk Bob Krekelberg and Alison Hsiang-Hsuan Liu On the FirstFit Algorithm for Online Unit-Interval Coloring	ALGOWIN talk Timothée Corsini, Jessica Enright, Laura Larios-Jones, Kitty Meeks Temporal Orienteering with Changing Fuel Costs
















	IPEC talk Klaus Jansen, Kai Kahler, Lis Pirotton and Malte Tutas New Algorithm for Combinatorial n-folds and Applications




			WAOA talk Yann Disser, Max Klimm, Annette Lutz and Lea Strubberg Incremental–Decremental Maximization







				ALGOWIN talk Davi de Andrade, Julio Araujo, Allen Ibiapina, Andrea Marino, Jason Schoeters, Ana Silva Temporal Cycle Detection and Acyclic Temporalizations



	IPEC talk Michał Włodarczyk Designing Compact ILPs via Fast Witness Verification









			session ends 9:29






	session ends 9:36






09:45	Coffee break
10:00	session chair: Ignasi Sau	session chair: Marie Schmidt	session chair: Jannik Matuschke	session chair: Guido Proietti
	IPEC talk Édouard Bonnet, Daniel Neuen and Marek Sokołowski Treedepth Inapproximability and Exponential ETH Lower Bound	ATMOS Best Paper Rolf van Lieshout and Bart van Rossum The Fair Periodic Assignment Problem	WAOA talk Hiroshi Fujiwara, Rina Atsumi and Hiroaki Yamamoto Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem	ALGOWIN talk Saswata Jana, Subhajit Pramanick, Adri Bhattacharya, Partha Sarathi Mandal Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph
















	IPEC talk Satyabrata Jana, Peter Strulo, Václav Blažej and M. S. Ramanujan Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth	ATMOS Best Student Paper Fabian Löbel and Niels Lindner A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing




			WAOA talk Fritz Bökler, Markus Chimani and Henning Jasper Simple Approximations for General Spanner Problems







				ALGOWIN talk Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal Graph Traversal via Connected Mobile Agents



	IPEC talk Narek Bojikian and Stefan Kratsch Tight bounds for Connected Odd Cycle Transversal parameterized by clique-width	ATMOS talk Julia Meusel, Matthias Müller-Hannemann and Klaus Reinhardt Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases









			WAOA talk David Fischer, Hauke Brinkop and Klaus Jansen Robust Scheduling on Uniform Machines






	IPEC talk Jonne Visser and Hans Bodlaender Deterministically counting k-paths and trees parameterized by treewidth in single-exponential time	ATMOS talk Johann Hartleb, Marie Schmidt, Samuel Wolf and Alexander Wolff Visualization of Event Graphs for Train Schedules








				session ends 11:00





session ends 11:06

11:08	Coffee break
11:30	session chair: Marie Schmidt?
	ATMOS keynote Marjan van den Akker A glimpse into OR for airline operations and why this is (not?) public transportation
12:30	Lunch
14:00	session chair: Benjamin Bergougnoux	session chair: Matthias Müller-Hannemann	session chair: José Verschae	session chair: Thomas Erlebach
	IPEC talk Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki and Tom van der Zanden A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs	ATMOS talk Shaul Rosner and Tami Tamir Throughput Maximization in a Scheduling Environment with Machine-Dependent Due-dates	WAOA talk Martijn van Ee and Rene Sitters Approximation algorithms for graph search with imperfect detection	ALGOWIN talk Tom Davot, Jessica Enright, Laura Larios-Jones Parameterised algorithms for temporally satisfying reconfiguration problems
















	IPEC talk George Manoussakis and Mohamed Jiddou Efficient Enumeration of Quasi-Cliques	ATMOS talk Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasilios Sofianos and Christos Zaroliagis VRP-inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling




			WAOA talk D Ellis Hershkowitz and Niklas Dahlmeier Low Recourse Arborescence Forests Under Uniformly Random Arcs







				ALGOWIN talk Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota Almost Tight Oracles for Fastest-Path Queries on Temporal Trees



	IPEC talk Marin Bougeret, Guilherme de Castro Mendes Gomes, Vinicius F. dos Santos and Ignasi Sau Enumeration kernels for Vertex Cover and Feedback Vertex Set	ATMOS talk Christopher Hojny, Frits Spieksma and Sten Wessel Evaluating Fairness of Sequential Resource Allocation Policies: a Computational Study









			WAOA talk Shamisa Nematollahi and Daniel Vaz Buy-at-Bulk Facility Location on Trees






	IPEC talk Michał Pilipczuk, Sylvain Schmitz and Henry Sinclair-Banks A Note on the Parameterised Complexity of Coverability in Vector Addition Systems	ATMOS talk Sven Mallach Refined Integer Programs and Polyhedral Results for the Target Visitation Problem








				session ends 15:00





			session ends 15:06

15:08	Coffee break
15:30	session chair: Jannik Matuschke
	WAOA keynote Sahil Singla Beyond Competitive Analysis for Online Algorithms
16:30	Coffee break
17:00	session chair: Mario Grobler?	session chair: Christos Zaroliagis	session chair: José Verschae	session chair: Stefano Leucci
	PACE session	ATMOS talk Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Gross and Georgios Paschos Speed-Aware Network Design: A Parametric Optimization Approach	WAOA talk Andreas Abels, Mariia Anapolska and Christina Büsing Interval-Constrained Bipartite Matching over Time	ALGOWIN Best Student Paper Vilhelm Agdur, Jessica Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates Approximating temporal modularity on graphs of small underlying treewidth
















		ATMOS talk Caleb Eardley, Dalton Gomez, Ryan Dupois, Michael Papadopoulos and Sean Yaw A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design




			WAOA talk Qiming Cui and Michael Dinitz Controlling Tail Risk in Two-Slope Ski Rental







				ALGOWIN Best Student Paper Igor Potapov, Tymofii Prokopenko, John Sylvester Capturing an Invisible Robber using Separators



		ATMOS talk Philine Schiewe, Anita Schöbel and Reena Urban Design of Distance Tariffs in Public Transport









			session ends 17:44






	session ends 17:51	session ends 17:51








18:00	IPEC community meeting	ATMOS business meeting		ALGOWIN business meeting

Friday, September 19

	0.03	0.03a	0.06	1.01
08:45	session chair: Magnus Wahlström	session chair: Jonas Sauer	session chair: Jannik Matuschke	session chair: Will Rosenbaum
	IPEC talk Takashi Horiyama, Yuto Okura, Kazuhisa Seto and Junichi Teruyama Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas	ATMOS talk Michael Zündorf, Thomas Bläsius and Scott Bacherle Separator-Based Alternative Paths in Customizable Contraction Hierarchies	WAOA talk Yan Couto and Cristina Fernandes Hardness of Dynamic Core and Truss Decompositions	ALGOWIN talk Khaled Jawhar, Evangelos Kranakis Linear Search for Capturing an Oblivious Mobile target in the Sender/Receiver Model
















	IPEC talk Aditya Anand, Vincent Cohen-Addad, Tommaso D’Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi and Sijin Peng Complexity of Local Search for CSPs Parameterized by Constraint Difference	ATMOS talk Carina Truschel and Sabine Storandt Multi-Criteria Route Planning with Little Regret




			WAOA talk Kanstantsin Pashkovich and Thomas Snow Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three







				ALGOWIN talk Zeev Nutov, Avner Huri, Guy Kortsarz A logarithmic approximation algorithm for the activation edge-multicover problem



	IPEC talk Steef Hegeman, Jan Martens and Alfons Laarman Uniformity within Parameterized Circuit Classes	ATMOS talk Stefan Engels and Robert Wille Using A* for Optimal Train Routing on Moving Block Systems









			session ends 9:29






	session ends 9:36	session ends 9:36








09:45	Coffee break
10:00	session chair: Anna Zych-Pawlewicz	session chair: Philine Schiewe	session chair: José Verschae	session chair: Tami Tamir
	IPEC talk Prafullkumar Tale Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number	ATMOS talk Johannes Breitling and Moritz Laupichler Exact and Heuristic Dynamic Taxi Sharing with Transfers using Shortest-Path Speedup Techniques	WAOA talk Jubayer Nirjhor and Nicole Wein Improved Online Sorting	ALGOWIN Best Paper Oluwatobi Alafin, George Mertzios, Paul Spirakis Round-asynchronous amnesiac flooding
















	IPEC talk Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi and Hayato Takaike Hitting Geodesic Intervals in Structurally Restricted Graphs	ATMOS talk Lena Dittrich, Michael Rihlmann, Anita Schöbel and Sarah Roth A model for strategic ridepooling and its integration with line planning




			WAOA talk Elisabet Burjons and Matthias Gehnen Online General Knapsack with Reservation Costs







				ALGOWIN talk Duncan Adamson, Will Rosenbaum, Paul Spirakis Distributed weak independent sets in hypergraphs: Upper and lower bounds



	IPEC talk Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak and Robert Scheffler A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers	ATMOS talk Jonas Barth, Kendra Reiter and Marie Schmidt The Line-Based Dial-a-Ride Problem with Transfers









			WAOA talk Riju Bindua, Minati De, Naveen Garg and Kanav Singla The Online Piercing Set Problem With Recourse






	IPEC talk Benjamin Bergougnoux and Lars Jaffke Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard	ATMOS talk Sarah Roth and Anita Schöbel Energy-Efficient Line Planning by Implementing Express Lines








				session ends 11:00





session ends 11:06

11:08	Coffee break
11:30	session chair: Othon Michail
	ALGOWIN keynote Thomas Erlebach Temporal Graphs: Exploration and Realization
12:30	Lunch
14:00				session chair: Giuseppe Prencipe
				ALGOWIN talk Francesco Betti Sorbelli, Sajjad Ghobadi, Lorenzo Palazzetti, Cristina M. Pinotti Optimizing the Number of Drones for Aerial Power-Line Maintenance
14:30				`Closure - Discussion`
15:00