Accepted papers

Proceedings published as LIPIcs volume 371.

#TitleAuthors
1A Practical Algorithm for (Geometry-Aware) Interleavings Between Merge TreesThijs Beurskens, Emil Toftegaard Gæde, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek
2Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems codeTim Donkiewicz
3An Empirical Analysis of Approximation Algorithms for the Unweighted Tree Augmentation Problem codeLuke Hawranick, Matthew Williamson, Jacob Restanio, K. Subramani, Cody Klingler
4Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization codeDildar Ali, Ansh Jasrotia, Abishek Salaria, Suman Banerjee
5Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations codeNathaniel K. Brown, Ben Langmead
6Breaking 2-Cores for Invertible Bloom Lookup Tables by Structure Prediction codeVojtěch Gaďurek, Pavel Veselý
7BuffCut: Prioritized Buffered Streaming Graph Partitioning codeLinus Baumgärtner, Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
8Compressing Highly Repetitive Binary Trees with an Application to Range Minimum Queries codeGabriel Carmona, Filippo Lari
9Computational Generation of Substrate-Specific Molecular Cages codeNoé Demange, Yann Strozecki, Sandrine Vial
10Cycle Basis Algorithms for Reducing Maximum Edge Participation codeFan Wang, Sandy Irani
11DeltaSort: Incremental Sorting of Arrays with Known Updates codeShubham Dwivedi
12Different Scales of Randomness: Empirical Mixing Times of the Edge Switching and Curveball MCMC codeDeepak Ajwani, Melvin Kallmayer, Alexander Leonhardt, Ulrich Meyer, Ryan O'Connor, Manuel Penschuck
13Efficient Large-Scale Text Precompression via Approximate LZ77 Parsings codePatrick Dinklage
14Engineering Algorithms for Dynamic Greedy Set Cover codeAmitai Uzrad
15Engineering Fully Dynamic Convex Hulls codeIvor van der Hoog, Henrik Reinstädtler, Eva Rotenberg
16Engineering Learned Heuristics to Improve Clustering for Multilevel Graph Partitioning codeSimeon Schrape, Nikolai Maas, Kenneth Langedal, Daniel Seemaier
17Exploiting Multi-Core Parallelism in Blockchain Validation and Construction codeArivarasan Karmegam, Lucianna Kiffer, Antonio Fernández Anta
18Fast Select Queries Using Hybrid Bitvectors codeEric Chiu, Dominik Kempa
19From Relative Compression to Hierarchical Compression codePhilip Bille, Inge Li Gørtz, Máximo Pérez-López
20General Multiplicative Spanners in Practice codeFritz Bökler, Markus Chimani, Henning Jasper
21Global Polyline Simplification Under the Fréchet Distance: Theory and Practice codeChristian Abdullahad, Sabine Storandt
22Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distance codeClaudio Arbib, Andrea D'Ascenzo, Oya E. Karaşan, Andrea Pizzuti
23K-Hole Separation in PEO-Based ILP Treewidth Formulation codeAndrea D'Ascenzo
24Practical Parallel Block Tree Construction codeRobert Clausecker, Florian Kurpicz, Etienne Palanga
25QuadRank: Engineering a High Throughput Rank codeRagnar Groot Koerkamp
26The Dual-Path Fixing Strategy and Its Application to the Set-Covering ProblemPaulo Michel F. Yamagishi, Marcia Fampa, Jon Lee
27Wavelet Forests Revisited codeEric Chiu, Dominik Kempa
28ZOR Filters: Fast and Smaller Than Fuse Filters codeAntoine Limasset