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