Volume 47, Number 1, July 2010

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

Volume 47, Number 2, August 2010

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

Volume 47, Number 3, October 2010

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

Volume 47, Number 4, November 2010

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

last updated on Thu May 23 04:33:02 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page