default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st SEA 2023: Barcelona, Spain
- Loukas Georgiadis
:
21st International Symposium on Experimental Algorithms, SEA 2023, July 24-26, 2023, Barcelona, Spain. LIPIcs 265, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-279-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Markus Anders, Pascal Schweitzer, Julian Stieß:
Engineering a Preprocessor for Symmetry Detection. 1:1-1:21 - Giorgos Kritikakis, Ioannis G. Tollis:
Fast Reachability Using DAG Decomposition. 2:1-2:17 - Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition into Cliques. 3:1-3:19 - Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi:
Subset Wavelet Trees. 4:1-4:14 - Manuel Penschuck:
Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place. 5:1-5:20 - Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric:
Proxying Betweenness Centrality Rankings in Temporal Networks. 6:1-6:22 - Diego Díaz-Domínguez, Saska Dönges, Simon J. Puglisi, Leena Salmela:
Simple Runs-Bounded FM-Index Designs Are Fast. 7:1-7:16 - Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel:
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. 8:1-8:18 - Satya Tamby, Daniel Vanderpooten:
Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem. 9:1-9:13 - Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. 10:1-10:14 - Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints. 11:1-11:20 - Miriam Fischer, Akshay Gupte:
Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games. 12:1-12:14 - Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin:
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. 13:1-13:18 - Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
A Graph-Theoretic Formulation of Exploratory Blockmodeling. 14:1-14:20 - Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. 15:1-15:16 - Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil:
Arc-Flags Meet Trip-Based Public Transit Routing. 16:1-16:18 - Noah Wahl, Lars Gottesbüren:
Greedy Heuristics for Judicious Hypergraph Partitioning. 17:1-17:16 - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. 18:1-18:16 - Meng He, Zhen Liu:
Exact and Approximate Range Mode Query Data Structures in Practice. 19:1-19:22 - Daniel Funke, Peter Sanders:
Efficient Yao Graph Construction. 20:1-20:20 - Stephen Jaud, Anthony Wirth, Farhana Murtaza Choudhury:
Maximum Coverage in Sublinear Space, Faster. 21:1-21:20
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-26 00:35 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:
