default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 21
Volume 21, Number 1, August 2016
- Catherine C. McGeoch:
In Memoriam: David S. Johnson. 1.1e:1
- Joachim Gudmundsson
, Jyrki Katajainen:
Editorial, SEA 2014 Special Issue. 1.1:1 - Martin Bergner, Marco E. Lübbecke, Jonas T. Witt:
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. 1.2:1-1.2:16 - David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. 1.3:1-1.3:23 - Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. 1.4:1-1.4:21 - Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. 1.5:1-1.5:49 - Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. 1.6:1-1.6:20 - Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. 1.7:1-1.7:22 - Gonzalo Navarro, Alberto Ordóñez Pereira:
Faster Compressed Suffix Trees for Repetitive Collections. 1.8:1-1.8:38
- Martin Marinov, Nicholas Nash, David Gregg:
Practical Algorithms for Finding Extremal Sets. 1.9:1-1.9:21 - Jiju Peethambaran, Amal Dev Parakkat, Ramanathan Muthuganapathy:
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets. 1.10:1-1.10:24 - Conrad W. Rosenbrock, Wiley S. Morgan, Gus L. W. Hart, Stefano Curtarolo, Rodney W. Forcade:
Numerical Algorithm for Pólya Enumeration Theorem. 1.11:1-1.11:17 - Takahisa Toda, Takehide Soh:
Implementing Efficient All Solutions SAT Solvers. 1.12:1-1.12:44 - Alexandros Efentakis, Dieter Pfoser:
ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks. 1.13:1-1.13:35
- Peter Sanders, Norbert Zeh:
Introduction to Special Issue ALENEX 2013. 2.1:1-2.1:2 - Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer:
Short and Simple Cycle Separators in Planar Graphs. 2.2:1-2.2:24 - Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and LCP Arrays in External Memory. 2.3:1-2.3:27 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lazy Lempel-Ziv Factorization Algorithms. 2.4:1-2.4:19
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-11-14 20:50 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:
