| 2014 | Deterministic Parameterized Algorithms for the Graph Motif Problem. | Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi |
| 2014 | Random Deterministic Automata. | Cyril Nicaud |
| 2014 | Betweenness Centrality - Incremental and Faster. | Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran |
| 2014 | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | Reachability in Pushdown Register Automata. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2014 | Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals. | Angelo Montanari, Gabriele Puppis, Pietro Sala |
| 2014 | Traveling Salesman Problems in Temporal Graphs. | Othon Michail, Paul G. Spirakis |
| 2014 | Model Checking Concurrent Recursive Programs Using Temporal Logics. | Roy Mennicke |
| 2014 | Monadic Datalog and Regular Tree Pattern Queries. | Filip Mazowiecki, Filip Murlak, Adam Witkowski |
| 2014 | Complexity of Equivalence and Learning for Multiplicity Tree Automata. | Ines Marusic, James Worrell |
| 2014 | Generalised Lyndon-Schtzenberger Equations. | Florin Manea, Mike Mller, Dirk Nowotka, Shinnosuke Seki |
| 2014 | An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games. | Akaki Mamageishvili, Mats Mihalk, Simone Montemezzani |
| 2014 | Document Retrieval with One Wildcard. | Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan |
| 2014 | Definability and Transformations for Cost Logics and Automatic Structures. | Martin Lang, Christof Lding, Amaldev Manuel |
| 2014 | On Coloring Resilient Graphs. | Jeremy Kun, Lev Reyzin |
| 2014 | Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. | Nils M. Kriege, Petra Mutzel |
| 2014 | Computational Complexity of Covering Three-Vertex Multigraphs. | Jan Kratochvl, Jan Arne Telle, Marek Tesar |
| 2014 | On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic. | Gergely Kovsznai, Helmut Veith, Andreas Frhlich, Armin Biere |
| 2014 | On the Clique Editing Problem. | Ivan Kovc, Ivana Selecniov, Monika Steinov |
| 2014 | Parameterized Approximations via d-Skew-Symmetric Multicut. | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | Two Results about Quantum Messages. | Hartmut Klauck, Supartha Podder |
| 2014 | Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. | Emanuel Kieronski, Antti Kuusisto |
| 2014 | Small Complexity Classes for Computable Analysis. | Akitoshi Kawamura, Hiroyuki Ota |
| 2014 | Affine Consistency and the Complexity of Semilinear Constraints. | Peter Jonsson, Johan Thapper |
| 2014 | Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman |