Skip to main content

Theory of Computing Systems

Ausgabe 1/2015

Inhalt (10 Artikel)

On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý

The Complexity of Debate Checking

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

Minimizing Rosenthal Potential in Multicast Games

Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk

Deciding Determinism of Regular Languages

Ping Lu, Joachim Bremer, Haiming Chen

Finding Disjoint Paths in Split Graphs

Pinar Heggernes, Pim van ’t Hof, Erik Jan van Leeuwen, Reza Saei

LP-Based Covering Games with Low Price of Anarchy

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