Schedule
The schedule is preliminary and subject to change.
Monday, June 22, 2026
Opening & Welcome 🎉
Invited Talk 1 · Charalampos E. Tsourakakis
Algorithmic Primitives for Finding Dense Structures in Rich Graph Data · [more]
Coffee break ☕
An Empirical Analysis of Approximation Algorithms for the Unweighted Tree Augmentation Problemcode
Luke Hawranick, Matthew Williamson, Jacob Restanio, K. Subramani, Cody Klingler
The Dual-Path Fixing Strategy and Its Application to the Set-Covering Problem
Paulo Michel F. Yamagishi, Marcia Fampa, Jon Lee
Lunch 🍽️
Compressing Highly Repetitive Binary Trees with an Application to Range Minimum Queriescode
Gabriel Carmona, Filippo Lari
From Relative Compression to Hierarchical Compressioncode
Philip Bille, Inge Li Gørtz, Máximo Pérez-López
Coffee break ☕
Exploiting Multi-Core Parallelism in Blockchain Validation and Constructioncode
Arivarasan Karmegam, Lucianna Kiffer, Antonio Fernández Anta
Practical Parallel Block Tree Constructioncode
Robert Clausecker, Florian Kurpicz, Etienne Palanga
Tuesday, June 23, 2026
Invited Talk 2 · Inge Li Gørtz
Locality Sensitive Hashing and Compressed Computation · [more]
Coffee break ☕
Engineering Fully Dynamic Convex Hullscode
Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg
A Practical Algorithm for (Geometry-Aware) Interleavings Between Merge Trees
Thijs Beurskens, Emil Toftegaard Gæde, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek
Global Polyline Simplification Under the Fréchet Distance: Theory and Practicecode
Christian Abdullahad, Sabine Storandt
Computational Generation of Substrate-Specific Molecular Cagescode
Noé Demange, Yann Strozecki, Sandrine Vial
Lunch 🍽️
Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutationscode
Nathaniel K. Brown, Ben Langmead
Fast Select Queries Using Hybrid Bitvectorscode
Eric Chiu, Dominik Kempa
QuadRank: Engineering a High Throughput Rankcode
Ragnar Groot Koerkamp
Eric Chiu, Dominik Kempa
Conference dinner 🍷 (at conference venue)
Wednesday, June 24, 2026
Invited Talk 3 · Sebastian Wild
Adaptive Sorting and Searching from Theory to Practice · [more]
Coffee break ☕
Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximizationcode
Dildar Ali, Ansh Jasrotia, Abishek Salaria, Suman Banerjee
Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distancecode
Claudio Arbib, Andrea D'Ascenzo, Oya E. Karaşan, Andrea Pizzuti
K-Hole Separation in PEO-Based ILP Treewidth Formulationcode
Andrea D'Ascenzo
Lunch 🍽️
BuffCut: Prioritized Buffered Streaming Graph Partitioningcode
Linus Baumgärtner, Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
Different Scales of Randomness: Empirical Mixing Times of the Edge Switching and Curveball MCMCcode
Deepak Ajwani, Melvin Kallmayer, Alexander Leonhardt, Ulrich Meyer, Ryan O'Connor, Manuel Penschuck
Engineering Learned Heuristics to Improve Clustering for Multilevel Graph Partitioningcode
Simeon Schrape, Nikolai Maas, Kenneth Langedal, Daniel Seemaier
General Multiplicative Spanners in Practicecode
Fritz Bökler, Markus Chimani, Henning Jasper
Coffee break ☕
Breaking 2-Cores for Invertible Bloom Lookup Tables by Structure Predictioncode
Vojtěch Gaďurek, Pavel Veselý
Cycle Basis Algorithms for Reducing Maximum Edge Participationcode
Fan Wang, Sandy Irani
ZOR Filters: Fast and Smaller Than Fuse Filterscode
Antoine Limasset
SEA Business Meeting 📋