{"id":435,"date":"2024-08-11T15:06:56","date_gmt":"2024-08-11T15:06:56","guid":{"rendered":"https:\/\/algo-conference.org\/2024\/?page_id=435"},"modified":"2024-09-05T07:34:39","modified_gmt":"2024-09-05T07:34:39","slug":"schedule","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2024\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n

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

<\/p>\n\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 \n \n \n \n \n
<\/td>\n Monday, 2 September  (toggle details)<\/a><\/td>\n <\/tr>\n
<\/td>\n WINDSOR AUD<\/a><\/td>\n WINDSOR 0-02 – 0-03<\/a><\/td>\n WINDSOR 0-04<\/a><\/td>\n WINDSOR 1-02 – 1-03<\/a><\/td>\n WINDSOR 1-04<\/a><\/td> \n <\/tr>\n
08:00<\/td>\n Registration desk opens<\/a><\/td>\n <\/tr>\n
08:50<\/td>\n ESA talk<\/b>
Sally Dong and Guanghao Ye
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk*<\/b>
Tatiana Belova, Nikolai Chukhin, Alexander Kulikov and Ivan Mihajlin
Improved Space Bounds for Subset Sum<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Amit Chakrabarti, Andrew McGregor and Anthony Wirth
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Giulio Ermanno Pibiri and Ragnar Groot Koerkamp
The mod-minimizer: a simple and efficient sampling algorithm for long k-mers<\/i><\/span><\/td>\n <\/tr>\n
09:10<\/td>\n ESA talk<\/b>
Matthew Ding and Jason Li
Deterministic Minimum Steiner Cut in Maximum Flow Time<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Timothy Randolph and Karol W\u0119grzycki
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Cezar-Mihail Alexandru and Christian Konrad
Interval Selection in Sliding Windows<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Mahmudur Rahman Hera and David Koslicki
Cosine Similarity Estimation Using FracMinHash: Theoretical Analysis, Safety Conditions, and Implementation<\/i><\/span><\/td>\n <\/tr>\n
9:30<\/td>\n ESA talk<\/b>
Shimon Kogan and Merav Parter
The Algorithmic Power of the Greene-Kleitman Theorem<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Cornelius Brand, Martin Koutecky, Alexandra Lassota and Sebastian Ordyniak
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Prantar Ghosh and Sahil Kuchlous
New Algorithms and Lower Bounds for Streaming Tournaments<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Jens Zentgraf and Sven Rahmann
Swiftly identifying strongly unique k-mers<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Gerth Brodal<\/td>\n chaired by Timothy Chan<\/td>\n chaired by Rasmus Pagh<\/td>\n chaired by Solon P. Pissis<\/td>\n <\/tr>\n
09:50<\/td>\n Break<\/td>\n <\/tr>\n
10:10<\/td>\n ESA talk<\/b>
Paloma de Lima, Martin Milani\u010d, Peter Mur\u0161i\u010d, Karolina Okrasa, Pawe\u0142 Rz\u0105\u017cewski and Kenny \u0160torgel
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Karl Bringmann, Ahmed Ghazy and Marvin K\u00fcnnemann
Exploring the Approximability Landscape of 3SUM<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Fritz B\u00f6kler, Markus Chimani, Henning Jasper and Mirko H. Wagner
Exact Minimum Weight Spanners via Column Generation<\/a>\n<\/i><\/span><\/td>\n 		WABI Invited talk<\/b>
Giulia Bernardini
Solving phylogenetic problems through graph theory: two case studies<\/i><\/span><\/td>\n <\/tr>\n
10:30<\/td>\n ESA talk<\/b>
Jacob Focke, Fabian Frei, Shaohua Li, D\u00e1niel Marx, Philipp Schepper, Roohani Sharma and Karol W\u0119grzycki
Hitting Meets Packing: How Hard Can It Be?<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Lotte Blank and Anne Driemel
A Faster Algorithm for the Fr\u00e9chet Distance in 1D for the Imbalanced Case<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Alexander Leonhardt, Ulrich Meyer and Manuel Penschuck
Insights into (k, \u03c1)-Shortcutting Algorithms<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
10:50<\/td>\n ESA talk<\/b>
Baris Can Esmer, Jacob Focke, D\u00e1niel Marx and Pawe\u0142 Rz\u0105\u017cewski
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Itai Boneh, Shay Golan and Arseny Shur
String 2-Covers with No Length Restrictions<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Henrik Reinst\u00e4dtler, Christian Schulz and Bora U\u00e7ar
Engineering Edge Orientation Algorithms<\/a>\n<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Bart Jansen<\/td>\n chaired by Panagiotis Charalampopoulos<\/td>\n chaired by Jonas Ellert<\/td>\n chaired by Solon P. Pissis<\/td>\n <\/tr>\n
11:10<\/td>\n Break<\/td>\n <\/tr>\n
11:30<\/td>\n ESA keynote<\/b>
Vincent Cohen-Addad
Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back<\/a>\n <\/i><\/span><\/td>\n<\/tr>\n
<\/td>\n chaired by Timothy Chan<\/td>\n <\/tr>\n
12:30<\/td>\n Lunch<\/td>\n <\/tr>\n
14:00<\/td>\n ESA talk<\/b>
George Osipov, Marcin Pilipczuk and Magnus Wahlstr\u00f6m
Parameterized Complexity of MinCSP over the Point Algebra<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Pawel Gawrychowski and Mateusz Wasylkiewicz
Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Pankaj K Agarwal, Haim Kaplan, Matthew J. Katz and Micha Sharir
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments<\/a><\/i><\/span><\/td>\n 		WABI talk<\/b>
Sebastian Schmidt, Santeri Toivonen, Paul Medvedev and Alexandru I. Tomescu
Applying the safe-and-complete framework to practical genome assembly<\/i><\/span><\/td>\n <\/tr>\n
14:20<\/td>\n ESA talk<\/b>
Konrad Majewski, Micha\u0142 Pilipczuk and Anna Zych-Pawlewicz
Parameterized Dynamic Data Structure for Split Completion<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Amir Abboud, Tomer Grossman, Moni Naor and Tomer Solomon
From Donkeys to Kings in Tournaments<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Matthew J. Katz, Rachel Saban and Micha Sharir
Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain<\/a>\n <\/i><\/span><\/td>\n 		WABI talk<\/b>
Ragnar Groot Koerkamp
A*PA2: Up to 19\u00d7 faster exact global alignment<\/i><\/span><\/td>\n <\/tr>\n
14:40<\/td>\n ESA talk<\/b>
Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, Satyabrata Jana and Saket Saurabh
Cuts in Graphs with Matroid Constraints<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Justin Dallant, Frederik Haagensen, Riko Jacob, L\u00e1szl\u00f3 Kozma and Sebastian Wild
An Optimal Randomized Algorithm for Finding the Saddlepoint<\/a>\n<\/i><\/span><\/td>\n 		ESA talk*<\/b>
Pankaj Agarwal, Esther Ezra and Micha Sharir
Lower Envelopes of Surface Patches in 3-Space<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben Yehezkel, Ryan Kelley and Mingfu Shao
Anchorage accurately assembles anchor-flanked synthetic long reads<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Bart Jansen<\/td>\n chaired by John Iacono<\/td>\n chaired by Emily Fox<\/td>\n chaired by Giulio Ermanno Pibiri<\/td>\n <\/td> \n <\/tr>\n
15:00<\/td>\n Break<\/td>\n <\/tr>\n
15:20<\/td>\n ESA talk<\/b>
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski and Mark Simkin
Invertible Bloom Lookup Tables with Less Memory and Randomness<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Mohit Garg, Debajyoti Kar and Arindam Khan
Random-Order Online Independent Set of Intervals and Hyperrectangles<\/a>\n<\/i><\/span><\/td>\n 		ESA talk*<\/b>
Rohit Gurjar, Taihei Oki and Roshan Raj
Fractional Linear Matroid Matching Is in Quasi-NC<\/a>\n <\/i><\/span><\/td>\n 		WABI talk<\/b>
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<\/i><\/span><\/td>\n <\/tr>\n
15:40<\/td>\n ESA talk<\/b>
Samuel McCauley
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Rajmohan Rajaraman and Omer Wasim
Competitive Capacitated Online Recoloring<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Khalid Hourani, William K. Moses Jr. and Gopal Pandurangan
Towards Communication-Efficient Peer-To-Peer Networks<\/a><\/i><\/span><\/td>\n 		WABI talk<\/b>
Md. Hasin Abrar and Paul Medvedev
PLA-index: A k-mer Index Exploiting Rank Curve Linearity<\/i><\/span><\/td>\n <\/tr>\n
16:00<\/td>\n ESA talk<\/b>
Shimon Kogan and Merav Parter
Giving Some Slack: Shortcuts and Transitive Closure Compressions<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen and L\u00e1szl\u00f3 Kozma
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Slobodan Mitrovi\u0107, Ronitt Rubinfeld and Mihir Singhal
Locally Computing Edge Orientations<\/a>\n <\/i><\/span><\/td>\n 		WABI talk<\/b>
Giovanni Buzzega, Alessio Conte, Roberto Grossi and Giulia Punzi
McDag: Indexing Maximal Common Subsequences in Practice<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Gerth Brodal<\/td>\n chaired by Thomas Erlebach<\/td>\n chaired by Gregory Schwartzman<\/td>\n chaired by Paul Medvedev<\/td>\n <\/tr>\n
16:20<\/td>\n Break<\/td>\n <\/tr>\n
16:40<\/td>\n ESA talk<\/b>
Yann Disser, Svenja M. Griesbach, Max Klimm and Annette Lutz
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Gabriel Bathie, Panagiotis Charalampopoulos and Tatiana Starikovskaya
Longest Common Extensions with Wildcards: Trade-Off and Applications<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Vittorio Bilo, Evangelos Markakis and Cosimo Vinci
Achieving Envy-Freeness Through Items Sale<\/a>\n <\/i><\/span><\/td>\n 		WABI Community meeting<\/b><\/td>\n <\/tr>\n
17:00<\/td>\n ESA talk<\/b>
Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, and Weihao Zhu
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Gabriel Bathie, Panagiotis Charalampopoulos and Tatiana Starikovskaya
Pattern Matching with Mismatches and Wildcards<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Sonja Kraiczy and Edith Elkind
A Lower Bound for Local Search Proportional Approval Voting<\/a>\n<\/i><\/span><\/td>\n <\/tr>\n
17:20<\/td>\n ESA talk<\/b>
Bart M. P. Jansen and C\u00e9line Swennenhuis
Steiner Tree Parameterized by Multiway Cut and Even Less<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Aranya Banerjee, Daniel Gibney and Sharma V. Thankachan
Longest Common Substring with Gaps and Related Problems<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Svenja M. Griesbach, Max Klimm, Philipp Warode and Theresa Ziemke
Optimizing Throughput and Makespan of Queuing Systems by Information Design<\/a>\n<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Sampson Wong<\/td>\n chaired by Rolf Fagerberg<\/td>\n chaired by Zhiyi Huang<\/td>\n chaired by Jens Stoye<\/td>\n <\/tr>\n
17:40<\/td>\n Reception<\/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 \n
<\/td>\n Tuesday, 3 September  (toggle details)<\/a><\/td>\n <\/tr>\n
<\/td>\n WINDSOR AUD<\/a><\/td>\n WINDSOR 0-02 – 0-03<\/a><\/td>\n WINDSOR 0-04<\/a><\/td>\n WINDSOR 1-02 – 1-03<\/a><\/td>\n WINDSOR 1-04<\/a><\/td>\n <\/tr>\n
08:50<\/td>\n ESA talk<\/b>
Sayan Bhattacharya, Martin Costa, Nadav Panski and Shay Solomon
Density-Sensitive Algorithms for (\u0394 + 1)-Edge Coloring<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Lars Gottesb\u00fcren, Nikos Parotsidis and Maximilian Probst Gutenberg
Practical Expander Decomposition<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Jana Cslovjecsek, Micha\u0142 Pilipczuk and Karol W\u0119grzycki
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments<\/a>\n<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
09:10<\/td>\n ESA talk<\/b>
Lukasz Kowalik
Edge-Coloring Sparse Graphs with \u0394 Colors in Quasilinear Time<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
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<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Zipei Nie and Hang Zhou
Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm<\/a>\n<\/i><\/span><\/td>\n <\/tr>\n
09:30<\/td>\n ESA talk<\/b>
Pu Wu, Huanyu Gu, Huiqin Jiang, Zehui Shao and Jin Xu
A Faster Algorithm for the 4-Coloring Problem<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
S M Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar and Bala Krishnamoorthy
Semi-Streaming Algorithms for Weighted k-Disjoint Matchings<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Julia Baligacs, Yann Disser, Andreas Emil Feldmann and Anna Zych-Pawlewicz
A (5\/3+\u03b5)-Approximation for Tricolored Non-Crossing Euclidean TSP<\/a>\n <\/i><\/span><\/td>\n 		<\/td>\n ALGOCLOUD talk<\/b>
Alexandros Spitalas, Charilaos Kapeletiotis and Kostas Tsichlas
Degree Distribution Optimization in Historical Graphs<\/i><\/span><\/td>\n\n <\/tr>\n
<\/td>\n chaired by David Harris<\/td>\n chaired by Christian Schulz<\/td>\n chaired by Emily Fox<\/td>\n <\/td>\n chaired by …<\/td>\n <\/tr>\n
09:50<\/td>\n Break<\/td>\n <\/tr>\n
10:10<\/td>\n ESA talk<\/b>
Ivor van der Hoog, Irene Parada and Eva Rotenberg
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Ahmad Biniaz
Art Galleries and Mobile Guards: Revisiting O’Rourke\u2019s Proof<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Max Dupr\u00e9 La Tour, Monika Henzinger and David Saulpic
Fully Dynamic k-Means Coreset in Near-Optimal Update Time<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
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<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Dimitrios Amaxilatis, Sarantis Papachristofilou and Christos Zaroliagis
Edge-based Federated Learning Methods for Remaining Useful Life Estimation in IIoT<\/i><\/span><\/td>\n <\/tr>\n
10:30<\/td>\n ESA talk<\/b>
Karthik Murali, Therese Biedl and Prosenjit Bose
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Emily Fox
A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs<\/a><\/i><\/span><\/td>\n 		ESA talk*<\/b>
Vipul Arora, Arnab Bhattacharyya, Mathews Boban, Venkatesan Guruswami and Esty Kelman
Outlier Robust Multivariate Polynomial Regression<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
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<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
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<\/i><\/span><\/td>\n <\/tr>\n
10:50<\/td>\n ESA talk<\/b>
Gruia Calinescu and Sumedha Uniyal
Local Optimization Algorithms for Maximum Planar Subgraph<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Enver Aman, Karthik C. S. and Sharath Punna
On Connections Between k-Coloring and Euclidean k-Means<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Toru Yoshinaga and Yasushi Kawase
The Last Success Problem with Samples<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Adam Cicherski, Anna Lisiecka and Norbert Dojer
AlfaPang: alignment free algorithm for pangenome graph construction<\/i><\/span><\/td>\n 		ALGOCLOUD talk*<\/b>
Constantinos Bitsakos, Konstantinos Nikas and Nectarios Koziris
QuantuML: Machine Learning Algorithms and K-means on Quantum Cloud offering<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Philipp Kindermann<\/td>\n chaired by …<\/td>\n chaired by Timothy Chan<\/td>\n chaired by Jens Stoye<\/td>\n chaired by …<\/td>\n <\/tr>\n
11:10<\/td>\n Break<\/td>\n <\/tr>\n
11:30<\/td>\n ESA keynote<\/b>
Eva Rotenberg
Simple<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by John Iacono<\/td>\n <\/tr>\n
12:30<\/td>\n Lunch<\/td>\n <\/tr>\n
14:00<\/td>\n ESA talk<\/b>
Mingyu Xiao
Solving Directed Multiway Cut Faster Than 2\u207f<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Kevin Buchin, Maike Buchin, Joachim Gudmundsson and Sampson Wong
Bicriteria Approximation for Minimum Dilation Graph Augmentation<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Justin Kim, Rahul Varki, Marco Oliva and Christina Boucher
Re\u00b2Pair: Increasing the Scalability of RePair by Decreasing Memory Usage<\/a>\n <\/i><\/span><\/td>\n 		WABI talk<\/b>
Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard and Manuel Lafond
Finding Maximum Common Contractions Between Phylogenetic Networks*<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Trung Phan, Bao Tran Quoc, Hung Nguyen Nhat, Vinh Nguyen Thanh, Kha Nguy\u1ec5n, 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<\/i><\/span><\/td>\n <\/tr>\n
14:20<\/td>\n ESA talk<\/b>
Gregory Schwartzman
Local Max-Cut on Sparse Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Davide Bil\u00f2, Luciano Gual\u00e0, Stefano Leucci and Alessandro Straziota
Graph Spanners for Group Steiner Distances<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
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<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Yao-Ban Chan
An efficient algorithm for the reconciliation of a gene network and species tree<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Spiros Grigoratos, Katerina Doka and Nectarios Koziris
Outsourced Distributed Computation with PROOF<\/i><\/span><\/td>\n <\/tr>\n
14:40<\/td>\n ESA talk<\/b>
Nathan Wallheimer and Amir Abboud
Worst-Case to Expander-Case Reductions: Derandomized and Generalized<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
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<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Henning Martin Woydt, Christian Komusiewicz and Frank Sommer
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints<\/a>\n<\/i><\/span><\/td>\n 		WABI talk<\/b>
Tsuyoshi Urata, Manato Yokoyama and Momoko Hayamizu
Orientability of undirected phylogenetic networks to a desired class: Practical algorithms and application to tree-child orientation<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Ryuto Kitagawa, Michael Goodrich and Vinesh Sridhar
Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Gruia Calinescu<\/td>\n chaired by Panos Giannopoulos<\/td>\n chaired by Johannes Fischer<\/td>\n chaired by Mohammed El-Kebir<\/td>\n chaired by …<\/td>\n <\/tr>\n
15:00<\/td>\n Break<\/td>\n <\/tr>\n
15:20<\/td>\n ALGOCLOUD keynote<\/b>
Peter Triantafillou
Machine Unlearning at Large<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by …<\/td>\n <\/td>\n <\/tr>\n
16:20<\/td>\n Break<\/td>\n <\/tr>\n
16:40<\/td>\n ESA A best paper<\/b>
Karl Bringmann, Anita D\u00fcrr and Adam Polak
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing<\/a>\n<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/b><\/td>\n WABI talk<\/b>
Alitzel L\u00f3pez S\u00e1nchez, Jos\u00e9 Antonio Ram\u00edrez-Rafael, Alejandro Flores-Lamas, Maribel Hern\u00e1ndez-Rosales and Manuel Lafond
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Domenico Garlisi, Stefano Milani, Christian Tedesco and Ioannis Chatzigiannakis
Achieving Processing Balance in LoRaWAN Using Multiple Edge Gateways<\/i><\/span><\/td>\n <\/tr>\n
17:00<\/td>\n ESA B best paper<\/b>
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda and Simon Puglisi
Height-Bounded Lempel-Ziv Encodings<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/b><\/td>\n WABI talk<\/b>
Lukas H\u00fcbner and Alexandros Stamatakis
Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests<\/i><\/span><\/td>\n 		ALGOCLOUD talk*<\/b>
Sangram Kishor Jena and K. Subramani
Optimizing resource-constrained distance matching for cloud based systems<\/i><\/span><\/td>\n <\/tr>\n
17:20<\/td>\n ESA S best paper<\/b>
Zhiyi Huang, Zahra Parsaeian and Zixuan Zhu
Laminar Matroid Secretary: Greedy Strikes Back<\/a>\n<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/b><\/td>\n WABI talk<\/b>
Leonard Bohnenk\u00e4mper, Jens Stoye and Daniel D\u00f6rr
Reconstructing Rearrangement Phylogenies of Natural Genomes<\/i><\/span><\/td>\n 		ALGOCLOUD talk<\/b>
Erik van den Akker and Klaus-Tycho Foerster
Short Paper: Towards 2-Resilient Local Failover in Destination-Based Routing<\/i><\/span><\/td>\n <\/tr>\n
17:40<\/td>\n ESA best student paper<\/b>
Michael Zlatin and Daniel Hathcock
Approximation Algorithms for Steiner Connectivity Augmentation<\/a>\n<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/b><\/td>\n WABI talk<\/b>
Yuanyuan Qi and Mohammed El-Kebir
Sapling: Inferring and Summarizing Tumor Phylogenies from Bulk Data using Backbone Trees<\/i><\/span><\/td>\n 		ALGOCLOUD business meeting<\/b><\/td>\n <\/tr>\n
<\/td>\n chaired by Timothy Chan, Johannes Fischer, and John Iacono<\/td>\n <\/td>\n <\/td>\n chaired by Nadia Tahiri<\/td>\n <\/tr>\n
18:00<\/td>\n \n <\/tr>\n
18:30<\/td>\n Conference 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
<\/td>\n Wednesday, 4 September  (toggle details)<\/a><\/td>\n <\/tr>\n
<\/td>\n WINDSOR AUD<\/a><\/td>\n WINDSOR 0-02 – 0-03<\/a><\/td>\n WINDSOR 0-04<\/a><\/td>\n WINDSOR 1-02 – 1-03<\/a><\/td>\n WINDSOR 1-04<\/a><\/td>\n <\/tr>\n
08:50<\/td>\n ESA talk<\/b>
Lech Duraj, Filip Konieczny and Krzysztof Pot\u0119pa
Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs<\/a><\/i><\/span><\/td>\n 		ESA talk<\/b>
Dvir Fried, Tsvi Kopelowitz and Ely Porat
Removing the log Factor from (min,+)-Products on Bounded Range Integer Matrices<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Gruia Calinescu, Sami Davies, Samir Khuller and Shirley Zhang
Online Flexible Busy Time Scheduling on Heterogeneous Machines<\/a>\n<\/i><\/span><\/td>\n 		IPEC Best Paper talk<\/b>
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, and Ziena Zeif
Combining Crown Structures for Vulnerability Measures<\/i><\/span><\/td>\n <\/tr>\n
09:10<\/td>\n ESA talk<\/b>
Elfarouk Harb, Zhengcheng Huang, and Da Wei Zheng
Shortest Path Separators in Unit Disk Graphs<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Zsuzsanna Liptak, Francesco Masillo and Gonzalo Navarro
A Textbook Solution for Dynamic Strings<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Konstantinos Dogeas, Thomas Erlebach and Ya-Chun Liang
Scheduling with Obligatory Tests<\/a>\n<\/i><\/span><\/td>\n 		IPEC talk<\/b>
Jakub Balab\u00e1n, Robert Ganian, and Mathis Rocton
Twin-Width Meets Feedback Edges and Vertex Integrity<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
09:30<\/td>\n ESA talk<\/b>
Shinwoo An, Eunjin Oh and Jie Xue
Sparse Outerstring Graphs Have Logarithmic Treewidth<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Gerth St\u00f8lting Brodal, Rolf Fagerberg and Casper Rysgaard
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Klaus Heeger and Danny Hermelin
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard<\/a>\n <\/i><\/span><\/td>\n 		IPEC talk<\/b>
Paul Bastide and Carla Groenland
Quasi-linear distance query reconstruction for graphs of bounded treelength<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
<\/td>\n chaired by Adam Polak<\/td>\n chaired by …<\/td>\n chaired by Karol W\u0119grzycki<\/td>\n chaired by Pawe\u0142 Rz\u0105\u017cewski<\/td>\n <\/tr>\n
09:50<\/td>\n Break<\/td>\n <\/tr>\n
10:10<\/td>\n ESA talk<\/b>
Bingbing Hu, Evangelos Kosinas and Adam Polak
Connectivity Oracles for Predictable Vertex Failures<\/a>\n<\/i><\/span><\/td>\n 		ESA talk*<\/b>
Dylan Hyatt-Denesik, Afrouz Jabal Ameli and Laura Sanita
Improved Approximations for Flexible Network Design<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Florian Kurpicz, Pascal Mehnert, Peter Sanders and Matthias Schimek
Scalable Distributed String Sorting<\/a>\n<\/i><\/span><\/td>\n 		IPEC talk<\/b>
Karthik C. S., Euiwoong Lee, and Pasin Manurangsi
On Equivalence of Parameterized Inapproximability of k-median, k-max-coverage, and 2-CSP<\/i><\/span><\/td>\n 		WABI talk<\/b>
Th\u00e9o Boury, Laurent Bulteau and Yann Ponty
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
10:30<\/td>\n ESA talk*<\/b>
Dipan Dey and Manoj Gupta
Near Optimal Dual Fault Tolerant Distance Oracle<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Chandra Chekuri and Rhea Jain
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov and Stefan Schmid
Toward Self-Adjusting k-Ary Search Tree Networks<\/a>\n <\/i><\/span><\/td> \n 		IPEC talk<\/b>
Matthias Kaul, Matthias Mnich, and Hendrik Molter
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates<\/i><\/span><\/td>\n 		WABI talk<\/b>
Kimon Boehmer, Sarah Juliane Berkemer, Sebastian Will and Yann Ponty
RNA Triplet Repeats: Improved Algorithms for Structure Prediction and Interactions<\/i><\/span><\/td>\n <\/tr>\n
10:50<\/td>\n ESA talk<\/b>
Kaito Harada, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Yuhang Bai, Krist\u00f3f B\u00e9rczi, Gergely Cs\u00e1ji and Tam\u00e1s Schwarcz
Approximating Maximum-Size Properly Colored Forests<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders and Stefan Walzer
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding<\/a>\n <\/i><\/span><\/td>\n 		IPEC talk*<\/b>
Ilan Doron-Arad, Ariel Kulik and Fabrizio Grandoni
Unsplittable Flow on a Short Path<\/i><\/span><\/td>\n 		WABI talk<\/b>
Luis Cunha, Ignasi Sau and U\u00e9verton Souza
On the Complexity of the Median and Closest Permutation Problems<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Panagiotis Charalampopoulos<\/td>\n chaired by Zeev Nutov<\/td>\n chaired by Manuel Penschuk<\/td>\n chaired by Karolina Okrasa<\/td>\n chaired by Giulia Bernardini<\/td>\n <\/tr>\n
11:10<\/td>\n Break<\/td>\n <\/tr>\n
11:30<\/td>\n WABI keynote<\/b>
Tom\u00e1\u0161 Vina\u0159
Bioinformatics of Pathogens<\/i><\/span><\/td>\n 		<\/td>\n <\/td>\n IPEC keynote<\/b>
Szymon Toru\u0144czyk
Structurally tractable graph classes<\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Solon P. Pissis<\/td>\n <\/td>\n <\/td>\n chaired by \u00c9douard Bonnet<\/td>\n <\/tr>\n
12:30<\/td>\n Lunch<\/td>\n <\/tr>\n
14:00<\/td>\n Test-of-Time Award<\/b>
Raphael Yuster and Uri Zwick
Fast Sparse Matrix Multiplication<\/a><\/i><\/span><\/td>\n\n <\/tr>\n
14:30<\/td>\n Test-of-Time Award<\/b>
Giovanni Manzini, Paolo Ferragina
Engineering a Lightweight Suffix Array Construction Algorithm<\/a><\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Rasmus Pagh<\/td>\n <\/td>\n <\/td>\n \n <\/tr>\n
15:00<\/td>\n Break<\/td>\n <\/tr>\n
15:20<\/td>\n IPEC keynote (Nerode Prize Winners)<\/b>
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos
(Meta)kerlization<\/a><\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by …<\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/tr>\n
16:20<\/td>\n Break<\/td>\n <\/tr>\n
16:40<\/td>\n ESA talk<\/b>
Zeev Nutov
Parameterized Algorithms for Node Connectivity Augmentation Problems<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
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<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Jean-Daniel Boissonnat and Kunal Dutta
A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels<\/a>\n<\/i><\/span><\/td>\n 		IPEC talk<\/b>
Jonas Lill, Kalina Petrova, and Simon Weber
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turz\u00edk Bound<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/b><\/td>\n <\/tr>\n
17:00<\/td>\n ESA talk<\/b>
Krist\u00f3f B\u00e9rczi, Karthekeyan Chandrasekaran, Tam\u00e1s Kir\u00e1ly and Shubhang Kulkarni
Hypergraph Connectivity Augmentation in Strongly Polynomial Time<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Qisheng Wang and Zhicheng Zhang
Time-Efficient Quantum Entropy Estimator via Samplizer<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Alexander Naumann, Annika Bonerath and Jan-Henrik Haunert
Many-To-Many Polygon Matching \u00e0 La Jaccard<\/a>\n <\/i><\/span><\/td>\n 		IPEC talk<\/b>
Matthias Bentert, Fedor V. Fomin, Fanny Hauser, and Saket Saurabh
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
17:20<\/td>\n ESA talk<\/b>
Yuni Iwamasa, Yusuke Kobayashi and Kenjiro Takazawa
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP<\/a>\n <\/i><\/span><\/td>\n 		ESA talk<\/b>
Tatsuya Terao and Ryuhei Mori
Parameterized Quantum Query Algorithms for Graph Problems<\/a>\n<\/i><\/span><\/td>\n 		ESA talk<\/b>
Lo\u00efc Dubois
Making Multicurves Cross Minimally on Surfaces<\/a>\n<\/i><\/span><\/td>\n 		IPEC talk<\/b>
Guilherme de Castro Mendes Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos
Matching (Multi)Cut<\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
17:40<\/td>\n <\/b><\/td>\n <\/b><\/td>\n <\/b><\/td>\n IPEC talk<\/b>
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, and Amer Mouawad
Parameterized Shortest Path Reconfiguration<\/i><\/span><\/td>\n <\/tr> \n
<\/td>\n chaired by Lukasz Kowalik<\/td>\n chaired by Danny Hermelin<\/td>\n chaired by Ahmad Biniaz<\/td>\n chaired by Fedor Fomin<\/td>\n <\/tr>\n
17:50<\/td>\n ESA 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 \n \n \n
<\/td>\n Thursday, 5 September  (toggle details)<\/a><\/td>\n <\/tr>\n
<\/td>\n WINDSOR AUD<\/a><\/td>\n WINDSOR 0-02 – 0-03<\/a><\/td>\n WINDSOR 0-04<\/a><\/td>\n WINDSOR 1-02 – 1-03<\/a><\/td>\n WINDSOR 1-04<\/a><\/td>\n <\/tr>\n
08:50<\/td>\n IPEC talk<\/b>
Marvin K\u00fcnnemann and Mirza Redzic
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Aflatoun Amouzandeh, Rob van Stee
Improved Online Scheduling with Restarts on a Single Machine<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
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<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Justine Cauvi, Ruoying Li and Sabine Storandt
Landmark Hub Labeling: Improved Bounds and Faster Query Answering<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
09:10<\/td>\n IPEC talk<\/b>
Henning Fernau and Kevin Mann
Roman Hitting Functions<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Kefu Lu, Mason Marchetti
Maximizing Throughput for Parallel Jobs with Speed-up Curves<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Duncan Adamson, Nathan Flaherty, Igor Potapov and Paul Spirakis
Collision-Free Robot Scheduling<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
David Coudert, Andrea D’Ascenzo and Mattia D’Emidio
Indexing Graphs for Shortest Beer Path Queries<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
09:30<\/td>\n IPEC talk<\/b>
Peter Strulo, M. S. Ramanujan, V\u00e1clav Bla\u017eej, and Sushmita Gupta
On Controlling Knockout Tournaments Without Perfect Information<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Rene Sitters, Tim Oosterwijk, Steven Miltenburg
Complexity of Fixed Order Routing<\/i><\/span><\/td>\n 		ALGOWIN talk*<\/b>
Rik Banerjee, Manish Kumar and Anisur Rahaman Molla
Optimizing Robot Dispersion on Unoriented Grids: with and without Fault Tolerance<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Jenny Enerb\u00e4ck, Lukas Eveborn and Elina R\u00f6nnberg
Pricing for the EVRPTW with Piecewise Linear Charging by a Bounding-Based Labeling Algorithm<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Ignasi Sau<\/td>\n chaired by Matthias Englert<\/td>\n chaired by Arnaud Casteigts<\/td>\n chaired by Spyros Kontogiannis<\/td>\n <\/td> \n <\/tr>\n
09:50<\/td>\n Break<\/td>\n <\/tr>\n
10:10<\/td>\n IPEC talk<\/b>
Carla Groenland, Jesper Nederlof, and Tomohiro Koana
A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Tim A. Hartmann, Tom Jan\u00dfen
Approximating delta-Covering<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Josef Erik Sedl\u00e1\u010dek, Jan Maty\u00e1\u0161 K\u0159i\u0161\u0165an, Laurent Feuilloley and Jan Janou\u0161ek
Decreasing verification radius in local certification<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Enrico Bortoletto, Rolf Nelson van Lieshout, Berenike Masing and Niels Lindner
Periodic Event Scheduling with Flexible Infrastructure Assignment<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
10:30<\/td>\n IPEC talk<\/b>
Ga\u00e9tan Berthe, Marin Bougeret, Daniel Gon\u00e7alves, and Jean-Florent Raymond
Kick the cliques<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Zeev Nutov
Improved Approximation Algorithms for Covering Pliable Set Families and Flexible Graph Connectivity<\/i><\/span><\/td>\n 		ALGOWIN talk*<\/b>
Michael Raskin
Modular population protocols<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
H\u00e9lo\u00efse Gachet and Fr\u00e9d\u00e9ric Meunier
Balanced Assignments of Periodic Tasks<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
10:50<\/td>\n IPEC talk<\/b>
Tomohiro Koana, Nidhi Purohit, and Kirill Simonov
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs<\/i><\/span><\/td>\n 		WAOA talk<\/b>
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<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Sandrine Njoo, Prosenjit Bose and Jean-Lou De Carufel
The Exact Spanning Ratio of the Parallelogram Delaunay Graph<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Tomas Lid\u00e9n, Christiane Schmidt and Rabii Zahir
Two-Stage Weekly Shift Scheduling for Train Dispatchers<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Panos Giannopoulos<\/td>\n chaired by Marek Chrobak<\/td>\n chaired by Quentin Bramas<\/td>\n chaired by Matthias M\u00fcller-Hannemann<\/td>\n <\/td> \n <\/tr>\n
11:10<\/td>\n Break<\/td>\n <\/tr>\n
11:30<\/td>\n ATMOS keynote<\/b>
Eduardo Uchoa
Exact Algorithms for Vehicle Routing: advances, challenges, and perspectives<\/i><\/span><\/td>\n 		<\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/tr>\n
<\/td>\n chaired by Paul Bouman<\/td>\n <\/td> \n <\/tr>\n
12:30<\/td>\n Lunch<\/td>\n <\/tr>\n
14:00<\/td>\n IPEC talk<\/b>
Anna Zych-Pawlewicz and Marek \u017bochowski
Dynamic Parameterized Feedback Problems in Tournaments<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Richard Shapley, David Shmoys
Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Sarah Feldmann and Torben Sch\u00fcrenberg
On the Min-Max Star Partitioning Number<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Gianlorenzo D’Angelo, Mattia D’Emidio, Esmaeil Delfaraz and Gabriele Di Stefano
Improved Algorithms for the Capacitated Team Orienteering Problem<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
14:20<\/td>\n IPEC talk<\/b>
Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Rajesh Chitnis, Samuel Thomas, Anthony Wirth
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
George Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis
The threshold of existence of \u03b4-temporal cliques in random simple temporal graphs<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
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)<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
14:40<\/td>\n IPEC talk<\/b>
Yuxi Liu and Mingyu Xiao
Solving Co-Path\/Cycle Packing and Co-Path Packing Faster Than 3^k<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Sergio Cabello, Panos Giannopoulos
Searching in Euclidean Spaces with Predictions<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Anthony Busson, Malory Marin and R\u00e9mi Watrigant
Channel allocation revisited through 1-extendability of graphs<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Spyros Kontogiannis, Andreas Paraskevopoulos, Christos Zaroliagis
Online Vehicle Routing with Pickups and Deliveries Under Time-Dependent Travel-Time Constraints<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by \u0141ukasz Kowalik<\/td>\n chaired by Zeev Nutov<\/td>\n chaired by …<\/td>\n chaired by Christos Zaroliagis<\/td>\n <\/td> \n <\/tr>\n
15:00<\/td>\n Break<\/td>\n <\/tr>\n
15:20<\/td>\n WAOA keynote<\/b>
Rico Zenklusen
Advances in Approximation Algorithms for Tree and Connectivity Augmentation<\/i><\/span><\/td>\n 		<\/b><\/td><\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/tr>\n
16:20<\/td>\n Break<\/td>\n <\/tr>\n
16:40<\/td>\n IPEC PACE Awards Session<\/b><\/td>\n <\/b><\/td>\n <\/b><\/td>\n ATMOS talk<\/b>
Sven J\u00e4ger, Sarah Roth and Anita Sch\u00f6bel
Periodic Timetabling: Travel Time vs. Regenerative Energy<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
17:00<\/td>\n <\/td>\n <\/b><\/td>\n ATMOS talk<\/b>
Fabian L\u00f6bel, Ralf Bornd\u00f6rfer, Andreas L\u00f6bel and Steffen Weider
Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
17:20<\/td>\n <\/td>\n <\/b><\/td>\n ATMOS talk<\/b>
Stefan Engels and Robert Wille
Towards an Optimization Pipeline for the Design of Train Control Systems with Hybrid Train Detection (Short Paper)<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by …<\/td>\n <\/td> \n <\/td> \n chaired by Rolf van Lieshout<\/td>\n <\/td> \n <\/tr>\n
17:40<\/td>\n Break<\/td>\n <\/tr>\n
17:50<\/td>\n IPEC business meeting<\/b><\/td>\n <\/b><\/td>\n ALGOWIN business meeting<\/b><\/td>\n ATMOS business meeting<\/b><\/td>\n <\/b><\/td>\n <\/b><\/td>\n <\/tr>\n
<\/td>\n chaired by Magnus Wahlstr\u00f6m<\/td>\n <\/td> \n <\/td> \n \n <\/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
<\/td>\n Friday, 6 September  (toggle details)<\/a><\/td>\n <\/tr>\n
<\/td>\n WINDSOR AUD<\/a><\/td>\n WINDSOR 0-02 – 0-03<\/a><\/td>\n WINDSOR 0-04<\/a><\/td>\n WINDSOR 1-02 – 1-03<\/a><\/td>\n WINDSOR 1-04<\/a><\/td>\n <\/tr>\n
08:50<\/td>\n IPEC talk<\/b>
Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, and Ruben F.A. Verhaegh
Preprocessing to Reduce the Search Space for Odd Cycle Transversal<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Mihail Stoian
Approximate Min-Sum Subset Convolution<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
David Kutner and Iain Stewart
Reconfigurable routing in data center networks<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Felix Prause and Ralf Bornd\u00f6rfer
A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
09:10<\/td>\n IPEC talk<\/b>
Jakob Greilhuber and Roohani Sharma
Component Order Connectivity admits no polynomial kernel parameterized by the feedback vertex set number<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Svein H\u00f8gemo
Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Zeev Nutov and Dawod Kahba
A 1.5-approximation algorithm for activating 2 disjoint st-paths<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Kendra Reiter, Marie Schmidt and Michael Stiglmayr
The Line-Based Dial-a-Ride Problem<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
09:30<\/td>\n IPEC talk*<\/b>
Ishay Haviv and Dror Rabinovich
Kernelization for Orthogonality Dimension<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Philip Whittington
Online String Attractors<\/i><\/span><\/td>\n 		ALGOWIN talk<\/b>
Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav and Marek Chrobak
On Permutation Selectors and Their Applications in Ad-Hoc Radio Networks Protocols<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Philine Schiewe, Anita Sch\u00f6bel and Reena Urban
A Bi-Objective Optimization Model for Fare Structure Design in Public Transport<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by George Osipov<\/td>\n chaired by \u0141ukasz Kowalik<\/td>\n chaired by Othon Michail<\/td>\n chaired by Paul Bouman<\/td>\n <\/td> \n <\/tr>\n
09:50<\/td>\n Break<\/td>\n <\/tr>\n
10:10<\/td>\n IPEC talk<\/b>
Peter Strulo, V\u00e1clav Bla\u017eej, M. S. Ramanujan, and Satyabrata Jana
On the Parameterized Complexity of Eulerian Strong Component Deletion<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Stefan Hougardy, Karolina Tammemaa
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching<\/i><\/span><\/td>\n 		\n \n \n \n \n \n \n \n \n \n \n \n
ALGOWIN Best student paper<\/b>
Nada Almalki, Siddharth Gupta and Othon Michail
On the Exponential Growth of Geometric Shapes<\/i><\/span><\/td>\n <\/tr>\n
ALGOWIN Best paper (starting 10:40)<\/b>
Khaled Jawhar and Evangelos Kranakis
Bike Assisted Evacuation on a Line of Robots with Communication Faults<\/i><\/span><\/td>\n <\/tr>\n <\/table>\n <\/td> \n 		ATMOS talk<\/b>
Loic Helouet, Kenza Saiah and Antoine Thebault
Modeling Subway Networks and Passenger Flows<\/a>\n <\/i><\/span><\/td>\n 		<\/b><\/td>\n <\/tr>\n
10:30<\/td>\n IPEC talk<\/b>
Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis
Parameterised distance to local irregularity<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Tung-Wei Kuo
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Tobias Harks, Sven J\u00e4ger, Michael Markl and Philine Schiewe
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
10:50<\/td>\n IPEC talk<\/b>
Jaroslav Garvardt and Christian Komusiewicz
Modularity Clustering parameterized by Max Leaf Number<\/i><\/span><\/td>\n 		WAOA talk<\/b>
Dylan Hyatt-Denesik, Danny Blom, Afrouz Jabal Ameli, Bart Smeulders
Approximation Algorithms for k-Scenario Matching<\/i><\/span><\/td>\n 		ATMOS talk<\/b>
Julian Patzner and Matthias M\u00fcller-Hannemann
Dynamic Traffic Assignment for Public Transport with Vehicle Capacities<\/a>\n <\/i><\/span><\/td>\n <\/tr>\n
<\/td>\n chaired by Karol W\u0119grzycki<\/td>\n chaired by Marcin Bie\u0144kowski<\/td>\n chaired by Marek Chrobak<\/td>\n chaired by Philine Schiewe<\/td>\n <\/td> \n <\/tr>\n
11:10<\/td>\n Break<\/td>\n <\/tr>\n
11:30<\/td>\n ALGOWIN keynote<\/b>
Petra Berenbrink
The Population Model as Model for Sensor-Networks<\/i><\/span><\/td>\n 		<\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/tr>\n
<\/td>\n chaired by …<\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/td>\n <\/tr>\n
12:30<\/td>\n Lunch<\/td>\n <\/tr>\n
14:00<\/td>\n End<\/td>\n <\/tr>\n <\/tbody>\n<\/table>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

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 talkSally Dong and […]<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-435","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/pages\/435","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/comments?post=435"}],"version-history":[{"count":59,"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/pages\/435\/revisions"}],"predecessor-version":[{"id":571,"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/pages\/435\/revisions\/571"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2024\/wp-json\/wp\/v2\/media?parent=435"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}