Schedule – ALGO 2023

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.

Monday, September 4

	Turing room	Euler room	L016	L017
08:15	Registration desk opens
09:05	Opening remarks by Prof. Ton de Kok, the Director of CWI
09:15	Session: 1, chair: Stefan Kratsch	Session: 2, chair: Philip Bille
	ESA talk François Sellier Parameterized Matroid-Constrained Maximum Coverage	ESA talk Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares and Nicola Prezza Sorting Finite Automata via Partition Refinement


	ESA talk Elfarouk Harb, Chandra Chekuri and Kent Quanrud Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing	ESA talk Jakub Radoszewski Linear Time Construction of Cover Suffix Tree and Applications


	ESA talk Victor A. Campos, Jonas Costa, Raul Lopes and Ignasi Sau New Menger-like dualities in digraphs and applications to half-integral linkages	ESA talk Krzysztof Pióro Subcubic algorithm for (Unweighted) Unrooted Tree Edit Distance


10:00	Session: 3, chair: Danny Hermelin	Session: 4, chair: Gabriele Fici
	ESA talk Parinya Chalermsook, Fedor Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof and Ly Orgo Polynomial-time Approximation of Independent Set Parameterized by Treewidth	ESA talk Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S. and Ron Safier Can You Solve Closest String Faster than Exhaustive Search?


	ESA (recorded) talk Meirav Zehavi, Fedor Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh and Stephan Thomasse Lossy Kernelization for (Implicit) Hitting Set Problems	ESA talk Hideo Bannai and Jonas Ellert Lyndon Arrays in Sublinear Time


10:30	Coffee break
11:00	Session: 5, chair: Danny Hermelin	Session: 6, chair: Hideo Bannai
	ESA talk Fedor V. Fomin, Petr A Golovach, Tanmay Inamdar, Saket Saurabh and Meirav Zehavi Kernelization for Spreading Points	ESA talk Francesco Masillo Matching Statistics speed up BWT construction


	ESA talk Chinmay Sonar, Subhash Suri and Jie Xue Fault Tolerance in Euclidean Committee Selection	ESA talk Dominik Köppl, Florian Kurpicz and Daniel Meyer Faster Block Tree Construction


11:30	Session: 7, chair: Simon J. Puglisi
	ESA keynote Martin Dietzfelbinger On Hashing by (Random) Equations	Stream of the ESA keynote from the Turing room











12:30	Lunch
14:00	Session: 8, chair: Yasamin Nazari	Session: 9, chair: Alex Conway
	ESA talk Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev and Liren Shan Approximation Algorithm for Norm Multiway Cut	ESA talk Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann and Peter Sanders High Performance Construction of RecSplit Based Minimal Perfect Hash Functions


	ESA talk Baruch Schieber and Soroush Vahidi Approximating Connected Maximum Cuts via Local Search	ESA talk Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders and Giorgio Vinciguerra Learned Monotone Minimal Perfect Hashing


	ESA talk Dor Katzelnick, Aditya Pillai, Roy Schwartz and Mohit Singh An Improved Approximation Algorithm for the Max-$3$-Section Problem	ESA talk David Harris Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication


	ESA talk Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu and Ruilong Zhang Scheduling with a Limited Testing Budget	ESA talk Christopher Musco and Chuhan Yang Efficient Block Approximate Matrix Multiplication


15:00	Coffee break
15:20	Session: 10, chair: Petra Wolf	Session: 11, chair: Merav Parter
	ESA talk Michael Czekanski, Shelby Kimmel and R. Teal Witter Robust and Space-Efficient Dual Adversary Quantum Query Algorithms	ESA talk Ashwin Jacob, Michal Wlodarczyk and Meirav Zehavi Finding Long Directed Cycles is Hard Even When DFVS is Small or Girth is Large


	ESA talk Simon Apers, Stacey Jeffery, Galina Pass and Michael Walter (No) Quantum space-time tradeoff for USTCON	ESA talk Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams and Zixuan Xu Faster Detours in Undirected Graphs


	ESA talk Adam Izdebski and Ronald de Wolf Improved Quantum Boosting	ESA talk Shyan Akmal and Nicole Wein A Local-to-Global Theorem for Congested Shortest Paths


	ESA talk Nikhil Mande and Ronald de Wolf Tight Bounds For Quantum Phase Estimation and Related Problems	ESA (recorded) talk 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


16:20	Coffee break
16:40	Session: 12, chair: Jakub Radoszewski	Session: 13, chair: Darren Strash
	ESA talk Ilan Cohen and Binghui Peng Primal-Dual schemes for Online Matching in Bounded Degree graphs	ESA talk Dani Dorfman, Haim Kaplan, Robert Tarjan and Uri Zwick Optimal energetical paths for electric cars


	ESA talk 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	2 papers ESA talk Aaron Berger, Jenny Kaufmann and Virginia Vassilevska Williams Approximating Min-Diameter: Standard and Bichromatic Mina Dalirrooyfard, Ray Li, Amir Abboud and Virginia Vassilevska Williams On Diameter Approximation in Directed Graphs


	ESA talk Martin Bullinger and René Romen Online Coalition Formation under Random Arrival or Coalition Dissolution	ESA talk Shimon Kogan and Merav Parter Towards Bypassing Lower Bounds for Graph Shortcuts


17:25	Welcome Reception

Tuesday, September 5

	Turing room	Euler room	L016	L017
09:15	Session: 14, chair: Bora Ucar	Session: 15, chair: Eunjin Oh	Session: 16, chairs: Ioannis Chatzigiannakis and Ioannis Karydis
	ESA talk Sebastian Forster, Gramoz Goranci, Yasamin Nazari and Antonis Skarlatos Bootstrapping Dynamic Distance Oracles	ESA talk Sándor Fekete, Dominik Krupke, Michael Perk, Christian Rieck and Christian Scheffer The Lawn Mowing Problem: From Algebra to Algorithms	ALGOCLOUD talk Alberto Robles-Enciso, Ricardo Robles-Enciso and Antonio Skarmeta Multi-agent reinforcement learning-based energy orchestrator for cyber-physical systems


	ESA talk Thatchaphol Saranurak and Wuwei Yuan Maximal k-Edge-Connected Subgraphs in Almost-linear Time	ESA talk Daniel Funke, Nicolai Hüning and Peter Sanders A Sweep-plane Algorithm for Calculating the Isolation of Mountains	ALGOCLOUD talk 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


	ESA talk Evangelos Kosinas Connectivity Queries under Vertex Failures: Not Optimal, but Practical	ESA talk Peter Sanders, Demian Hespe, Carina Truschel and Sabine Storandt Pareto Sums of Pareto Sets	ALGOCLOUD talk Marianna Tzortzi, Charalampos Kleitsikas, Agis Politis, Sotirios Niarchos, Katerina Doka and Nectarios Koziris Planning workflow executions over the Edge-to-Cloud Continuum


10:00	Session: 17, chair: Sabine Storandt	Session: 18, chair: Gerth Brodal	Session: 19, chair: Spyros Sioutas
	ESA talk Amir Abboud, Shay Mozes and Oren Weimann What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?	ESA talk George Osipov and Magnus Wahlström Parameterized Complexity of Equality MinCSP	ALGOCLOUD talk Panagiotis Kokkinos, Andreas Varvarigos, Dimitrios Konidaris and Konstantinos Tserpes Intent-based Allocation of Cloud Computing Resources Using Q-Learning


	ESA talk Adam Karczmarz and Marcin Smulewicz On Fully Dynamic Strongly Connected Components	ESA talk Hugo Akitaya, Andrei Gonczi, Diane Souvaine, Csaba Toth and Thomas Weighill Reconfiguration of Polygonal Subdivisions via Recombination	ALGOCLOUD talk Andrea Rossi, Andrea Visentin, Steven Prestwich and Kenneth N. Brown Clustering-based Numerosity Reduction for Cloud Workload Forecasting


10:30	Coffee break
11:00	Session: 20, chair: Sabine Storandt	Session: 21, chair: Gerth Brodal	Session: 22, chair: Dimitrios Amaxilatis
	ESA talk Adil Chhabra, Marcelo Fonseca Faraj and Christian Schulz Faster Local Motif Clustering via Maximum Flows	ESA talk Patrizio Angelini, Michael Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister and Torsten Ueckerdt Axis-Parallel Right Angle Crossing Graphs	ALGOCLOUD talk 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


	ESA talk Ioannis Panagiotas, Gregoire Pichon, Somesh Singh and Bora Ucar Engineering fast algorithms for the bottleneck matching problem	ESA talk Ignaz Rutter and Peter Stumpf Simultaneous Representation of Interval Graphs in the Sunflower Case	ALGOCLOUD talk 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


11:30	Session: 23, chair: Inge Li Gørtz
	ESA keynote Rotem Oshman Set Disjointness: Fundamentals, Applications and Beyond	Stream of the ESA keynote from the Turing room











12:30	Lunch
14:00	Session: 24, chair: Prudence Wong	Session: 25, chair: Joachim Gudmundsson	Session: 26, chair: Ioannis Chatzigiannakis
	ESA talk Julia Baligacs, Yann Disser, Irene Heinrich and Pascal Schweitzer Exploration of graphs with excluded minors	ESA talk Christoph Grunau, Ahmet Alper Özüdoğru and Václav Rozhoň Noisy k-means++ revisited	ALGOCLOUD talk Spyros Kontogiannis, Andreas Paraskevopoulos, Meletios Pogkas and Christos Zaroliagis i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System


	ESA talk Enze Sun, Zonghan Yang and Yuhao Zhang Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs	ESA talk Sergio Cabello and Panos Giannopoulos On $k$-means for segments and polylines	ALGOCLOUD talk 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


	ESA talk Yuval Emek, Yuval Gil, Maciej Pacut and Stefan Schmid Online Algorithms with Randomly Infused Advice	ESA talk Ahmed Abdelkader and David Mount Smooth Distance Approximation	ALGOCLOUD talk 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


	ESA talk 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	ESA talk Adam Kurpisz and Silvan Suter Improved Approximations for Translational Packing of Convex Polygons	ALGOCLOUD talk 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


15:00	Coffee break
15:20	Session: 27, chair: David Mount	Session: 28, chair: Sebastian Wild	Session: 29, chair: Ioannis Chatzigiannakis
	ESA talk 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.	ESA talk Ismail Naderi Beni, Mohsen Rezapour and Mohammad Salavatipour Approximation Schemes for Min-Sum $k$-Clustering	ALGOCLOUD keynote Chris Schwiegelshohn Fitting Data on a Grain of Rice	Stream of the ALGOCLOUD keynote from L016


	ESA talk Michael Lampis and Manolis Vasilakis Structural Parameterizations for Two Bounded Degree Problems Revisited	ESA talk Svenja M. Griesbach, Felix Hommelsheim, Max Klimm and Kevin Schewior Improved Approximation Algorithms for the Expanding Search Problem


	ESA talk Matthias Bentert, Klaus Heeger and Tomohiro Koana Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication	ESA talk Max Deppert, Matthias Kaul and Matthias Mnich A (3/2+ε)-Approximation for Multiple TSP with a Variable Number of Depots


	ESA talk Jan Dreier, Daniel Mock and Peter Rossmanith Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond	ESA talk Evangelos Kipouridis Fitting Tree Metrics with Minimum Disagreements


16:20	Coffee break
16:40	Session: 30, chair: Christian Schulz	Session: 31, chair: Daniel Funke	Session: 32, chair: Ioannis Karydis
	ESA talk Jacek Sroka and Jerzy Tyszkiewicz Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps	ESA talk Colin Geniet and Stephan Thomasse First order logic and twin-width in tournaments	ALGOCLOUD talk Themistoklis Sarantakos, Daniel Mauricio Jimenez Gutierrez and Dimitrios Amaxilatis On-Field Leaf Infection Detection using the Cloud-Edge Continuum


	ESA talk Zelin Li, Pan Peng and Xianbin Zhu Massively Parallel Algorithms for the Stochastic Block Model	ESA talk Felix Klingelhoefer and Alantha Newman Coloring tournaments with few colors: Algorithms and complexity	ALGOCLOUD best paper and best student paper awards


	ESA talk Goran Zuzic A Simple Boosting Framework for Transshipment	ESA (recorded) talk Yixin Cao Enumerating Maximal Induced Subgraphs	ALGOCLOUD closing remarks


17:25	End of talks
17:30	Group photo
19:00	Conference Dinner

Wednesday, September 6

	Turing room	Euler room	L016	L017
09:15	Session: 33, chair: Adam Karczmarz	Session: 34, chair: Florian Kurpicz	Session: 35, chair: Michał Pilipczuk
	ESA talk Tomasz Kociumaka and Adam Polak Bellman–Ford is optimal for shortest hop-bounded paths	ESA talk Gerth Stølting Brodal and Sebastian Wild Funnelselect: Cache-Oblivious Multiple Selection	IPEC talk Max Bannach, Florian Chudigiewitsch and Till Tantau Existential Second-Order Logic over Graphs: Parameterized Complexity


	ESA talk Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé and Alexandra Wesolek Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$	ESA talk Arthur Carvalho Walraven Da Cunha, Francesco d’Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale and Laurent Viennot Revisiting the Random Subset Sum Problem	IPEC talk 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


	ESA talk Dongrun Cai, Xue Chen and Pan Peng Effective Resistances in Non-Expander Graphs	ESA (recorded) talk Ming Ding and Peng Zhang Efficient $1$-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences	IPEC talk Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk and Roohani Sharma Parameterized Complexity Classification for Interval Constraints


10:00	Session: 36, chair: Shay Mozes	Session: 37, chair: Adam Polak
	ESA talk Zihui Liang, Bakh Khoussainov, Toru Takisaka and Mingyu Xiao Connectivity in the presence of an opponent	ESA talk Alejandro Cassis and Karl Bringmann Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution	IPEC talk Robert Ganian, Liana Khazaliya and Kirill Simonov Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity


	ESA talk Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff and Ziena Zeif On the Giant Component of Geometric Inhomogeneous Random Graphs	ESA talk Xiaoming Sun, Jialin Zhang and Zhijie Zhang Simple Deterministic Approximation for Submodular Multiple Knapsack Problem	IPEC talk Klaus Heeger, Danny Hermelin and Dvir Shabtay Single Machine Scheduling with Few Deadlines


10:30	Coffee break
11:00	Session: 38, chair: Shay Mozes	Session: 39, chair: Adam Polak	Session: 40, chair: Magnus Wahlström
	ESA talk Farhana Choudhury, Rowan Warneke and Anthony Wirth Maximum Coverage in Random-Arrival Streams	ESA talk Amit Ganz, Pranav Nuti and Roy Schwartz A Tight Competitive Ratio for Online Submodular Welfare Maximization	IPEC best paper Hans L. Bodlaender, Isja Mannens, Jelle Oostveen, Sukanya Pandey and Erik Jan van Leeuwen The Parameterised Complexity of Integer Multicommodity Flow


	ESA talk Menachem Sadigurschi, Moshe Shechner and Uri Stemmer Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model	ESA talk Martin Hoefer and Kevin Schewior Threshold Testing and Semi-Online Prophet Inequalities	IPEC best student paper Stefan Kratsch and Pascal Kunz Approximate Turing kernelization and lower bounds for domination problems


11:30	Session: 41, chair: Christos Zaroliagis
	ESA test of time talk Dorothea Wagner Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms	Stream of the ESA test of time talks from the Turing room





	ESA test of time talk Bob Sedgewick Marianne Durand, Philippe Flajolet: Loglog Counting of Large Cardinalities





12:30		Lunch		Women+ lunch in room L017
14:00	Session: 42, chair: Sándor Fekete	Session: 43, chair: Robert Ganian	Session: 44, chair: Magnus Wahlström
	ESA talk Haim Kaplan, Matthew Katz, Rachel Saban and Micha Sharir The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs	ESA talk Eunjin Oh and Seunghyeok Oh Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs	Nerode prize talk Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. van Rooij and Jakub Onufry Wojtaszczyk Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	Stream of the Nerode prize talk from L016


	ESA talk Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen and Sampson Wong Oriented Spanners	ESA talk Thomas Bläsius and Max Göttlicher An Efficient Algorithm for Power Dominating Set


	ESA (recorded) talk Andre van Renssen, Yuan Sha, Yucheng Sun and Sampson Wong The Tight Spanning Ratio of the Rectangle Delaunay Triangulation	ESA talk Aleksander Figiel, Tomohiro Koana, André Nichterlein and Niklas Wünsche Correlating Theory and Practice in Finding Clubs and Plexes


	ESA (recorded) talk Haitao Wang and Yiming Zhao Improved Algorithms for Distance Selection and Related Problems	ESA talk Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash and John Wilson Solving Edge Clique Cover Exactly via Synergistic Data Reduction


15:00	Coffee break
15:20	Session: 45, chair: Martin Farach-Colton	Session: 46, chair: Hans L. Bodlaender	Session: 47, chair: André Nichterlein
	ESA best paper Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu and Yihan Sun Efficient Parallel Output-Sensitive Edit Distance	ESA talk Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh and Vaishali Surianarayanan Parameterized Complexity of Fair Bisection	IPEC talk Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk and Meirav Zehavi Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs


	ESA best paper Ursula Hebert-Johnson, Daniel Lokshtanov and Eric Vigoda Counting and Sampling Labeled Chordal Graphs in Polynomial Time	ESA talk 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	IPEC talk Maël Dumas and Anthony Perez An improved kernelization algorithm for Trivially Perfect Editing


	ESA best paper Oleg Verbitsky and Maksim Zhukovskii Canonization of a random graph by two matrix-vector multiplications	ESA talk Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk and Erik Jan van Leeuwen Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth	IPEC talk Bart M. P. Jansen and Bart van der Steenhoven Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions


	ESA best student paper Joakim Blikstad and Peter Kiss Incremental (1-eps)-approximate dynamic matching in O(poly(1/eps)) update time	ESA talk Falko Hegerfeld and Stefan Kratsch Tight algorithms for connectivity problems parameterized by clique-width	IPEC talk Bart M. P. Jansen and Shivesh K. Roy Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted $H$-Packing on Sparse Graphs


16:20	Coffee break
16:40			Session: 48, chair: Mark Jones
	Community meeting		IPEC talk Riccardo Dondi and Manuel Lafond An FPT Algorithm for Temporal Graph Untangling


			IPEC talk Siddharth Gupta, Guy Saar and Meirav Zehavi Collective Graph Exploration Parameterized by Vertex Cover


			IPEC talk Emmanuel Arrighi, Fedor Fomin, Petr Golovach and Petra Wolf Kernelizing Temporal Exploration Problems


			session ends 17:25


17:40

Thursday, September 7

	Turing room	Euler room	L016	L017
09:15	Session: 49, chair: Robert Ganian	Session: 50, chair: Andreas Wiese	Session: 51, chair: Philine Schiewe	Session: 52, chair: Evangelos Kranakis
	IPEC talk Ioannis Koutis, Michal Wlodarczyk and Meirav Zehavi Sidestepping Barriers for Dominating Set in Parameterized Complexity	session starts 9:30	session starts 9:30	ALGOWIN (remote) talk Prabhat Chand, Anisur Rahaman Molla and Sumathi Sivasubramaniam Run for Cover: Dominating Set via Mobile Agents


	IPEC talk Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh and Roohani Sharma Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity	WAOA talk Bodo Manthey and Jesse van Rhijn Approximation Ineffectiveness of a Tour-Untangling Heuristic	ATMOS talk Ekkehard Köhler, Markus Rogge, Robert Scheffler and Martin Strehler Optimal Bicycle Routes with Few Signal Stops


	IPEC talk Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos and Manolis Vasilakis Bandwidth Parameterized by Cluster Vertex Deletion Number	WAOA talk William Evans and David Kirkpatrick A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities		ALGOWIN (remote) talk Subhajit Pramanick, Saswata Jana, Adri Bhattacharya and Partha Sarathi Mandal Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements
			ATMOS talk Irene Heinrich, Olli Herrala, Philine Schiewe and Topias Terho Using light spanning graphs for passenger assignment in public transport

	IPEC talk Bart M. P. Jansen and Shivesh K. Roy On the Parameterized Complexity of Multiway Near-Separator	WAOA talk Tobias Mömke, Alexandru Popa, Aida Roshany Tabrizi, Michael Ruderer and Roland Vincze Approximating Maximum Edge 2-Coloring by Normalizing Graphs

			ATMOS talk Ralf Borndörfer, Fabian Danecker and Martin Weiser Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization
	IPEC talk Guilherme de Castro Mendes Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinicius F. dos Santos and Tom C. van der Zanden Minimum Separator Reconfiguration	WAOA talk Sander Aarts and David Shmoys Hitting Sets when the Shallow Cell Complexity is Small		session ends 10:15


10:30	Coffee break
11:00	Session: 53, chair: Hans L. Bodlaender	Session: 54, chair: Jarek Byrka		Session: 55, chair: Evangelos Kranakis
	IPEC talk Irene Heinrich and Simon Raßmann Twin-width of graphs with tree-structured decompositions	WAOA best paper Mateusz Basiak, Marcin Bienkowski and Agnieszka Tatarczuk An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem	Stream of the WAOA best paper talk from Euler room	ALGOWIN talk Annalisa De Bonis Conflict Resolution in Arbitrary Hypergraphs


	IPEC talk Édouard Bonnet and Julien Duron Stretch-width

		session ends 11:25
11:30	Session: 56, chair: Hans L. Bodlaender	Session: 57, chair: Daniele Frigioni
	IPEC keynote Tuukka Korhonen New methods in FPT algorithms for treewidth	ATMOS keynote Christos Zaroliagis Time-Dependent Route Planning: Theory & Practice	ATMOS keynote takes place in Euler room Stream of the ATMOS keynote from Euler room












12:30	Lunch
14:00	Session: 58, chair: Holger Dell	Session: 59, chair: Andreas Wiese	Session: 60, chair: Vera Grafe	Session: 61, chair: Evangelos Kranakis
	IPEC talk Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey and Ondrej Suchy Treewidth is NP-Complete on Cubic Graphs	WAOA keynote Nicole Megow Optimization under Explorable Uncertainty: Adversarial and Stochastic Models	ATMOS talk Irene Heinrich, Philine Schiewe and Constantin Seebach Non-Pool-Based Line Planning on Graphs of Bounded Treewidth	ALGOWIN talk Hankang Gu and Michele Zito Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks


	IPEC talk Hisao Tamaki A contraction-recursive algorithm for treewidth
			ATMOS talk Berenike Masing, Niels Lindner and Christian Liebchen Integrating Line Planning for Construction Sites into Periodic Timetabling via Track Choice

	IPEC talk Lars Jaffke, Laure Morelle, Ignasi Sau and Dimitrios M. Thilikos Dynamic programming on bipartite tree decompositions			ALGOWIN talk Chen-Rui Jien and Tung-Wei Kuo Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information

			ATMOS talk Stefan Engels, Tom Peham and Robert Wille A Symbolic Design Method for ETCS Hybrid Level 3 at Different Degrees of Accuracy
	IPEC talk Siddharth Gupta, Guy Saar and Meirav Zehavi Drawn Tree Decomposition: New Approach for Graph Drawing Problems


15:00	PACE Poster session	Coffee break
15:20	Session: 62, chairs: Max Bannach and Sebastian Berndt	Session: 63, chair: Jarek Byrka	Session: 64, chair: Matthias Müller-Hannemann	Session: 65, chair: Evangelos Kranakis
	PACE Awards	WAOA talk Gunther Bidlingmaier Greedy Minimum-Energy Scheduling	ATMOS talk Enrico Bortoletto, Niels Lindner and Berenike Masing Periodic timetabling with cyclic order constraints	ALGOWIN talk Sajjad Ghobadi and Cristina M. Pinotti Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks


		WAOA talk Eric Balkanski, Tingting Ou, Clifford Stein and Hao-Ting Wei Scheduling with Speed Predictions
			ATMOS talk Pedro José 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

		WAOA talk Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W.H. Wong and Xiao-Ou Zhang The Power of Amortization on Scheduling with Explorable Uncertainty		ALGOWIN talk Nour El Hoda Djidi, Damien Wohwe Sambo, Matthieu Gautier, Olivier Berder and Nathalie Mitton WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio

			ATMOS talk Vera Grafe and Anita Schöbel Recoverable Robust Periodic Timetabling
		WAOA talk Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanad Imreh, Alberto Marchetti-Spaccamela, Martin Skutella and Leen Stougie Total completion time scheduling under scenarios


16:20	Coffee break
16:40		Session: 66, chair: Andreas Wiese	Session: 67, chair: Christos Zaroliagis	Session: 68, chair: Evangelos Kranakis
	IPEC Business Meeting	WAOA talk Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt and Julian Wargalla Approximating Fair k-Min-Sum-Radii in R^d	ATMOS talk Peerawit Suriya, Vorapong Suppakitpaisarn, Supanut Chaidee and Phapaengmueng Sukkasem Submodularity Property for Facility Locations of Dynamic Flow Networks	ALGOWIN talk Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou and Marianna Spyrakou Byzantine Fault-Tolerant Protocols for $(n,f)$-evacuation from a Circle


		WAOA talk Mathieu Mari, Nima Khodaveisi and Shanli Alefkhani Online hitting set of d-dimensional fat objects
			ATMOS talk Theresa Ziemke, Leon Sering and Kai Nagel Spillback changes the long-term behavior of dynamic equilibria in fluid queuing networks

		WAOA talk Michael Dinitz, Ama Koranteng, Guy Kortsarz and Zeev Nutov Improved Approximations for Relative Survivable Network Design		session ends 17:10

			ATMOS talk Akira Matsubayashi and Yushi Saito A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess’s Paradox
	session ends 17:25	session ends 17:25
17:30	Drinks and Snacks

17:40			ATMOS business meeting

Friday, September 8

	Turing room	Euler room	L016	L017
09:15	Session: 69, chair: Eduard Eiben	Session: 70, chair: Erik Jan van Leeuwen	Session: 71, chair: Dennis Huisman	Session: 72, chair: Evangelos Kranakis
	IPEC talk Ilan Doron, Ariel Kulik and Hadas Shachnai Budgeted Matroid Maximization: a Parameterized Viewpoint	session starts 9:30	session starts 9:30	ALGOWIN talk Yeganeh Bahoo, Somnath Kundu and Kody Manastyrski Segment Visibility for $k$-transmitters


	IPEC talk Timothé Picavet, Mathieu Mari and Michał Pilipczuk A parameterized approximation scheme for the 2D-Knapsack problem with wide items	WAOA talk Vítor G. Chagas, Elisa Dell’Arriva and Flavio K. Miyazawa Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes	ATMOS talk Boris Grimm, Ralf Borndörfer and Julian Bushe Assignment Based Resource Constrained Path Generation for Railway Rolling Stock Optimization


	IPEC talk Baris Can Esmer, Ariel Kulik, Daniel Marx, Daniel Neuen and Roohani Sharma Approximate Monotone Local Search for Weighted Problems	WAOA talk 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		ALGOWIN best paper David C. Kutner and Laura Larios-Jones Temporal Reachability Dominating Sets: contagion in temporal graphs
			ATMOS talk Philip de Bruin, Marjan van den Akker, Han Hoogeveen and Marcel van Kooten Niekerk Scheduling Electric Buses with Stochastic Driving Times

	IPEC talk Matthias Bentert, Jannik Schestag and Frank Sommer On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model	WAOA talk Philip Cervenjak, Junhao Gan and Anthony Wirth Fast Parallel Algorithms for Submodular p-Superseparable Maximization

			ATMOS talk Fabian Löbel, Ralf Borndörfer and Steffen Weider Non-linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates
	IPEC talk Pål Grønås Drange, Patrick Greaves, Irene Muzi and Felix Reidl Computing complexity measures of degenerate graphs	WAOA talk Allan Borodin and Christodoulos Karavasilis Any-Order Online Interval Selection		session ends 10:15


10:30	Coffee break
11:00	Session: 73, chair: Riccardo Dondi	Session: 74, chair: Evangelos Kranakis	Session: 75, chair: Niels Lindner
	IPEC talk Mark Jones and Jannik Schestag How can we Maximize Phylogenetic Diversity? Parameterized Approaches for Networks	ALGOWIN keynote Sándor P. Fekete Coordinated Motion Planning: Reconfiguring a Swarm of Robots	ATMOS talk Aigerim Saken and Stephen Maher Subproblem separation in logic-based Benders’ decomposition for the vehicle routing problem with local congestion	ALGOWIN keynote takes place in Euler room


	IPEC talk Jaroslav Garvardt, Malte Renken, Jannik Schestag and Mathias Weller Finding Degree-Constrained Acyclic Orientations
			ATMOS talk Bart van Rossum, Rui Chen and Andrea Lodi Optimizing Fairness Over Time With Homogeneous Workers

	IPEC talk Jaroslav Garvardt, Nils Morawietz, André Nichterlein and Mathias Weller Graph Clustering Problems under the Lens of Parameterized Local Search

			ATMOS talk Mette Wagenvoort, Martijn van Ee, Paul Bouman and Kerry Malone Simple policies for capacitated resupply problems
	IPEC talk Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan and Petra Wolf Cluster Editing with Overlapping Communities


12:00			ATMOS closing remarks
12:30	Lunch

Sponsors: