1. Editorial: ISAAC 2008 Special Issue

   • Seok-Hee Hong
   • Hiroshi Nagamochi

   EditorialNotes 17 March 2011 Pages: 777 - 778

2. Signature Theory in Holographic Algorithms

   • Jin-Yi Cai
   • Pinyan Lu

   OriginalPaper 31 December 2009 Pages: 779 - 816

3. Faster Parameterized Algorithms for Minimum Fill-in

   • Hans L. Bodlaender
   • Pinar Heggernes
   • Yngve Villanger

   OriginalPaper 01 July 2010 Pages: 817 - 838

4. How to Guard a Graph?

   • Fedor V. Fomin
   • Petr A. Golovach
   • Peter Widmayer

   OriginalPaper 06 January 2010 Pages: 839 - 856

5. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

   • Sounaka Mishra
   • Venkatesh Raman
   • C. R. Subramanian

   OriginalPaper 20 May 2010 Pages: 857 - 881

6. A New Algorithm for Finding Trees with Many Leaves

   • Joachim Kneis
   • Alexander Langer
   • Peter Rossmanith

   OriginalPaper 28 September 2010 Pages: 882 - 897

7. An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem

   • Maxim A. Babenko

   OriginalPaper 16 December 2009 Pages: 898 - 922

8. Editors’ Note: ISAAC 2009 Special Section

   Announcement 29 October 2011 Pages: 923 - 923

9. Exact Algorithms for the Bottleneck Steiner Tree Problem

   • Sang Won Bae
   • Sunghee Choi
   • Shin-ichi Tanigawa

   OriginalPaper 30 July 2011 Pages: 924 - 948

10. Editing Graphs into Disjoint Unions of Dense Clusters

    • Jiong Guo
    • Iyad A. Kanj
    • Johannes Uhlmann

    OriginalPaper 12 January 2011 Pages: 949 - 970

11. Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three

    • Marwan Al-Jubeh
    • Mashhood Ishaque
    • Pavel Valtr

    OriginalPaper 03 August 2011 Pages: 971 - 999

12. Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs

    • Minming Li
    • Peng-Jun Wan
    • Frances Yao

    OriginalPaper 15 April 2011 Pages: 1000 - 1021

13. Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra

    • Seok-Hee Hong
    • Hiroshi Nagamochi

    OriginalPaper 21 September 2011 Pages: 1022 - 1076

14. An Improved Approximation Algorithm for the Traveling Tournament Problem

    • Daisuke Yamaguchi
    • Shinji Imahori
    • Tomomi Matsui

    OriginalPaper 13 October 2011 Pages: 1077 - 1091

15. Another Sub-exponential Algorithm for the Simple Stochastic Game

    • Decheng Dai
    • Rong Ge

    OriginalPaper 18 May 2010 Pages: 1092 - 1104