| 777 | -- | 778 | Seok-Hee Hong, Hiroshi Nagamochi. Editorial: ISAAC 2008 Special Issue |
| 779 | -- | 816 | Jin-yi Cai, Pinyan Lu. Signature Theory in Holographic Algorithms |
| 817 | -- | 838 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger. Faster Parameterized Algorithms for Minimum Fill-in |
| 839 | -- | 856 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer. How to Guard a Graph? |
| 857 | -- | 881 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover |
| 882 | -- | 897 | Joachim Kneis, Alexander Langer, Peter Rossmanith. A New Algorithm for Finding Trees with Many Leaves |
| 898 | -- | 922 | Maxim A. Babenko. An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem |
| 923 | -- | 0 | . Editors' Note: ISAAC 2009 Special Section |
| 924 | -- | 948 | Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa. Exact Algorithms for the Bottleneck Steiner Tree Problem |
| 949 | -- | 970 | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann. Editing Graphs into Disjoint Unions of Dense Clusters |
| 971 | -- | 999 | Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr. Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three |
| 1000 | -- | 1021 | Minming Li, Peng-Jun Wan, F. Frances Yao. Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs |
| 1022 | -- | 1076 | Seok-Hee Hong, Hiroshi Nagamochi. Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra |
| 1077 | -- | 1091 | Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui. An Improved Approximation Algorithm for the Traveling Tournament Problem |
| 1092 | -- | 1104 | Decheng Dai, Rong Ge. Another Sub-exponential Algorithm for the Simple Stochastic Game |