{"id":760,"date":"2022-08-23T10:26:57","date_gmt":"2022-08-23T08:26:57","guid":{"rendered":"https:\/\/algo2022.eu\/?page_id=760"},"modified":"2022-09-08T09:20:39","modified_gmt":"2022-09-08T07:20:39","slug":"schedule","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2022\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"

This schedule is still subject to small changes. Virtual presentations are marked with *. Note that all times are given for Central European Summer Time (CEST).<\/p>\n\n\n

\n
Show Details<\/a><\/div>\n\n\n\n
Hide Details<\/a><\/div>\n<\/div>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nMonday, September 5  (toggle details)<\/a><\/td>\n<\/tr>\n
<\/td>\nHS1<\/a><\/td>\nHS2<\/a><\/td>\nHS3<\/a><\/td>\nH-E.51<\/a><\/td>\nH-2.57<\/a><\/td>\nL-E.03<\/a><\/td>\n<\/tr>\n
08:00<\/td>\nRegistration desk opens<\/a><\/td>\n<\/tr>\n
09:10<\/td>\nESA A talk<\/b>
Baris Can Esmer, Ariel Kulik, D\u00e1niel Marx, Daniel Neuen and Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Shahbaz Khan and Alexandru I. Tomescu
Optimizing the Safe Flow Decompositions in DAGs<\/i><\/span><\/td>\n		ESA A talk<\/b>
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo Silveira and Frank Staals
Efficient Fr\u00e9chet distance queries for segments<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:30<\/td>\nESA A talk<\/b>
Jan Dreier, Sebastian Ordyniak and Stefan Szeider
SAT Backdoors: Depth Beats Size<\/i><\/span><\/td>\n		ESA A talk<\/b>
Manuel C\u00e1ceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru Tomescu and Lucia Williams
Width Helps and Hinders Splitting Flows<\/i><\/span><\/td>\n		ESA A talk<\/b>
Thijs van der Horst, Maarten L\u00f6ffler and Frank Staals
Chromatic k-Nearest Neighbor Queries<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Eduard Eiben<\/td>\nchaired by Zeev Nutov<\/td>\nchaired by Kisfaludi-Bak S\u00e1ndor<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
09:50<\/td>\nBreak<\/td>\n<\/tr>\n
10:10<\/td>\nESA A talk<\/b>
Nikhil Bansal and Christian Coester
Online metric allocation and time-varying regularization<\/i><\/span><\/td>\n		ESA A talk<\/b>
Hans L. Bodlaender, Carla Groenland and Hugo Jacob
List Colouring Trees in Logarithmic Space<\/i><\/span><\/td>\n		WABI talk<\/b>*
Yoshihiko Suzuki and Gene Myers
Accurate K-mer Classification Using Read Profiles<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:30<\/td>\nESA A talk<\/b>
Rajmohan Rajaraman and Omer Wasim
Improved bounds for online balanced graph re-partitioning<\/i><\/span><\/td>\n		ESA A talk<\/b>
Ofer Neiman and Idan Shabat
A Unified Framework for Hopsets<\/i><\/span><\/td>\n		WABI talk<\/b>
Jens Zentgraf and Sven Rahmann
Fast gapped k-mer counting with subdivided multi-way bucketed Cuckoo hash tables<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:50<\/td>\nESA A talk<\/b>
Bernhard Haeupler, D. Ellis Hershkowitz and Goran Zuzic
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Oswin Aichholzer, Erik Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masarova, Mikhail Rudoy, Virginia Vassilevska Williams and Nicole Wein
Hardness of Token Swapping on Trees<\/i><\/span><\/td>\n		WABI talk<\/b>*
Sebastian Schmidt and Jarno Alanko
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Eduard Eiben<\/td>\nchaired by Davide Bil\u00f2<\/td>\nchaired by Christina Boucher<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
11:10<\/td>\nBreak<\/td>\n<\/tr>\n
11:30<\/td>\nESA keynote: Saket Saurabh<\/b><\/td>\n<\/tr>\n
12:30<\/td>\nLunch<\/td>\n<\/tr>\n
14:00<\/td>\nESA A talk<\/b>
Argyrios Deligkas, Michail Fasoulakis and Evangelos Markakis
A Polynomial-Time Algorithm for 1\/3-Approximate Nash Equilibria in Bimatrix Games<\/i><\/span><\/td>\n		ESA A talk<\/b>
Martin Balko, Steven Chaplick, Siddharth Gupta, Robert Ganian, Michael Hoffmann, Pavel Valtr and Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs<\/i><\/span><\/td>\n		WABI talk<\/b>
Zsuzsanna Liptak, Francesco Masillo and Simon J. Puglisi
Suffix sorting via matching statistics<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:20<\/td>\nESA A talk<\/b>
Bento Natura, Meike Neuwohner and Stefan Weltge
The Pareto cover problem<\/i><\/span><\/td>\n		ESA A talk<\/b>
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi and Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited<\/i><\/span><\/td>\n		WABI talk<\/b>
Giulio Ermanno Pibiri
On Weighted K-Mer Dictionaries<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:40<\/td>\nESA A talk<\/b>
Jiehua Chen and Sanjukta Roy
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space<\/i><\/span><\/td>\n		ESA A talk<\/b>
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak and Stefan Szeider
Finding a Cluster in Incomplete Data<\/i><\/span><\/td>\n		WABI talk<\/b>
Taher Mun, Naga Sai Kavya Vaddadi and Ben Langmead
Pangenomic genotyping with the marker array<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Sarel Cohen<\/td>\nchaired by Saket Saurabh<\/td>\nchaired by Travis Gagie<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
15:00<\/td>\nBreak<\/td>\n<\/tr>\n
15:20<\/td>\nESA A talk<\/b>
Zeev Nutov
Data structures for node connectivity queries<\/i><\/span><\/td>\n		ESA A talk<\/b>
Raghavendra Addanki, Andrew McGregor and Cameron Musco
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries<\/i><\/span><\/td>\n		WABI talk<\/b>
Pijus Simonaitis and Benjamin J. Raphael
A maximum parsimony principle for multichromosomal complex genome rearrangements<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
15:40<\/td>\nESA A talk<\/b>
Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff and Kevin Mann
Enumerating Minimal Connected Dominating Sets<\/i><\/span><\/td>\n		ESA A talk<\/b>
Thomas Erlebach, Murilo de Lima, Nicole Megow and Jens Schl\u00f6ter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty<\/i><\/span><\/td>\n		WABI talk<\/b>
Marilia Braga, Leonie Brockmann, Katharina Klerx and Jens Stoye
A linear time algorithm for an extended version of the breakpoint double distance<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
16:00<\/td>\nESA A talk<\/b>*
Han Jiang, Shang-En Huang, Thatchaphol Saranurak and Tian Zhang
Vertex Sparsifiers for Hyperedge Connectivity<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Or Zamir
Faster algorithm for Unique (k,2)-CSP<\/i><\/span><\/td>\n		WABI talk<\/b>
Diego P. Rubert and Marilia Braga
Gene orthology inference via large-scale rearrangements for partially assembled genomes<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Philip Wellnitz<\/td>\nchaired by Argyrios Deligkas<\/td>\nchaired by Daniel Doerr<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
16:20<\/td>\nBreak<\/td>\n<\/tr>\n
16:40<\/td>\nESA A talk<\/b>
Kobi Bodek and Moran Feldman
Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case<\/i><\/span><\/td>\n		ESA A talk<\/b>
Valentin Bartier, Nicolas Bousquet and Amer Mouawad
Galactic Token Sliding<\/i><\/span><\/td>\n		WABI business meeting<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
17:00<\/td>\nESA A talk<\/b>*
Sheng Yang, Samir Khuller, Sunav Choudhary, Kanak Mahadik and Subrata Mitra
Correlated Stochastic Knapsack with a Submodular Objective<\/i><\/span><\/td>\n		ESA A talk<\/b>
Daniel Blankenburg
Resource Sharing Revisited: Local Weak Duality and Optimal Convergence<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
17:20<\/td>\nESA A talk<\/b>*
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson and Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly<\/i><\/span><\/td>\n		ESA A talk<\/b>
Benjamin Merlin Bumpus, Bart M. P. Jansen and Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Andreas Wiese<\/td>\nchaired by Roohani Sharma<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
17:40<\/td>\nReception<\/a><\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nTuesday, September 6  (toggle details)<\/a><\/td>\n<\/tr>\n
<\/td>\nHS1<\/a><\/td>\nHS2<\/a><\/td>\nHS3<\/a><\/td>\nH-E.51<\/a><\/td>\nH-2.57<\/a><\/td>\nL-E.03<\/a><\/td>\n<\/tr>\n
08:50<\/td>\nESA A talk<\/b>
Wojciech Nadara, Micha\u0142 Pilipczuk and Marcin Smulewicz
Computing treedepth in polynomial space and linear fpt time<\/i><\/span><\/td>\n		ESA S talk<\/b>
Aleksander \u0141ukasiewicz and Przemys\u0142aw Uzna\u0144ski
Cardinality estimation using Gumbel distribution<\/i><\/span><\/td>\n		WABI talk<\/b>
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone and Lorenzo Tattini
phyBWT: Alignment-free phylogeny via eBWT positional clustering<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
A. Spitalas, K. Tsichlas
MAGMA: Proposing a Massive Historical Graph Management System<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:10<\/td>\nESA A talk<\/b>
Mark Jones, Mathias Weller and Leo van Iersel
Embedding phylogenetic trees in networks of low treewidth<\/i><\/span><\/td>\n		ESA S talk<\/b>
Sourav Chakraborty, Kuldeep S. Meel and N. V. Vinodchandran
Distinct Elements in Streams: An Algorithm for the (Text) Book<\/i><\/span><\/td>\n		WABI talk<\/b>
Adri\u00e1n Goga and Andrej Bal\u00e1\u017e
Prefix-free parsing for building large tunnelled Wheeler graphs<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
D. Amaxilatis, I. Chatzigiannakis, T. Saradakos
Edge-Enabled Machine Learning for Solar Power Production Forecasting<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:30<\/td>\nESA A talk<\/b>
Tesshu Hanaka and Michael Lampis
Hedonic Games and Treewidth Revisited<\/i><\/span><\/td>\n		ESA S talk<\/b>*
Mohammad Ansari, Mohammad Saneian and Hamid Zarrabi-Zadeh
Simple Streaming Algorithms for Edge Coloring<\/i><\/span><\/td>\n		WABI talk<\/b>
Ahsan Sanaullah, Degui Zhi and Shaojie Zhang
Haplotype Threading Using the Positional Burrows-Wheeler Transform<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
A. Karras, C. Karras, A. Pervanas, S. Sioutas, C. Zaroliagis
SQL Query Optimization in Distributed NoSQL Databases for Cloud-based Applications<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Paloma Thom\u00e9 de Lima<\/td>\n<\/td>\nchaired by Jarno Alanko<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
09:50<\/td>\nBreak<\/td>\n<\/tr>\n
10:10<\/td>\nESA A talk<\/b>
Frederik Br\u00fcning, Jacobus Conradi and Anne Driemel
Faster Approximate Covering of Subcurves under the Fr\u00e9chet Distance<\/i><\/span><\/td>\n		ESA S talk<\/b>
Jonas Ellert
Lyndon Arrays Simplified<\/i><\/span><\/td>\n		WABI talk<\/b>
Alitzel L\u00f3pez S\u00e1nchez and Manuel Lafond
Predicting Horizontal Gene Transfers with Perfect Transfer Networks<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
E. Althaus, S. Funke, M. Schrauth
Privacy Preserving Queries of Shortest Path Distances<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:30<\/td>\nESA A talk<\/b>
Soh Kumabe and Yuichi Yoshida
Average sensitivity of the Knapsack Problem<\/i><\/span><\/td>\n		ESA S talk<\/b>
Travis Gagie
Simple worst-case optimal adaptive prefix-free coding<\/i><\/span><\/td>\n		WABI talk<\/b>
Konstantinn Bonnet, Tobias Marschall and Daniel Doerr
Constructing founder sets under allelic and non-allelic homologous recombination<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
S. Kontogiannis, P.-M. Machaira, A. Paraskevopoulos, K. Raftopoulos, C. Zaroliagis
Cloud-Based Urban Mobility Services<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:50<\/td>\nESA A talk<\/b>*
Zachary Friggstad and Mahya Jamshidian
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters<\/i><\/span><\/td>\n		ESA S talk<\/b>*
Alexander Tiskin
Fast RSK correspondence by doubling search<\/i><\/span><\/td>\n		WABI talk<\/b>*
Wei Wei and David Koslicki
WGSUniFrac: Applying UniFrac metric to Whole Genome Shotgun data<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>*
K. Subramani, Piotr Wojciechowski and Alvaro Velasquez
An analysis of priority based bin packing<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Sebastian Ordyniak<\/td>\nchaired by Solon Pissis<\/td>\nchaired by Thomas Vinar<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
11:10<\/td>\nBreak<\/td>\n<\/tr>\n
11:30<\/td>\nESA keynote: Simon Puglisi<\/b><\/td>\n<\/tr>\n
12:30<\/td>\nLunch<\/td>\n<\/tr>\n
14:00<\/td>\nESA A best student paper<\/b>
Zoe Xi and William Kuszmaul
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings<\/i><\/span><\/td>\n		ESA B best student paper<\/b>
Tim Zeitz and Nils Werner
Combining Predicted and Live Traffic with Time-Dependent A* Potentials<\/i><\/span><\/td>\n		WABI talk<\/b>
Mathieu Gascon and Nadia El-Mabrouk
Non-binary Tree Reconciliation with Endosymbiotic Gene Transfer<\/i><\/span><\/td>\n		ALGOCLOUD talk<\/b>
A. Karakasidis, G. Koloniari
More Sparking Soundex-based Privacy-Preserving Record Linkage<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:20<\/td>\nESA S best paper (we wait for listeners of ESA B and ALGOCLOUD)<\/b>
Alejandro Flores-Velazco
Improved Search of Relevant Points for Nearest-Neighbor Classification<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>*
Baqiao Liu and Tandy Warnow
Fast and Accurate Species Trees from Weighted Internode Distances<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:40<\/td>\nESA B best paper<\/b>
Chris Schwiegelshohn and Omar Ali Sheikh-Omar
An Empirical Evaluation of k-Means Coresets<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Giulia Bernardini, Leo van Iersel, Esther Julien and Leen Stougie
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Sven Rahmann<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
15:00<\/td>\nBreak<\/td>\n<\/tr>\n
15:20<\/td>\nESA A best paper<\/b>
Stefan Walzer
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold (extended abstract)<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Eden Ozery, Meirav Zehavi and Michal Ziv-Ukelson
Algorithms for Structure Informed Genome Rearrangement<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
15:40<\/td>\nESA Test-of-Time award<\/b>
Andrew V. Goldberg and Jason D. Hartline
Competitive Auctions for Multiple Digital Goods<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Daniel Gibney, Sharma V. Thankachan and Srinivas Aluru
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
16:00<\/td>\nESA Test-of-Time award<\/b>
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross A. Lippert, and Russell Schwartz
SNPs Problems, Complexity, and Algorithms<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Erin Molloy<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
16:20<\/td>\nBreak<\/td>\n<\/tr>\n
16:40<\/td>\nmemorial lecture for Camil Demetrescu, Rolf Niedermeier and Gerhard Woeginger<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
17:25<\/td>\nEnd of talk, dinner venue opens<\/td>\n<\/tr>\n
18:30<\/td>\nConference Dinner<\/a><\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nWednesday, September 7  (toggle details)<\/a><\/td>\n<\/tr>\n
<\/td>\nHS1<\/a><\/td>\nHS2<\/a><\/td>\nHS3<\/a><\/td>\nH-E.51<\/a><\/td>\nH-2.57<\/a><\/td>\nL-E.03<\/a><\/td>\n<\/tr>\n
08:50<\/td>\nESA A talk<\/b>
\u0141ukasz Bo\u017cyk and Micha\u0142 Pilipczuk
Polynomial kernel for immersion hitting in tournaments<\/i><\/span><\/td>\n		ESA B talk<\/b>
Owen Rouille and Cl\u00e9ment Maria
Localized geometric moves to compute hyperbolic structures on triangulated 3-manifolds<\/i><\/span><\/td>\n		Nerode prize winner: Bruno Courcelle<\/b><\/td>\nESA A talk<\/b>
Davide Bil\u00f2, Gianlorenzo D’Angelo, Luciano Gual\u00e0, Stefano Leucci and Mirko Rossi
Sparse Temporal Spanners with Low Stretch<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Cl\u00e9ment Agret, Bastien Cazaux and Antoine Limasset
Toward optimal fingerprint indexing for large scale genomics<\/i><\/span><\/td>\n<\/tr>\n
09:10<\/td>\nESA A talk<\/b>
V\u00e1clav Bla\u017eej, Pratibha Choudhary, Du\u0161an Knop, \u0160imon Schierreich, Ond\u0159ej Such\u00fd and Tom\u00e1\u0161 Valla
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations<\/i><\/span><\/td>\n		ESA B talk<\/b>
Lex de Kogel, Marc van Kreveld and Jordi L. Vermeulen
Abstract morphing using the Hausdorff distance and Voronoi diagrams<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh and Csaba Toth
Online Spanners in Metric Spaces<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Yoshihiro Shibuya, Djamal Belazzougui and Gregory Kucherov
Efficient reconciliation of genomic datasets of high similarity<\/i><\/span><\/td>\n<\/tr>\n
09:30<\/td>\nESA A talk<\/b>
Jakub Gajarsk\u00fd, Lars Jaffke, Paloma Lima, Jana Novotn\u00e1, Marcin Pilipczuk, Pawe\u0142 Rz\u0105\u017cewski and U\u00e9verton Souza
Taming graphs with no large creatures and skinny ladders<\/i><\/span><\/td>\n		ESA B talk<\/b>*
Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu and Julian Shun
ParGeo: A Library for Parallel Computational Geometry<\/i><\/span><\/td>\n		ESA A talk<\/b>
Manoj Gupta and Dipan Dey
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Ke Chen and Mingfu Shao
Locality-sensitive bucketing functions<\/i><\/span><\/td>\n<\/tr>\n
<\/td>\nchaired by Fedor Fomin<\/td>\nchaired by Chris Schwiegelshohn<\/td>\n<\/td>\nchaired by Martin Schirneck<\/td>\n<\/td>\nchaired by Alberto Policriti<\/td>\n<\/tr>\n
09:50<\/td>\nBreak<\/td>\n<\/tr>\n
10:10<\/td>\nESA A talk<\/b>
Jendrik Brachter and Pascal Schweitzer
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension<\/i><\/span><\/td>\n		ESA B talk<\/b>
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik K\u00f6ppl and Takaaki Nishimoto
Computing NP-hard Repetitiveness Measures via MAX-SAT<\/i><\/span><\/td>\n		IPEC talk<\/b>
Robert Ganian and Viktoriia Korchemna
Slim Tree-Cut Width<\/i><\/span><\/td>\n		ESA A talk<\/b>
Anna Arutyunova and Heiko R\u00f6glin
The Price of Hierarchical Clustering<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI talk<\/b>
Bertrand Marchand, Sebastian Will, Sarah Berkemer, Laurent Bulteau and Yann Ponty
Fully-automated design of dynamic programming schemes for RNA folding with pseudoknots<\/i><\/span><\/td>\n<\/tr>\n
10:30<\/td>\nESA A talk<\/b>
Florian Barth, Stefan Funke and Claudius Proissl
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions<\/i><\/span><\/td>\n		ESA B talk<\/b>
Andrew Goldberg, Yuanyuan Dong, Alexander Noe, Nikos Parotsidis, Mauricio Resende and Quico Spaen
A Local Search Algorithm for Large Maximum Weight Independent Set Problems<\/i><\/span><\/td>\n		IPEC talk<\/b>
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk and Micha\u0142 Pilipczuk
On the Complexity of Problems on Tree-structured Graphs<\/i><\/span><\/td>\n		ESA A talk<\/b>
Georg Anegg, Laura Vargas Koch and Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems<\/i><\/span><\/td>\n		<\/b><\/td>\nWABI best paper<\/b><\/td>\n<\/tr>\n
10:50<\/td>\nESA A talk<\/b>*
Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhoefer and Miklos Santha
Classical and quantum algorithms for variants of Subset-Sum via dynamic programming<\/i><\/span><\/td>\n		ESA B talk<\/b>
Aleksander Figiel, Vincent Froese, Andr\u00e9 Nichterlein and Rolf Niedermeier
There and Back Again: On Applying Data Reduction Rules by Undoing Others<\/i><\/span><\/td>\n		IPEC talk<\/b>
Brage I. K. Bakkane and Lars Jaffke
On the hardness of generalized domination problems parameterized by mim-width<\/i><\/span><\/td>\n		ESA A talk<\/b>
Deeparnab Chakrabarty, Maryam Negahbani and Ankita Sarkar
Approximation Algorithms for Continuous Clustering and Facility Location Problems<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Hendrik Molter<\/td>\nchaired by Matthias Stallman<\/td>\n<\/td>\nchaired by Argyrios Deligkas<\/td>\n<\/td>\nchaired by Christina Boucher and Sven Rahmann<\/td>\n<\/tr>\n
11:10<\/td>\nBreak<\/td>\n<\/tr>\n
11:30<\/td>\nWABI keynote: Leena Salmela<\/b><\/td>\n<\/tr>\n
12:30<\/td>\nLunch<\/td>\n<\/tr>\n
14:00<\/td>\nESA A talk<\/b>
Miriam Goetze, Paul Jungeblut and Torsten Ueckerdt
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs<\/i><\/span><\/td>\n		ESA B talk<\/b>
Alexander Dobler, Manuel Sorge and Ana\u00efs Villedieu
Turbocharging Heuristics for Weak Coloring Numbers<\/i><\/span><\/td>\n		IPEC talk<\/b>
Bar\u0131\u015f Can Esmer, Ariel Kulik, D\u00e1niel Marx, Philipp Schepper and Karol W\u0119grzycki
Computing Generalized Convolutions Faster Than Brute Force<\/i><\/span><\/td>\n		ESA A talk<\/b>
Susanne Albers and Sebastian Schubert
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:20<\/td>\nESA A talk<\/b>
Bart\u0142omiej Bosek and Anna Zych-Pawlewicz
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget<\/i><\/span><\/td>\n		ESA B talk<\/b>
Evangelos Kosinas, Loukas Georgiadis, Giuseppe F. Italiano and Thodoris Dimas
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study<\/i><\/span><\/td>\n		IPEC talk<\/b>
Falko Hegerfeld and Stefan Kratsch
Towards exact structural thresholds for parameterized complexity<\/i><\/span><\/td>\n		ESA A talk<\/b>
Amit Chakrabarti and Themistoklis Haris
Counting Simplices in Hypergraph Streams<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
14:40<\/td>\nESA A talk<\/b>*
D Ellis Hershkowitz and Jason Li
O(1) Steiner Point Removal in Series-Parallel Graphs<\/i><\/span><\/td>\n		ESA B talk<\/b>*
Markus Chimani and Finn Stutzenstein
Spanner Approximations in Practice<\/i><\/span><\/td>\n		IPEC talk<\/b>
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit and Saket Saurabh
Exact Exponential Algorithms for Clustering Problems<\/i><\/span><\/td>\n		ESA A talk<\/b>
Chien-Chung Huang and Fran\u00e7ois Sellier
Maximum Weight b-Matchings in Random-Order Streams<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Thomas Erlebach<\/td>\nchaired by Travis Gagie<\/td>\n<\/td>\nchaired by Ilan Cohen<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
15:00<\/td>\nBreak<\/td>\n<\/tr>\n
15:20<\/td>\nESA A talk<\/b>*
Debajyoti Kar, Arindam Khan and Andreas Wiese
Approximation Algorithms for ROUND-UFP and ROUND-SAP<\/i><\/span><\/td>\n		ESA B talk<\/b>
Marek Szyku\u0142a and Adam Zyzik
An Improved Algorithm for Finding the Shortest Synchronizing Words<\/i><\/span><\/td>\n		PACE awards (poster session in foyer afterwards)<\/b><\/td>\nESA A talk<\/b>
Antonios Antoniadis, Mark de Berg, S\u00e1ndor Kisfaludi-Bak and Antonis Skarlatos
Computing Smallest Convex Intersecting Polygons<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
15:40<\/td>\nESA A talk<\/b>
Marten Maack, Simon Pukrop and Anna Rodriguez Rasmussen
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling<\/i><\/span><\/td>\n		ESA B talk<\/b>
Thomas Bl\u00e4sius and Philipp Fischbeck
On the External Validity of Average-Case Analyses of Graph Algorithms<\/i><\/span><\/td>\n		ESA A talk<\/b>
Justin Dallant and John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
16:00<\/td>\nESA A talk<\/b>
Du\u0161an Knop and Martin Koutecky
Scheduling Kernels via Configuration LP<\/i><\/span><\/td>\n		ESA B talk<\/b>
Arghya Bhattacharya, Helen Xu, Abiyaz Chowdhury, Rezaul A. Chowdhury, Rathish Das, Rob Johnson, Rishab Nithyanand and Michael A. Bender
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Esther Ezra and Micha Sharir
Intersection Searching amid Tetrahedra in 4-space and Efficient Continuous Collision Detection<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Thomas Erlebach<\/td>\nchaired by Simon Puglisi<\/td>\n<\/td>\nchaired by Philip Wellnitz<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
16:20<\/td>\nBreak<\/td>\n<\/tr>\n
16:40<\/td>\nESA A talk<\/b>
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon Pissis, Wojciech Rytter, Tomasz Walen and Wiktor Zuba
Approximate Circular Pattern Matching<\/i><\/span><\/td>\n		ESA S talk<\/b>
Syamantak Das and Andreas Wiese
A simpler QPTAS for scheduling jobs with precedence constraints<\/i><\/span><\/td>\n		IPEC talk<\/b>
Akanksha Agrawal, Saket Saurabh and Meirav Zehavi
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation<\/i><\/span><\/td>\n		ESA A talk<\/b>
Monika Henzinger, Ami Paz and A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
17:00<\/td>\nESA A talk<\/b>
Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov
Longest Cycle above Erd\u0151s\u2013Gallai Bound<\/i><\/span><\/td>\n		ESA S talk<\/b>*
Henk Alkema, Mark de Berg, Leonidas Theocharous and Morteza Monemizadeh
TSP in a Simple Polygon<\/i><\/span><\/td>\n		IPEC talk<\/b>*
Yosuke Mizutani and Blair Sullivan
Improved Parameterized Complexity of Happy Set Problems<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Younan Gao and Meng He
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
17:20<\/td>\nESA A talk<\/b>*
Tamal Dey and Tao Hou
Fast Computation of Zigzag Persistence<\/i><\/span><\/td>\n		ESA S talk<\/b>
Radu Curticapean
Determinants from homomorphisms<\/i><\/span><\/td>\n		IPEC talk<\/b>*
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana and Abhishek Sahu
Parameterized Complexity of Perfectly Matched Sets<\/i><\/span><\/td>\n		ESA A talk<\/b>*
Sayan Bhattacharya, Thatchaphol Saranurak and Pattara Sukprasert
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\nchaired by Philip Wellnitz<\/td>\nchaired by Anne Driemel<\/td>\n<\/td>\nchaired by Stefano Leucci<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
17:40<\/td>\nBreak<\/td>\n<\/tr>\n
17:50<\/td>\nESA community meeting<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nThursday, September 8  (toggle details)<\/a><\/td>\n<\/tr>\n
<\/td>\nHS1<\/a><\/td>\nHS2<\/a><\/td>\nHS3<\/a><\/td>\nH-E.51<\/a><\/td>\nH-2.57<\/a><\/td>\nL-E.03<\/a><\/td>\n<\/tr>\n
08:50<\/td>\nIPEC talk<\/b>
\u00c9douard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen K\u00f6hler, Raul Lopes and St\u00e9phan Thomass\u00e9
Twin-width VIII: delineation and win-wins<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:10<\/td>\nIPEC talk<\/b>
Hans L. Bodlaender, Carla Groenland and Hugo Jacob
On the parameterized complexity of computing tree-partitions<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:30<\/td>\nIPEC talk<\/b>
Esther Galby, Daniel Marx, Philipp Schepper, Roohani Sharma and Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
09:50<\/td>\nBreak<\/td>\n<\/tr>\n
10:10<\/td>\nIPEC talk<\/b>
Leon Kellerhals, Tomohiro Koana and Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees<\/i><\/span><\/td>\n		WAOA talk<\/b>
Matej Lieskovsk\u00fd and Ji\u0159\u00ed Sgall
Graph burning and non-uniform $k$-centers for small treewidth<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Lukas Graf, Tobias Harks and Prashant Palkar
Dynamic Traffic Assignment for Electric Vehicles<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Nada Almalki and Othon Michail
On Geometric Shape Construction via Growth Operations<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:30<\/td>\nIPEC talk<\/b>
Johannes Blum, Yann Disser, Andreas Feldmann, Siddharth Gupta and Anna Zych-Pawlewicz
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension<\/i><\/span><\/td>\n		WAOA talk<\/b>
Moritz Buchem, Linda Kleist and Daniel Schmidt Genannt Waldschmidt
Scheduling with Machine Conflicts<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Moritz Potthoff and Jonas Sauer
Efficient Algorithms for Fully Multimodal Journey Planning<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>*
Matthew Connor and Othon Michail
Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
10:50<\/td>\nIPEC talk<\/b>
Christian Komusiewicz and Nils Morawietz
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial<\/i><\/span><\/td>\n		WAOA talk<\/b>*
Rajni Dabas, Naveen Garg, Neelima Gupta and Dilpreet Kaur
Locating Service and Charging stations<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Spyros Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos and Christos Zaroliagis
REX: A Realistic Time-dependent Model for Multimodal Public Transport<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano and Alfredo Navarra
Molecular robots with chirality on grids<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Niels Lindner<\/td>\nchaired by Thomas Erlebach<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
11:10<\/td>\nBreak<\/td>\n<\/tr>\n
11:30<\/td>\nIPEC keynote: Eunjung Kim<\/b><\/td>\n<\/td>\n<\/td>\n<\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/tr>\n
12:30<\/td>\nLunch<\/td>\n<\/tr>\n
14:00<\/td>\nIPEC talk<\/b>
D\u00e1niel Marx, Govind S. Sankar and Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)<\/i><\/span><\/td>\n		WAOA talk<\/b>
Devin Smedira and David Shmoys
Scheduling Appointments Online: The Power of Deferred Decision-Making<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Vera Grafe, Alexander Schiewe and Anita Sch\u00f6bel
Delay Management with Integrated Decisions on the Vehicle Circulations<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Davide Bil\u00f2, Gianlorenzo D\u2019Angelo, Luciano Gual\u00e0, Stefano Leucci and Mirko Rossi
Blackout-tolerant Temporal Spanners<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
14:20<\/td>\nIPEC talk<\/b>
Guillaume Ducoffe
Obstructions to faster diameter computation: Asteroidal sets<\/i><\/span><\/td>\n		WAOA talk<\/b>
Evripidis Bampis, Bruno Escoffier and Michalis Xefteris
Canadian Traveller Problem with Predictions<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Julian Patzner, Ralf R\u00fcckert and Matthias M\u00fcller-Hannemann
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
George Mertzios, Othon Michail, Paul Spirakis, George Skretas and Michail Theofilatos
The Complexity of Growing a Graph<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
14:40<\/td>\nIPEC talk<\/b>
Jelle Oostveen and Erik Jan van Leeuwen
Parameterized Complexity of Streaming Diameter and Connectivity Problems<\/i><\/span><\/td>\n		WAOA talk<\/b>
Andreas Abels, Leon Ladewig, Kevin Schewior and Moritz Stinzend\u00f6rfer
Knapsack Secretary Through Boosting<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Zuguang Gao, John R. Birge, Richard L.-Y. Chen and Maurice Cheung
Greedy Algorithms for the Freight Consolidation Problem<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
George Karakostas and Stavros Kolliopoulos
Resource time-sharing for IoT applications with deadlines<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Spyros Kontogiannis<\/td>\nchaired by Michael Segal<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
15:00<\/td>\nBreak<\/td>\n<\/tr>\n
15:20<\/td>\nATMOS keynote: Christian Sommer<\/b><\/td>\n<\/td>\n<\/td>\n<\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/tr>\n
16:20<\/td>\nBreak<\/td>\n<\/tr>\n
16:40<\/td>\nIPEC best paper<\/b>
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke and Paloma de Lima
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure<\/i><\/span><\/td>\n		<\/b><\/td>\nATMOS talk<\/b>
Torsten Klug, Thomas Schlechte and Markus Reuther
Does Laziness Pay Off? – A Lazy-Constraint Approach to Timetabling<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti and Giuseppe Prencipe
Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone<\/i><\/span><\/td>\n		WABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
17:00<\/td>\nIPEC business meeting<\/b><\/td>\n<\/b><\/td>\nATMOS talk<\/b>
Kosuke Kawazoe, Takuto Yamauchi and Kenji Tei
A formulation of MIP train rescheduling at terminals in bidirectional double-track lines with a moving block and ATO<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>*
Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam
Fault-Tolerant Graph Realizations in the Congested Clique<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
17:20<\/td>\n<\/b><\/td>\nATMOS talk<\/b>
Enrico Bortoletto, Niels Lindner and Berenike Masing
Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling<\/i><\/span><\/td>\n		ALGOSENSORS business meeting<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Philine Schiewe<\/td>\nchaired by Davide Bil\u00f2<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
17:40<\/td>\nBreak<\/td>\n<\/tr>\n
17:50<\/td>\nIPEC business meeting (continued)<\/b><\/td>\n<\/b><\/td>\nATMOS business meeting<\/b><\/td>\nALGOSENSORS business meeting (continued)<\/b><\/td>\n<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n
 <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nFriday, September 9  (toggle details)<\/a><\/td>\n<\/tr>\n
<\/td>\nHS1<\/a><\/td>\nHS2<\/a><\/td>\nHS3<\/a><\/td>\nH-E.51<\/a><\/td>\nH-2.57<\/a><\/td>\nL-E.03<\/a><\/td>\n<\/tr>\n
08:50<\/td>\nIPEC talk<\/b>
Danny Hermelin, Yuval Itzhaki, Hendrik Molter and Dvir Shabtay
Hardness of Interval Scheduling on Unrelated Machines<\/i><\/span><\/td>\n		WAOA talk<\/b>
Hsiang-Hsuan Liu and Jonathan Toole-Charignon
The Power of Amortized Recourse for Online Graph Problems<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/b><\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
09:10<\/td>\nIPEC talk<\/b>
Maher Mallem, Claire Hanen and Alix Munier Kordon
Parameterized complexity of a parallel machine scheduling problem<\/i><\/span><\/td>\n		WAOA talk<\/b>
J\u00falia Balig\u00e1cs, Yann Disser, Nils Mosis and David Weckbecker
An Improved Algorithm for Open Online Dial-a-Ride<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Ralf Bornd\u00f6rfer, Fabian Danecker and Martin Weiser
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Vishwanath Reddy Singireddy and Manjanna B
Dispersing Facilities on Planar Segment and Circle Amidst Repulsion<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
09:30<\/td>\nIPEC talk<\/b>
Ishay Haviv
A Fixed-Parameter Algorithm for the Schrijver Problem<\/i><\/span><\/td>\n		WAOA talk<\/b>
Ilan Cohen
Stochastic graph exploration with limited resources<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Marco Blanco, Ralf Borndoerfer and Pedro Maristany de Las Casas
An A* Algorithm for Flight Planning based on Idealized Vertical Profiles<\/i><\/span><\/td>\n		ALGOSENSORS talk<\/b>
Konstantinos Georgiou and Woojin Jang
Triangle Evacuation of 2 Agents in the Wireless Model<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nchaired by Matthias Muller-Hannemann<\/td>\nchaired by George Skretas<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
09:50<\/td>\nBreak<\/td>\n<\/tr>\n
10:10<\/td>\nIPEC talk<\/b>
Sayan Bandyapadhyay, Fedor Fomin, Petr Golovach, Nidhi Purohit and Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering<\/i><\/span><\/td>\n		WAOA talk<\/b>
Lisa Hellerstein, Devorah Kletenik, Naifeng Liu and R. Teal Witter
Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Irene Heinrich, Philine Schiewe and Constantin Seebach
Algorithms and Hardness for Non-Pool-Based Line Planning<\/i><\/span><\/td>\n		ALGOSENSORS invited talk: Roger Wattenhofer<\/b><\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/b><\/td>\n<\/tr>\n
10:30<\/td>\nIPEC talk<\/b>
Hjalmar Schulz, Andr\u00e9 Nichterlein, Rolf Niedermeier and Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time<\/i><\/span><\/td>\n		WAOA talk<\/b>
Fabian Klute, Sujoy Bhore and Jelle Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita Sch\u00f6bel and Reena Urban
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
10:50<\/td>\nIPEC talk<\/b>
Eduard Eiben, Cl\u00e9ment Rambaud and Magnus Wahlstr\u00f6m
On the parameterized complexity of symmetric directed multicut<\/i><\/span><\/td>\n		WAOA talk<\/b>
Maike Buchin, Anne Driemel, Ioannis Psarros, Dennis Rohde and Koen van Greevenbroek
Approximating Length-Restricted Means under Dynamic Time Warping<\/i><\/span><\/td>\n		ATMOS talk<\/b>
Hector Gatt, Jean-Marie Freche, Fabien Lehu\u00e9d\u00e9 and Arnaud Laurent
A bilevel model for the frequency setting problem<\/i><\/span><\/td>\n		<\/b><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/td>\nchaired by Michael Segal<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
11:10<\/td>\nBreak<\/td>\n<\/tr>\n
11:30<\/td>\nWAOA keynote: Tobias M\u00f6mke<\/b><\/td>\n<\/td>\n<\/td>\n<\/td>\nWABI Pangenome Workshop<\/b><\/td>\n<\/tr>\n
12:30<\/td>\nLunch<\/td>\n<\/tr>\n
14:00<\/td>\nEnd<\/td>\n<\/tr>\n<\/tbody>\n<\/table>","protected":false},"excerpt":{"rendered":"

This schedule is still subject to small changes. Virtual presentations are marked with *. Note that all times are given for Central European Summer Time (CEST). Monday, September 5  (toggle details) HS1 HS2 HS3 H-E.51 H-2.57 L-E.03 08:00 Registration desk opens 09:10 ESA A talkBaris Can Esmer, Ariel Kulik, D\u00e1niel Marx, Daniel Neuen and Roohani SharmaFaster … <\/p>\n

Read more “Schedule”<\/span><\/a><\/p>\n","protected":false},"author":16,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-760","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/760","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/users\/16"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/comments?post=760"}],"version-history":[{"count":87,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/760\/revisions"}],"predecessor-version":[{"id":1130,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/760\/revisions\/1130"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/media?parent=760"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}