| 2013 | Logical Aspects of the Lexicographic Order on 1-Counter Languages. | Dietrich Kuske |
| 2013 | Prime Languages. | Orna Kupferman, Jonathan Mosheiff |
| 2013 | Reversibility of Computations in Graph-Walking Automata. | Michal Kunc, Alexander Okhotin |
| 2013 | Small Depth Proof Systems. | Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah |
| 2013 | Strong Completeness for Markovian Logics. | Dexter Kozen, Radu Mardare, Prakash Panangaden |
| 2013 | Prior-Free Auctions of Digital Goods. | Elias Koutsoupias |
| 2013 | Helly Circular-Arc Graph Isomorphism Is in Logspace. | Johannes Kbler, Sebastian Kuhnert, Oleg Verbitsky |
| 2013 | Detecting Regularities on Grammar-Compressed Strings. | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
| 2013 | A Polychromatic Ramsey Theory for Ordinals. | Martin Huschenbett, Jiamou Liu |
| 2013 | Improved Complexity Results on k-Coloring P t -Free Graphs. | Shenwei Huang |
| 2013 | Length-Increasing Reductions for PSPACE-Completeness. | John M. Hitchcock, Aduri Pavan |
| 2013 | Reachability in Higher-Order-Counters. | Alexander Heuner, Alexander Kartzow |
| 2013 | Polynomial Threshold Functions and Boolean Threshold Circuits. | Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii |
| 2013 | A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums. | Leonid Gurvits |
| 2013 | Logical and Structural Approaches to the Graph Isomorphism Problem. | Martin Grohe |
| 2013 | On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. | Prachi Goyal, Vikram Kamat, Neeldhara Misra |
| 2013 | A Constructive Proof of the Topological Kruskal Theorem. | Jean Goubault-Larrecq |
| 2013 | Solving 3-Superstring in 3 n/3 Time. | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2013 | Separating Hierarchical and General Hub Labelings. | Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko |
| 2013 | Meta-kernelization with Structural Parameters. | Robert Ganian, Friedrich Slivovsky, Stefan Szeider |
| 2013 | A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. | Vincent Froese, Ren van Bevern, Rolf Niedermeier, Manuel Sorge |
| 2013 | On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. | Herv Fournier, Sylvain Perifel, Rmi de Joannis de Verclos |
| 2013 | On the Parameterized Complexity of Cutting a Few Vertices from a Graph. | Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen |
| 2013 | Ordering Metro Lines by Block Crossings. | Martin Fink, Sergey Pupyrev |
| 2013 | Reachability in Register Machines with Polynomial Updates. | Alain Finkel, Stefan Gller, Christoph Haase |