![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ALENEX 2020: Salt Lake City, UT, USA
- Guy E. Blelloch, Irene Finocchi:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. SIAM 2020, ISBN 978-1-61197-600-7 - André Schidler
, Stefan Szeider
:
Computing Optimal Hypertree Decompositions. 1-11 - Christian Komusiewicz, Frank Sommer:
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. 12-26 - Damir Ferizovic, Demian Hespe
, Sebastian Lamm, Matthias Mnich
, Christian Schulz, Darren Strash
:
Engineering Kernelization for Maximum Cut. 27-41 - Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. 42-55 - Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. 56-69 - Brian Lavallee, Hayley Russell, Blair D. Sullivan
, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. 70-80 - Maleq Khan, Gopal Pandurangan
, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang
:
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. 81-93 - Moritz Beck, Sabine Storandt:
Puzzling Grid Embeddings. 94-105 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. 106-119 - Fritz Bökler
, Markus Chimani:
Approximating Multiobjective Shortest Path in Practice. 120-133 - Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar:
Karp-Sipser based kernels for bipartite graph matching. 134-145 - Andre Droschinsky, Petra Mutzel
, Erik Thordsen:
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. 146-160 - Lukas Barth, Dorothea Wagner:
Engineering Top-Down Weight-Balanced Trees. 161-174 - Emmanuel Esposito
, Thomas Mueller Graf
, Sebastiano Vigna:
RecSplit: Minimal Perfect Hashing via Recursive Splitting. 175-185 - Jens Zentgraf, Henning Timm, Sven Rahmann:
Cost-optimal assignment of elements in genome-scale multi-way bucketed Cuckoo hash tables. 186-198 - Giulia Bernardini
, Huiping Chen
, Gabriele Fici, Grigorios Loukides, Solon P. Pissis
:
Reverse-Safe Data Structures for Text Indexing. 199-213 - Patrick Dinklage
, Johannes Fischer, Florian Kurpicz
:
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. 214-228
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.