Schedule – ALGO2024

This schedule is still subject to changes. Virtual presentations are marked with *. Note that all times are given for British Summer Time (BST).

Show Details

Hide Details

	Monday, 2 September (toggle details)
	WINDSOR AUD	WINDSOR 0-02 – 0-03	WINDSOR 0-04	WINDSOR 1-02 – 1-03	WINDSOR 1-04
08:00	Registration desk opens
08:50	ESA talk Sally Dong and Guanghao Ye Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs	ESA talk* Tatiana Belova, Nikolai Chukhin, Alexander Kulikov and Ivan Mihajlin Improved Space Bounds for Subset Sum	ESA talk Amit Chakrabarti, Andrew McGregor and Anthony Wirth Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams	WABI talk Giulio Ermanno Pibiri and Ragnar Groot Koerkamp The mod-minimizer: a simple and efficient sampling algorithm for long k-mers
09:10	ESA talk Matthew Ding and Jason Li Deterministic Minimum Steiner Cut in Maximum Flow Time	ESA talk Timothy Randolph and Karol Węgrzycki Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM	ESA talk Cezar-Mihail Alexandru and Christian Konrad Interval Selection in Sliding Windows	WABI talk Mahmudur Rahman Hera and David Koslicki Cosine Similarity Estimation Using FracMinHash: Theoretical Analysis, Safety Conditions, and Implementation
9:30	ESA talk Shimon Kogan and Merav Parter The Algorithmic Power of the Greene-Kleitman Theorem	ESA talk Cornelius Brand, Martin Koutecky, Alexandra Lassota and Sebastian Ordyniak Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds	ESA talk Prantar Ghosh and Sahil Kuchlous New Algorithms and Lower Bounds for Streaming Tournaments	WABI talk Jens Zentgraf and Sven Rahmann Swiftly identifying strongly unique k-mers
	chaired by Gerth Brodal	chaired by Timothy Chan	chaired by Rasmus Pagh	chaired by Solon P. Pissis
09:50	Break
10:10	ESA talk Paloma de Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski and Kenny Štorgel Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set	ESA talk Karl Bringmann, Ahmed Ghazy and Marvin Künnemann Exploring the Approximability Landscape of 3SUM	ESA talk Fritz Bökler, Markus Chimani, Henning Jasper and Mirko H. Wagner Exact Minimum Weight Spanners via Column Generation	WABI Invited talk Giulia Bernardini Solving phylogenetic problems through graph theory: two case studies
10:30	ESA talk Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma and Karol Węgrzycki Hitting Meets Packing: How Hard Can It Be?	ESA talk Lotte Blank and Anne Driemel A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced Case	ESA talk Alexander Leonhardt, Ulrich Meyer and Manuel Penschuck Insights into (k, ρ)-Shortcutting Algorithms
10:50	ESA talk Baris Can Esmer, Jacob Focke, Dániel Marx and Paweł Rzążewski List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs	ESA talk Itai Boneh, Shay Golan and Arseny Shur String 2-Covers with No Length Restrictions	ESA talk Henrik Reinstädtler, Christian Schulz and Bora Uçar Engineering Edge Orientation Algorithms
	chaired by Bart Jansen	chaired by Panagiotis Charalampopoulos	chaired by Jonas Ellert	chaired by Solon P. Pissis
11:10	Break
11:30	ESA keynote Vincent Cohen-Addad Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back
	chaired by Timothy Chan
12:30	Lunch
14:00	ESA talk George Osipov, Marcin Pilipczuk and Magnus Wahlström Parameterized Complexity of MinCSP over the Point Algebra	ESA talk Pawel Gawrychowski and Mateusz Wasylkiewicz Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity	ESA talk Pankaj K Agarwal, Haim Kaplan, Matthew J. Katz and Micha Sharir Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments	WABI talk Sebastian Schmidt, Santeri Toivonen, Paul Medvedev and Alexandru I. Tomescu Applying the safe-and-complete framework to practical genome assembly
14:20	ESA talk Konrad Majewski, Michał Pilipczuk and Anna Zych-Pawlewicz Parameterized Dynamic Data Structure for Split Completion	ESA talk Amir Abboud, Tomer Grossman, Moni Naor and Tomer Solomon From Donkeys to Kings in Tournaments	ESA talk Matthew J. Katz, Rachel Saban and Micha Sharir Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain	WABI talk Ragnar Groot Koerkamp APA2: Up to 19× faster exact global alignment*
14:40	ESA talk Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, Satyabrata Jana and Saket Saurabh Cuts in Graphs with Matroid Constraints	ESA talk Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma and Sebastian Wild An Optimal Randomized Algorithm for Finding the Saddlepoint	ESA talk* Pankaj Agarwal, Esther Ezra and Micha Sharir Lower Envelopes of Surface Patches in 3-Space	WABI talk Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben Yehezkel, Ryan Kelley and Mingfu Shao Anchorage accurately assembles anchor-flanked synthetic long reads
	chaired by Bart Jansen	chaired by John Iacono	chaired by Emily Fox	chaired by Giulio Ermanno Pibiri
15:00	Break
15:20	ESA talk Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski and Mark Simkin Invertible Bloom Lookup Tables with Less Memory and Randomness	ESA talk Mohit Garg, Debajyoti Kar and Arindam Khan Random-Order Online Independent Set of Intervals and Hyperrectangles	ESA talk* Rohit Gurjar, Taihei Oki and Roshan Raj Fractional Linear Matroid Matching Is in Quasi-NC	WABI talk Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie and Jan Fostier b-move: faster bidirectional character extensions in a run-length compressed index
15:40	ESA talk Samuel McCauley Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion	ESA talk Rajmohan Rajaraman and Omer Wasim Competitive Capacitated Online Recoloring	ESA talk Khalid Hourani, William K. Moses Jr. and Gopal Pandurangan Towards Communication-Efficient Peer-To-Peer Networks	WABI talk Md. Hasin Abrar and Paul Medvedev PLA-index: A k-mer Index Exploiting Rank Curve Linearity
16:00	ESA talk Shimon Kogan and Merav Parter Giving Some Slack: Shortcuts and Transitive Closure Compressions	ESA talk Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen and László Kozma Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional	ESA talk Slobodan Mitrović, Ronitt Rubinfeld and Mihir Singhal Locally Computing Edge Orientations	WABI talk Giovanni Buzzega, Alessio Conte, Roberto Grossi and Giulia Punzi McDag: Indexing Maximal Common Subsequences in Practice
	chaired by Gerth Brodal	chaired by Thomas Erlebach	chaired by Gregory Schwartzman	chaired by Paul Medvedev
16:20	Break
16:40	ESA talk Yann Disser, Svenja M. Griesbach, Max Klimm and Annette Lutz Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem	ESA talk Gabriel Bathie, Panagiotis Charalampopoulos and Tatiana Starikovskaya Longest Common Extensions with Wildcards: Trade-Off and Applications	ESA talk Vittorio Bilo, Evangelos Markakis and Cosimo Vinci Achieving Envy-Freeness Through Items Sale	WABI Community meeting
17:00	ESA talk Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, and Weihao Zhu From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs	ESA talk Gabriel Bathie, Panagiotis Charalampopoulos and Tatiana Starikovskaya Pattern Matching with Mismatches and Wildcards	ESA talk Sonja Kraiczy and Edith Elkind A Lower Bound for Local Search Proportional Approval Voting
17:20	ESA talk Bart M. P. Jansen and Céline Swennenhuis Steiner Tree Parameterized by Multiway Cut and Even Less	ESA talk Aranya Banerjee, Daniel Gibney and Sharma V. Thankachan Longest Common Substring with Gaps and Related Problems	ESA talk Svenja M. Griesbach, Max Klimm, Philipp Warode and Theresa Ziemke Optimizing Throughput and Makespan of Queuing Systems by Information Design
	chaired by Sampson Wong	chaired by Rolf Fagerberg	chaired by Zhiyi Huang	chaired by Jens Stoye
17:40	Reception

	Tuesday, 3 September (toggle details)
	WINDSOR AUD	WINDSOR 0-02 – 0-03	WINDSOR 0-04	WINDSOR 1-02 – 1-03	WINDSOR 1-04
08:50	ESA talk Sayan Bhattacharya, Martin Costa, Nadav Panski and Shay Solomon Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring	ESA talk Lars Gottesbüren, Nikos Parotsidis and Maximilian Probst Gutenberg Practical Expander Decomposition	ESA talk Jana Cslovjecsek, Michał Pilipczuk and Karol Węgrzycki Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
09:10	ESA talk Lukasz Kowalik Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time	ESA talk Felipe de C. Pereira, Pedro J. de Rezende, Tallys Yunes and Luiz F. B. Morato A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs	ESA talk Zipei Nie and Hang Zhou Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm
09:30	ESA talk Pu Wu, Huanyu Gu, Huiqin Jiang, Zehui Shao and Jin Xu A Faster Algorithm for the 4-Coloring Problem	ESA talk S M Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar and Bala Krishnamoorthy Semi-Streaming Algorithms for Weighted k-Disjoint Matchings	ESA talk Julia Baligacs, Yann Disser, Andreas Emil Feldmann and Anna Zych-Pawlewicz A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP		ALGOCLOUD talk Alexandros Spitalas, Charilaos Kapeletiotis and Kostas Tsichlas Degree Distribution Optimization in Historical Graphs
	chaired by David Harris	chaired by Christian Schulz	chaired by Emily Fox		chaired by …
09:50	Break
10:10	ESA talk Ivor van der Hoog, Irene Parada and Eva Rotenberg Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs	ESA talk Ahmad Biniaz Art Galleries and Mobile Guards: Revisiting O’Rourke’s Proof	ESA talk Max Dupré La Tour, Monika Henzinger and David Saulpic Fully Dynamic k-Means Coreset in Near-Optimal Update Time	WABI talk Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Esteban Gabory, Roberto Grossi and Nadia Pisanti A unifying taxonomy of pattern matching in degenerate strings and founder graphs	ALGOCLOUD talk Dimitrios Amaxilatis, Sarantis Papachristofilou and Christos Zaroliagis Edge-based Federated Learning Methods for Remaining Useful Life Estimation in IIoT
10:30	ESA talk Karthik Murali, Therese Biedl and Prosenjit Bose A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs	ESA talk Emily Fox A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs	ESA talk* Vipul Arora, Arnab Bhattacharyya, Mathews Boban, Venkatesan Guruswami and Esty Kelman Outlier Robust Multivariate Polynomial Regression	WABI talk Stephen Hwang, Nathaniel K. Brown, Omar Y. Ahmed, Katharine Jenike, Sam Kovaka, Michael C. Schatz and Ben Langmead MEM-based pangenome indexing for k-mer queries	ALGOCLOUD talk Iosif Arvanitis, Menelaos Panagiotis Papastergiou, Agorakis Mpompotas, Evangelos Geraridis, Ioanna Giannoukou, Ioannis Karydis and Spyros Sioutas Leveraging Apache Spark for Appliance-Level Load Monitoring with Ensemble Learning Techniques
10:50	ESA talk Gruia Calinescu and Sumedha Uniyal Local Optimization Algorithms for Maximum Planar Subgraph	ESA talk Enver Aman, Karthik C. S. and Sharath Punna On Connections Between k-Coloring and Euclidean k-Means	ESA talk Toru Yoshinaga and Yasushi Kawase The Last Success Problem with Samples	WABI talk Adam Cicherski, Anna Lisiecka and Norbert Dojer AlfaPang: alignment free algorithm for pangenome graph construction	ALGOCLOUD talk* Constantinos Bitsakos, Konstantinos Nikas and Nectarios Koziris QuantuML: Machine Learning Algorithms and K-means on Quantum Cloud offering
	chaired by Philipp Kindermann	chaired by …	chaired by Timothy Chan	chaired by Jens Stoye	chaired by …
11:10	Break
11:30	ESA keynote Eva Rotenberg Simple
	chaired by John Iacono
12:30	Lunch
14:00	ESA talk Mingyu Xiao Solving Directed Multiway Cut Faster Than 2ⁿ	ESA talk Kevin Buchin, Maike Buchin, Joachim Gudmundsson and Sampson Wong Bicriteria Approximation for Minimum Dilation Graph Augmentation	ESA talk Justin Kim, Rahul Varki, Marco Oliva and Christina Boucher Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage	WABI talk Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard and Manuel Lafond Finding Maximum Common Contractions Between Phylogenetic Networks*	ALGOCLOUD talk Trung Phan, Bao Tran Quoc, Hung Nguyen Nhat, Vinh Nguyen Thanh, Kha Nguyễn, Nguyen Van Minh, Le Khanh Tung, Ngan Nguyen Thi Kim, Bang Le and Son Xuan Innovating Medical Record Keeping with Blockchain, RSA-Encrypted NFTs, and Smart Contracts
14:20	ESA talk Gregory Schwartzman Local Max-Cut on Sparse Graphs	ESA talk Davide Bilò, Luciano Gualà, Stefano Leucci and Alessandro Straziota Graph Spanners for Group Steiner Distances	ESA talk Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane and Srinivasa Rao Satti A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs	WABI talk Yao-Ban Chan An efficient algorithm for the reconciliation of a gene network and species tree	ALGOCLOUD talk Spiros Grigoratos, Katerina Doka and Nectarios Koziris Outsourced Distributed Computation with PROOF
14:40	ESA talk Nathan Wallheimer and Amir Abboud Worst-Case to Expander-Case Reductions: Derandomized and Generalized	ESA talk Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas and Armin Wells How to Reduce Temporal Cliques to Find Sparse Spanners	ESA talk Henning Martin Woydt, Christian Komusiewicz and Frank Sommer SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints	WABI talk Tsuyoshi Urata, Manato Yokoyama and Momoko Hayamizu Orientability of undirected phylogenetic networks to a desired class: Practical algorithms and application to tree-child orientation	ALGOCLOUD talk Ryuto Kitagawa, Michael Goodrich and Vinesh Sridhar Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
	chaired by Gruia Calinescu	chaired by Panos Giannopoulos	chaired by Johannes Fischer	chaired by Mohammed El-Kebir	chaired by …
15:00	Break
15:20	ALGOCLOUD keynote Peter Triantafillou Machine Unlearning at Large
	chaired by …
16:20	Break
16:40	ESA A best paper Karl Bringmann, Anita Dürr and Adam Polak Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing			WABI talk Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales and Manuel Lafond The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees	ALGOCLOUD talk Domenico Garlisi, Stefano Milani, Christian Tedesco and Ioannis Chatzigiannakis Achieving Processing Balance in LoRaWAN Using Multiple Edge Gateways
17:00	ESA B best paper Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda and Simon Puglisi Height-Bounded Lempel-Ziv Encodings			WABI talk Lukas Hübner and Alexandros Stamatakis Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests	ALGOCLOUD talk* Sangram Kishor Jena and K. Subramani Optimizing resource-constrained distance matching for cloud based systems
17:20	ESA S best paper Zhiyi Huang, Zahra Parsaeian and Zixuan Zhu Laminar Matroid Secretary: Greedy Strikes Back			WABI talk Leonard Bohnenkämper, Jens Stoye and Daniel Dörr Reconstructing Rearrangement Phylogenies of Natural Genomes	ALGOCLOUD talk Erik van den Akker and Klaus-Tycho Foerster Short Paper: Towards 2-Resilient Local Failover in Destination-Based Routing
17:40	ESA best student paper Michael Zlatin and Daniel Hathcock Approximation Algorithms for Steiner Connectivity Augmentation			WABI talk Yuanyuan Qi and Mohammed El-Kebir Sapling: Inferring and Summarizing Tumor Phylogenies from Bulk Data using Backbone Trees	ALGOCLOUD business meeting
	chaired by Timothy Chan, Johannes Fischer, and John Iacono			chaired by Nadia Tahiri
18:00
18:30	Conference Dinner

	Wednesday, 4 September (toggle details)
	WINDSOR AUD	WINDSOR 0-02 – 0-03	WINDSOR 0-04	WINDSOR 1-02 – 1-03	WINDSOR 1-04
08:50	ESA talk Lech Duraj, Filip Konieczny and Krzysztof Potępa Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs	ESA talk Dvir Fried, Tsvi Kopelowitz and Ely Porat Removing the log Factor from (min,+)-Products on Bounded Range Integer Matrices	ESA talk Gruia Calinescu, Sami Davies, Samir Khuller and Shirley Zhang Online Flexible Busy Time Scheduling on Heterogeneous Machines	IPEC Best Paper talk Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, and Ziena Zeif Combining Crown Structures for Vulnerability Measures
09:10	ESA talk Elfarouk Harb, Zhengcheng Huang, and Da Wei Zheng Shortest Path Separators in Unit Disk Graphs	ESA talk Zsuzsanna Liptak, Francesco Masillo and Gonzalo Navarro A Textbook Solution for Dynamic Strings	ESA talk Konstantinos Dogeas, Thomas Erlebach and Ya-Chun Liang Scheduling with Obligatory Tests	IPEC talk Jakub Balabán, Robert Ganian, and Mathis Rocton Twin-Width Meets Feedback Edges and Vertex Integrity
09:30	ESA talk Shinwoo An, Eunjin Oh and Jie Xue Sparse Outerstring Graphs Have Logarithmic Treewidth	ESA talk Gerth Stølting Brodal, Rolf Fagerberg and Casper Rysgaard On Finding Longest Palindromic Subsequences Using Longest Common Subsequences	ESA talk Klaus Heeger and Danny Hermelin Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard	IPEC talk Paul Bastide and Carla Groenland Quasi-linear distance query reconstruction for graphs of bounded treelength
	chaired by Adam Polak	chaired by …	chaired by Karol Węgrzycki	chaired by Paweł Rzążewski
09:50	Break
10:10	ESA talk Bingbing Hu, Evangelos Kosinas and Adam Polak Connectivity Oracles for Predictable Vertex Failures	ESA talk* Dylan Hyatt-Denesik, Afrouz Jabal Ameli and Laura Sanita Improved Approximations for Flexible Network Design	ESA talk Florian Kurpicz, Pascal Mehnert, Peter Sanders and Matthias Schimek Scalable Distributed String Sorting	IPEC talk Karthik C. S., Euiwoong Lee, and Pasin Manurangsi On Equivalence of Parameterized Inapproximability of k-median, k-max-coverage, and 2-CSP	WABI talk Théo Boury, Laurent Bulteau and Yann Ponty RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs
10:30	ESA talk* Dipan Dey and Manoj Gupta Near Optimal Dual Fault Tolerant Distance Oracle	ESA talk Chandra Chekuri and Rhea Jain Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing	ESA talk Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov and Stefan Schmid Toward Self-Adjusting k-Ary Search Tree Networks	IPEC talk Matthias Kaul, Matthias Mnich, and Hendrik Molter Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates	WABI talk Kimon Boehmer, Sarah Juliane Berkemer, Sebastian Will and Yann Ponty RNA Triplet Repeats: Improved Algorithms for Structure Prediction and Interactions
10:50	ESA talk Kaito Harada, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles	ESA talk Yuhang Bai, Kristóf Bérczi, Gergely Csáji and Tamás Schwarcz Approximating Maximum-Size Properly Colored Forests	ESA talk Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders and Stefan Walzer PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding	IPEC talk* Ilan Doron-Arad, Ariel Kulik and Fabrizio Grandoni Unsplittable Flow on a Short Path	WABI talk Luis Cunha, Ignasi Sau and Uéverton Souza On the Complexity of the Median and Closest Permutation Problems
	chaired by Panagiotis Charalampopoulos	chaired by Zeev Nutov	chaired by Manuel Penschuk	chaired by Karolina Okrasa	chaired by Giulia Bernardini
11:10	Break
11:30	WABI keynote Tomáš Vinař Bioinformatics of Pathogens			IPEC keynote Szymon Toruńczyk Structurally tractable graph classes
	chaired by Solon P. Pissis			chaired by Édouard Bonnet
12:30	Lunch
14:00	Test-of-Time Award Raphael Yuster and Uri Zwick Fast Sparse Matrix Multiplication
14:30	Test-of-Time Award Giovanni Manzini, Paolo Ferragina Engineering a Lightweight Suffix Array Construction Algorithm
	chaired by Rasmus Pagh
15:00	Break
15:20	IPEC keynote (Nerode Prize Winners) Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos (Meta)kerlization
	chaired by …
16:20	Break
16:40	ESA talk Zeev Nutov Parameterized Algorithms for Node Connectivity Augmentation Problems	ESA talk Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai and Hsin Hao Su Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights	ESA talk Jean-Daniel Boissonnat and Kunal Dutta A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels	IPEC talk Jonas Lill, Kalina Petrova, and Simon Weber Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
17:00	ESA talk Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király and Shubhang Kulkarni Hypergraph Connectivity Augmentation in Strongly Polynomial Time	ESA talk Qisheng Wang and Zhicheng Zhang Time-Efficient Quantum Entropy Estimator via Samplizer	ESA talk Alexander Naumann, Annika Bonerath and Jan-Henrik Haunert Many-To-Many Polygon Matching à La Jaccard	IPEC talk Matthias Bentert, Fedor V. Fomin, Fanny Hauser, and Saket Saurabh The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
17:20	ESA talk Yuni Iwamasa, Yusuke Kobayashi and Kenjiro Takazawa Finding a Maximum Restricted t-Matching via Boolean Edge-CSP	ESA talk Tatsuya Terao and Ryuhei Mori Parameterized Quantum Query Algorithms for Graph Problems	ESA talk Loïc Dubois Making Multicurves Cross Minimally on Surfaces	IPEC talk Guilherme de Castro Mendes Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos Matching (Multi)Cut
17:40				IPEC talk Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, and Amer Mouawad Parameterized Shortest Path Reconfiguration
	chaired by Lukasz Kowalik	chaired by Danny Hermelin	chaired by Ahmad Biniaz	chaired by Fedor Fomin
17:50	ESA community meeting

	Thursday, 5 September (toggle details)
	WINDSOR AUD	WINDSOR 0-02 – 0-03	WINDSOR 0-04	WINDSOR 1-02 – 1-03	WINDSOR 1-04
08:50	IPEC talk Marvin Künnemann and Mirza Redzic Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs	WAOA talk Aflatoun Amouzandeh, Rob van Stee Improved Online Scheduling with Restarts on a Single Machine	ALGOWIN talk Siddharth Gupta, Marc van Kreveld, Othon Michail and Andreas Padalkin Collision Detection for Modular Robots — it is easy to cause collisions and hard to avoid them	ATMOS talk Justine Cauvi, Ruoying Li and Sabine Storandt Landmark Hub Labeling: Improved Bounds and Faster Query Answering
09:10	IPEC talk Henning Fernau and Kevin Mann Roman Hitting Functions	WAOA talk Kefu Lu, Mason Marchetti Maximizing Throughput for Parallel Jobs with Speed-up Curves	ALGOWIN talk Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul Spirakis Collision-Free Robot Scheduling	ATMOS talk David Coudert, Andrea D’Ascenzo and Mattia D’Emidio Indexing Graphs for Shortest Beer Path Queries
09:30	IPEC talk Peter Strulo, M. S. Ramanujan, Václav Blažej, and Sushmita Gupta On Controlling Knockout Tournaments Without Perfect Information	WAOA talk Rene Sitters, Tim Oosterwijk, Steven Miltenburg Complexity of Fixed Order Routing	ALGOWIN talk* Rik Banerjee, Manish Kumar and Anisur Rahaman Molla Optimizing Robot Dispersion on Unoriented Grids: with and without Fault Tolerance	ATMOS talk Jenny Enerbäck, Lukas Eveborn and Elina Rönnberg Pricing for the EVRPTW with Piecewise Linear Charging by a Bounding-Based Labeling Algorithm
	chaired by Ignasi Sau	chaired by Matthias Englert	chaired by Arnaud Casteigts	chaired by Spyros Kontogiannis
09:50	Break
10:10	IPEC talk Carla Groenland, Jesper Nederlof, and Tomohiro Koana A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor	WAOA talk Tim A. Hartmann, Tom Janßen Approximating delta-Covering	ALGOWIN talk Josef Erik Sedláček, Jan Matyáš Křišťan, Laurent Feuilloley and Jan Janoušek Decreasing verification radius in local certification	ATMOS talk Enrico Bortoletto, Rolf Nelson van Lieshout, Berenike Masing and Niels Lindner Periodic Event Scheduling with Flexible Infrastructure Assignment
10:30	IPEC talk Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond Kick the cliques	WAOA talk Zeev Nutov Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity	ALGOWIN talk* Michael Raskin Modular population protocols	ATMOS talk Héloïse Gachet and Frédéric Meunier Balanced Assignments of Periodic Tasks
10:50	IPEC talk Tomohiro Koana, Nidhi Purohit, and Kirill Simonov Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs	WAOA talk Sander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery	ALGOWIN talk Sandrine Njoo, Prosenjit Bose and Jean-Lou De Carufel The Exact Spanning Ratio of the Parallelogram Delaunay Graph	ATMOS talk Tomas Lidén, Christiane Schmidt and Rabii Zahir Two-Stage Weekly Shift Scheduling for Train Dispatchers
	chaired by Panos Giannopoulos	chaired by Marek Chrobak	chaired by Quentin Bramas	chaired by Matthias Müller-Hannemann
11:10	Break
11:30	ATMOS keynote Eduardo Uchoa Exact Algorithms for Vehicle Routing: advances, challenges, and perspectives
	chaired by Paul Bouman
12:30	Lunch
14:00	IPEC talk Anna Zych-Pawlewicz and Marek Żochowski Dynamic Parameterized Feedback Problems in Tournaments	WAOA talk Richard Shapley, David Shmoys Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs	ALGOWIN talk Sarah Feldmann and Torben Schürenberg On the Min-Max Star Partitioning Number	ATMOS talk Gianlorenzo D’Angelo, Mattia D’Emidio, Esmaeil Delfaraz and Gabriele Di Stefano Improved Algorithms for the Capacitated Team Orienteering Problem
14:20	IPEC talk Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset	WAOA talk Rajesh Chitnis, Samuel Thomas, Anthony Wirth Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths	ALGOWIN talk George Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis The threshold of existence of δ-temporal cliques in random simple temporal graphs	ATMOS talk Barbara M. Anthony, Christine Chung, Ananya Das and David Yuen New Bounds on the Performance of SBP for the Dial-a-Ride Problem with Revenues (Short Paper)
14:40	IPEC talk Yuxi Liu and Mingyu Xiao Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k	WAOA talk Sergio Cabello, Panos Giannopoulos Searching in Euclidean Spaces with Predictions	ALGOWIN talk Anthony Busson, Malory Marin and Rémi Watrigant Channel allocation revisited through 1-extendability of graphs	ATMOS talk Spyros Kontogiannis, Andreas Paraskevopoulos, Christos Zaroliagis Online Vehicle Routing with Pickups and Deliveries Under Time-Dependent Travel-Time Constraints
	chaired by Łukasz Kowalik	chaired by Zeev Nutov	chaired by …	chaired by Christos Zaroliagis
15:00	Break
15:20	WAOA keynote Rico Zenklusen Advances in Approximation Algorithms for Tree and Connectivity Augmentation
16:20	Break
16:40	IPEC PACE Awards Session			ATMOS talk Sven Jäger, Sarah Roth and Anita Schöbel Periodic Timetabling: Travel Time vs. Regenerative Energy
17:00				ATMOS talk Fabian Löbel, Ralf Borndörfer, Andreas Löbel and Steffen Weider Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach
17:20				ATMOS talk Stefan Engels and Robert Wille Towards an Optimization Pipeline for the Design of Train Control Systems with Hybrid Train Detection (Short Paper)
	chaired by …			chaired by Rolf van Lieshout
17:40	Break
17:50	IPEC business meeting		ALGOWIN business meeting	ATMOS business meeting
	chaired by Magnus Wahlström

Friday, 6 September (toggle details)

08:50

IPEC talk
Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F.A. Verhaegh
Preprocessing to Reduce the Search Space for Odd Cycle Transversal

WAOA talk
Mihail Stoian
Approximate Min-Sum Subset Convolution

ALGOWIN talk
David Kutner and Iain Stewart
Reconfigurable routing in data center networks

ATMOS talk
Felix Prause and Ralf Borndörfer
A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance

09:10

IPEC talk
Jakob Greilhuber and Roohani Sharma
Component Order Connectivity admits no polynomial kernel parameterized by the feedback vertex set number

WAOA talk
Svein Høgemo
Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees

ALGOWIN talk
Zeev Nutov and Dawod Kahba
A 1.5-approximation algorithm for activating 2 disjoint st-paths

ATMOS talk
Kendra Reiter, Marie Schmidt and Michael Stiglmayr
The Line-Based Dial-a-Ride Problem

09:30

IPEC talk*
Ishay Haviv and Dror Rabinovich
Kernelization for Orthogonality Dimension

WAOA talk
Philip Whittington
Online String Attractors

ALGOWIN talk
Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav and Marek Chrobak
On Permutation Selectors and Their Applications in Ad-Hoc Radio Networks Protocols

ATMOS talk
Philine Schiewe, Anita Schöbel and Reena Urban
A Bi-Objective Optimization Model for Fare Structure Design in Public Transport

chaired by George Osipov

chaired by Łukasz Kowalik

chaired by Othon Michail

chaired by Paul Bouman

09:50

Break

10:10

IPEC talk
Peter Strulo, Václav Blažej, M. S. Ramanujan, and Satyabrata Jana
On the Parameterized Complexity of Eulerian Strong Component Deletion

WAOA talk
Stefan Hougardy, Karolina Tammemaa
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching

ALGOWIN Best student paper
Nada Almalki, Siddharth Gupta and Othon Michail
On the Exponential Growth of Geometric Shapes

ALGOWIN Best paper (starting 10:40)
Khaled Jawhar and Evangelos Kranakis
Bike Assisted Evacuation on a Line of Robots with Communication Faults

ATMOS talk
Loic Helouet, Kenza Saiah and Antoine Thebault
Modeling Subway Networks and Passenger Flows

10:30

IPEC talk
Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis
Parameterised distance to local irregularity

WAOA talk
Tung-Wei Kuo
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line

ATMOS talk
Tobias Harks, Sven Jäger, Michael Markl and Philine Schiewe
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities

10:50

IPEC talk
Jaroslav Garvardt and Christian Komusiewicz
Modularity Clustering parameterized by Max Leaf Number

WAOA talk
Dylan Hyatt-Denesik, Danny Blom, Afrouz Jabal Ameli, Bart Smeulders
Approximation Algorithms for k-Scenario Matching

ATMOS talk
Julian Patzner and Matthias Müller-Hannemann
Dynamic Traffic Assignment for Public Transport with Vehicle Capacities

chaired by Karol Węgrzycki

chaired by Marcin Bieńkowski

chaired by Marek Chrobak

chaired by Philine Schiewe

11:10

Break

11:30

ALGOWIN keynote
Petra Berenbrink
The Population Model as Model for Sensor-Networks

chaired by …

12:30

Lunch

14:00

End