1. The Complexity of Circumscriptive Inference in Post’s Lattice

   • Michael Thomas

   OriginalPaper 11 January 2011 Pages: 401 - 419

2. A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

   • Hans L. Bodlaender
   • Fedor V. Fomin
   • Dimitrios M. Thilikos

   OriginalPaper Open access 21 January 2011 Pages: 420 - 432

3. How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model

   • Shukai Cai
   • Taisuke Izumi
   • Koichi Wada

   OriginalPaper 02 February 2011 Pages: 433 - 445

4. Trichotomies in the Complexity of Minimal Inference

   • Arnaud Durand
   • Miki Hermann
   • Gustav Nordh

   OriginalPaper 10 March 2011 Pages: 446 - 491

5. Faster Approximate String Matching for Short Patterns

   • Philip Bille

   OriginalPaper 01 April 2011 Pages: 492 - 515

6. On the Correlation Between Parity and Modular Polynomials

   • Anna Gál
   • Vladimir Trifonov

   OriginalPaper 12 May 2011 Pages: 516 - 536

7. Irregular Total Labellings of Generalized Petersen Graphs

   • Khandoker Mohammed Mominul Haque

   OriginalPaper 07 July 2011 Pages: 537 - 544

8. An Improved Approximation Algorithm for the Most Points Covering Problem

   • Hossein Ghasemalizadeh
   • Mohammadreza Razzazi

   OriginalPaper 06 August 2011 Pages: 545 - 558

9. The Impact of Social Ignorance on Weighted Congestion Games

   • Dimitris Fotakis
   • Vasilis Gkatzelis
   • Paul G. Spirakis

   OriginalPaper 30 July 2011 Pages: 559 - 578