LIPIcs, Volume 301, SEA 2024

• Leo Liberti LIPIcs, Volume 301, SEA 2024, Complete Volume 10.4230/LIPIcs.SEA.2024
• Leo Liberti Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SEA.2024.0
• Nico Bertram, Johannes Fischer, and Lukas Nalbach Move-r: Optimizing the r-index 10.4230/LIPIcs.SEA.2024.1
• Paolo Boldi, Stefano Marchini, and Sebastiano Vigna Engineering Zuffix Arrays 10.4230/LIPIcs.SEA.2024.2
• Manuel Cáceres, Brendan Mumey, Santeri Toivonen, and Alexandru I. Tomescu Practical Minimum Path Cover 10.4230/LIPIcs.SEA.2024.3
• Jonas Charfreitag, Christine Dahn, Michael Kaibel, Philip Mayer, Petra Mutzel, and Lukas Schürmann Separator Based Data Reduction for the Maximum Cut Problem 10.4230/LIPIcs.SEA.2024.4
• Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, and Daniel Seemaier Buffered Streaming Edge Partitioning 10.4230/LIPIcs.SEA.2024.5
• Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Pavel Hudec, Pingjiang Li, and Harshit Jitendra Motwani Faster Treewidth-Based Approximations for Wiener Index 10.4230/LIPIcs.SEA.2024.6
• Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, and Melanie Schmidt Local Search k-means++ with Foresight 10.4230/LIPIcs.SEA.2024.7
• David Coudert, Mónika Csikós, Guillaume Ducoffe, and Laurent Viennot Practical Computation of Graph VC-Dimension 10.4230/LIPIcs.SEA.2024.8
• Patrick Dinklage, Johannes Fischer, and Nicola Prezza Top-k Frequent Patterns in Streams and Parameterized-Space LZ Compression 10.4230/LIPIcs.SEA.2024.9
• Dominika Draesslerová, Omar Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, and Gonzalo Navarro Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests 10.4230/LIPIcs.SEA.2024.10
• Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, and Christian Schulz Engineering Weighted Connectivity Augmentation Algorithms 10.4230/LIPIcs.SEA.2024.11
• S M Ferdous, Alex Pothen, and Mahantesh Halappanavar Streaming Matching and Edge Cover in Practice 10.4230/LIPIcs.SEA.2024.12
• Bernhard Sebastian Germann, Klaus Jansen, Felix Ohnesorge, and Malte Tutas 3/2-Dual Approximation for CPU/GPU Scheduling 10.4230/LIPIcs.SEA.2024.13
• Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, and Alexandru I. Tomescu Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions 10.4230/LIPIcs.SEA.2024.14
• Daniel Hambly, Rhyd Lewis, and Padraig Corcoran Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs 10.4230/LIPIcs.SEA.2024.15
• Deborah Hendrych, Mathieu Besançon, and Sebastian Pokutta Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods 10.4230/LIPIcs.SEA.2024.16
• Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, and Matthias Müller-Hannemann Barcode Selection and Layout Optimization in Spatial Transcriptomics 10.4230/LIPIcs.SEA.2024.17
• Jakub Komárek and Martin Koutecký Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization 10.4230/LIPIcs.SEA.2024.18
• Nick Krumbholz, Stefan Funke, Peter Schäfer, and Sabine Storandt Algorithms for Gradual Polyline Simplification 10.4230/LIPIcs.SEA.2024.19
• Kenneth Langedal, Demian Hespe, and Peter Sanders Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks 10.4230/LIPIcs.SEA.2024.20
• Matthew D. Laws, Jocelyn Bliven, Kit Conklin, Elyes Laalai, Samuel McCauley, and Zach S. Sturdevant SPIDER: Improved Succinct Rank and Select Performance 10.4230/LIPIcs.SEA.2024.21
• Vadim Lebovici, Steve Oudot, and Hugo Passe Efficient Computation of Topological Integral Transforms 10.4230/LIPIcs.SEA.2024.22
• Philip Mayer and Petra Mutzel Engineering A* Search for the Flip Distance of Plane Triangulations 10.4230/LIPIcs.SEA.2024.23
• Matthew N. Palmer, Simone Faro, and Stefano Scafiti Efficient Exact Online String Matching Through Linked Weak Factors 10.4230/LIPIcs.SEA.2024.24
• Gabriel Ponte, Marcia Fampa, and Jon Lee Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem 10.4230/LIPIcs.SEA.2024.25
• Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, and Takehiro Ito Scalable Hard Instances for Independent Set Reconfiguration 10.4230/LIPIcs.SEA.2024.26
• Christoph Staudt, Mark Blacher, Julien Klaus, Farin Lippmann, and Joachim Giesen Improved Cut Strategy for Tensor Network Contraction Orders 10.4230/LIPIcs.SEA.2024.27
• Sebastián Urrutia and Vinicius dos Santos Finding the Minimum Cost Acceptable Element in a Sorted Matrix 10.4230/LIPIcs.SEA.2024.28