| 1 | -- | 35 | René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý. On the Parameterized Complexity of Computing Balanced Partitions in Graphs |
| 36 | -- | 80 | H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz. The Complexity of Debate Checking |
| 81 | -- | 96 | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk. Minimizing Rosenthal Potential in Multicast Games |
| 97 | -- | 139 | Ping Lu, Joachim Bremer, Haiming Chen. Deciding Determinism of Regular Languages |
| 140 | -- | 159 | Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei. Finding Disjoint Paths in Split Graphs |
| 160 | -- | 194 | Stasys Jukna. Lower Bounds for Tropical Circuits and Dynamic Programs |
| 195 | -- | 225 | Norbert Hundeshagen, Friedrich Otto. Restarting Transducers, Regular Languages, and Rational Relations |
| 226 | -- | 237 | Kazuki Okamura. Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations |
| 238 | -- | 260 | Georgios Piliouras, Tomás Valla, László A. Végh. LP-Based Covering Games with Low Price of Anarchy |
| 261 | -- | 285 | Idit Keidar, Dmitri Perelman. On Avoiding Spare Aborts in Transactional Memory |