default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st SEA 2024: Vienna, Austria
- Leo Liberti
:
22nd International Symposium on Experimental Algorithms, SEA 2024, July 23-26, 2024, Vienna, Austria. LIPIcs 301, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-325-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Nico Bertram, Johannes Fischer, Lukas Nalbach:
Move-r: Optimizing the r-index. 1:1-1:19 - Paolo Boldi, Stefano Marchini, Sebastiano Vigna:
Engineering Zuffix Arrays. 2:1-2:18 - Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Practical Minimum Path Cover. 3:1-3:19 - Jonas Charfreitag, Christine Dahn, Michael Kaibel, Philip Mayer, Petra Mutzel, Lukas Schürmann:
Separator Based Data Reduction for the Maximum Cut Problem. 4:1-4:21 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. 5:1-5:21 - Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Pavel Hudec, Pingjiang Li, Harshit J. Motwani:
Faster Treewidth-Based Approximations for Wiener Index. 6:1-6:19 - Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. 7:1-7:20 - David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. 8:1-8:20 - Patrick Dinklage, Johannes Fischer, Nicola Prezza:
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. 9:1-9:20 - Dominika Draesslerová, Omar Ahmed, Travis Gagie, Jan Holub, Ben Langmead, Giovanni Manzini, Gonzalo Navarro:
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests. 10:1-10:13 - Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. 11:1-11:22 - S. M. Ferdous, Alex Pothen, Mahantesh Halappanavar:
Streaming Matching and Edge Cover in Practice. 12:1-12:22 - Sebastian Bernhard Germann, Klaus Jansen, Felix Ohnesorge, Malte Tutas:
3/2-Dual Approximation for CPU/GPU Scheduling. 13:1-13:18 - Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu:
Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. 14:1-14:19 - Daniel Hambly, Rhyd Lewis, Padraig Corcoran:
Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs. 15:1-15:11 - Deborah Hendrych, Mathieu Besançon, Sebastian Pokutta:
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. 16:1-16:22 - Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, Matthias Müller-Hannemann:
Barcode Selection and Layout Optimization in Spatial Transcriptomics. 17:1-17:19 - Jakub Komárek, Martin Koutecký:
Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization. 18:1-18:21 - Nick Krumbholz, Stefan Funke, Peter Schäfer, Sabine Storandt:
Algorithms for Gradual Polyline Simplification. 19:1-19:18 - Kenneth Langedal, Demian Hespe, Peter Sanders:
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks. 20:1-20:21 - Matthew D. Laws, Jocelyn Bliven, Kit Conklin, Elyes Laalai, Samuel McCauley, Zach S. Sturdevant:
SPIDER: Improved Succinct Rank and Select Performance. 21:1-21:18 - Vadim Lebovici, Steve Oudot, Hugo Passe:
Efficient Computation of Topological Integral Transforms. 22:1-22:19 - Philip Mayer, Petra Mutzel:
Engineering A* Search for the Flip Distance of Plane Triangulations. 23:1-23:20 - Matthew N. Palmer, Simone Faro, Stefano Scafiti:
Efficient Exact Online String Matching Through Linked Weak Factors. 24:1-24:14 - Gabriel Ponte, Marcia Fampa, Jon Lee:
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. 25:1-25:14 - Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito:
Scalable Hard Instances for Independent Set Reconfiguration. 26:1-26:15 - Christoph Staudt, Mark Blacher, Julien Klaus, Farin Lippmann, Joachim Giesen:
Improved Cut Strategy for Tensor Network Contraction Orders. 27:1-27:19 - Sebastián Urrutia, Vinícius Fernandes dos Santos:
Finding the Minimum Cost Acceptable Element in a Sorted Matrix. 28:1-28:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-10 20:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
