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