8:30–8:45 |
Opening & Welcome |
|
8:45–9:45 |
Invited Talk 1 (Chair: TBA) |
Daniel Lemire
Algorithms for Modern Processor Architectures (abstract)
|
|
9:45–10:15 |
Coffee Break |
|
10:15–12:00 |
Session 1: Algorithms and data structures 1 (Chair: TBA) |
10:15– 10:40 |
Johanna Schmitz, Jens Zentgraf and Sven Rahmann. Blocked Bloom Filters with Choices
|
10:40–11:05 |
Gerth Stølting Brodal. A Simple Integer Successor-Delete Data Structure
|
11:05–11:30 |
Lorenzo Bellomo, Mattia Odorisio, Paolo Ferragina, Giuseppe Cianci and Luca de Rosa. A Comparative Study of Compressed, Learned, and Traditional Indexing Methods for Integer Data
|
11:30–11:55 |
Lorraine Ayad, Gabriele Fici, Ragnar Groot Koerkamp, Grigorios Loukides, Rob Patro, Giulio Ermanno Pibiri and Solon Pissis. A Universal Indexing Framework for Matching Long Patterns
|
|
|
12:00–13:30 |
Lunch (not provided) |
|
13:30–14:45 |
Session 2: Optimization (Chair: TBA) |
13:30– 13:55 |
Liding Xu, Gioni Mexi and Ksenia Bestuzheva.
Sparsity-driven Aggregation of Mixed Integer Programs
|
13:55– 14:20 |
Ernst Althaus, Stefan Irnich, Luzie Marianczuk and Marc Pfetch. A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees
|
14:20– 14:45 |
Angikar Ghosal and Andreas Karrenbauer. Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
|
|
|
14:45–15:15 |
Coffee Break |
|
15:15–16:30 |
Session 3: Graphs 1 (Chair: TBA) |
15:15– 15:40 |
Stefan Funke, Claudius Proissl and Sabine Storandt. Computing the Exact Radius of Large Graphs
|
15:40– 16:05 |
Alejandro Cassis, Andreas Karrenbauer, André Nusser and Paolo Luigi Rinaldi. Algorithm Engineering of SSSP With Negative Edge Weights
|
16:05– 16:30 |
Laurent Bulteau, Pierre-Yves David, Florian Horn and Euxane Tran-Girard. Incremental Reachability
|
|