{"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":"2023-09-02T09:51:20","modified_gmt":"2023-09-02T08:51:20","slug":"schedule","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2023\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n
\n
\n
\n
\n
\n
\n
Monday
4 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Tuesday
5 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Wednesday
6 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Thursday
7 Sep<\/a><\/div>\n<\/div>\n<\/div>\n\n\n\n
\n
\n
Friday
8 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
<\/div>\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
\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<\/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 (including best paper talks) of ALGOCLOUD, ESA, IPEC and WAOA is assigned a 15<\/mark><\/strong> minutes slot, for ATMOS it is 20<\/mark><\/strong> minutes, and for ALGOWIN it is 30<\/mark><\/strong> minutes. Each keynote talk is given a 60<\/strong><\/mark> minutes time slot, and ESA test of time talks are given 30<\/strong><\/mark> minutes time slot each.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n
\n

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

<\/td>Turing room<\/td>Euler room<\/td>L016<\/td>L017<\/td><\/tr>
08:15<\/td>Registration desk opens<\/mark><\/a><\/td><\/tr>
09:05<\/td>Opening remarks by Prof. Ton de Kok, the Director of CWI<\/td><\/td><\/td><\/td><\/tr>
09:15<\/td>Session: 1, chair: Stefan Kratsch<\/td>Session: 2, chair: Philip Bille<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Fran\u00e7ois Sellier
Parameterized Matroid-Constrained Maximum Coverage<\/mark><\/a><\/td>		ESA talk<\/strong>
Ruben Becker, Manuel C\u00e1ceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares and Nicola Prezza
Sorting Finite Automata via Partition Refinement<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Elfarouk Harb, Chandra Chekuri and Kent Quanrud
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing<\/mark><\/a><\/td>		ESA talk<\/strong>
Jakub Radoszewski
Linear Time Construction of Cover Suffix Tree and Applications<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Victor A. Campos, Jonas Costa, Raul Lopes and Ignasi Sau
New Menger-like dualities in digraphs and applications to half-integral linkages<\/mark><\/a><\/td>		ESA talk<\/strong>
Krzysztof Pi\u00f3ro
Subcubic algorithm for (Unweighted) Unrooted Tree Edit Distance<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
10:00<\/td>Session: 3, chair: Danny Hermelin<\/td>Session: 4, chair: Gabriele Fici<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Parinya Chalermsook, Fedor Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof and Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth<\/mark><\/a><\/td>		ESA talk<\/strong>
Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S. and Ron Safier
Can You Solve Closest String Faster than Exhaustive Search?<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA (recorded) talk<\/strong>
Meirav Zehavi, Fedor Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh and Stephan Thomasse
Lossy Kernelization for (Implicit) Hitting Set Problems<\/mark><\/a><\/td>		ESA talk<\/strong>
Hideo Bannai and Jonas Ellert
Lyndon Arrays in Sublinear Time<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
10:30<\/td>Coffee break<\/td><\/tr>
11:00<\/td>Session: 5, chair: Danny Hermelin<\/td>Session: 6, chair: Hideo Bannai<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Fedor V. Fomin, Petr A Golovach, Tanmay Inamdar, Saket Saurabh and Meirav Zehavi
Kernelization for Spreading Points<\/mark><\/a><\/td>		ESA talk<\/strong>
Francesco Masillo
Matching Statistics speed up BWT construction<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Chinmay Sonar, Subhash Suri and Jie Xue
Fault Tolerance in Euclidean Committee Selection<\/mark><\/a><\/td>		ESA talk<\/strong>
Dominik K\u00f6ppl, Florian Kurpicz and Daniel Meyer
Faster Block Tree Construction<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
11:30<\/td>Session: 7, chair: Simon J. Puglisi<\/td><\/td><\/td><\/td><\/tr>
<\/td>ESA keynote<\/strong>
Martin Dietzfelbinger
On Hashing by (Random) Equations<\/mark><\/a><\/td>		Stream of the ESA keynote from the Turing room<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td>Session: 8, chair: Yasamin Nazari<\/td>Session: 9, chair: Alex Conway<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev and Liren Shan
Approximation Algorithm for Norm Multiway Cut<\/mark><\/a><\/td>		ESA talk<\/strong>
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann and Peter Sanders
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Baruch Schieber and Soroush Vahidi
Approximating Connected Maximum Cuts via Local Search<\/mark><\/a><\/td>		ESA talk<\/strong>
Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders and Giorgio Vinciguerra
Learned Monotone Minimal Perfect Hashing<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Dor Katzelnick, Aditya Pillai, Roy Schwartz and Mohit Singh
An Improved Approximation Algorithm for the Max-$3$-Section Problem<\/mark><\/mark><\/a><\/td>		ESA talk<\/strong>
David Harris
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu and Ruilong Zhang
Scheduling with a Limited Testing Budget<\/mark><\/a><\/td>		ESA talk<\/strong>
Christopher Musco and Chuhan Yang
Efficient Block Approximate Matrix Multiplication<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
15:00<\/td>Coffee break<\/td><\/tr>
15:20<\/td>Session: 10, chair: Petra Wolf<\/td>Session: 11, chair: Merav Parter<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Michael Czekanski, Shelby Kimmel and R. Teal Witter
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms<\/mark><\/a><\/td>		ESA talk<\/strong>
Ashwin Jacob, Michal Wlodarczyk and Meirav Zehavi
Finding Long Directed Cycles is Hard Even When DFVS is Small or Girth is Large<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Simon Apers, Stacey Jeffery, Galina Pass and Michael Walter
(No) Quantum space-time tradeoff for USTCON<\/mark><\/a><\/td>		ESA talk<\/strong>
Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams and Zixuan Xu
Faster Detours in Undirected Graphs<\/mark><\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Adam Izdebski and Ronald de Wolf
Improved Quantum Boosting<\/mark><\/a><\/td>		ESA talk<\/strong>
Shyan Akmal and Nicole Wein
A Local-to-Global Theorem for Congested Shortest Paths<\/mark><\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Nikhil Mande and Ronald de Wolf
Tight Bounds For Quantum Phase Estimation and Related Problems<\/mark><\/a><\/td>		ESA (recorded) talk<\/strong>
Joergen Bang-Jensen, Kristine V. K. Knudsen, Pranabendu Misra and Saket Saurabh
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
16:20<\/td>Coffee break<\/td><\/tr>
16:40<\/td>Session: 12, chair: Jakub Radoszewski<\/td>Session: 13, chair: Darren Strash<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Ilan Cohen and Binghui Peng
Primal-Dual schemes for Online Matching in Bounded Degree graphs<\/mark><\/a><\/td>		ESA talk<\/strong>
Dani Dorfman, Haim Kaplan, Robert Tarjan and Uri Zwick
Optimal energetical paths for electric cars<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang and Renfei Zhou
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching<\/mark><\/a><\/td>		2 papers ESA talk<\/strong>
Aaron Berger, Jenny Kaufmann and Virginia Vassilevska Williams
Approximating Min-Diameter: Standard and Bichromatic<\/mark><\/a>
Mina Dalirrooyfard, Ray Li, Amir Abboud and Virginia Vassilevska Williams
On Diameter Approximation in Directed Graphs<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Martin Bullinger and Ren\u00e9 Romen
Online Coalition Formation under Random Arrival or Coalition Dissolution<\/mark><\/a><\/td>		ESA talk<\/strong>
Shimon Kogan and Merav Parter
Towards Bypassing Lower Bounds for Graph Shortcuts<\/mark><\/a><\/td>		<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
17:25<\/td>Welcome Reception<\/mark><\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

<\/td>Turing room<\/td>Euler room<\/td>L016<\/td>L017<\/td><\/tr>
09:15<\/td>Session: 14, chair: Bora Ucar<\/td>Session: 15, chair: Eunjin Oh<\/td>Session: 16, chairs: Ioannis Chatzigiannakis and Ioannis Karydis<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Sebastian Forster, Gramoz Goranci, Yasamin Nazari and Antonis Skarlatos
Bootstrapping Dynamic Distance Oracles<\/mark><\/a><\/td>		ESA talk<\/strong>
S\u00e1ndor Fekete, Dominik Krupke, Michael Perk, Christian Rieck and Christian Scheffer
The Lawn Mowing Problem: From Algebra to Algorithms<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Alberto Robles-Enciso, Ricardo Robles-Enciso and Antonio Skarmeta
Multi-agent reinforcement learning-based energy orchestrator for cyber-physical systems<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Thatchaphol Saranurak and Wuwei Yuan
Maximal k-Edge-Connected Subgraphs in Almost-linear Time<\/mark><\/a><\/td>		ESA talk<\/strong>
Daniel Funke, Nicolai H\u00fcning and Peter Sanders
A Sweep-plane Algorithm for Calculating the Isolation of Mountains<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Ahmed Fayez Moustafa Tayel, Gabriele Proietti Mattia and Roberto Beraldi
A Double-decision Reinforcement Learning based Algorithm for Online Scheduling in Edge and Fog Computing<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Evangelos Kosinas
Connectivity Queries under Vertex Failures: Not Optimal, but Practical<\/mark><\/a><\/td>		ESA talk<\/strong>
Peter Sanders, Demian Hespe, Carina Truschel and Sabine Storandt
Pareto Sums of Pareto Sets<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Marianna Tzortzi, Charalampos Kleitsikas, Agis Politis, Sotirios Niarchos, Katerina Doka and Nectarios Koziris
Planning workflow executions over the Edge-to-Cloud Continuum<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
10:00<\/td>Session: 17, chair: Sabine Storandt<\/td>Session: 18, chair: Gerth Brodal<\/td>Session: 19, chair: Spyros Sioutas<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Amir Abboud, Shay Mozes and Oren Weimann
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?<\/mark><\/a><\/td>		ESA talk<\/strong>
George Osipov and Magnus Wahlstr\u00f6m
Parameterized Complexity of Equality MinCSP<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Panagiotis Kokkinos, Andreas Varvarigos, Dimitrios Konidaris and Konstantinos Tserpes
Intent-based Allocation of Cloud Computing Resources Using Q-Learning<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Adam Karczmarz and Marcin Smulewicz
On Fully Dynamic Strongly Connected Components<\/mark><\/a><\/td>		ESA talk<\/strong>
Hugo Akitaya, Andrei Gonczi, Diane Souvaine, Csaba Toth and Thomas Weighill
Reconfiguration of Polygonal Subdivisions via Recombination<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Andrea Rossi, Andrea Visentin, Steven Prestwich and Kenneth N. Brown
Clustering-based Numerosity Reduction for Cloud Workload Forecasting<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
10:30<\/td>Coffee break<\/td><\/tr>
11:00<\/td>Session: 20, chair: Sabine Storandt<\/td>Session: 21, chair: Gerth Brodal<\/td>Session: 22, chair: Dimitrios Amaxilatis<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Adil Chhabra, Marcelo Fonseca Faraj and Christian Schulz
Faster Local Motif Clustering via Maximum Flows<\/mark><\/a><\/td>		ESA talk<\/strong>
Patrizio Angelini, Michael Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister and Torsten Ueckerdt
Axis-Parallel Right Angle Crossing Graphs<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Aristeidis Karras, Christos Karras, Ioannis Karydis, Markos Avlonitis and Spyros Sioutas
An Adaptive, Energy-Efficient DRL-based and MCMC-based Caching Strategy for IoT Systems<\/mark><\/td>		<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Ioannis Panagiotas, Gregoire Pichon, Somesh Singh and Bora Ucar
Engineering fast algorithms for the bottleneck matching problem<\/mark><\/a><\/td>		ESA talk<\/strong>
Ignaz Rutter and Peter Stumpf
Simultaneous Representation of Interval Graphs in the Sunflower Case<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Aristeidis Karras, Christos Karras, Ioanna Giannoukou, Konstantinos Giotopoulos, Dimitrios Tsolis, Ioannis Karydis and Spyros Sioutas
Decentralized Algorithms for Efficient Energy Management over Cloud-Edge Infrastructures<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
11:30<\/td>Session: 23, chair: Inge Li G\u00f8rtz<\/td><\/td><\/td><\/td><\/tr>
<\/td>ESA keynote<\/strong>
Rotem Oshman
Set Disjointness: Fundamentals, Applications and Beyond<\/mark><\/td>		Stream of the ESA keynote from the Turing room<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td>Session: 24, chair: Prudence Wong<\/td>Session: 25, chair: Joachim Gudmundsson<\/td>Session: 26, chair: Ioannis Chatzigiannakis<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Julia Baligacs, Yann Disser, Irene Heinrich and Pascal Schweitzer
Exploration of graphs with excluded minors<\/mark><\/a><\/td>		ESA talk<\/strong>
Christoph Grunau, Ahmet Alper \u00d6z\u00fcdo\u011fru and V\u00e1clav Rozho\u0148
Noisy k-means++ revisited<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Spyros Kontogiannis, Andreas Paraskevopoulos, Meletios Pogkas and Christos Zaroliagis
i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Enze Sun, Zonghan Yang and Yuhao Zhang
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs<\/mark><\/a><\/td>		ESA talk<\/strong>
Sergio Cabello and Panos Giannopoulos
On $k$-means for segments and polylines<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Aristeidis Karras, Christos Karras, Nikolaos Schizas, Spyros Sioutas and Christos Zaroliagis
Algorithmic Aspects of Distributed Hash Tables on Cloud, Fog, and Edge Computing Applications: A Survey<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Yuval Emek, Yuval Gil, Maciej Pacut and Stefan Schmid
Online Algorithms with Randomly Infused Advice<\/mark><\/a><\/td>		ESA talk<\/strong>
Ahmed Abdelkader and David Mount
Smooth Distance Approximation<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Domenico Garlisi, Gabriele Restuccia, Ilenia Tinnirello, Francesca Cuomo and Ioannis Chatzigiannakis
Real-Time Leakage Zone Detection in Water Distribution Networks: A Machine Learning-based Stream Processing Algorithm<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami and Michalis Xefteris
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else<\/mark><\/a><\/td>		ESA talk<\/strong>
Adam Kurpisz and Silvan Suter
Improved Approximations for Translational Packing of Convex Polygons<\/mark><\/a><\/td>		ALGOCLOUD talk<\/strong>
Daniel Mauricio Jimenez Gutierrez, Ioannis Chatzigiannakis, Hassan Hafiz, Lorella Landi and Andrea Vitaletti
Application of Federated Learning techniques for arrhythmia classification using 12-lead ECG signals<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
15:00<\/td>Coffee break<\/td><\/tr>
15:20<\/td>Session: 27, chair: David Mount<\/td>Session: 28, chair: Sebastian Wild<\/td>Session: 29, chair: Ioannis Chatzigiannakis<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Jesper Nederlof and Isja Mannens
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth.<\/mark><\/a><\/td>		ESA talk<\/strong>
Ismail Naderi Beni, Mohsen Rezapour and Mohammad Salavatipour
Approximation Schemes for Min-Sum $k$-Clustering<\/mark><\/a><\/td>		ALGOCLOUD keynote<\/strong>
Chris Schwiegelshohn
Fitting Data on a Grain of Rice<\/mark><\/td>		Stream of the ALGOCLOUD keynote from L016<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Michael Lampis and Manolis Vasilakis
Structural Parameterizations for Two Bounded Degree Problems Revisited<\/mark><\/a><\/td>		ESA talk<\/strong>
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm and Kevin Schewior
Improved Approximation Algorithms for the Expanding Search Problem<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Matthias Bentert, Klaus Heeger and Tomohiro Koana
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication<\/mark><\/a><\/td>		ESA talk<\/strong>
Max Deppert, Matthias Kaul and Matthias Mnich
A (3\/2+\u03b5)-Approximation for Multiple TSP with a Variable Number of Depots<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Jan Dreier, Daniel Mock and Peter Rossmanith
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond<\/mark><\/a><\/td>		ESA talk<\/strong>
Evangelos Kipouridis
Fitting Tree Metrics with Minimum Disagreements<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
16:20<\/td>Coffee break<\/td><\/tr>
16:40<\/td>Session: 30, chair: Christian Schulz<\/td>Session: 31, chair: Daniel\u00a0Funke<\/td>Session: 32, chair: Ioannis Karydis<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Jacek Sroka and Jerzy Tyszkiewicz
Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps<\/mark><\/a><\/td>		ESA talk<\/strong>
Colin Geniet and Stephan Thomasse
First order logic and twin-width in tournaments<\/mark><\/a><\/a><\/td>		ALGOCLOUD talk<\/strong>
Themistoklis Sarantakos, Daniel Mauricio Jimenez Gutierrez and Dimitrios Amaxilatis
On-Field Leaf Infection Detection using the Cloud-Edge Continuum<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Zelin Li, Pan Peng and Xianbin Zhu
Massively Parallel Algorithms for the Stochastic Block Model<\/mark><\/a><\/td>		ESA talk<\/strong>
Felix Klingelhoefer and Alantha Newman
Coloring tournaments with few colors: Algorithms and complexity<\/mark><\/a><\/a><\/td>		ALGOCLOUD best paper and best student paper awards<\/strong><\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Goran Zuzic
A Simple Boosting Framework for Transshipment<\/mark><\/a><\/td>		ESA (recorded) talk<\/strong>
Yixin Cao
Enumerating Maximal Induced Subgraphs<\/mark><\/a><\/a><\/td>		ALGOCLOUD closing remarks<\/strong><\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
17:25<\/td>End of talks<\/td><\/tr>
17:30<\/td>Group photo<\/td><\/tr>
19:00<\/td>Conference Dinner<\/mark><\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

<\/td>Turing room<\/td>Euler room<\/td>L016<\/td>L017<\/td><\/tr>
09:15<\/td>Session: 33, chair: Adam Karczmarz<\/td>Session: 34, chair: Florian\u00a0Kurpicz<\/td>Session: 35, chair: Micha\u0142 Pilipczuk<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Tomasz Kociumaka and Adam Polak
Bellman\u2013Ford is optimal for shortest hop-bounded paths<\/mark><\/a>
<\/td>		ESA talk<\/strong>
Gerth St\u00f8lting Brodal and Sebastian Wild
Funnelselect: Cache-Oblivious Multiple Selection<\/mark><\/a><\/td>		IPEC talk<\/strong>
Max Bannach, Florian Chudigiewitsch and Till Tantau
Existential Second-Order Logic over Graphs: Parameterized Complexity<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
\u00c9douard Bonnet, Julien Duron, Colin Geniet, St\u00e9phan Thomass\u00e9 and Alexandra Wesolek
Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \\uplus C_4$<\/mark><\/a><\/td>		ESA talk<\/strong>
Arthur Carvalho Walraven Da Cunha, Francesco d\u2019Amore, Fr\u00e9d\u00e9ric Giroire, Hicham Lesfari, Emanuele Natale and Laurent Viennot
Revisiting the Random Subset Sum Problem<\/mark><\/a><\/a><\/td>		IPEC talk<\/strong>
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak and Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Dongrun Cai, Xue Chen and Pan Peng
Effective Resistances in Non-Expander Graphs<\/mark><\/a><\/td>		ESA (recorded) talk<\/strong>
Ming Ding and Peng Zhang
Efficient $1$-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences<\/mark><\/a><\/a><\/td>		IPEC talk<\/strong>
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk and Roohani Sharma
Parameterized Complexity Classification for Interval Constraints<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
10:00<\/td>Session: 36, chair: Shay Mozes<\/td>Session: 37, chair: Adam Polak<\/td><\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Zihui Liang, Bakh Khoussainov, Toru Takisaka and Mingyu Xiao
Connectivity in the presence of an opponent<\/mark><\/a><\/td>		ESA talk<\/strong>
Alejandro Cassis and Karl Bringmann
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution<\/mark><\/a><\/td>		IPEC talk<\/strong>
Robert Ganian, Liana Khazaliya and Kirill Simonov
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Thomas Bl\u00e4sius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff and Ziena Zeif
On the Giant Component of Geometric Inhomogeneous Random Graphs<\/mark><\/a><\/td>		ESA talk<\/strong>
Xiaoming Sun, Jialin Zhang and Zhijie Zhang
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem<\/mark><\/a><\/td>		IPEC talk<\/strong>
Klaus Heeger, Danny Hermelin and Dvir Shabtay
Single Machine Scheduling with Few Deadlines<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
10:30<\/td>Coffee break<\/td><\/tr>
11:00<\/td>Session: 38, chair: Shay Mozes<\/td>Session: 39, chair: Adam Polak<\/td>Session: 40, chair: Magnus Wahlstr\u00f6m<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Farhana Choudhury, Rowan Warneke and Anthony Wirth
Maximum Coverage in Random-Arrival Streams<\/mark><\/a><\/td>		ESA talk<\/strong>
Amit Ganz, Pranav Nuti and Roy Schwartz
A Tight Competitive Ratio for Online Submodular Welfare Maximization<\/mark><\/a><\/td>		IPEC best paper<\/strong>
Hans L. Bodlaender, Isja Mannens, Jelle Oostveen, Sukanya Pandey and Erik Jan van Leeuwen
The Parameterised Complexity of Integer Multicommodity Flow<\/mark><\/td>		<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Menachem Sadigurschi, Moshe Shechner and Uri Stemmer
Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model<\/mark><\/a><\/td>		ESA talk<\/strong>
Martin Hoefer and Kevin Schewior
Threshold Testing and Semi-Online Prophet Inequalities<\/mark><\/a><\/td>		IPEC best student paper<\/strong>
Stefan Kratsch and Pascal Kunz
Approximate Turing kernelization and lower bounds for domination problems<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
11:30<\/td>Session: 41, chair: Christos Zaroliagis<\/td><\/td><\/td><\/td><\/tr>
<\/td>ESA test of time talk<\/strong>
Dorothea Wagner
Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms<\/mark><\/td>		Stream of the ESA test of time talks from the Turing room<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA test of time talk<\/strong>
Bob Sedgewick
Marianne Durand, Philippe Flajolet: Loglog Counting of Large Cardinalities<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
12:30<\/td><\/td>Lunch<\/td>Women+ lunch in room <\/mark><\/a>L017<\/mark><\/a><\/td><\/tr>
14:00<\/td>Session: 42, chair: S\u00e1ndor\u00a0Fekete<\/td>Session: 43, chair: Robert Ganian<\/td>Session: 44, chair: Magnus Wahlstr\u00f6m<\/td><\/td><\/tr>
<\/td>ESA talk<\/strong>
Haim Kaplan, Matthew Katz, Rachel Saban and Micha Sharir
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs<\/mark><\/a><\/td>		ESA talk<\/strong>
Eunjin Oh and Seunghyeok Oh
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs<\/mark><\/a><\/td>		Nerode prize talk<\/strong>
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Micha\u0142 Pilipczuk, Johan M. M. van Rooij and Jakub Onufry Wojtaszczyk
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time<\/mark><\/td>		Stream of the Nerode prize talk from L016<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA talk<\/strong>
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, Andr\u00e9 van Renssen and Sampson Wong
Oriented Spanners<\/mark><\/a><\/td>		ESA talk<\/strong>
Thomas Bl\u00e4sius and Max G\u00f6ttlicher
An Efficient Algorithm for Power Dominating Set<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA (recorded) talk<\/strong>
Andre van Renssen, Yuan Sha, Yucheng Sun and Sampson Wong
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation<\/mark><\/a><\/td>		ESA talk<\/strong>
Aleksander Figiel, Tomohiro Koana, Andr\u00e9 Nichterlein and Niklas W\u00fcnsche
Correlating Theory and Practice in Finding Clubs and Plexes<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>ESA (recorded) talk<\/strong>
Haitao Wang and Yiming Zhao
Improved Algorithms for Distance Selection and Related Problems<\/mark><\/a><\/td>		ESA talk<\/strong>
Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash and John Wilson
Solving Edge Clique Cover Exactly via Synergistic Data Reduction<\/mark><\/a><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
15:00<\/td>Coffee break<\/td><\/tr>
15:20<\/td>Session: 45, chair: Martin Farach-Colton<\/td>Session: 46, chair: Hans L. Bodlaender<\/td>Session: 47, chair: Andr\u00e9 Nichterlein<\/td><\/td><\/tr>
<\/td>ESA best paper<\/strong>
Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu and Yihan Sun
Efficient Parallel Output-Sensitive Edit Distance<\/mark><\/a><\/td>		ESA talk<\/strong>
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh and Vaishali Surianarayanan
Parameterized Complexity of Fair Bisection<\/mark><\/a><\/td>		IPEC talk<\/strong>
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk and Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA best paper<\/strong>
Ursula Hebert-Johnson, Daniel Lokshtanov and Eric Vigoda
Counting and Sampling Labeled Chordal Graphs in Polynomial Time<\/mark><\/a><\/td>		ESA talk<\/strong>
Bart M. P. Jansen, Jari J.H. de Kroon and Michal Wlodarczyk
5-Approximation for $\\mathcal{H}$-Treewidth Essentially as Fast as $\\mathcal{H}$-Deletion Parameterized by Solution Size<\/mark><\/a><\/td>		IPEC talk<\/strong>
Ma\u00ebl Dumas and Anthony Perez
An improved kernelization algorithm for Trivially Perfect Editing<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA best paper<\/strong>
Oleg Verbitsky and Maksim Zhukovskii
Canonization of a random graph by two matrix-vector multiplications<\/mark><\/a><\/td>		ESA talk<\/strong>
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant\u00e9, Matthias Mnich, Sang-il Oum, Micha\u0142 Pilipczuk and Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth<\/mark><\/a><\/td>		IPEC talk<\/strong>
Bart M. P. Jansen and Bart van der Steenhoven
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td>ESA best student paper<\/strong>
Joakim Blikstad and Peter Kiss
Incremental (1-eps)-approximate dynamic matching in O(poly(1\/eps)) update time<\/mark><\/a><\/td>		ESA talk<\/strong>
Falko Hegerfeld and Stefan Kratsch
Tight algorithms for connectivity problems parameterized by clique-width<\/mark><\/a><\/td>		IPEC talk<\/strong>
Bart M. P. Jansen and Shivesh K. Roy
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted $H$-Packing on Sparse Graphs<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
16:20<\/td>Coffee break<\/td><\/tr>
16:40<\/td><\/td><\/td>Session: 48, chair: Mark Jones<\/td><\/td><\/tr>
<\/td>Community meeting<\/strong><\/td><\/td>IPEC talk<\/strong>
Riccardo Dondi and Manuel Lafond
An FPT Algorithm for Temporal Graph Untangling<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td>IPEC talk<\/strong>
Siddharth Gupta, Guy Saar and Meirav Zehavi
Collective Graph Exploration Parameterized by Vertex Cover<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td>IPEC talk<\/strong>
Emmanuel Arrighi, Fedor Fomin, Petr Golovach and Petra Wolf
Kernelizing Temporal Exploration Problems<\/mark><\/td>		<\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td>session ends 17:25<\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
<\/td><\/td><\/td><\/tr>
17:40<\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

<\/td>Turing room<\/td>Euler room<\/td>L016<\/td>L017<\/td><\/tr>
09:15<\/td>Session: 49, chair: Robert Ganian<\/td>Session: 50, chair: Andreas Wiese<\/td>Session: 51, chair: Philine Schiewe<\/td>Session: 52, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Ioannis Koutis, Michal Wlodarczyk and Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity<\/mark><\/td>		session starts 9:30<\/td>session starts 9:30<\/td>ALGOWIN (remote) talk<\/strong>
Prabhat Chand, Anisur Rahaman Molla and Sumathi Sivasubramaniam
Run for Cover: Dominating Set via Mobile Agents<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh and Roohani Sharma
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity<\/mark><\/td>		WAOA talk<\/strong>
Bodo Manthey and Jesse van Rhijn
Approximation Ineffectiveness of a Tour-Untangling Heuristic<\/mark><\/td>		ATMOS talk<\/strong>
Ekkehard K\u00f6hler, Markus Rogge, Robert Scheffler and Martin Strehler
Optimal Bicycle Routes with Few Signal Stops<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Tatsuya Gima, Eun Jung Kim, Noleen K\u00f6hler, Nikolaos Melissinos and Manolis Vasilakis
Bandwidth Parameterized by Cluster Vertex Deletion Number<\/mark>
<\/td>		WAOA talk<\/strong>
William Evans and David Kirkpatrick
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities<\/mark><\/td>		ALGOWIN (remote) talk<\/strong>
Subhajit Pramanick, Saswata Jana, Adri Bhattacharya and Partha Sarathi Mandal
Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements<\/mark><\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Irene Heinrich, Olli Herrala, Philine Schiewe and Topias Terho
Using light spanning graphs for passenger assignment in public transport<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Bart M. P. Jansen and Shivesh K. Roy
On the Parameterized Complexity of Multiway Near-Separator<\/mark><\/td>		WAOA talk<\/strong>
Tobias M\u00f6mke, Alexandru Popa, Aida Roshany Tabrizi, Michael Ruderer and Roland Vincze
Approximating Maximum Edge 2-Coloring by Normalizing Graphs<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Ralf Bornd\u00f6rfer, Fabian Danecker and Martin Weiser
Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization<\/mark><\/td><\/tr>
<\/td>IPEC talk<\/strong>
Guilherme de Castro Mendes Gomes, Cl\u00e9ment Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinicius F. dos Santos and Tom C. van der Zanden
Minimum Separator Reconfiguration<\/mark><\/td>		WAOA talk<\/strong>
Sander Aarts and David Shmoys
Hitting Sets when the Shallow Cell Complexity is Small<\/mark><\/td>		session ends 10:15<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
10:30<\/td>Coffee break<\/td><\/tr>
11:00<\/td>Session: 53, chair: Hans L. Bodlaender<\/td>Session: 54, chair: Jarek Byrka<\/td><\/td>Session: 55, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Irene Heinrich and Simon Ra\u00dfmann
Twin-width of graphs with tree-structured decompositions<\/mark><\/td>		WAOA best paper<\/strong>
Mateusz Basiak, Marcin Bienkowski and Agnieszka Tatarczuk
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem<\/mark><\/td>		Stream of the WAOA best paper talk from Euler room<\/td>ALGOWIN talk<\/strong>
Annalisa De Bonis
Conflict Resolution in Arbitrary Hypergraphs<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
\u00c9douard Bonnet and Julien Duron
Stretch-width<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>session ends 11:25<\/td><\/td><\/tr>
11:30<\/td>Session: 56, chair: Hans L. Bodlaender<\/td>Session: 57, chair: Daniele Frigioni<\/td><\/td><\/td><\/tr>
<\/td>IPEC keynote<\/strong>
Tuukka Korhonen
New methods in FPT algorithms for treewidth<\/mark>
<\/mark><\/td>		ATMOS keynote<\/strong>
Christos Zaroliagis
Time-Dependent Route Planning: Theory & Practice<\/mark><\/td>		ATMOS keynote takes place in Euler room

Stream of the ATMOS keynote from Euler room
<\/td>		<\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
<\/td><\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr>
14:00<\/td>Session: 58, chair: Holger Dell<\/td>Session: 59, chair: Andreas Wiese<\/td>Session: 60, chair: Vera Grafe<\/td>Session: 61, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Hans L. Bodlaender, \u00c9douard Bonnet, Lars Jaffke, Dusan Knop, Paloma Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey and Ondrej Suchy
Treewidth is NP-Complete on Cubic Graphs<\/mark><\/mark><\/td>		WAOA keynote<\/strong>
Nicole Megow
Optimization under Explorable Uncertainty: Adversarial and Stochastic Models<\/mark><\/td>		ATMOS talk<\/strong>
Irene Heinrich, Philine Schiewe and Constantin Seebach
Non-Pool-Based Line Planning on Graphs of Bounded Treewidth<\/mark>
<\/td>		ALGOWIN talk<\/strong>
Hankang Gu and Michele Zito
Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Hisao Tamaki
A contraction-recursive algorithm for treewidth<\/mark><\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Berenike Masing, Niels Lindner and Christian Liebchen
Integrating Line Planning for Construction Sites into Periodic Timetabling via Track Choice<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Lars Jaffke, Laure Morelle, Ignasi Sau and Dimitrios M. Thilikos
Dynamic programming on bipartite tree decompositions<\/mark><\/mark><\/td>		ALGOWIN talk<\/strong>
Chen-Rui Jien and Tung-Wei Kuo
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Stefan Engels, Tom Peham and Robert Wille
A Symbolic Design Method for ETCS Hybrid Level 3 at Different Degrees of Accuracy<\/mark><\/td><\/tr>
<\/td>IPEC talk<\/strong>
Siddharth Gupta, Guy Saar and Meirav Zehavi
Drawn Tree Decomposition: New Approach for Graph Drawing Problems<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
15:00<\/td>PACE Poster session<\/strong><\/td>Coffee break<\/td><\/td><\/tr>
15:20<\/td>Session: 62, chairs: Max Bannach and Sebastian Berndt<\/td>Session: 63, chair: Jarek Byrka<\/td>Session: 64, chair: Matthias M\u00fcller-Hannemann<\/td>Session: 65, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>PACE Awards<\/mark><\/strong><\/td>WAOA talk<\/strong>
Gunther Bidlingmaier
Greedy Minimum-Energy Scheduling<\/mark><\/td>		ATMOS talk<\/strong>
Enrico Bortoletto, Niels Lindner and Berenike Masing
Periodic timetabling with cyclic order constraints<\/mark><\/td>		ALGOWIN talk<\/strong>
Sajjad Ghobadi and Cristina M. Pinotti
Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
Eric Balkanski, Tingting Ou, Clifford Stein and Hao-Ting Wei
Scheduling with Speed Predictions<\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Pedro Jos\u00e9 Correia Duarte, Marie Schmidt, Dennis Huisman and Lucas P. Veelenturf
Fewer Trains for Better Timetables: the Price of Fixed Line Frequencies in the Passenger-Oriented Timetabling Problem<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W.H. Wong and Xiao-Ou Zhang
The Power of Amortization on Scheduling with Explorable Uncertainty<\/mark><\/td>		ALGOWIN talk<\/strong>
Nour El Hoda Djidi, Damien Wohwe Sambo, Matthieu Gautier, Olivier Berder and Nathalie Mitton
WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Vera Grafe and Anita Sch\u00f6bel
Recoverable Robust Periodic Timetabling<\/mark><\/td><\/tr>
<\/td>WAOA talk<\/strong>
Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanad Imreh, Alberto Marchetti-Spaccamela, Martin Skutella and Leen Stougie
Total completion time scheduling under scenarios<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
16:20<\/td>Coffee break<\/td><\/tr>
16:40<\/td><\/td>Session: 66, chair: Andreas Wiese<\/td>Session: 67, chair: Christos Zaroliagis<\/td>Session: 68, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>IPEC Business Meeting<\/strong><\/td>WAOA talk<\/strong>
Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt and Julian Wargalla
Approximating Fair k-Min-Sum-Radii in R^d<\/mark><\/td>		ATMOS talk<\/strong>
Peerawit Suriya, Vorapong Suppakitpaisarn, Supanut Chaidee and Phapaengmueng Sukkasem
Submodularity Property for Facility Locations of Dynamic Flow Networks<\/mark><\/td>		ALGOWIN talk<\/strong>
Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou and Marianna Spyrakou
Byzantine Fault-Tolerant Protocols for $(n,f)$-evacuation from a Circle<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
Mathieu Mari, Nima Khodaveisi and Shanli Alefkhani
Online hitting set of d-dimensional fat objects<\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Theresa Ziemke, Leon Sering and Kai Nagel
Spillback changes the long-term behavior of dynamic equilibria in fluid queuing networks<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>WAOA talk<\/strong>
Michael Dinitz, Ama Koranteng, Guy Kortsarz and Zeev Nutov
Improved Approximations for Relative Survivable Network Design<\/mark><\/td>		session ends 17:10<\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Akira Matsubayashi and Yushi Saito
A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess\u2019s Paradox<\/mark><\/td><\/tr>
<\/td>session ends 17:25<\/td>session ends 17:25<\/td><\/tr>
17:30<\/td>Drinks and Snacks<\/td><\/tr>
<\/td><\/tr>
17:40<\/td><\/td><\/td>ATMOS business meeting<\/strong><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

<\/td>Turing room<\/td>Euler room<\/td>L016<\/td>L017<\/td><\/tr>
09:15<\/td>Session: 69, chair: Eduard Eiben<\/td>Session: 70, chair: Erik Jan van Leeuwen<\/td>Session: 71, chair: Dennis Huisman<\/td>Session: 72, chair: Evangelos Kranakis<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Ilan Doron, Ariel Kulik and Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint<\/mark><\/td>		session starts 9:30<\/td>session starts 9:30<\/td>ALGOWIN talk<\/strong>
Yeganeh Bahoo, Somnath Kundu and Kody Manastyrski
Segment Visibility for $k$-transmitters<\/mark><\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Timoth\u00e9 Picavet, Mathieu Mari and Micha\u0142 Pilipczuk
A parameterized approximation scheme for the 2D-Knapsack problem with wide items<\/mark><\/td>		WAOA talk<\/strong>
V\u00edtor G. Chagas, Elisa Dell\u2019Arriva and Flavio K. Miyazawa
Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes<\/mark><\/td>		ATMOS talk<\/strong>
Boris Grimm, Ralf Bornd\u00f6rfer and Julian Bushe
Assignment Based Resource Constrained Path Generation for Railway Rolling Stock Optimization<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Baris Can Esmer, Ariel Kulik, Daniel Marx, Daniel Neuen and Roohani Sharma
Approximate Monotone Local Search for Weighted Problems<\/mark><\/td>		WAOA talk<\/strong>
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi and Joachim Spoerhase
Independent set in $k$-Claw-Free Graphs: Conditional $\\chi$-boundedness and the Power of LP\/SDP Relaxations<\/mark><\/td>		ALGOWIN best paper<\/strong>
David C. Kutner and Laura Larios-Jones
Temporal Reachability Dominating Sets: contagion in temporal graphs<\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Philip de Bruin, Marjan van den Akker, Han Hoogeveen and Marcel van Kooten Niekerk
Scheduling Electric Buses with Stochastic Driving Times<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Matthias Bentert, Jannik Schestag and Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model<\/mark><\/td>		WAOA talk<\/strong>
Philip Cervenjak, Junhao Gan and Anthony Wirth
Fast Parallel Algorithms for Submodular p-Superseparable Maximization<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Fabian L\u00f6bel, Ralf Bornd\u00f6rfer and Steffen Weider
Non-linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates<\/mark><\/td><\/tr>
<\/td>IPEC talk<\/strong>
P\u00e5l Gr\u00f8n\u00e5s Drange, Patrick Greaves, Irene Muzi and Felix Reidl
Computing complexity measures of degenerate graphs<\/mark><\/td>		WAOA talk<\/strong>
Allan Borodin and Christodoulos Karavasilis
Any-Order Online Interval Selection<\/mark><\/td>		session ends 10:15<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
10:30<\/td>Coffee break<\/td><\/tr>
11:00<\/td>Session: 73, chair: Riccardo Dondi<\/td>Session: 74, chair: Evangelos Kranakis<\/td>Session: 75, chair: Niels Lindner<\/td><\/td><\/tr>
<\/td>IPEC talk<\/strong>
Mark Jones and Jannik Schestag
How can we Maximize Phylogenetic Diversity? Parameterized Approaches for Networks<\/mark><\/td>		ALGOWIN keynote<\/strong>
S\u00e1ndor P. Fekete
Coordinated Motion Planning: Reconfiguring a Swarm of Robots<\/mark><\/td>		ATMOS talk<\/strong>
Aigerim Saken and Stephen Maher
Subproblem separation in logic-based Benders\u2019 decomposition for the vehicle routing problem with local congestion<\/mark><\/td>		ALGOWIN keynote takes place in Euler room<\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Jaroslav Garvardt, Malte Renken, Jannik Schestag and Mathias Weller
Finding Degree-Constrained Acyclic Orientations<\/mark><\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Bart van Rossum, Rui Chen and Andrea Lodi
Optimizing Fairness Over Time With Homogeneous Workers<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Jaroslav Garvardt, Nils Morawietz, Andr\u00e9 Nichterlein and Mathias Weller
Graph Clustering Problems under the Lens of Parameterized Local Search<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td>ATMOS talk<\/strong>
Mette Wagenvoort, Martijn van Ee, Paul Bouman and Kerry Malone
Simple policies for capacitated resupply problems<\/mark>
<\/td><\/tr>
<\/td>IPEC talk<\/strong>
Emmanuel Arrighi, Matthias Bentert, P\u00e5l Gr\u00f8n\u00e5s Drange, Blair D. Sullivan and Petra Wolf
Cluster Editing with Overlapping Communities<\/mark><\/td><\/tr>
<\/td><\/tr>
<\/td><\/tr>
12:00<\/td><\/td><\/td>ATMOS closing remarks<\/strong><\/td><\/td><\/tr>
12:30<\/td>Lunch<\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div>\n\n\n\n
\n

Sponsors:<\/strong><\/p>\n\n\n\n

\n
\"\"<\/a><\/figure>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
\"\"<\/figure>\n<\/div>\n\n\n\n
\n
\"\"<\/a><\/figure>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
\"\"<\/a><\/figure>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Each standard talk (including best paper talks) of ALGOCLOUD, ESA, IPEC and WAOA is assigned a 15 minutes slot, for ATMOS it is 20 minutes, and for ALGOWIN it is 30 minutes. Each keynote talk is given a 60 minutes time slot, and ESA test of time talks are given 30 minutes time slot each.<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"wp-custom-template-schedule-page","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/pages\/882"}],"collection":[{"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/comments?post=882"}],"version-history":[{"count":81,"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/pages\/882\/revisions"}],"predecessor-version":[{"id":1833,"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/pages\/882\/revisions\/1833"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2023\/wp-json\/wp\/v2\/media?parent=882"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}