Editorial: ISAAC 2008 Special Issue Seok-Hee HongHiroshi Nagamochi EditorialNotes 17 March 2011 Pages: 777 - 778
Signature Theory in Holographic Algorithms Jin-Yi CaiPinyan Lu OriginalPaper 31 December 2009 Pages: 779 - 816
Faster Parameterized Algorithms for Minimum Fill-in Hans L. BodlaenderPinar HeggernesYngve Villanger OriginalPaper 01 July 2010 Pages: 817 - 838
How to Guard a Graph? Fedor V. FominPetr A. GolovachPeter Widmayer OriginalPaper 06 January 2010 Pages: 839 - 856
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover Sounaka MishraVenkatesh RamanC. R. Subramanian OriginalPaper 20 May 2010 Pages: 857 - 881
A New Algorithm for Finding Trees with Many Leaves Joachim KneisAlexander LangerPeter Rossmanith OriginalPaper 28 September 2010 Pages: 882 - 897
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem Maxim A. Babenko OriginalPaper 16 December 2009 Pages: 898 - 922
Exact Algorithms for the Bottleneck Steiner Tree Problem Sang Won BaeSunghee ChoiShin-ichi Tanigawa OriginalPaper 30 July 2011 Pages: 924 - 948
Editing Graphs into Disjoint Unions of Dense Clusters Jiong GuoIyad A. KanjJohannes Uhlmann OriginalPaper 12 January 2011 Pages: 949 - 970
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three Marwan Al-JubehMashhood IshaquePavel Valtr OriginalPaper 03 August 2011 Pages: 971 - 999
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs Minming LiPeng-Jun WanFrances Yao OriginalPaper 15 April 2011 Pages: 1000 - 1021
Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra Seok-Hee HongHiroshi Nagamochi OriginalPaper 21 September 2011 Pages: 1022 - 1076
An Improved Approximation Algorithm for the Traveling Tournament Problem Daisuke YamaguchiShinji ImahoriTomomi Matsui OriginalPaper 13 October 2011 Pages: 1077 - 1091
Another Sub-exponential Algorithm for the Simple Stochastic Game Decheng DaiRong Ge OriginalPaper 18 May 2010 Pages: 1092 - 1104