| 2013 | Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types. | Hyeonseung Im, Keiko Nakata, Sungwoo Park |
| 2013 | Locally Stable Marriage with Strict Preferences. | Martin Hoefer, Lisa Wagner |
| 2013 | On the Complexity of Broadcast Setup. | Martin Hirt, Pavel Raykov |
| 2013 | Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2013 | Local Correctability of Expander Codes. | Brett Hemenway, Rafail Ostrovsky, Mary Wootters |
| 2013 | A Refined Complexity Analysis of Degree Anonymization in Graphs. | Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Ondrej Such |
| 2013 | Efficient Computation of Balanced Structures. | David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan |
| 2013 | Arthur-Merlin Streaming Complexity. | Tom Gur, Ran Raz |
| 2013 | The Complexity of Planar Boolean #CSP with Complex Weights. | Heng Guo, Tyson Williams |
| 2013 | Dynamic Compressed Strings with Random Access. | Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini |
| 2013 | Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. | Daniel Grier |
| 2013 | Competitive Auctions for Markets with Positive Externalities. | Nick Gravin, Pinyan Lu |
| 2013 | Querying the Guarded Fragment with Transitivity. | Georg Gottlob, Andreas Pieris, Lidia Tendera |
| 2013 | An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger |
| 2013 | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. | Christian Glaer, Dung T. Nguyen, Christian Reitwiener, Alan L. Selman, Maximilian Witek |
| 2013 | ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. | Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss |
| 2013 | Asynchronous Games over Tree Architectures. | Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz |
| 2013 | Strategy Composition in Compositional Games. | Marcus Gelderie |
| 2013 | FO Model Checking of Interval Graphs. | Robert Ganian, Petr Hlinen, Daniel Krl', Jan Obdrzlek, Jarett Schwartz, Jakub Teska |
| 2013 | Learning a Ring Cheaply and Fast. | Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi |
| 2013 | Checking Equality and Regularity for Normed BPA with Silent Moves. | Yuxi Fu |
| 2013 | Ramsey Goes Visibly Pushdown. | Oliver Friedmann, Felix Klaedtke, Martin Lange |
| 2013 | On the Power of Deterministic Mechanisms for Facility Location Games. | Dimitris Fotakis, Christos Tzamos |
| 2013 | Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | Reachability in Two-Clock Timed Automata Is PSPACE-Complete. | John Fearnley, Marcin Jurdzinski |