default search action
ACM Journal of Experimental Algorithmics, Volume 19
Volume 19, Number 1, May 2014
- Rodrigo González, Gonzalo Navarro, Héctor Ferrada:
Locally Compressed Suffix Arrays. - Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. - B. O. Fagginger Auer, Rob H. Bisseling:
Efficient Matching for Column Intersection Graphs. - Claudio Angione, Annalisa Occhipinti, Giuseppe Nicosia:
Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions. - Asaf Frieder, Liam Roditty:
An Experimental Study on Approximating k Shortest Simple Paths. - Gustavo Rodrigues Galvão, Zanoni Dias:
An Audit Tool for Genome Rearrangement Algorithms. - Tomasz Jurkiewicz, Kurt Mehlhorn:
On a Model of Virtual Address Translation.
- Ralf Klasing:
Editorial. - Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. - Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. - Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. - David F. Manlove, Gregg O'Malley:
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks.
- David A. Bader, Petra Mutzel:
Introduction to Special Issue ALENEX'12. - Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multimodal Route Planning. - Robert Görke, Andrea Kappes, Dorothea Wagner:
Experiments on Density-Constrained Graph Clustering. - Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions.
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.