Journal: Theory Comput. Syst.

Volume 53, Issue 3

365 -- 385Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang. Global Strong Defensive Alliances of Sierpiński-Like Graphs
386 -- 423Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien. Static Strategies for Worksharing with Unrecoverable Interruptions
424 -- 440Konstantinos Kollias. Nonpreemptive Coordination Mechanisms for Identical Machines
441 -- 453Martin Hoefer, Alexander Skopalik. On the Complexity of Pareto-Optimal Nash and Strong Equilibria
454 -- 466Angsheng Li, Peng Zhang. Unbalanced Graph Partitioning
467 -- 502Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets
503 -- 506Eric Allender, Vikraman Arvind, Meena Mahajan. Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series