@Proceedings{liberti:LIPIcs.SEA.2024,
title = {{LIPIcs, Volume 301, SEA 2024, Complete Volume}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {1--548},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024},
URN = {urn:nbn:de:0030-drops-203649},
doi = {10.4230/LIPIcs.SEA.2024},
annote = {Keywords: LIPIcs, Volume 301, SEA 2024, Complete Volume}
}
@InProceedings{liberti:LIPIcs.SEA.2024.0,
author = {Liberti, Leo},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.0},
URN = {urn:nbn:de:0030-drops-203658},
doi = {10.4230/LIPIcs.SEA.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{bertram_et_al:LIPIcs.SEA.2024.1,
author = {Bertram, Nico and Fischer, Johannes and Nalbach, Lukas},
title = {{Move-r: Optimizing the r-index}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.1},
URN = {urn:nbn:de:0030-drops-203662},
doi = {10.4230/LIPIcs.SEA.2024.1},
annote = {Keywords: Compressed Text Index, Burrows-Wheeler Transform}
}
@InProceedings{boldi_et_al:LIPIcs.SEA.2024.2,
author = {Boldi, Paolo and Marchini, Stefano and Vigna, Sebastiano},
title = {{Engineering Zuffix Arrays}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {2:1--2:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.2},
URN = {urn:nbn:de:0030-drops-203677},
doi = {10.4230/LIPIcs.SEA.2024.2},
annote = {Keywords: Suffix trees, suffix arrays, z-fast tries}
}
@InProceedings{caceres_et_al:LIPIcs.SEA.2024.3,
author = {C\'{a}ceres, Manuel and Mumey, Brendan and Toivonen, Santeri and Tomescu, Alexandru I.},
title = {{Practical Minimum Path Cover}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.3},
URN = {urn:nbn:de:0030-drops-203687},
doi = {10.4230/LIPIcs.SEA.2024.3},
annote = {Keywords: minimum path cover, directed acyclic graph, maximum flow, parameterized algorithms, edge sparsification, algorithm engineering}
}
@InProceedings{charfreitag_et_al:LIPIcs.SEA.2024.4,
author = {Charfreitag, Jonas and Dahn, Christine and Kaibel, Michael and Mayer, Philip and Mutzel, Petra and Sch\"{u}rmann, Lukas},
title = {{Separator Based Data Reduction for the Maximum Cut Problem}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {4:1--4:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.4},
URN = {urn:nbn:de:0030-drops-203698},
doi = {10.4230/LIPIcs.SEA.2024.4},
annote = {Keywords: Data Reduction, Maximum Cut, Vertex Separators}
}
@InProceedings{chhabra_et_al:LIPIcs.SEA.2024.5,
author = {Chhabra, Adil and Fonseca Faraj, Marcelo and Schulz, Christian and Seemaier, Daniel},
title = {{Buffered Streaming Edge Partitioning}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {5:1--5:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.5},
URN = {urn:nbn:de:0030-drops-203701},
doi = {10.4230/LIPIcs.SEA.2024.5},
annote = {Keywords: graph partitioning, edge partitioning, streaming, online, buffered partitioning}
}
@InProceedings{conrado_et_al:LIPIcs.SEA.2024.6,
author = {Conrado, Giovanna Kobus and Goharshady, Amir Kafshdar and Hudec, Pavel and Li, Pingjiang and Motwani, Harshit Jitendra},
title = {{Faster Treewidth-Based Approximations for Wiener Index}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.6},
URN = {urn:nbn:de:0030-drops-203718},
doi = {10.4230/LIPIcs.SEA.2024.6},
annote = {Keywords: Computational Chemistry, Treewidth, Wiener Index}
}
@InProceedings{conrads_et_al:LIPIcs.SEA.2024.7,
author = {Conrads, Theo and Drexler, Lukas and K\"{o}nen, Joshua and Schmidt, Daniel R. and Schmidt, Melanie},
title = {{Local Search k-means++ with Foresight}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.7},
URN = {urn:nbn:de:0030-drops-203727},
doi = {10.4230/LIPIcs.SEA.2024.7},
annote = {Keywords: k-means clustering, kmeans++, greedy, local search}
}
@InProceedings{coudert_et_al:LIPIcs.SEA.2024.8,
author = {Coudert, David and Csik\'{o}s, M\'{o}nika and Ducoffe, Guillaume and Viennot, Laurent},
title = {{Practical Computation of Graph VC-Dimension}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.8},
URN = {urn:nbn:de:0030-drops-203731},
doi = {10.4230/LIPIcs.SEA.2024.8},
annote = {Keywords: VC-dimension, graph, algorithm}
}
@InProceedings{dinklage_et_al:LIPIcs.SEA.2024.9,
author = {Dinklage, Patrick and Fischer, Johnnes and Prezza, Nicola},
title = {{Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {9:1--9:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.9},
URN = {urn:nbn:de:0030-drops-203748},
doi = {10.4230/LIPIcs.SEA.2024.9},
annote = {Keywords: compression, streaming, heavy hitters, algorithm engineering}
}
@InProceedings{draesslerova_et_al:LIPIcs.SEA.2024.10,
author = {Draesslerov\'{a}, Dominika and Ahmed, Omar and Gagie, Travis and Holub, Jan and Langmead, Ben and Manzini, Giovanni and Navarro, Gonzalo},
title = {{Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {10:1--10:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.10},
URN = {urn:nbn:de:0030-drops-203756},
doi = {10.4230/LIPIcs.SEA.2024.10},
annote = {Keywords: Taxonomic classification, metagenomics, KATKA, maximal exact matches, string kernels, minimizer digests}
}
@InProceedings{faraj_et_al:LIPIcs.SEA.2024.11,
author = {Faraj, Marcelo Fonseca and Gro{\ss}mann, Ernestine and Joos, Felix and M\"{o}ller, Thomas and Schulz, Christian},
title = {{Engineering Weighted Connectivity Augmentation Algorithms}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {11:1--11:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.11},
URN = {urn:nbn:de:0030-drops-203768},
doi = {10.4230/LIPIcs.SEA.2024.11},
annote = {Keywords: weighted connectivity augmentation, approximation, heuristic, integer linear program, algorithm engineering}
}
@InProceedings{ferdous_et_al:LIPIcs.SEA.2024.12,
author = {Ferdous, S M and Pothen, Alex and Halappanavar, Mahantesh},
title = {{Streaming Matching and Edge Cover in Practice}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {12:1--12:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.12},
URN = {urn:nbn:de:0030-drops-203773},
doi = {10.4230/LIPIcs.SEA.2024.12},
annote = {Keywords: Matching, Edge Cover, Semi-Streaming Algorithm, Parallel Algorithms, Algorithm Engineering}
}
@InProceedings{germann_et_al:LIPIcs.SEA.2024.13,
author = {Germann, Bernhard Sebastian and Jansen, Klaus and Ohnesorge, Felix and Tutas, Malte},
title = {{3/2-Dual Approximation for CPU/GPU Scheduling}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.13},
URN = {urn:nbn:de:0030-drops-203782},
doi = {10.4230/LIPIcs.SEA.2024.13},
annote = {Keywords: computing, machine scheduling, moldable, CPU/GPU}
}
@InProceedings{grigorjew_et_al:LIPIcs.SEA.2024.14,
author = {Grigorjew, Andreas and Dias, Fernando H. C. and Cracco, Andrea and Rizzi, Romeo and Tomescu, Alexandru I.},
title = {{Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.14},
URN = {urn:nbn:de:0030-drops-203792},
doi = {10.4230/LIPIcs.SEA.2024.14},
annote = {Keywords: Flow decomposition, Integer Linear Programming, Safety, RNA-seq, RNA transcript assembly, isoform}
}
@InProceedings{hambly_et_al:LIPIcs.SEA.2024.15,
author = {Hambly, Daniel and Lewis, Rhyd and Corcoran, Padraig},
title = {{Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {15:1--15:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.15},
URN = {urn:nbn:de:0030-drops-203805},
doi = {10.4230/LIPIcs.SEA.2024.15},
annote = {Keywords: Graphs, paths, backtracking, integer programming, Yen’s algorithm}
}
@InProceedings{hendrych_et_al:LIPIcs.SEA.2024.16,
author = {Hendrych, Deborah and Besan\c{c}on, Mathieu and Pokutta, Sebastian},
title = {{Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {16:1--16:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.16},
URN = {urn:nbn:de:0030-drops-203810},
doi = {10.4230/LIPIcs.SEA.2024.16},
annote = {Keywords: Mixed-Integer Non-Linear Optimization, Optimal Experiment Design, Frank-Wolfe, Boscia}
}
@InProceedings{jatzkowski_et_al:LIPIcs.SEA.2024.17,
author = {Jatzkowski, Frederik L. and Schmidt, Antonia and Mank, Robert and Sch\"{u}ler, Steffen and M\"{u}ller-Hannemann, Matthias},
title = {{Barcode Selection and Layout Optimization in Spatial Transcriptomics}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {17:1--17:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.17},
URN = {urn:nbn:de:0030-drops-203821},
doi = {10.4230/LIPIcs.SEA.2024.17},
annote = {Keywords: Spatial Transcriptomics, Array Layout, Optimization, Computational Complexity, GPU Computing, Integer Linear Programming, Metaheuristics}
}
@InProceedings{komarek_et_al:LIPIcs.SEA.2024.18,
author = {Kom\'{a}rek, Jakub and Kouteck\'{y}, Martin},
title = {{Experimental Analysis of LP Scaling Methods Based on Circuit Imbalance Minimization}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {18:1--18:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.18},
URN = {urn:nbn:de:0030-drops-203832},
doi = {10.4230/LIPIcs.SEA.2024.18},
annote = {Keywords: Linear programming, scaling, circuit imbalance measure}
}
@InProceedings{krumbholz_et_al:LIPIcs.SEA.2024.19,
author = {Krumbholz, Nick and Funke, Stefan and Sch\"{a}fer, Peter and Storandt, Sabine},
title = {{Algorithms for Gradual Polyline Simplification}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.19},
URN = {urn:nbn:de:0030-drops-203847},
doi = {10.4230/LIPIcs.SEA.2024.19},
annote = {Keywords: Polyline simplification, Progressive simplification, Fr\'{e}chet distance}
}
@InProceedings{langedal_et_al:LIPIcs.SEA.2024.20,
author = {Langedal, Kenneth and Hespe, Demian and Sanders, Peter},
title = {{Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {20:1--20:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.20},
URN = {urn:nbn:de:0030-drops-203853},
doi = {10.4230/LIPIcs.SEA.2024.20},
annote = {Keywords: Graphs, Independent Set, Vertex Cover, Graph Neural Networks, Branch-and-Reduce}
}
@InProceedings{laws_et_al:LIPIcs.SEA.2024.21,
author = {Laws, Matthew D. and Bliven, Jocelyn and Conklin, Kit and Laalai, Elyes and McCauley, Samuel and Sturdevant, Zach S.},
title = {{SPIDER: Improved Succinct Rank and Select Performance}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.21},
URN = {urn:nbn:de:0030-drops-203865},
doi = {10.4230/LIPIcs.SEA.2024.21},
annote = {Keywords: Rank and Select, Succinct Data Structures, Data Structres, Cache Performance, Predictions}
}
@InProceedings{lebovici_et_al:LIPIcs.SEA.2024.22,
author = {Lebovici, Vadim and Oudot, Steve and Passe, Hugo},
title = {{Efficient Computation of Topological Integral Transforms}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.22},
URN = {urn:nbn:de:0030-drops-203878},
doi = {10.4230/LIPIcs.SEA.2024.22},
annote = {Keywords: Topological data analysis, Euler calculus, Topological integral transform, Euler characteristic transform, Hybrid transforms}
}
@InProceedings{mayer_et_al:LIPIcs.SEA.2024.23,
author = {Mayer, Philip and Mutzel, Petra},
title = {{Engineering A* Search for the Flip Distance of Plane Triangulations}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.23},
URN = {urn:nbn:de:0030-drops-203887},
doi = {10.4230/LIPIcs.SEA.2024.23},
annote = {Keywords: Computational Geometry, Triangulations, Flip Distance, A-star Search, Integer Linear Programming}
}
@InProceedings{palmer_et_al:LIPIcs.SEA.2024.24,
author = {Palmer, Matthew N. and Faro, Simone and Scafiti, Stefano},
title = {{Efficient Exact Online String Matching Through Linked Weak Factors}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24},
URN = {urn:nbn:de:0030-drops-203896},
doi = {10.4230/LIPIcs.SEA.2024.24},
annote = {Keywords: String matching, text processing, weak recognition, hashing, experimental algorithms, design and analysis of algorithms}
}
@InProceedings{ponte_et_al:LIPIcs.SEA.2024.25,
author = {Ponte, Gabriel and Fampa, Marcia and Lee, Jon},
title = {{Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.25},
URN = {urn:nbn:de:0030-drops-203901},
doi = {10.4230/LIPIcs.SEA.2024.25},
annote = {Keywords: maximum-entropy sampling, D-optimality, convex relaxation, branch-and-bound, integer nonlinear optimization, principal component analysis}
}
@InProceedings{soh_et_al:LIPIcs.SEA.2024.26,
author = {Soh, Takehide and Watanabe, Takumu and Kawahara, Jun and Suzuki, Akira and Ito, Takehiro},
title = {{Scalable Hard Instances for Independent Set Reconfiguration}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.26},
URN = {urn:nbn:de:0030-drops-203913},
doi = {10.4230/LIPIcs.SEA.2024.26},
annote = {Keywords: Combinatorial reconfiguration, Benckmark dataset, Graph Algorithm, PSPACE-complete}
}
@InProceedings{staudt_et_al:LIPIcs.SEA.2024.27,
author = {Staudt, Christoph and Blacher, Mark and Klaus, Julien and Lippmann, Farin and Giesen, Joachim},
title = {{Improved Cut Strategy for Tensor Network Contraction Orders}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.27},
URN = {urn:nbn:de:0030-drops-203924},
doi = {10.4230/LIPIcs.SEA.2024.27},
annote = {Keywords: tensor network, contraction order, graph partitioniong, quantum simulation}
}
@InProceedings{urrutia_et_al:LIPIcs.SEA.2024.28,
author = {Urrutia, Sebasti\'{a}n and dos Santos, Vinicius},
title = {{Finding the Minimum Cost Acceptable Element in a Sorted Matrix}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.28},
URN = {urn:nbn:de:0030-drops-203939},
doi = {10.4230/LIPIcs.SEA.2024.28},
annote = {Keywords: Search, Sorted matrix, Oracle function, Algorithm complexity}
}
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