1. On the Parameterized Complexity of Computing Balanced Partitions in Graphs

   • René van Bevern
   • Andreas Emil Feldmann
   • Ondřej Suchý

   OriginalPaper 08 July 2014 Pages: 1 - 35

   

2. The Complexity of Debate Checking

   • H. Gökalp Demirci
   • A. C. Cem Say
   • Abuzer Yakaryılmaz

   OriginalPaper 13 August 2014 Pages: 36 - 80

   

3. Minimizing Rosenthal Potential in Multicast Games

   • Fedor V. Fomin
   • Petr A. Golovach
   • Michał Pilipczuk

   OriginalPaper 16 September 2014 Pages: 81 - 96

   

4. Deciding Determinism of Regular Languages

   • Ping Lu
   • Joachim Bremer
   • Haiming Chen

   OriginalPaper 24 September 2014 Pages: 97 - 139

   

5. Finding Disjoint Paths in Split Graphs

   • Pinar Heggernes
   • Pim van ’t Hof
   • Reza Saei

   OriginalPaper 28 September 2014 Pages: 140 - 159

   

6. Lower Bounds for Tropical Circuits and Dynamic Programs

   • Stasys Jukna

   OriginalPaper 05 October 2014 Pages: 160 - 194

7. Restarting Transducers, Regular Languages, and Rational Relations

   • Norbert Hundeshagen
   • Friedrich Otto

   OriginalPaper 14 October 2014 Pages: 195 - 225

   

8. Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations

   • Kazuki Okamura

   OriginalPaper 18 October 2014 Pages: 226 - 237

9. LP-Based Covering Games with Low Price of Anarchy

   • Georgios Piliouras
   • Tomáš Valla
   • László A Végh

   OriginalPaper 19 October 2014 Pages: 238 - 260

10. On Avoiding Spare Aborts in Transactional Memory

    • Idit Keidar
    • Dmitri Perelman

    OriginalPaper 15 February 2015 Pages: 261 - 285