Program

The registration desk is located at the main entrance of the Department of Human Studies and is open from Monday to Friday, from 8:00 until the end of each day’s program. To avoid queues on Monday, you can also register on Sunday, August 30, between 17:00 and 19:00.

Plenary talks will take place in the Alessandro Clementi Room (Floor -1).

ESA
IPEC
WABI
ATMOS
WAOA
ALGOWIN
ALGOCLOUD

Monday August 31

	Room: A. Clementi (floor -1) Session chair Gonzalo Navarro Parallel session 1	Room: 0.A (floor 0) Session chair László Kozma Parallel session 2	Room: 1.A (floor 1) Session chair Nick Fischer Parallel session 3	Room: 2.A (floor 2) Session chair Deeparnab Chakrabarty Parallel session 4	Room: 1.D (floor 1) Session chair Fabio Vanding
8:40	ESA Talk Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Pawel Gawrychowski, Adam Górkiewicz and Srinivasa Rao Satti	ESA Talk Pure Nash Equilibria in Graphical Games of Bounded Width Revisited Michael Lampis and Yiren Lu	ESA Talk A dynamic (1+ε)-spanner for disk intersection graphs Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Johanne Vistisen and Sampson Wong	ESA Talk Optimal Enumeration of Eulerian Trails in Directed Graphs Ben Bals, Solon P. Pissis and Matei Tinca	WABI Keynote Algorithms for Cell Lineage Tracing: From Trees to Differentiation Maps Ben Raphael
8:57	ESA Talk Practical Bit Vectors Supporting Constant Time Rank and Select in Optimal Space Florian Kurpicz, Niccolò Rigi-Luperti and Peter Sanders	ESA Talk Strategyproof Mechanisms Without Money for 2-Exchange Systems Javier Cembrano, Max Klimm, Martin Knaack and Arturo Merino	ESA Talk Algorithm Exercises Skyline and Young Tableau: Divide-and-Conquer Revisited Gerth Stølting Brodal	ESA Talk Warm-Starting All-Pairs Shortest Paths with Predictions Adam Polak and Jonas Schmidt
9:14	ESA Talk Deconstructed Learned Indexes and their Smoothed Analysis Stefan Hermann, Mattia Odorisio, Peter Sanders and Stefan Walzer	ESA Talk Improved Bounds for Strategy Improvement Algorithms for Energy Games Dani Dorfman, Haim Kaplan and Uri Zwick	ESA Talk Matching in geometric uniform hypergraphs Matthew Katz, Yuval Nidam, Rachel Saban and Micha Sharir	ESA Talk Hierarchical Spanners Davide Bilò, Luciano Gualà, Stefano Leucci and Guido Proietti, Alessandro Straziota
9:31	ESA Talk Non-minimal k-perfect hashing: Tight lower bounds and an application to fast static hash tables Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders and Stefan Walzer	ESA Talk The Complexity of Stackelberg Pricing Games Christoph Grüne, Dorothee Henke, Eva Rotenberg and Lasse Wulf	ESA Talk Small Independent Sets versus Small Separator in Geometric Intersection Graphs Malory Marin and Rémi Watrigant	ESA Talk A General Reduction from Near-Additive Emulators to Near-Exact Hopsets Julian Aeri, Sebastian Forster and Mara Grilnberger
9:48	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair John Iacono Parallel session 1	Room: 0.A (floor 0) Session chair Petr Golovach Parallel session 2	Room: 1.A (floor 1) Session chair Sabine Storandt Parallel session 3	Room: 2.A (floor 2) Session chair Robert Krauthgamer Parallel session 4	Room: 1.D (floor 1) Session chair Fabio Vandin
10:15	ESA Talk Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection Ivor van der Hoog, Eva Rotenberg and Daniel Rutschmann	ESA Talk Advances in Exact and Approximate Group Closeness Centrality Maximization Christian Schulz, Jakob Ternes and Henning Martin Woydt	ESA Talk Smallest convex hulls of polygons Mook Kwon Jung and Hee-Kap Ahn	ESA Talk DAG Covers: The Steiner Point Effect Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein and Da Wei Zheng	WABI Talk Is level-1 blob reconstruction under the network multispecies coalescent easy? Junyan Dai and Erin Molloy.
10:32	ESA Talk A Quadratic Lower Bound for Stable Roommates Solvability Will Rosenbaum	ESA Talk Adaptive Sampling for Minimum-Norm k-Clustering Haripriya Pulyassary and Chaitanya Swamy	ESA Talk Decomposing a Simple Polygon with Geodesic Unit-Balls Reilly Browne and Prahlad Narasimhan Kasthurirangan	ESA Talk Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles Deeparnab Chakrabarty and Hang Liao	WABI Talk Exact and Efficient Inference of Tumor Phylogenies via Novel Pruning Techniques. Juan Luque, Arjun Subramanian, Aravind Srinivasan, Salem Malikic and S. Cenk Sahinalp.
10:49	ESA Talk On the Communication Complexity of Maximum Matching and Shortest Paths Yu Cheng, Tianle Jiang, Pachara Sawettamalya and Huacheng Yu	ESA Talk Sublinear Algorithms for Estimating Single-Linkage Clustering Costs Pan Peng, Christian Sohler and Yi Xu	ESA Talk Bicriteria Polygon Aggregation with Arbitrary Shapes Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann and Jonas Sauer	ESA Talk Strongly Polynomial Parallel Maximum Flow Revisited Adam Karczmarz and Paweł Pilarski	WABI Talk Statistical Inconsistency of Error-correction Objectives for Perfect Phylogenies. Gryte Satas, Matthew Myers and Sohrab Shah
11:06	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Seth Pettie
11:30	ESA Keynote Proofs of Useful Work from Arbitrary Matrix Multiplication Omri Weinstein
12:30	Lunch at Lugi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Sabine Storandt Parallel session 1	Room: 0.A (floor 0) Session chair Will Rosenbaum Parallel session 2	Room: 1.A (floor 1) Session chair Stefan Walzer Parallel session 3	Room: 2.A (floor 2) Session chair Prantar Ghosh Parallel session 4	Room: 1.D (floor 1) Session chair Guillaume Marçais
14:00	ESA Talk Shifting is Optimal under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes Manuel Cáceres, Sándor Kisfaludi-Bak and Saeed Odak	ESA Talk Theoretical Analysis of Byte-Pair Encoding László Kozma and Johannes Voderholzer	ESA Talk The Presort Hierarchy for Geometric Problems Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson and Lasse Wulf	ESA Talk Optimal Union Probability Interval Is NP-Hard Petteri Kaski, Heikki Mannila and Chandra Kanta Mohapatra	WABI Talk Discriminative learning of substitution matrices and gap penalties for pairwise alignment of biological sequences. Michał Ciach, Elissavet Zacharopoulou, Michał Startek, Błażej Miasojedow and Panagiotis Alexiou.
14:17	ESA Talk Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs Nathan Wallheimer, Amir Abboud and Ron Safier	ESA Talk Compact representations of pattern-avoiding permutations László Kozma and Michal Opler	ESA Talk On Small Pair Decompositions for Point Sets Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs and Sampson Wong	ESA Talk Optimality-Preserving Data Reduction for Maximum k-Cut Michael Kaibel and Petra Mutzel	WABI Talk Towards a Unified Exact Solution of Rearrangement Small Parsimony for Natural Genomes. Leonard Bohnenkämper and Daria Frolova.
14:34	ESA Talk String Matching in (Block) Graphs: A Full Classification by Walk Length Sebastian Angrick, Ben Bals, Pawel Gawrychowski, Solon P. Pissis and Yuki Yonemoto	ESA Talk Hardness of Frequency-Related Queries on Compressed Strings Rajat De and Dominik Kempa	ESA Talk Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams Kevin Buchin, Mark Joachim Krallmann and Frank Staals	ESA Talk Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions Sang-il Oum and Marek Sokołowski	WABI Talk On the complexity of the (l, k)-Median Problems. Luís Felipe Cunha, Thiago Nascimento, Marília Braga and Jens Stoye.
14:51	ESA Talk Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products Indu Ramesh and Christopher Musco	ESA Talk Incongruity-sensitive access to highly compressed strings Ferdinando Cicalese, Travis Gagie, Zsuzsanna Liptak, Gonzalo Navarro, Nicola Prezza and Cristian Urbina	ESA Talk Shortest Path Map Equivalence Decompositions and Applications Haitao Wang	ESA Talk Incremental Submodular Maximization: Better Than Greedy Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa, Yann Disser and Annette Lutz	WABI Talk Anchored Edit Distance in O(n log log n)-time using Colinear Chaining. Nicola Rizzo and Ragnar Groot Koerkamp.
15:08	ESA Talk Robustifying Sparse Matrix Multiplication Karl Bringmann, Nick Fischer and Vassilios Nakos	ESA Talk Dynamic Grammar-Compressed Self-Index in δ-Optimal Space Takaaki Nishimoto and Yasuo Tabei	ESA Talk Benchmarking and Engineering Data Structures for Spherical Range Queries Thomas Bläsius, Jean-Pierre von der Heydt, Tobias Kempf, Dennis Kobert and Nikolai Maas	ESA Talk Data-dependent Evaluations for Budgeted Submodular Maximization Lejian Zhang, Xueyan Tang and Jing Tang	WABI Talk Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements. Ryosuke Yamano and Tetsuo Shibuya.
15:25	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Dan Hermelin Parallel session 1	Room: 0.A (floor 0) Session chair Magnus Wahlström Parallel session 2	Room: 1.A (floor 1) Session chair Deeparnab Chakrabarty Parallel session 3	Room: 2.A (floor 2) Session chair Guillaume Ducoffe Parallel session 4	Room: 1.D (floor 1) Session chair Jens Stoye	Room: 1.G (floor 1) Session chair Bernardino Romera-Paredes
15:50	ESA Talk Online Demand Strip Packing Sebastian Bruchhold, Franziska Eberle, Georgios Moneftsis, Malin Rau and Albert Vesterlund	ESA Talk Partition Rank and Algebraic Circuit Lower Bounds Cornelius Brand, Petteri Kaski and Jiaheng Wang	ESA Talk Multiple-Choice Knapsack with Small Items Jakub Pawlewicz	ESA Talk Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs Paweł Rafał Bieliński, Marta Piecyk and Paweł Rzążewski	WABI Talk Minimum flow decomposition guided by saturating subflows. Ke Chen, Abhishek Talesara, Sanchal Thakkar and Mingfu Shao.	ALGOCLOUD Talk A Brief Comparison of Node- and Link-Disjoint Fast Failover Routing Algorithms for Node- and Link-Failures Stephanie Althoff, Klaus-Tycho Foerster and Ammar Gamous
16:07	ESA Talk Beyond Monotone Delays for Multi-Level Aggregation Yossi Azar and Liad Iluz	ESA Talk Reducing CMSO to Unbreakable Graphs Cannot be Computable Colin Geniet and Roohani Sharma	ESA Talk An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers Yusuke Kobayashi and Takashi Noguchi	ESA Talk Conflict-Free Coloring Planar Graphs with 4 Colors Petr Hlineny and Lukas Malik	WABI Talk Contig model for variable-order de Bruijn graphs. Diego Diaz, Pierfrancesco Martinello, Taku Onodera, Simon Puglisi and Leena Salmela.	ALGOCLOUD Talk Algorithmic Recourse on Temporal Networks: A survey proposal Christos Konstantopoulos and Kostas Tsichlas
16:24	ESA Talk Learning-Augmented Online Sorting and TSP Ioana O. Bercea, Gerth Stølting Brodal, John Iacono, László Kozma and Debmalya Panigrahi	ESA Talk A simple algorithmic framework for disambiguation of finite automata Mauricio Cari, Martín Muñoz and Cristian Riveros	ESA Talk Exploiting Spanning Trees for Directed Acyclicity Sergei Khargeliia and Danil Sagunov	ESA Talk Linear-Time Vertex-Connectivity on Bounded Genus Sergio Cabello, Alexander Dobler, Gašper Fijavž, Thekla Hamm and Mirko H. Wagner	WABI Talk Efficient Algorithms for Pangenome Personalization. Denys Andrukhovskyi, Martin Madzin, Luca Denti, Tomas Vinar and Broňa Brejová	ALGOCLOUD Talk Evaluation of TCP Slow Start Algorithms for Low Earth Orbit Satellite Environments Ioannis Angelis, Georgios Tsoumanis, George Koufoudakis and Konstantinos Oikonomou
16:41	ESA Talk Primal-Dual Online Algorithms for the Parking Permit Problem Christian Coester and Alexander Turoczy	ESA Talk On Computing Minimum Wheeler DFA From Their Language Ruben Becker, Davide Cenzato, Nicola Prezza and Daniel Puttini	ESA Talk One-Exact Approximate Pareto Sets for APX-hard Multiobjective Problems Fritz Bökler, Markus Chimani and Henning Jasper	ESA Talk Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time Da Wei Zheng	WABI Talk Reconciling and comparing variation graphs using homology relations. Anna Lisiecka, Adam Cicherski and Norbert Dojer.	ALGOCLOUD business meeting
16:58	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Bingkai Lin Parallel session 1	Room: 0.A (floor 0) Session chair Sebastian Wild Parallel session 2	Room: 1.A (floor 1) Session chair Nick Fischer Parallel session 3	Room: 2.A (floor 2) Session chair Stefan Walzer Parallel session 4	Room: 1.D (floor 1)
17:25	ESA Talk Moderately Beyond Clique-Width: Reduced Component Max-Leaf and Related Parameters Édouard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet and O-Joung Kwon	ESA Talk The Prophet and the Voronoi Diagram Sariel Har-Peled	ESA Talk Symmetry-Preserving Graph Compression Markus Anders, Manuel Penschuck and Pascal Schweitzer	ESA Talk On the Assadi–Liu–Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance Christian Konrad, Kheeran Naidu, Archie Walton and Eric Wang	WABI business meeting
17:42	ESA Talk The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs Jakob Greilhuber and Dániel Marx	ESA Talk Sliding Cubes in Parallel Hugo A. Akitaya, Joseph Dorfer, Peter Kramer, Christian Rieck, Gabriel Shahrouzi and Frederick Stock	ESA Talk Efficient Uniform Negative Edge Weights Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck and Hung Tran	ESA Talk Characterizing Streaming Decidability of CSPs via Non-Redundancy Amatya Sharma and Santhoshini Velusamy
17:59	ESA Talk Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann and Roohani Sharma	ESA Talk Strong ILP Formulations for the p-Regions Problem Daniel Faber, Petra Mutzel and Jan-Henrik Haunert	ESA Talk Dynamic Dominating Set in Uniformly Sparse Graphs Anton Bukov and Shay Solomon	ESA Talk An LCA for approximated MST in general bounded-degree graphs Reut Levi, Moti Medina and Daniel Prigan
18:16	ESA Talk A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth Stefan Kratsch	ESA Talk Persistent homology on GPU for 1d and 2d cubical filtrations Marc Glisse	ESA Talk Dynamic Detours Daniel Dadush, Michał Pilipczuk, Amadeus Reinald, Marek Sokołowski and Michał Włodarczyk	ESA Talk No Time to Interact: Simulating Population Protocols at Scale Lukas Hintze and Manuel Penschuck
18:33	(Free time)
19:30	Welcome at Palazzo dell’Emiciclo

On small screens, scroll the timetable horizontally.

Tuesday September 1

	Room: A. Clementi (floor -1) Session chair Nick Fischer Parallel session 1	Room: 0.A (floor 0) Session chair Seth Pettie Parallel session 2	Room: 1.A (floor 1) Session chair Prantar Ghosh Parallel session 3	Room: 2.A Session chair Michael Lampis Parallel session 4	Room: Aula Magna – Luigi Zordan Building Session chair Brona Brejova	Room: 1.G (floor 1) Session chair Christos Zaroliagis
8:40	ESA Talk Unconditional Lower Bounds for Degree Fault Tolerant Spanners Greg Bodwin and Aleksey Lopez	ESA Talk Near-Optimal Heaps and Dijkstra on Pointer Machines Ivor van der Hoog, John Iacono, Eva Rotenberg and Daniel Rutschmann	ESA Talk Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces Eunjin Oh and Hyeonjun Shin	ESA Talk Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width Thobias Kvalvik Høivik and Erlend Raa Vågset	WABI Talk FTP Learning of Sparse, Robust and Interpretable Generative models of RNA evolution. Samuel Gardelle, Laurent Bulteau and Yann Ponty	ALGOCLOUD Talk Adaptive Multi-Armed Bandit Routing for Energy-Efficient Data Collection in IoT Edge Networks Georgios Tsoumanis, George Koufoudakis and Konstantinos Oikonomou
8:57	ESA Talk Revisiting Diameter in Directed Graphs Ben Bals, Joakim Blikstad, Daniel Dadush, Yasamin Nazari and Jonas Schmidt	ESA Talk Approximate Single Source Dual Fault Tolerant Distance Oracle Koustav Das and Manoj Gupta	ESA Talk A Strongly-Subquadratic (3+ε)-Approximation for the Fréchet Distance for Paths in Metric Spaces Thijs van der Horst and Tim Ophelders	ESA Talk Tight bounds for clique-packing parameterized by clique-width Narek Bojikian and Stefan Kratsch	WABI Talk CoSTAR: Coarse Stem-Topology Alignment of Pseudoknotted RNA Structures by Relation-Constrained Search. Finn Archinuk and Hosna Jabbari	ALGOCLOUD Talk Building Intelligence as a Service: Reusable, Adaptive ML for Smart Buildings Dimitrios Amaxilatis, Themistoklis Sarantakos, Nikolaos Tsironis, Kostas Ramantas, Jhofre Ojeda, Vasiliki Parousidou and Vasileios Theodorou
9:14	ESA Talk Tighter bounds for weighted and unweighted shortest cycle approximation Avi Kadria, Liam Roditty and Virginia Vassilevska Williams	ESA Talk All-Pairs k-th Mincuts: Generalizing ancestor tree of Cheng and Hu Anupam Roy and Surender Baswana	ESA Talk Abstract Color Voronoi Diagrams and Circular Sequences of Color Permutations Sang Won Bae, Nicolau Oliver and Evanthia Papadopoulou	ESA Talk Separating Geodesic Structure and Product Structure Laura Merker, Lena Scherzer and Samuel Schneider	WABI Talk RNA Inverse Folding Under Stacked Base Pairs Maximization. Théo Boury, Laurent Bulteau and Yann Ponty.	ALGOCLOUD Talk Lightweight Query-Adaptive Weighted Rank Fusion for Hybrid Retrieval on the Cloud-Edge Continuum Konstantinos Anastasopoulos, Spyros Sioutas and Christos Zaroliagis
9:31	ESA Talk Improved Approximation Algorithms for n-Pairs Shortest Paths Avi Kadria, Liam Roditty and Virginia Vassilevska Williams	ESA Talk Virtual-Memory Powersort Finn Moltmann, Tamio-Vesa Nakajima and Sebastian Wild	ESA Talk Instance and Universally Optimal Bounds for Imprecise Pareto Fronts Sarita de Berg, Nynne Maria Foldager Bække, Frida Astrup Eriksen, Ivor van der Hoog, Eva Rotenberg and Daniel Rutschmann	ESA Talk Towards the Recognition of Oriented Interval Graphs Lukas Patrick Bachmann, Jiri Fiala, Ignaz Rutter, Peter Stumpf, Miriam Münch and Alexander Wolff	WABI Talk PRISM: Partition-Function Decomposition into Structural Classes for Hierarchically Constrained RNA Pseudoknot Ensembles. Mateo Gray, Sebastian Will and Hosna Jabbari.	ALGOCLOUD Talk Bi-objective Replication Aware Workflow Scheduling in the Cloud Continuum Konstantinos Karathanasis, Spyros Kontogiannis and Christos Zaroliagis
9:48	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Will Rosenbaum Parallel session 1	Room: 0.A (floor 0) Session chair Magnus Wahlström Parallel session 2	Room: 1.A (floor 1) Session chair Dan Hermelin Parallel session 3	Room: 2.A (floor 2) Session chair Christian Sohler Parallel session 4	Room: Aula Magna – Luigi Zordan Building Session chair Erin Molloy	Room: 1.G (floor 1) Session chair Georgios Tsoumanis
10:15	ESA Talk Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams Hoang Ta and Hoa Vu	ESA Talk Answering Related Questions Édouard Bonnet	ESA Talk Graph Scheduling with Group Completion Times Lars Rohwedder and Leander Schnaars	ESA Talk Computational Boundaries for Escaping Rectangles Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abishek Sahu, Saket Saurabh and Kushal Singanporia	WABI Talk Construction of distinct k-mer color sets via set fingerprinting. Jarno Alanko and Simon Puglisi.	ALGOCLOUD Talk Self-Consuming Generative Models and Synthetic Data Augmentation Cloud-Edge Systems Ioannis Kleitsiotis, Spyros Sioutas, George Tsirogiannis and Christos Zaroliagis
10:32	ESA Talk Optimal Stochastic Online Sorting Daniel Anker Hermansen	ESA Talk On the Hardness of Optimal Motion on Trees Tzvika Geft	ESA Talk T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks Jonas Sauer, Patrick Steil and Sascha Witt	ESA Talk Parameterized Approximation of Rectangle Stabbing Huairui Chu, Ajaykrishnan E S, Daniel Lokshtanov, Anikait Mundhra, Thomas Schibler, Xiaoyang Xu and Jie Xue	WABI Talk Fast Set Operations for Compact k-mer Sets. Jarno Alanko, Lore Depuydt, Camille Marchet and Simon Puglisi.	ALGOCLOUD Talk When Neurons Meet Neighborhoods: Bridging Neural Networks with Nearest Neighbors Ioannis Souliotis, Gerasimos Vonitsanos, Ioannis Kouretas, Ioanna Giannoukou and Spyros Sioutas
10:49	ESA Talk On the Adversarial Robustness of Online Importance Sampling Yotam Kenneth-Mordoch and Shay Sapir	ESA Talk Dichotomies for \#CSP on graphs that forbid a clique as a minor Boning Meng and Yicheng Pan	ESA Talk Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones Thomas Erlebach, Kelin Luo and Wen Zhang	ESA Talk Covering Points with Rectangular Boundaries Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi, Saket Saurabh and Kushal Singanporia	WABI Talk Quantum Closest-Pair Search for Biological Sequences via k-mer Distribution Statistics. Zhezheng Xander Song and Carl Kingsford.	ALGOCLOUD Talk ML Driven Reanalysis of Public Proteomics Datasets: How quantms and MS2Rescore Unlock Hidden Peptide Spectra Harsh Shailesh Dankhara
11:06	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Seth Pettie
11:30	ESA Keynote History Independence as an Algorithmic Tool William Kuszmaul
12:30	Lunch at Lugi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Georgios Tsoumanis
14:00	ALGOCLOUD Keynote Evolving Superhuman Algorithms for Online Optimization Problems Bernardino Romera Paredes
15:00	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Sabine Storandt
15:25	ESA Track A Best Paper Fast Metric Decompositions in High Dimension Robert Krauthgamer, Asaf Petruschka and Nir Petruschka
15:45	ESA Track E Best Paper SimdQuickHeap: The QuickHeap Reconsidered Johannes Breitling, Ragnar Groot Koerkamp and Marvin Williams
16:05	ESA Track S Best Paper The Power of the Score Sequence of a Tournament Prantar Ghosh, Sahil Kuchlous, Shravan Mehra and Sagnik Mukhopadhyay
16:25	ESA Best Student Paper Greedy Completion for Weighted (α,β)-Spanners Elad Tzalik
16:45	(Free time)
17:00	Social Event
19:30	Dinner at Magione Papale

On small screens, scroll the timetable horizontally.

Wednesday September 2

	Room: A. Clementi (floor -1) Session chair Petra Mutzel Parallel session 1	Room: 0.A (floor 0) Session chair Robert Ganian Parallel session 2	Room: 1.A (floor 1) Session chair Anna Zych-Pawlewicz Parallel session 3	Room: 2.A (floor 2) Session chair Seth Pettie Parallel session 4	Room: 1.G (floor 1) Session chair Michael Lampis	Room: Aula Magna – Luigi Zordan Building Session chair Gryte Sata
8:40	ESA Talk On The See-Through Watchman Route Problem and The Quota-TSP Problem on Infinite Lines Joseph Mitchell and Linh Nguyen	ESA Talk A more versatile model for enumerative kernelization: a case study for Vertex Cover Marin Bougeret, Guilherme de Castro Mendes Gomes and Ignasi Sau	ESA Talk New Algorithms and Hardness Results for Connected Clustering Jan Eube and Heiko Röglin	ESA Talk Quantum Time-Space Tradeoffs for Exponential Dynamic Programming Susanna Caroppo, Jevgēnijs Vihrovs, Dārta Zajakina and Aleksejs Zajakins	IPEC Talk New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof and Shengzhe Wang	WABI Talk GSI: A New Approach to the Protein Inference Problem. Aurélien Berthier, Emile Benoist, Guillaume Fertin and Géraldine Jean.
8:57	ESA Talk Fast Algorithms for Continuous Optimal Transport between Histograms Pankaj Agarwal, Sharath Raghvendra and Keegan Yao	ESA Talk Tree-independence number of P₅-free graphs with no large bicliques Václav Blažej, J. Pascal Gollin, Tomáš Hons, Tomáš Masařík, Martin Milanič, Paweł Rzążewski, Ondřej Suchý and Alexandra Wesolek	ESA Talk High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing Nikolai Maas	ESA Talk On estimating operator norm distance, with optimal trace distance estimation when one state is pure Yupan Liu, Qisheng Wang and Zhan Yu	IPEC Talk Fast and Practical Single-Exponential Algorithms for Branchwidth Taiki Kaneda, Yasuaki Kobayashi and Hisao Tamaki	WABI Talk Theoretically and Practically Faster Algorithms for Protein Structure Alignment. Masahito Tsukahara and Tetsuo Shibuya.
9:14	ESA Talk Maximum Coverage k-Antichains and Chains: A Greedy Approach Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak and Alexandru I. Tomescu	ESA Talk Kernelization for H-Packing Revisited Tomohiro Koana and Soh Kumabe	ESA Talk Exact ratio preservation via outliers for fair k-center clustering Anna Arutyunova, Irina Fast, Annika Hennes, Carsten Krollmann, Daniel R. Schmidt and Melanie Schmidt	ESA Talk Log-concavity and tunneling: quantum adiabatic algorithm for convex functions (with a spike) Elie Bermot, Simon Apers and Arthur Braida	IPEC Talk A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth Dongyun Byun and Akira Matsubayashi	WABI Talk FBApro: A fast, simple linear transformation for diverse metabolic modeling tasks. Ariel Bruner and Mona Singh.
9:31	ESA Talk Approximation Algorithms for the Traveling Thief Problem Jan Eube, Kelin Luo, Heiko Röglin and Sarah Sturm	ESA Talk An FPT Algorithm for Diverse Minimum s-t Cuts Krishnan Dehaleesan, Fedor Fomin, Petr Golovach, Laure Morelle and Pål Drange	ESA Talk Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs Guillaume Ducoffe	ESA Talk A 0.8395-approximation algorithm for the EPR problem James Sud, Anuj Apte, Kunal Marwaha, Ojas Parekh, Eunou Lee and Lennart Sinjorgo	IPEC Talk Fast Parameterized Algorithms for Matching Cut and d-Cut Ruchir Bansal, Dalu Jacob, Soumen Mandal, Ashutosh Rai and Navneet Raj	WABI Talk DivQuant: Estimation of Species Richness and Entropy from Small Samples. Johanna Elena Schmitz and Sven Rahmann.
9:48	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Spyros Kontogiannis Parallel session 1	Room: 0.A (floor 0) Session chair Prantar Ghosh Parallel session 2	Room: 1.A (floor 1) Session chair Gonzalo Navarro Parallel session 3	Room: 2.A (floor 2) Session chair Shay Solomon Parallel session 4	Room: 1.G (floor 1) Session chair Dan Hermelin	Room: Aula Magna – Luigi Zordan Building Session chair Tomas Vinar
10:15	ESA Talk Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting Dmitriy Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii, Maxim Klimenko, Dmitry Malyshev and Stanislav Moiseev	ESA Talk Streaming with Catalytic Memory Nimrod Kaplan, Haim Kaplan and Tamara Kaplan	ESA Talk Nearly Optimal Internal Dictionary Matching Jingbang Chen, Jiangqi Dai, Qiuyang Mang, Qingyu Shi and Tingqiang Xu	ESA Talk On the Stability of Minimum-Weight Perfect Matching on the Line Mark de Berg, Ulrike Schmidt-Kraepelin and Andree Stef	IPEC Talk (best student paper) From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants Max Göttlicher, Lennard Hofmann and Christoph Niederbudde	WABI Talk 10-minimizers: a promising class of constant-space minimizers. Arseny Shur, Ido Tziony and Yaron Orenstein.
10:32	ESA Talk Adaptive Sparsification for Linear Programming Etienne Objois and Adrian Vladu	ESA Talk Online Flow Time Minimization with Gradually Revealed Jobs Alexander Lindermayr, Guido Schäfer, Jens Schlöter and Leen Stougie	ESA Talk Text Indexing: From Reporting to Counting Ben Bals, Panagiotis Charalampopoulos, Oded Lachish, Solon P. Pissis and Hilde Verbeek	ESA Talk Unimodal-Cost $k$-Median on a Line Yike Chen and Chao Xu	IPEC Talk Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties Radu Curticapean and Mingjun Liu	WABI Talk The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme. Ragnar Groot Koerkamp.
10:49	ESA Talk Dynamic Matroids: Base Packing and Covering Tijn de Vos and Mara Grilnberger	ESA Talk A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering Akitoshi Kawamura and Yusuke Kobayashi	ESA Talk Online Approximate Circular Pattern Matching in Small Space Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Paweł Gawrychowski and Tatiana Starikovskaya	ESA Talk Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces Ilan Newman, Noam Licht and Yuri Rabinovich	IPEC Talk On k-Bounded Nondeterminism for Branching Programs and Circuits Anselm Haak, Arne Meier and Raghavendra Rao B V	WABI Talk Designing exact k-mer filters based on hits and coverage. Moein Karami, Jens Zentgraf and Sven Rahmann.
11:06	ESA Talk Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting Tatiana Rocha Avila, Lars Rohwedder and Leo Wennmann	ESA Talk Online and Incremental Fractional Vertex Cover on Trees Júlia Baligács, Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Grzegorz Gutowski, Katarzyna Kępińska, Paweł Putra and Anna Zych-Pawlewicz	ESA Talk Indexing Integer Strings Using Local Difference Bounds Daniel Gibney, Kaamil Kaka and Sharma Thankachan	ESA Talk Sparse Oriented Spanners in Metric Spaces Sujoy Bhore, Ahmad Biniaz, Kevin Buchin, Jean-Lou De Carufel, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs and Michiel Smid	IPEC Talk Independent Set Hardness in Graphs of Bounded Twin-Width and Merge-Width Édouard Bonnet, Maël Dumas and Julien Duron	WABI Talk Finimap: fast approximate single-species bacterial pseudoalignment with finimizers. Jarno Alanko, Elena Biagi and Simon Puglisi.
11:23	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Erik Jan van Leeuwen					Room: Aula Magna – Luigi Zordan Building Session chair Nadia El-Mabrouk
11:45	IPEC Keynote Old and New Parameterized Algorithms for k-Path Jesper Nederlof					WABI Keynote Algorithmic toolkits for pangenomes. Nadia Pisanti
12:45	Lunch at Lugi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Michael Lampis
14:15	IPEC Nerode Prize Keynote Parameterized Complexity of k-Biclique and Its Impact Bingkai Lin
15:15	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Sabine Storandt Parallel session 1	Room: 0.A (floor 0) Session chair Guillaume Ducoffe Parallel session 2	Room: 1.A (floor 1) Session chair Sebastian Wild Parallel session 3	Room: 2.A (floor 2) Session chair László Kozma Parallel session 4	Room: 1.G (floor 1) Session chair Jesper Nederlof	Room: Aula Magna – Luigi Zordan Building Session chair Zsuzsanna Liptak
15:40	ESA Talk Rerouting Curves on Surfaces Timo Brand, Stefan Felsner, Henry Förster, Stephen Kobourov, Anna Lubiw, Yoshio Okamoto, János Pach, Csaba D. Tóth, Géza Tóth, Torsten Ueckerdt and Pavel Valtr	ESA Talk On the complexity of Multipacking Sandip Das, Sk Samim Islam and Daniel Lokshtanov	ESA Talk Multi Choice Min Prophet Yossi Azar, Itamar Biran and Amos Fiat	ESA Talk Approximation Algorithms for Machine Minimization Mohsen Mohammadi and Mohammad Salavatipour	IPEC Talk On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering Ameet Gadekar	WABI Talk Quick 2.0: Efficient Large-Scale DNA Barcode Calling. Steffen Schüler, Antonia Schmidt and Matthias Müller-Hannemann.
15:57	ESA Talk Time Series Decomposition using the Fréchet Distance Anne Driemel, Jan Höckendorff, Ioannis Psarros and Christian Sohler	ESA Talk FPT algorithms over linear delta-matroids with applications Eduard Eiben, Tomohiro Koana and Magnus Wahlström	ESA Talk Faster Exponential-Time Approximate Counting via Bounded Self-Reductions Katie Clinch, Serge Gaspers, Simon Mackenzie and Qi Wang	ESA Talk Faster Exponential Algorithms For Multi-Machine Scheduling Problems Anita Dürr, Karol Węgrzycki, Anubhav Dhar, Jakob Greilhuber and Ahmed Ghazy	IPEC Talk Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm Fedor Fomin, Petr Golovach and Yash More	WABI Talk Selecting Chromosomes for Polygenic Traits: Algorithms and Complexity. Or Zuk.
16:14	ESA Talk Dimension Reduction for Curves — Simplified and Generalized Matthijs Ebbens, Jie Lu and Alexander Munteanu	ESA Talk Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii Thomas Depian and Frank Sommer	ESA Talk Online Coloring for Graphs of Large Odd Girth Hirotaka Yoneda and Masataka Yoneda	ESA Talk Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility Robert Bredereck, Till Fluschnik and Klaus Heeger	IPEC Talk Weighted chromatic correlation clustering and a parameterized algorithm Kensuke Oowa and Takuro Fukunaga	WABI Talk Turnpike with Uncertain Measurements: Triangle-Equality Integer Programming with a Deterministic Recovery Guarantee. Shane Elder, Guillaume Marçais and Carl Kingsford.
16:31	ESA Talk Triangle Nearest-Neighbor Searching in 3-Space Pankaj Agarwal, Esther Ezra and Micha Sharir	ESA Talk Maximizing Reachability via Shifting of Temporal Paths Argyrios Deligkas, Michelle Döring, Eduard Eiben, George Skretas and Georg Tennigkeit			IPEC Talk Eccentricity Shortest Path is W[1]-hard parameterized by Distance to Spider Graphs Sriram Bhyravarapu and A Mohanapriya	WABI Talk Constructing Incompatibility Graphs of Pairs of Trees in Optimal Output-Sensitive Time. Manuel Lafond.
16:48	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1)
17:10	ESA Test of time award Techniques and Applications for AMQ Structures, and where do Ideas come from? George Varghese
	Room: Aula Magna – Luigi Zordan Building
18:15	ESA Business meeting

On small screens, scroll the timetable horizontally.

Thursday September 3

	Room: 1.A (floor 1) Session chair Prudence Wong	Room: 0.A (floor 0) Session chair Valentina Cacchiani	Room: A. Clementi (floor -1) Session chair Jarek Byrka	Room: Aula Magna – Luigi Zordan Building Session chair Roohani Sharma
8:40		ATMOS Talk Passenger-Based Intermodal Connection Optimization with Elastic Demands Paula Franke, Ralf Borndoerfer, Boris Grimm, Giovanni Luca Giacco, Tommaso Montino, Andrea Fraioli and Federico Marinucci	WAOA Talk The Target Date Scheduling Problem: Improved Upper and Lower Bounds Sven O. Krumke and Maren Manzke	IPEC Talk The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg and Marie Diana Sieper	8:40
				IPEC Talk Not All Degree Constraints Are Created Equal when Computing Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang and Krisztina Szilagyi	8:57
9:01	ALGOWIN Talk (best paper) Search and Rescue on the Plane Jared Coleman, Evangelos Kranakis, Oscar Morales Ponce and Danny Krizanc	ATMOS Talk Computing the Cost of Stability in Periodic Microscopic Railway Timetabling via Logic-Based Benders Decomposition Tongcheng Ouyang, Florian Flükiger-Fuchs, Bernardo Martin-Iradi and Francesco Corman	WAOA Talk Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard Benjamin Moseley, Kirk Pruhs, Marc Uetz, and Rudy Zhou
				IPEC Talk Routing Multiple Agents Below the Sum of Distances Matthias Bentert, Eduard Eiben, Fedor Fomin and Petr Golovach	9:14
9:22	ALGOWIN Talk Randomised Cop Strategies Under Zero-Visibility Constraints Tymofii Prokopenko and Igor Potapov	ATMOS Talk Time-Aware A* for Optimal Train Routing on Moving Block Systems Stefan Engels and Robert Wille	WAOA Talk Scheduling to Maximize Weighted Throughput with an Active-Time Budget Susanne Albers and Wessel van der Heijden
				IPEC Talk Faster Parameterized Broadcasting Édouard Bonnet, Carl Feghali and Manolis Vasilakis	9:31
9:43	Coffee break at Luigi Zordan Congress Center
				Coffee break	9:48
	Room: 1.A (floor 1) Session chair Nicola Santoro	Room: 0.A (floor 0) Session chair Matusz Mihalak	Room: A. Clementi (floor -1) Session chair Marcin Bieńkowski	Room: Aula Magna – Luigi Zordan Building Session chair Bingkai Lin
10:15	ALGOWIN Talk On the Control of Mobile Ad-Hoc Agent Deployments in Partially Observed Space Edwin Meriaux, Louis-Roy Langevin, Shuo Wen, Ndiamé Ndiaye, Gregory Dudek and Antonio Loría	ATMOS Talk Why Start Over: Incremental MaxSMT for Operational Railway Scheduling Thomas Dubach, Florian Flükiger-Fuchs and Bernardo Martin-Iradi	WAOA Talk Servicing Matched Client Pairs with Facilities Fateme Abbasi, Martin Böhm, Jarosław Byrka, Matin Mohammadi, and Yongho Shin	IPEC Talk (best paper) Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist and Magnus Wahlström	10:15
				IPEC Talk O(n)+f(k): Truly Linear FPT Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright, Michael R. Fellows, David C. Kutner, Laura Larios-Jones, Barnaby Martin, Frances Rosamond and Ella Yates	10:32
10:36	ALGOWIN Talk Dispersion and Maximal Independent Set Formation by Mobile Robots on Cylindrical Grids Himani and Supantha Pandit	ATMOS Talk Dispatching-Area Design Tomas Lidén, Christiane Schmidt and Rabii Zahir	WAOA Talk Approximation Algorithms for Colorful Rainbow Domination: a Facility Location Problem on Graphs Tetiana Lavynska
				IPEC Talk Exploring Minimal Blocking Sets for Kernelization Lower Bounds for F-Minor Deletion Jakob Greilhuber, Ahmed Ghazy and Tim A. Hartmann	10:49
10:57	ALGOWIN Talk Gathering Algorithm for Asynchronous Robots under the Adversarial (N, K)-Defected View Model Prakhar Shukla, Seshunadh Tanuj Peddinti and Subhash Bhagat	ATMOS Talk From Routes to Resources: A Model for Real-Time Train Dispatching with No-Wait Constraints Luka Stärk, Ralf Borndörfer and Niels Lindner	WAOA Talk Minimum-Membership Covering by Translates of a Convex Polygon Sathish Govindarajan and Siddhartha Sarkar
				Coffee break	11:06
11:18	Coffee break at Luigi Zordan Congress Center
	Room: A. Clementi (floor -1) Session chair Stefan Funke
11:40	ATMOS Keynote Optimizing Last-Mile Deliveries at Amazon Renato F. Werneck				11:40
12:40	Lunch at Lugi Zordan Congress Center				12:40
	Room: A. Clementi (floor -1) Session chair Monaldo Mastrolilli
14:10	WAOA Keynote Relaxations of Max-Cut and Beyond Standa Živný				14:10
15:10	Coffee break at Luigi Zordan Congress Center				15:10
	Room: 1.A (floor 1) Session chair Paola Flocchini	Room: 0.A (floor 0) Session chair Anita Schöbel	Room: A. Clementi (floor -1) Session chair Marc Uetz	Room: Aula Magna – Luigi Zordan Building
15:35		ATMOS Talk Adaptive Metaheuristics for Multi-objective Berth Allocation and Scheduling Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasilios Sofianos and Christos Zaroliagis	WAOA Talk Sublinear Edge Fault-Tolerant Hyperspanners for Hypergraphs Jialin He, Nicholas Popescu, and Chunjiang Zhu	IPEC PACE Awards	15:35
15:56	ALGOWIN Talk Network Restoration Games With Quotas Philip Bogaars, Argyrios Deligkas, Eduard Eiben and Michail Fasoulakis	ATMOS Talk Algorithmics for Safe Bicycle Network Design with Bounded Detours in Rural Areas Till Fluschnik	WAOA Talk Approximating the Network Design Problem for Potential-Based Flows Max Klimm, Marc Pfetsch, Martin Skutella, and Lea Strubberg
16:17	ALGOWIN Talk (best paper) Efficient algorithms for a drone multidepot segment covering problem Laurent Beaudou, Florent Foucaud, Lucas Lorieau and Pranabendu Misra	ATMOS Talk Scheduling Electric-Vehicle Charging under Grid Capacity and Minimum Charge rates Bruna Cavalcanti Lauro, Matúš Mihalák, Filip Schlembach and Evgueni Smirnov	WAOA Talk NP-Hardness and a PTAS for the Euclidean Steiner Line Problem Simon Bartlmae, Paul Jünger, and Elmar Langetepe
16:38	ALGOWIN Talk Min-Max k-tree cover problem with restricted \beta-triangle inequality Hong-Yang Huang and Li-Hsuan Chen	ATMOS Talk ASPaeroFlow: Decomposition Heuristics for Joint Air Traffic Flow & Capacity Management Alexander Beiser, Markus Hecher, Nysret Musliu, Georg Trausmuth and Stefan Woltran	WAOA Talk Online Rounding Schemes for Edge Cover Jarosław Byrka and Yongho Shin	IPEC PACE Poster Session San Basilio Room – Luigi Zordan Building (floor 0)	16:38
16:59	Small break				16:59
	Room: 1.A (floor 1)	Room: 0.A (floor 0)	Room: A. Clementi (floor -1) Session chair Monaldo Mastrolilli	Room: Aula Magna – Luigi Zordan Building Session chair Édouard Bonnet
17:10	ALGOWIN Business meeting	ATMOS Business meeting	WAOA Business meeting	IPEC Talk Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility Leo van Iersel, Mark Jones, Jannik Schestag, Celine Scornavacca and Mathias Weller	17:10
				IPEC Talk Computing Local 2-Separators Sarah Frenkel and Johannes Carmesin	17:27
				IPEC Talk Minimum Membership Dominating Set and Its Generalization: Leafage vs. Asteroidal Number Yuma Tamura, Daichi Wakayama, Akira Suzuki and Xiao Zhou	17:44
				IPEC Talk Identification to Subclasses of Chordal Graphs Petr Golovach, Laure Morelle and Daniel Paulusma	18:01
				(Small break)	18:18
				IPEC Community meeting	18:30
19:30	Dinner				19:30

On small screens, scroll the timetable horizontally.

Friday September 4

	Room: 1.A (floor 1) Session chair Evangelos Kranakis	Room: 0.A (floor 0) Session chair Matthias Müller-Hannemann	Room: A. Clementi (floor -1) Session chair Monaldo Mastrolilli	Room: Aula Magna – Luigi Zordan Building Session chair Petr Golovach
8:40		ATMOS Talk Integrated Line Planning and Strategic Ridepooling: Minimizing the Passengers' Travel Time Lena Dittrich, Sven Jäger and Anita Schöbel	WAOA Talk A 5/4 bound for graphic s-t path TSP on subcubic graphs Junho Hwang	IPEC Talk Structural Parameterizations for Eternal Vertex Cover Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani and Mateusz Rychlicki	8:40
				IPEC Talk An O*((2 + epsilon)^k) Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs Manuel Lafond and Francis Sarrazin	8:57
9:01	ALGOWIN talk Efficient K-Visibility Query in Polygons Roni Sherman and Yeganeh Bahoo	ATMOS Talk A Multimodal Framework for Transport Planning Lena Dittrich, Michael Rihlmann, Philine Schiewe and Anita Schöbel	WAOA Talk Designing Caterpillars for Graphs: Approximation and Hardness Leon Kullmann, Phuoc Lucky Trinh, Leon Kellerhals, Mitja Krebs, André Nichterlein, and Stefan Schmid
				IPEC Talk k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms Rin Saito and Yuma Tamura	9:14
9:22	ALGOWIN talk A Generalization of Siegel’s Lemma with an Application to Point Placement Nikhil Mande, Joe Morris and Anish Mukherjee	ATMOS Talk Exploiting Treewidth to solve the Pricing Problem in Column Generation for Non-Pool-Based Line Planning Markus Niebisch and Tom Cornelis van der Zanden	WAOA Talk A PTAS for Axis-Parallel Separation of Points in Convex Position Siddhartha Sarkar
				IPEC Talk Set Function Maximization with Locality over Graphs Tesshu Hanaka, Hirotaka Ono and Suguru Yamada	9:31
9:43	Coffee break at Luigi Zordan Congress Center
				Coffee break	9:48
	Room: 1.A (floor 1) Session chair Li-Hsuan Chen	Room: 0.A (floor 0) Session chair Christos Zaroliagis	Room: A. Clementi (floor -1) Session chair Monaldo Mastrolilli	Room: Aula Magna – Luigi Zordan Building Session chair Robert Ganian
10:15	ALGOWIN talk Parameterized Complexity of Temporal Agony Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann and Pascal Kunz	ATMOS Talk Finding Maximum-Success Disjoint Paths Aaron Neugebauer and Marie Schmidt	WAOA Talk Geometric Burning Under L1 and L∞ Metrics, and Beyond Shahin Kamali and Saba Yazdani	IPEC Talk c-Packedness versus λ-Low-Density in Geometric Graphs: Theory and Practice Gregor Diatzko, Felix Lasseux and Sabine Storandt	10:15
				IPEC Talk Exact algorithms for optimal discretization László Kozma and Junqi Tan	10:32
10:36	ALGOWIN talk Exploration of Always S-Connected Temporal Graphs Duncan Adamson and Paul Spirakis	ATMOS Talk Large scale middle mile network design through efficient local search Carlo Sartori, Jian Shen, Anastasia Kireeva, Mattia Neroni and Philipp Loick	WAOA Talk Cumulative Incremental Maximization of Decreasing Sequences Julian Born, Yann Disser, Maximilian Stahlberg, and Linda Thelen
				IPEC Talk On the Hardness of Strong Metric Dimension Prafullkumar Tale	10:49
10:57	ALGOWIN talk Temporal Role Colouring Jessica Enright, Kitty Meeks, Puck Rombach and Ella Yates	ATMOS Talk Integrated Location-Routing-Scheduling for Multi-Trip Mobile Parcel Lockers with Time Windows Salma Essouaied, Leandro Callegari Coelho, Christophe Wilbaut and Raca Todosijević	WAOA Talk Streaming algorithms for computing coresets and k-median clustering in the Hamming space Taha El Ghazi, Jonas Ellert, Chien-Chung Huang, and Tatiana Starikovskaya
				IPEC Talk On Kernels and Leaves: Searching for Bare and Lush Trees Jesse Beisegel, Ekkehard Köhler, Robert Scheffler and Martin Strehler	11:06
11:18	Coffee break at Luigi Zordan Congress Center
				Coffee break	11:23
	Room: A. Clementi (floor -1) Session chair Aris Pagourtzis
11:45	ALGOWIN Keynote Computing by Mobile Robots under Sequential Schedulers: An Overview Paola Flocchini				11:45
12:45	Lunch at Lugi Zordan Congress Center				12:45

On small screens, scroll the timetable horizontally.