| 2013 | A Faster CREW PRAM Algorithm for Computing Cartesian Trees. Chung Keung Poon, Hao Yuan |
| 2013 | A Greedy Approximation Algorithm for Minimum-Gap Scheduling. Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor |
| 2013 | A New Dynamic Graph Structure for Large-Scale Transportation Networks. Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos, Christos D. Zaroliagis |
| 2013 | Advice Complexity of the Online Coloring Problem. Sebastian Seibert, Andreas Sprock, Walter Unger |
| 2013 | Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings Paul G. Spirakis, Maria J. Serna |
| 2013 | Approximation Algorithms for Disjoint Hasna Mohsen Alqahtani, Thomas Erlebach |
| 2013 | Average Optimal String Matching in Packed Strings. Djamal Belazzougui, Mathieu Raffinot |
| 2013 | Capacitated Rank-Maximal Matchings. Katarzyna E. Paluch |
| 2013 | Cliques and Clubs. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey |
| 2013 | Competitive Online Clique Clustering. Aleksander Fabijan, Bengt J. Nilsson, Mia Persson |
| 2013 | Complexity of Barrier Coverage with Relocatable Sensors in the Plane. Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia |
| 2013 | Decentralized Throughput Scheduling. Jasper de Jong, Marc Uetz, Andreas Wombacher |
| 2013 | Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. Evgeny Dantsin, Alexander Wolpert |
| 2013 | Finding All Convex Cuts of a Plane Graph in Cubic Time. Roland Glantz, Henning Meyerhenke |
| 2013 | Four Measures of Nonlinearity. Joan Boyar, Magnus Find, René Peralta |
| 2013 | Improving the Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák |
| 2013 | LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem. Li Yan, Marek Chrobak |
| 2013 | Linear Time Distributed Swap Edge Algorithms. Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe |
| 2013 | List Coloring in the Absence of Two Subgraphs. Petr A. Golovach, Daniël Paulusma |
| 2013 | Money-Based Coordination of Network Packets. Pavlos S. Efraimidis, Remous-Aris Koutsiamanis |
| 2013 | New Results on Stabbing Segments with a Polygon. José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira |
| 2013 | On the Characterization of Plane Bus Graphs. Till Bruckdorfer, Stefan Felsner, Michael Kaufmann |
| 2013 | Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items. Mihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung |
| 2013 | Optimal Network Decontamination with Threshold Immunity. Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro |
| 2013 | Parameterized Complexity and Kernel Bounds for Hard Planning Problems. Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2013 | Parameterized Complexity of DAG Partitioning. René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý |
| 2013 | Query Complexity of Matroids. Raghav Kulkarni, Miklos Santha |
| 2013 | Selfish Resource Allocation in Optical Networks. Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis |
| 2013 | Shortest Paths with Bundles and Non-additive Weights Is Hard. Paul W. Goldberg, Antony McCabe |
| 2013 | Sparse Linear Complementarity Problems. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino |
| 2013 | Succinct Permanent Is Shlomi Dolev, Nova Fandina, Dan Gutfreund |
| 2013 | Truthful Many-to-Many Assignment with Private Weights. Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard |