| 2008 | An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. Reinhard Kutzelnigg |
| 2008 | An improved Algorithm for the Black-and-White Coloring Problem on Trees. Daniel Berend, Shira Zucker |
| 2008 | An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. George B. Mertzios, Walter Unger |
| 2008 | Approximate Word Sequence Matching on an Inverted File Index. Taehyung Lee, Sung-Ryul Kim, Kunsoo Park |
| 2008 | Automata approach to graphs of bounded rank-width. Petr Hlinený, Robert Ganian |
| 2008 | Bimagic Labelings. Alison Marr, Nick Phillips, Walter D. Wallis |
| 2008 | Combinatorial algorithms in concorde. Vasek Chvátal |
| 2008 | Construction of Extremal Graphs. Jianmin Tang, Yuqing Lin, Mirka Miller |
| 2008 | Cop-Win Graphs with Maximal Capture-Time. Tomas Gavenciak |
| 2008 | Delivering multimedia content in vehicular ad hoc networks. Stephan Olariu |
| 2008 | Designing good random walks on finite graphs. Masafumi Yamashita |
| 2008 | Finding Paths Between 3-Colourings. Matthew Johnson, Luis Cereceda, Jan van den Heuvel |
| 2008 | Improving Multikey Quicksort for Sorting Strings. Eunsang Kim, Kunsoo Park |
| 2008 | K-Phase Oscillator Synchronization for Graph Coloring. S. Anthony Lee, Raymond Lister |
| 2008 | L(2, 1)-labellings of integer distance graphs. Peter Che Bor Lam, Tao-Ming Wang, Guohua Gu |
| 2008 | Loose Cover of Graphs by a Local Structure. Satoshi Fujita |
| 2008 | Notes on generating completely condensed d-neighborhoods. Heikki Hyyrö |
| 2008 | On Conditional Covering Problem. Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
| 2008 | On Irreducibility of Maximal Cliques. Tao-Ming Wang, Peter Che Bor Lam, Jun-Lin Kuo, Feng-Rung Hu |
| 2008 | On partitional labelings of graphs. Rikio Ichishima, Akito Oshima |
| 2008 | On the pagenumber of the cube-connected cycles. Yuuki Tanaka, Yukio Shibata |
| 2008 | Partitioning Bispanning Graphs into Spanning Trees. Matthias Baumgart |
| 2008 | Path factors and parallel knock-out schemes of almost claw-free graphs. Matthew Johnson, Daniël Paulusma, Chantal Wood |
| 2008 | Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan Mirka Miller, Koichi Wada |
| 2008 | Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. Johannes Fischer, Volker Heun |
| 2008 | Self-similar planar graphs as models for complex networks. Lichao Chen, Francesc Comellas, Zhongzhi Zhang |