Abstract is missing.
- Compressing Highly Repetitive Binary Trees with an Application to Range Minimum QueriesGabriel Carmona, Filippo Lari. [doi]
- Global Polyline Simplification Under the Fréchet Distance: Theory and PracticeChristian Abdullahad, Sabine Storandt. [doi]
- Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design ProblemsTim Donkiewicz. [doi]
- Fast Select Queries Using Hybrid BitvectorsEric Chiu, Dominik Kempa. [doi]
- Efficient Large-Scale Text Precompression via Approximate LZ77 ParsingsPatrick Dinklage. [doi]
- Practical Parallel Block Tree ConstructionRobert Clausecker, Florian Kurpicz, Etienne Palanga. [doi]
- Cycle Basis Algorithms for Reducing Maximum Edge ParticipationFan Wang 0043, Sandy Irani. [doi]
- K-Hole Separation in PEO‑Based ILP Treewidth FormulationAndrea D'Ascenzo. [doi]
- Approximation Algorithms for Budget Splitting in Multi-Channel Influence MaximizationDildar Ali, Ansh Jasrotia, Abishek Salaria, Suman Banerjee 0002. [doi]
- An Empirical Analysis of Approximation Algorithms for the Unweighted Tree Augmentation ProblemLuke Hawranick, Matthew D. Williamson, Jacob Restanio, K. Subramani 0001, Cody Klingler. [doi]
- General Multiplicative Spanners in PracticeFritz Bökler, Markus Chimani, Henning Jasper. [doi]
- QuadRank: Engineering a High Throughput RankRagnar Groot Koerkamp. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Different Scales of Randomness: Empirical Mixing Times of the Edge Switching and Curveball MCMCDeepak Ajwani, Melvin Kallmayer, Alexander Leonhardt, Ulrich Meyer 0001, Ryan O'Connor, Manuel Penschuck. [doi]
- Bounding the Average Move Structure Query for Faster and Smaller RLBWT PermutationsNathaniel K. Brown, Ben Langmead. [doi]
- Engineering Fully Dynamic Convex HullsIvor van der Hoog, Henrik Reinstädtler, Eva Rotenberg. [doi]
- BuffCut: Prioritized Buffered Streaming Graph PartitioningLinus Baumgärtner, Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz 0003. [doi]
- The Dual-Path Fixing Strategy and Its Application to the Set-Covering ProblemPaulo Michel F. Yamagishi, Marcia Fampa, Jon Lee 0001. [doi]
- A Practical Algorithm for (Geometry-Aware) Interleavings Between Merge TreesThijs Beurskens, Emil Toftegaard Gæde, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek. [doi]
- Engineering Learned Heuristics to Improve Clustering for Multilevel Graph PartitioningSimeon Schrape, Nikolai Maas, Kenneth Langedal, Daniel Seemaier. [doi]
- ZOR Filters: Fast and Smaller Than Fuse FiltersAntoine Limasset. [doi]
- From Relative Compression to Hierarchical CompressionPhilip Bille, Inge Li Gørtz, Máximo Pérez López. [doi]
- Wavelet Forests RevisitedEric Chiu, Dominik Kempa. [doi]
- Exploiting Multi-Core Parallelism in Blockchain Validation and ConstructionArivarasan Karmegam, Lucianna Kiffer, Antonio Fernández Anta. [doi]
- Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein DistanceClaudio Arbib, Andrea D'Ascenzo, Oya Ekin Karasan, Andrea Pizzuti. [doi]
- Computational Generation of Substrate-Specific Molecular CagesNoé Demange, Yann Strozecki, Sandrine Vial. [doi]
- Breaking 2-Cores for Invertible Bloom Lookup Tables by Structure PredictionVojtech Gadurek, Pavel Veselý 0001. [doi]
- Engineering Algorithms for Dynamic Greedy Set CoverAmitai Uzrad. [doi]
- DeltaSort: Incremental Sorting of Arrays with Known UpdatesShubham Dwivedi. [doi]