On the Parameterized Complexity of Computing Balanced Partitions in Graphs René van BevernAndreas Emil FeldmannOndřej Suchý OriginalPaper 08 July 2014 Pages: 1 - 35
The Complexity of Debate Checking H. Gökalp DemirciA. C. Cem SayAbuzer Yakaryılmaz OriginalPaper 13 August 2014 Pages: 36 - 80
Minimizing Rosenthal Potential in Multicast Games Fedor V. FominPetr A. GolovachMichał Pilipczuk OriginalPaper 16 September 2014 Pages: 81 - 96
Deciding Determinism of Regular Languages Ping LuJoachim BremerHaiming Chen OriginalPaper 24 September 2014 Pages: 97 - 139
Finding Disjoint Paths in Split Graphs Pinar HeggernesPim van ’t HofReza Saei OriginalPaper 28 September 2014 Pages: 140 - 159
Lower Bounds for Tropical Circuits and Dynamic Programs Stasys Jukna OriginalPaper 05 October 2014 Pages: 160 - 194
Restarting Transducers, Regular Languages, and Rational Relations Norbert HundeshagenFriedrich Otto OriginalPaper 14 October 2014 Pages: 195 - 225
Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations Kazuki Okamura OriginalPaper 18 October 2014 Pages: 226 - 237
LP-Based Covering Games with Low Price of Anarchy Georgios PiliourasTomáš VallaLászló A Végh OriginalPaper 19 October 2014 Pages: 238 - 260
On Avoiding Spare Aborts in Transactional Memory Idit KeidarDmitri Perelman OriginalPaper 15 February 2015 Pages: 261 - 285
