Journal: Theory Comput. Syst.

Volume 47, Issue 4

809 -- 810Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler. Foreword
811 -- 836Fabian Kuhn, Thomas Moscibroda. Distributed Approximation of Capacitated Dominating Sets
837 -- 855Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder. Strong-Diameter Decompositions of Minor Free Graphs
856 -- 877Guolong Lin, Rajmohan Rajaraman. Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
878 -- 919Rezaul Alam Chowdhury, Vijaya Ramachandran. The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
920 -- 933Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. Local MST Computation with Short Advice
934 -- 962Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari. Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model

Volume 47, Issue 3

611 -- 612Susanne Albers, Pascal Weil. STACS 2008 Foreword
613 -- 636Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff. Trimming of Graphs, with Application to Point Labeling
637 -- 654Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. Trimmed Moebius Inversion and Graphs of Bounded Degree
655 -- 673Thomas Thierauf, Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
674 -- 695Mirela Damian, Robin Y. Flatland, Joseph O Rourke, Suneeta Ramaswami. Connecting Polygonizations via Stretches and Twangs
696 -- 719Diana Fischer, Erich Grädel, Lukasz Kaiser. Model Checking Games for the Quantitative ::::µ::::-Calculus
720 -- 736Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin. Limit Complexities Revisited
737 -- 757Samir Datta, Raghav Kulkarni, Sambuddha Roy. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
758 -- 785Jacques Sakarovitch, Rodrigo de Souza. Lexicographic Decomposition of ::::k::::-Valued Transducers

Volume 47, Issue 2

301 -- 316Remco Loos, Mitsunori Ogihara. Time and Space Complexity for Splicing Systems
317 -- 341Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet. Non-Uniform Reductions
342 -- 367Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith. New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
368 -- 404Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications
405 -- 432Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien. Computing Nash Equilibria for Scheduling on Restricted Parallel Links
433 -- 453Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim. Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
454 -- 490Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer. The Complexity of Problems for Quantified Constraints
491 -- 506Nicola Galesi, Massimo Lauria. On the Automatizability of Polynomial Calculus
507 -- 530Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli. Designing Fast Converging Cost Sharing Methods for Multicast Transmissions
531 -- 567Bruno Courcelle, Andrew Twigg. Constrained-Path Labellings on Graphs of Bounded Clique-Width
568 -- 592Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas. Automatic Presentations and Semigroup Constructions
593 -- 609Beate Bollig, Niko Range, Ingo Wegener. Exact OBDD Bounds for Some Fundamental Functions

Volume 47, Issue 1

1 -- 2Burkhard Monien, Ulf-Peter Schroeder. Preface
3 -- 14Matthias Englert, Thomas Franke, Lars Olbrich. Sensitivity of Wardrop Equilibria
15 -- 37Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda. Non-Cooperative Cost Sharing Games via Subsidies
38 -- 59Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. Atomic Congestion Games: Fast, Myopic and Concurrent
60 -- 112Rainer Feldmann, Marios Mavronicolas, Andreas Pieris. Facets of the Fully Mixed Nash Equilibrium Conjecture
113 -- 136Dimitris Fotakis. Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
137 -- 161Jeff Edmonds, Suprakash Datta, Patrick W. Dymond. TCP is Competitive with Resource Augmentation
162 -- 178Olaf Beyersdorff. The Deduction Theorem for Strong Propositional Proof Systems
179 -- 195Francine Blanchet-Sadri, E. Clader, O. Simpson. Border Correlations of Partial Words
196 -- 217Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier. Fixed-Parameter Algorithms for Cluster Vertex Deletion
218 -- 249Dimitris Fotakis. Stackelberg Strategies for Atomic Congestion Games
250 -- 258Olgo Kharlampovich, I. G. Lysënok, Alexei G. Myasnikov, Nicholas W. M. Touikan. The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete
259 -- 287Philippe Raipin Parvédy, Michel Raynal, Corentin Travers. Strongly Terminating Early-Stopping ::::k::::-Set Agreement in Synchronous Systems with General Omission Failures
288 -- 299Jacobo Torán. Reductions to Graph Isomorphism