![](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 2019: San Diego, CA, USA
- Stephen G. Kobourov, Henning Meyerhenke
:
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. SIAM 2019 - Stefan Edelkamp
, Armin Weiß
:
Worst-Case Efficient Sorting with QuickMergesort. 1-14 - Martin Aumüller, Nikolaj Hass:
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. 15-26 - Johannes Fischer, Florian Kurpicz
:
Lightweight Distributed Suffix Array Construction. 27-38 - Romain Azaïs
, Jean-Baptiste Durand
, Christophe Godin:
Approximation of trees by self-nested trees. 39-53 - Daniel Delling, Julian Dibbelt, Thomas Pajor:
Fast and Exact Public Transit Routing with Restricted Pareto Sets. 54-65 - Florian Barth
, Stefan Funke, Sabine Storandt:
Alternative Multicriteria Routes. 66-80 - Moritz Beck, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu
:
Concatenated k-Path Covers. 81-91 - Thomas Tseng
, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. 92-106 - Adalat Jabrayilov, Petra Mutzel
:
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. 107-116 - Robert Ganian, Neha Lodha, Sebastian Ordyniak
, Stefan Szeider
:
SAT-Encodings for Treecut Width and Treedepth. 117-129 - Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks
, Martin Schirneck
:
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. 130-143 - Sebastian Lamm, Christian Schulz, Darren Strash
, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. 144-158 - Yihan Sun, Guy E. Blelloch:
Parallel Range, Segment and Rectangle Queries with Augmented Maps. 159-173 - Thom Castermans, Bettina Speckmann
, Kevin Verbeek
:
A Practical Algorithm for Spatial Agglomerative Clustering. 174-185 - Sándor P. Fekete, Dominik Krupke:
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. 186-198 - Sebastian Schlag
, Matthias Schmitt
, Christian Schulz:
Faster Support Vector Machines. 199-210 - Sebastian Schlag
, Christian Schulz, Daniel Seemaier, Darren Strash
:
Scalable Edge Partitioning. 211-225
![](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.