| 2008 | Optimal Key Tree Structure for Deleting Two or More Leaves. | Weiwei Wu, Minming Li, Enhong Chen |
| 2008 | Bandwidth of Bipartite Permutation Graphs. | Ryuhei Uehara |
| 2008 | Reachability Problems on Directed Graphs. | Robert Endre Tarjan |
| 2008 | Inducing Polygons of Line Arrangements. | Ludmila Scharf, Marc Scherfenberg |
| 2008 | Power Domination in O | Daniel Raible, Henning Fernau |
| 2008 | Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. | Simon J. Puglisi, Andrew Turpin |
| 2008 | A Game Theoretic Approach for Efficient Graph Coloring. | Panagiota N. Panagopoulou, Paul G. Spirakis |
| 2008 | Negation-Limited Inverters of Linear Size. | Hiroki Morizumi, Genki Suzuki |
| 2008 | Unbounded-Error Quantum Query Complexity. | Ashley Montanaro, Harumichi Nishimura, Rudy Raymond |
| 2008 | Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. | Shuichi Miyazaki, Kazuya Okamoto |
| 2008 | Knig Deletion Sets and Vertex Covers above the Matching Size. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2008 | Enumeration of Perfect Sequences of Chordal Graph. | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
| 2008 | Deductive Inference for the Interiors and Exteriors of Horn Theories. | Kazuhisa Makino, Hirotaka Ono |
| 2008 | Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. | Jun Luo, Christian Wulff-Nilsen |
| 2008 | Minkowski Sum Selection and Finding. | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
| 2008 | From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. | Vadim V. Lozin |
| 2008 | On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. | Michael Lampis, Georgia Kaouri, Valia Mitsou |
| 2008 | A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching. | M. Oguzhan Klekci |
| 2008 | Preprocessing Imprecise Points and Splitting Triangulations. | Marc J. van Kreveld, Maarten Lffler, Joseph S. B. Mitchell |
| 2008 | Sorting with Complete Networks of Stacks. | Felix G. Knig, Marco E. Lbbecke |
| 2008 | A New Algorithm for Finding Trees with Many Leaves. | Joachim Kneis, Alexander Langer, Peter Rossmanith |
| 2008 | Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. | Christian Knauer, Marc Scherfenberg |
| 2008 | The Complexity of Minimum Convex Coloring. | Frank Kammer, Torsten Tholey |
| 2008 | The Complexity of Rationalizing Matchings. | Shankar Kalyanaraman, Christopher Umans |
| 2008 | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |