{"id":882,"date":"2023-03-06T13:57:42","date_gmt":"2023-03-06T12:57:42","guid":{"rendered":"https:\/\/algo-conference.org\/2023\/?page_id=882"},"modified":"2025-09-10T18:40:52","modified_gmt":"2025-09-10T18:40:52","slug":"schedule","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2025\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n
\n
\n
\n
\n
\n
\n
Monday
15 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Tuesday
16 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Wednesday
17 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Thursday
18 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Friday
19 Sep<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
\n
\n
\n
ESA<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
ALGOWIN<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
\n
\n
\n
ALGOCLOUD<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
IPEC<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
\n
Reception<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Dinner<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
<\/div>\n\n\n\n
\n
\n
ATMOS<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
\n
<\/div>\n\n\n\n
<\/div>\n\n\n\n
<\/div>\n\n\n\n
\n
\n
WAOA<\/strong><\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

Each standard talk of ESA, IPEC, ALGOCLOUD and ATMOS is assigned a 17<\/strong> minutes slot, for WAOA it is 22<\/strong> minutes, and for ALGOWIN it is 30<\/strong> minutes. Each keynote talk is given a 60<\/strong> minutes time slot.<\/p>\n\n\n\n

\n

Monday, September 15<\/p>\n\n\n\n

\n
<\/td>0.03<\/td>0.03a<\/td>0.06<\/td>1.01<\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div>\n\n\n\n
08:00<\/td>Registration desk opens<\/td><\/tr>
08:45<\/td>session chair: Anne Benoit<\/td>session chair: Shyan Akmal<\/td>session chair: Ivor van der Hoog<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Gerth St\u00f8lting Brodal, Michael Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava and Rolf Svenning
External-Memory Priority Queues with Optimal Insertions<\/mark><\/td>		ESA talk<\/strong>
Koustav Bhanja and Asaf Petruschka
Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity<\/mark><\/td>		ESA talk<\/strong>
Mark de Berg and Sergio Cabello
An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Vincent Jug\u00e9
Efficient top-down updates in AVL trees<\/mark><\/td>		ESA talk<\/strong>
Aikaterini Niklanovits, Kirill Simonov, Shaily Verma and Ziena Zeif
Connected Partitions via Connected Dominating Sets<\/mark><\/td>		ESA talk<\/strong>
Reut Levi and Yonatan Meiri
Tolerant Testers for Subgraph-Freeness<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Gerth St\u00f8lting Brodal, Casper Rysgaard and Rolf Svenning
Buffered Partially-Persistent External-Memory Search Trees<\/mark><\/td>		ESA talk<\/strong>
Zeev Nutov and Reut Cohen
Bicriteria approximation for k-edge-connectivity<\/mark><\/td>		ESA talk<\/strong>
Artur Czumaj, Christian Sohler and Stefan Walzer
Testing Depth First Search Numbering<\/mark><\/td>		<\/td><\/tr>
09:36<\/td>Coffee break<\/td><\/tr>
10:00<\/td>session chair: Artur Czumaj<\/td>session chair: Zeev Nutov<\/td>session chair: Anne Benoit<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Matthias Bentert, Fedor Fomin, Petr Golovach and Laure Morelle
Fault-Tolerant Matroid Bases<\/mark><\/td>		ESA talk<\/strong>
Jacobus Conradi and Anne Driemel
Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better<\/mark><\/td>		ESA talk<\/strong>
Gianmarco Picarella, Marc van Kreveld, Frank Staals and Sjoerd de Vries
Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
David Eppstein, Michael Goodrich and Songyu Liu
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing<\/mark><\/td>		ESA talk<\/strong>
Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg and Lasse Wulf
Fr\u00e9chet Distance in Unweighted Planar Graphs<\/mark><\/td>		ESA talk<\/strong>
L\u00e1szl\u00f3 Kozma and Junqi Tan
Faster exponential algorithms for cut problems via geometric data structures<\/mark><\/td><\/tr>
<\/td>ESA talk<\/strong>
Thomas Erlebach, Othon Michail and Nils Morawietz
Recognizing and Realizing Temporal Reachability Graphs<\/mark><\/td>		ESA talk<\/strong>
Thijs van der Horst, Marc van Kreveld, Tim Ophelders and Bettina Speckmann
The Geodesic Fr\u00e9chet Distance Between Two Curves Bounding a Simple Polygon<\/mark><\/td>		ESA talk<\/strong>
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<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Soh Kumabe
Max-Distance Sparsification for Diversification and Clustering<\/mark><\/td>		ESA talk<\/strong>
Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter and Sampson Wong
Property Testing of Curve Similarity<\/mark><\/td>		ESA talk<\/strong>
Jean Cardinal and Yelena Yuditsky
Compact Representation of Semilinear and Terrain-like Graphs<\/mark><\/td>		<\/td><\/tr>
11:08<\/td>Coffee break<\/td><\/tr>
11:30<\/td>session chair: Haim Kaplan<\/td><\/td><\/td><\/td><\/tr>
<\/td>ESA keynote<\/strong>
Bernhard Haeupler
Length-Constrained Expanders<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td>session chair: Anne Benoit<\/td>session chair: Vincent Jug\u00e9<\/td>session chair: Marc van Kreveld<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Baris Can Esmer and D\u00e1niel Marx
Generalized Graph Packing Problems Parameterized by Treewidth<\/mark><\/td>		ESA talk<\/strong>
Benjamin Aram Berendsohn
Optimal antimatroid sorting<\/mark><\/td>		ESA talk<\/strong>
Vincent Despr\u00e9, Camille Lanuel, Marc Pouget and Monique Teillaud
\u03b5-Net Algorithm Implementation on Hyperbolic Surfaces<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Laure Morelle, Ignasi Sau and Dimitrios M. Thilikos
Graph modification of bounded size to minor-closed classes as fast as vertex deletion<\/mark><\/td>		ESA talk<\/strong>
Pawel Gawrychowski and Adam G\u00f3rkiewicz
Better Indexing for Rectangular Pattern Matching<\/mark><\/td>		ESA talk<\/strong>
Haitao Wang
A Deterministic Partition Tree and Applications<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Tatsuya Gima, Soh Kumabe and Yuichi Yoshida
Courcelle’s Theorem for Lipschitz Continuity<\/mark><\/mark><\/td>		ESA talk<\/strong>
Jannik Olbrich
Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars<\/mark><\/td>		ESA talk<\/strong>
Minati De, Satyam Singh and Csaba Toth
Online Hitting Sets for Disks of Bounded Radii<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Narek Bojikian, Vera Chekan and Stefan Kratsch
Tight Bounds for some Classical Problems Parameterized by Cutwidth<\/mark><\/td>		ESA talk<\/strong>
Md. Hasin Abrar, Paul Medvedev and Giorgio Vinciguerra
Efficiency of Learned Indexes on Genome Spectra<\/mark><\/td>		ESA talk<\/strong>
Jack Spalding-Jamieson and Anurag Murty Naredla
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds<\/mark><\/td>		<\/td><\/tr>
15:08<\/td>Coffee break<\/td><\/tr>
15:30<\/td>session chair: Micha\u0142 Pilipczuk<\/td>session chair: Andr\u00e9 Nichterlein<\/td>session chair: Bettina Speckmann<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Radu Curticapean, Simon D\u00f6ring and Daniel Neuen
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial<\/mark><\/td>		ESA talk<\/strong>
Francisco Sena, Romeo Rizzi and Alexandru I. Tomescu
Safe Sequences via Dominators in DAGs for Path-Covering Problems<\/mark><\/td>		ESA talk<\/strong>
Ivor van der Hoog, Eva Rotenberg and Daniel Rutschmann
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Joshua Marc K\u00f6nen, Heiko R\u00f6glin and Tarek Stuck
Parameterized Algorithms for Computing Pareto Sets<\/mark><\/td>		ESA talk<\/strong>
Saman Ahmadi, Andrea Raith and Mahdi Jalili
A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem<\/mark><\/td>		ESA talk<\/strong>
Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann and Sampson Wong
Instance-Optimal Imprecise Convex Hull<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
Thomas Depian, Simon D. Fink, Robert Ganian and Vaishali Surianarayanan
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms<\/mark><\/td>		ESA talk<\/strong>
Henrik Reinst\u00e4dtler, S M Ferdous, Alex Pothen, Bora Ucar and Christian Schulz
Semi-Streaming  Algorithms for Hypergraph Matching<\/mark><\/td>		ESA talk<\/strong>
Emil Toftegaard G\u00e6de, Ivor van der Hoog, Eva Rotenberg and Tord Stordalen
A Dynamic Piecewise-linear Geometric Index with Worst-case Guarantees<\/mark><\/td>		<\/td><\/tr>
<\/td>ESA talk<\/strong>
\u00c9ric Colin de Verdi\u00e8re and Petr Hlineny
A Unified FPT Framework for Crossing Number Problems<\/mark><\/td>		ESA talk<\/strong>
Lars Gottesb\u00fcren, Nikolai Maas, Dominik Rosch, Peter Sanders and Daniel Seemaier
Linear-Time Multilevel Graph Partitioning via Edge Sparsification<\/mark><\/td>		ESA talk<\/strong>
Hugo Akitaya, S\u00e1ndor Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock and Tobias Wallner
Sliding Squares in Parallel<\/mark><\/td>		<\/td><\/tr>
16:38<\/td>Coffee break<\/td><\/tr>
17:00<\/td>session chair: Nick Matsakis<\/td>session chair: Gerth Brodal<\/td>session chair: Micha\u0142 Pilipczuk<\/td>session chair: Tizia Cattai<\/td><\/tr>
<\/td>ESA talk<\/strong>
Martin F\u00fcrer, Carlos Hoppen and Vilmar Trevisan
Fast Gaussian elimination for low treewidth matrices<\/mark><\/td>		ESA talk<\/strong>
Nikhil Kumar, Jj Nan and Chaitanya Swamy
Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique<\/mark><\/td>		ESA talk<\/strong>
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak and Shengzhe Wang
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts<\/mark><\/td>		ALGOCLOUD talk<\/strong>
Vincenzo Taormina, Sergio Dimarca, Silvia Schilleci, Maria Del Mar Bosch Belmar, Francesco Paolo Mancuso, Ilenia Tinnirello, Gianluca Sar\u00e0 and Domenico Garlisi
A Federated Learning Approach for Predicting Marine Heat Waves<\/mark><\/td><\/tr>
<\/td>ESA talk<\/strong>
Nicolas Bousquet, Quentin Deschamps, Arnaud Mary, Amer Mouawad and Theo Pierron
The tape reconfiguration problem and its consequences for dominating set reconfiguration<\/mark><\/td>		ESA talk<\/strong>
Yotam Kenneth-Mordoch and Robert Krauthgamer
Cut-Query Algorithms with Few Rounds<\/mark><\/td>		ESA talk<\/strong>
Mariia Anapolska, Dario van den Boom, Christina B\u00fcsing and Timo Gersing
A Faster Parametric Search for the Integral Quickest Transshipment Problem<\/mark><\/td>		ALGOCLOUD talk<\/strong>
Mark Doyle, Theodoros Aslanidis and Dimitris Chatzopoulos
Cooper: A Lightweight Event Recording and Visualization Framework for Data Center Simulations<\/mark><\/td><\/tr>
<\/td>ESA talk<\/strong>
Florian H\u00f6rsch and D\u00e1niel Marx
Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern<\/mark><\/td>		ESA talk<\/strong>
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<\/mark><\/td>		ESA talk<\/strong>
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<\/mark><\/td>		ALGOCLOUD talk<\/strong>
Sonika Arora, Prashanth Josyula, Anant Kumar and Gangadharayya Hiremath
Policy Agents for Zero-Trust Kubernetes: A Comprehensive Survey<\/mark><\/td><\/tr>
17:51<\/td>Welcome Reception<\/mark><\/a><\/td><\/tr>
21:00<\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Tuesday, September 16<\/p>\n\n\n\n

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

Wednesday, September 17<\/p>\n\n\n\n

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

Thursday, September 18<\/p>\n\n\n\n

<\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr>
<\/td>0.03<\/td>0.03a<\/td>0.06<\/td>1.01<\/td><\/tr>
08:45<\/td>session chair: Erik Jan van Leeuwen?<\/td><\/td>session chair: Jos\u00e9 Verschae<\/td>session chair: Giuseppe Prencipe<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman and Meirav Zehavi
A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma<\/mark><\/mark><\/td>		WAOA talk<\/strong>
Bob Krekelberg and Alison Hsiang-Hsuan Liu
On the FirstFit Algorithm for Online Unit-Interval Coloring<\/mark><\/td>		ALGOWIN talk<\/strong>
Timoth\u00e9e Corsini, Jessica Enright, Laura Larios-Jones, Kitty Meeks
Temporal Orienteering with Changing Fuel Costs<\/mark><\/td><\/tr>
IPEC talk<\/strong>
Klaus Jansen, Kai Kahler, Lis Pirotton and Malte Tutas
New Algorithm for Combinatorial n-folds and Applications<\/mark><\/mark><\/td><\/tr>
WAOA talk<\/strong>
Yann Disser, Max Klimm, Annette Lutz and Lea Strubberg
Incremental\u2013Decremental Maximization<\/mark><\/td><\/tr>
ALGOWIN talk<\/strong>
Davi de Andrade, Julio Araujo, Allen Ibiapina, Andrea Marino, Jason Schoeters, Ana Silva
Temporal Cycle Detection and Acyclic Temporalizations<\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
Micha\u0142 W\u0142odarczyk
Designing Compact ILPs via Fast Witness Verification<\/mark><\/mark><\/td><\/tr>
session ends 9:29<\/td><\/tr>
session ends 9:36<\/td><\/tr>
09:45<\/td>Coffee break<\/td><\/tr>
10:00<\/td>session chair: Ignasi Sau<\/td>session chair: Marie Schmidt<\/td>session chair: Jannik Matuschke<\/td>session chair: Guido Proietti<\/td><\/tr>
<\/td>IPEC talk<\/strong>
\u00c9douard Bonnet, Daniel Neuen and Marek Soko\u0142owski
Treedepth Inapproximability and Exponential ETH Lower Bound<\/mark><\/td>		ATMOS Best Paper<\/strong>
Rolf van Lieshout and Bart van Rossum
The Fair Periodic Assignment Problem<\/mark><\/strong>
<\/td>		WAOA talk<\/strong>
Hiroshi Fujiwara, Rina Atsumi and Hiroaki Yamamoto
Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem<\/mark><\/td>		ALGOWIN talk<\/strong>
Saswata Jana, Subhajit Pramanick, Adri Bhattacharya, Partha Sarathi Mandal
Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph<\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
Satyabrata Jana, Peter Strulo, V\u00e1clav Bla\u017eej and M. S. Ramanujan
Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth<\/mark><\/td>		ATMOS Best Student Paper<\/strong>
Fabian L\u00f6bel and Niels Lindner
A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing<\/mark><\/strong><\/td><\/tr>
WAOA talk<\/strong>
Fritz B\u00f6kler, Markus Chimani and Henning Jasper
Simple Approximations for General Spanner Problems<\/mark><\/td><\/tr>
ALGOWIN talk<\/strong>
Saswata Jana, Giuseppe F. Italiano, Partha Sarathi Mandal
Graph Traversal via Connected Mobile Agents<\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
Narek Bojikian and Stefan Kratsch
Tight bounds for Connected Odd Cycle Transversal parameterized by clique-width<\/mark><\/td>		ATMOS talk<\/strong>
Julia Meusel, Matthias M\u00fcller-Hannemann and Klaus Reinhardt
Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases<\/mark><\/td><\/tr>
WAOA talk<\/strong>
David Fischer, Hauke Brinkop and Klaus Jansen
Robust Scheduling on Uniform Machines<\/mark><\/td><\/tr>
IPEC talk<\/strong>
Jonne Visser and Hans Bodlaender
Deterministically counting k-paths and trees parameterized by treewidth in single-exponential time<\/mark><\/td>		ATMOS talk<\/strong>
Johann Hartleb, Marie Schmidt, Samuel Wolf and Alexander Wolff
Visualization of Event Graphs for Train Schedules<\/mark><\/td><\/tr>
session ends 11:00<\/td><\/tr>
session ends 11:06<\/td><\/tr>
11:08<\/td>Coffee break<\/td><\/tr>
11:30<\/td>session chair: Marie Schmidt?<\/td><\/td><\/td><\/td><\/tr>
<\/td>ATMOS keynote<\/strong>
Marjan van den Akker
A glimpse into OR for airline operations and why this is (not?) public transportation<\/mark><\/mark><\/td>		<\/td><\/td><\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td>session chair: Benjamin Bergougnoux<\/td>session chair: Matthias M\u00fcller-Hannemann<\/td>session chair: Jos\u00e9 Verschae<\/td>session chair: Thomas Erlebach<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki and Tom van der Zanden
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs<\/mark><\/td>		ATMOS talk<\/strong>
Shaul Rosner and Tami Tamir
Throughput Maximization in a Scheduling Environment with Machine-Dependent Due-dates<\/mark><\/td>		WAOA talk<\/strong>
Martijn van Ee and Rene Sitters
Approximation algorithms for graph search with imperfect detection<\/mark><\/td>		ALGOWIN talk<\/strong>
Tom Davot, Jessica Enright, Laura Larios-Jones
Parameterised algorithms for temporally satisfying reconfiguration problems<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
George Manoussakis and Mohamed Jiddou
Efficient Enumeration of Quasi-Cliques<\/mark><\/td>		ATMOS talk<\/strong>
Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasilios Sofianos and Christos Zaroliagis
VRP-inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
D Ellis Hershkowitz and Niklas Dahlmeier
Low Recourse Arborescence Forests Under Uniformly Random Arcs<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ALGOWIN talk<\/strong>
Davide Bil\u00f2, Luciano Gual\u00e0, Stefano Leucci, Guido Proietti, Alessandro Straziota
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Marin Bougeret, Guilherme de Castro Mendes Gomes, Vinicius F. dos Santos and Ignasi Sau
Enumeration kernels for Vertex Cover and Feedback Vertex Set<\/mark><\/td>		ATMOS talk<\/strong>
Christopher Hojny, Frits Spieksma and Sten Wessel
Evaluating Fairness of Sequential Resource Allocation Policies: a Computational Study<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
Shamisa Nematollahi and Daniel Vaz
Buy-at-Bulk Facility Location on Trees<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Micha\u0142 Pilipczuk, Sylvain Schmitz and Henry Sinclair-Banks
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems<\/mark><\/td>		ATMOS talk<\/strong>
Sven Mallach
Refined Integer Programs and Polyhedral Results for the Target Visitation Problem<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>session ends 15:00<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>session ends 15:06<\/td><\/tr>
<\/td><\/tr>
15:08<\/td>Coffee break<\/td><\/tr>
15:30<\/td>session chair: Jannik Matuschke<\/td><\/td><\/td><\/td><\/tr>
<\/td>WAOA keynote<\/strong>
Sahil Singla
Beyond Competitive Analysis for Online Algorithms<\/mark><\/mark><\/td>		<\/td><\/td><\/td><\/tr>
16:30<\/td>Coffee break<\/td><\/tr>
17:00<\/td>session chair: Mario Grobler?<\/td>session chair: Christos Zaroliagis<\/td>session chair: Jos\u00e9 Verschae<\/td>session chair: Stefano Leucci<\/td><\/tr>
<\/td>PACE session<\/strong><\/td>ATMOS talk<\/strong>
Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Gross and Georgios Paschos
Speed-Aware Network Design: A Parametric Optimization Approach<\/mark>
<\/td>		WAOA talk<\/strong>
Andreas Abels, Mariia Anapolska and Christina B\u00fcsing
Interval-Constrained Bipartite Matching over Time<\/mark><\/td>		ALGOWIN Best Student Paper<\/strong><\/strong>
Vilhelm Agdur, Jessica Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates<\/strong>
Approximating temporal modularity on graphs of small underlying treewidth<\/strong><\/mark><\/mark><\/td><\/tr>
ATMOS talk<\/strong>
Caleb Eardley, Dalton Gomez, Ryan Dupois, Michael Papadopoulos and Sean Yaw
A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design<\/mark><\/td><\/tr>
WAOA talk<\/strong>
Qiming Cui and Michael Dinitz
Controlling Tail Risk in Two-Slope Ski Rental<\/mark><\/td><\/tr>
ALGOWIN Best Student Paper<\/strong><\/strong><\/strong>
Igor Potapov, Tymofii Prokopenko, John Sylvester<\/strong>
Capturing an Invisible Robber using Separators<\/strong><\/mark><\/mark><\/td><\/tr>
ATMOS talk<\/strong>
Philine Schiewe, Anita Sch\u00f6bel and Reena Urban
Design of Distance Tariffs in Public Transport<\/mark><\/td><\/tr>
session ends 17:44<\/td><\/tr>
session ends 17:51<\/td>session ends 17:51<\/td><\/tr>
18:00<\/td>IPEC community meeting<\/strong><\/td>ATMOS business meeting<\/strong><\/td><\/td>ALGOWIN business meeting<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Friday, September 19<\/p>\n\n\n\n

<\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr><\/tr>
<\/td>0.03<\/td>0.03a<\/td>0.06<\/td>1.01<\/td><\/tr>
08:45<\/td>session chair: Magnus Wahlstr\u00f6m<\/td>session chair: Jonas Sauer<\/td>session chair: Jannik Matuschke<\/td>session chair: Will Rosenbaum<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Takashi Horiyama, Yuto Okura, Kazuhisa Seto and Junichi Teruyama
Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas<\/mark><\/td>		ATMOS talk<\/strong>
Michael Z\u00fcndorf, Thomas Bl\u00e4sius and Scott Bacherle
Separator-Based Alternative Paths in Customizable Contraction Hierarchies<\/mark><\/td>		WAOA talk<\/strong>
Yan Couto and Cristina Fernandes
Hardness of Dynamic Core and Truss Decompositions<\/mark>
<\/td>		ALGOWIN talk<\/strong>
Khaled Jawhar, Evangelos Kranakis
Linear Search for Capturing an Oblivious Mobile target in the Sender\/Receiver Model<\/mark><\/td><\/tr>
IPEC talk<\/strong>
Aditya Anand, Vincent Cohen-Addad, Tommaso D\u2019Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi and Sijin Peng
Complexity of Local Search for CSPs Parameterized by Constraint Difference<\/mark><\/td>		ATMOS talk<\/strong>
Carina Truschel and Sabine Storandt
Multi-Criteria Route Planning with Little Regret<\/mark><\/td><\/tr>
WAOA talk<\/strong>
Kanstantsin Pashkovich and Thomas Snow
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three<\/mark><\/td><\/tr>
ALGOWIN talk<\/strong>
Zeev Nutov, Avner Huri, Guy Kortsarz
A logarithmic approximation algorithm for the activation edge-multicover problem<\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
Steef Hegeman, Jan Martens and Alfons Laarman
Uniformity within Parameterized Circuit Classes<\/mark><\/td>		ATMOS talk<\/strong>
Stefan Engels and Robert Wille
Using A* for Optimal Train Routing on Moving Block Systems<\/mark><\/td><\/tr>
session ends 9:29<\/td><\/tr>
session ends 9:36<\/td>session ends 9:36<\/td><\/tr>
09:45<\/td>Coffee break<\/td><\/tr>
10:00<\/td>session chair: Anna Zych-Pawlewicz<\/td>session chair: Philine Schiewe<\/td>session chair: Jos\u00e9 Verschae<\/td>session chair: Tami Tamir<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Prafullkumar Tale
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number<\/mark><\/td>		ATMOS talk<\/strong>
Johannes Breitling and Moritz Laupichler
Exact and Heuristic Dynamic Taxi Sharing with Transfers using Shortest-Path Speedup Techniques<\/mark><\/td>		WAOA talk<\/strong>
Jubayer Nirjhor and Nicole Wein
Improved Online Sorting<\/mark><\/td>		ALGOWIN Best Paper<\/strong><\/strong>
Oluwatobi Alafin, George Mertzios, Paul Spirakis<\/strong>
Round-asynchronous amnesiac flooding<\/strong><\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi and Hayato Takaike
Hitting Geodesic Intervals in Structurally Restricted Graphs<\/mark><\/td>		ATMOS talk<\/strong>
Lena Dittrich, Michael Rihlmann, Anita Sch\u00f6bel and Sarah Roth
A model for strategic ridepooling and its integration with line planning<\/mark><\/td><\/tr>
WAOA talk<\/strong>
Elisabet Burjons and Matthias Gehnen
Online General Knapsack with Reservation Costs<\/mark><\/td><\/tr>
ALGOWIN talk<\/strong>
Duncan Adamson, Will Rosenbaum, Paul Spirakis
Distributed weak independent sets in hypergraphs: Upper and lower bounds<\/mark><\/mark><\/td><\/tr>
IPEC talk<\/strong>
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<\/mark><\/td>		ATMOS talk<\/strong>
Jonas Barth, Kendra Reiter and Marie Schmidt
The Line-Based Dial-a-Ride Problem with Transfers<\/mark><\/td><\/tr>
WAOA talk<\/strong>
Riju Bindua, Minati De, Naveen Garg and Kanav Singla
The Online Piercing Set Problem With Recourse<\/mark><\/td><\/tr>
IPEC talk<\/strong>
Benjamin Bergougnoux and Lars Jaffke
Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard<\/mark><\/td>		ATMOS talk<\/strong>
Sarah Roth and Anita Sch\u00f6bel
Energy-Efficient Line Planning by Implementing Express Lines<\/mark><\/td><\/tr>
session ends 11:00<\/td><\/tr>
session ends 11:06<\/td><\/tr>
11:08<\/td>Coffee break<\/td><\/tr>
11:30<\/td>session chair: Othon Michail<\/td><\/td><\/td><\/td><\/tr>
<\/td>ALGOWIN keynote<\/strong>
Thomas Erlebach
Temporal Graphs: Exploration and Realization<\/mark><\/td>		<\/td><\/td><\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td><\/td><\/td><\/td>session chair: Giuseppe Prencipe<\/td><\/tr>
<\/td><\/td><\/td><\/td>ALGOWIN talk<\/strong>
Francesco Betti Sorbelli, Sajjad Ghobadi, Lorenzo Palazzetti, Cristina M. Pinotti
Optimizing the Number of Drones for Aerial Power-Line Maintenance<\/mark><\/mark><\/td><\/tr>
14:30<\/td><\/td><\/td><\/td>Closure - Discussion<\/strong><\/code><\/td><\/tr>
15:00<\/td><\/td><\/td><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

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.<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"wp-custom-template-schedule-page","meta":{"footnotes":""},"class_list":["post-882","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/882","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/comments?post=882"}],"version-history":[{"count":12,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/882\/revisions"}],"predecessor-version":[{"id":2283,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/882\/revisions\/2283"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/media?parent=882"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}