Accepted Papers
These are the 27 papers (out of 62 submitted) that were accepted for presentation at the SEA 2025 conference:
- Ylène Aboulfath, Dominique Barth, Thierry Mautor, Dimitri Watel and Marc-Antoine Weisser. Polymorphic cycle basis in a sequence of graphs to analyze the structural evolution of a molecular dynamic trajectory
- 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
- Josua Dörrer, Konrad Gendle, Johanna Hofmann, Julius von Smercek, Andreas Steding and Florian Stober. Exact Lower Bounds for the Number of Comparisons in Selection
- Christine Awofeso, Patrick Greaves, Oded Lachish and Felix Reidl. A practical algorithm for 2-admissibility
- Igor Martayan and Ragnar Groot Koerkamp. SimdMinimizers: Computing random minimizers, fast
- Kenneth Langedal, Ernestine Großmann and Christian Schulz. Concurrent Iterated Local Search for the Maximum Weight Independent Set Problem
- Hannah Troppens, Mathieu Besançon, St. Elmo Wilken and Sebastian Pokutta. Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks
- Liding Xu, Gioni Mexi and Ksenia Bestuzheva. Sparsity-driven Aggregation of Mixed Integer Programs
- Johanna Schmitz, Jens Zentgraf and Sven Rahmann. Blocked Bloom Filters with Choices
- Alejandro Cassis, Andreas Karrenbauer, André Nusser and Paolo Luigi Rinaldi. Algorithm Engineering of SSSP With Negative Edge Weights
- Davide Cozzi, Brian Riccardi, Luca Denti, Simone Ciccolella, Kunihiko Sadakane and Paola Bonizzoni. Pangenome Graph Indexing via the Multidollar-BWT
- Ernst Althaus, Stefan Irnich, Luzie Marianczuk and Marc Pfetch. A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees
- Enno Adler, Stefan Böttcher, Rita Hartel and Cederic Alexander Steininger. IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
- Gerth Stølting Brodal. A Simple Integer Successor-Delete Data Structure
- Adil Chhabra, Christian Schulz and Shai Dorian Peretz. CluStRE: Streaming Graph Clustering with Multi-Stage Refinement
- Alan Cleary, Joseph Winjum, Jordan Dood, Hiroki Shibata and Shunsuke Inenaga. Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access
- Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin and Steinar Simonnes. Planar Network Diversion
- Lannie Hough and Abhinav Bhatele. Micro-Scale Elias-Fano Compression for Small and Performant Rank & Select Structures
- Ragnar Groot Koerkamp. PtrHash: Minimal Perfect Hashing at RAM Throughput
- Diego Diaz. Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
- Yannick Bosch and Sabine Storandt. Continuous Map Matching to Paths under Travel Time Constraints
- Shivaram Gopal, S M Ferdous, Alex Pothen and Hemanta Maji. GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
- Laurent Bulteau, Pierre-Yves David, Florian Horn and Euxane Tran-Girard. Incremental Reachability
- Stefan Funke, Claudius Proissl and Sabine Storandt. Computing the Exact Radius of Large Graphs
- Saska Dönges and Simon Puglisi. Succinct Rank Dictionaries Revisited
- Angikar Ghosal and Andreas Karrenbauer. Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
- 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