| 2013 | Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. | Konstantin Makarychev |
| 2013 | Explicit relation between all lower bound techniques for quantum query complexity. | Lock Magnin, Jrmie Roland |
| 2013 | The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems. | Tengyu Ma, Bo Tang, Yajun Wang |
| 2013 | Deterministic algorithms for skewed matrix products. | Konstantin Kutzkov |
| 2013 | Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. | Manfred Kufleitner, Alexander Lauser |
| 2013 | On Polynomial Kernels for Sparse Integer Linear Programs. | Stefan Kratsch |
| 2013 | Pebbling, Entropy and Branching Program Size Lower Bounds. | Balagopal Komarath, Jayalal Sarma |
| 2013 | Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2013 | The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. | Ines Klimann |
| 2013 | Fooling One-Sided Quantum Protocols. | Hartmut Klauck, Ronald de Wolf |
| 2013 | Constrained Binary Identification Problem. | Amin Karbasi, Morteza Zadimoghaddam |
| 2013 | Recompression: a simple and powerful technique for word equations. | Artur Jez |
| 2013 | Excluded vertex-minors for graphs of linear rank-width at most k. | Jisu Jeong, O-joung Kwon, Sang-il Oum |
| 2013 | Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. | Emmanuel Jeandel, Pascal Vanier |
| 2013 | Parameterized Matching in the Streaming Model. | Markus Jalsenius, Benny Porat, Benjamin Sach |
| 2013 | Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. | Yoichi Iwata, Yuichi Yoshida |
| 2013 | Lossy Chains and Fractional Secret Sharing. | Yuval Ishai, Eyal Kushilevitz, Omer Strulovich |
| 2013 | The Rank of Tree-Automatic Linear Orderings. | Martin Huschenbett |
| 2013 | Search versus Decision for Election Manipulation Problems. | Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton |
| 2013 | Finding Pseudo-repetitions. | Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu |
| 2013 | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2013 | Streaming Complexity of Checking Priority Queues. | Nathanal Franois, Frdric Magniez |
| 2013 | Searching for better fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2013 | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2013 | Tight bounds for Parameterized Complexity of Cluster Editing. | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |