default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX 2018: New Orleans, LA, USA
- Rasmus Pagh, Suresh Venkatasubramanian:
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. SIAM 2018, ISBN 978-1-61197-505-5 - Héctor Ferrada, Dominik Kempa
, Simon J. Puglisi:
Hybrid Indexing Revisited. 1-8 - Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Simple, Fast and Lightweight Parallel Wavelet Tree Construction. 9-20 - Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. 21-35 - Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego:
Adaptive Cuckoo Filters. 36-47 - Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. 48-61 - Nirman Kumar, Stavros Sintos:
Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. 62-74 - Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. 75-86 - Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. 87-96 - Lars Arge, Yujin Shin, Constantinos Tsirogiannis:
Computing Floods Caused by Non-Uniform Sea-Level Rise. 97-108 - David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. 109-116 - Thomas Mendel:
Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice. 117-128 - Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
A Geometric Heuristic for Rectilinear Crossing Minimization. 129-138 - Jakob L. Andersen, Daniel Merkle:
A Generic Framework for Engineering Graph Canonization Algorithms. 139-153 - Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard:
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. 154-168 - Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel:
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. 169-183 - Petteri Kaski:
Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. 184-198 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. 199-208 - Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke:
Scaling up Group Closeness Maximization. 209-222 - Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. 223-237
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-13 19:15 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:
