| 2008 | On Labeled Traveling Salesman Problems. | Basile Coutoux, Laurent Gourvs, Jrme Monnot, Orestis Telelis |
| 2008 | Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD. | Ali Civril, Malik Magdon-Ismail |
| 2008 | Computing with Priced Information: When the Value Makes the Price. | Ferdinando Cicalese, Martin Milanic |
| 2008 | Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol. | Eric Goles Ch., Cedric Little, Ivan Rapaport |
| 2008 | Evaluation of General Set Expressions. | Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh |
| 2008 | Free-Form Surface Partition in 3-D. | Danny Z. Chen, Ewa Misiolek |
| 2008 | Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. | Leizhen Cai, Elad Verbin, Lin Yang |
| 2008 | Signature Theory in Holographic Algorithms. | Jin-yi Cai, Pinyan Lu |
| 2008 | New Results on Optimizing Rooted Triplets Consistency. | Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson |
| 2008 | Detecting Commuting Patterns by Clustering Subtrajectories. | Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Lffler, Jun Luo |
| 2008 | The Complexity of SPP Formula Minimization. | David Buchfuhrer |
| 2008 | Selecting Sums in Arrays. | Gerth Stlting Brodal, Allan Grnlund Jrgensen |
| 2008 | Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. | Karl Bringmann, Tobias Friedrich |
| 2008 | Independent Sets of Maximum Weight in Apple-Free Graphs. | Andreas Brandstdt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
| 2008 | On the Stretch Factor of Convex Delaunay Graphs. | Prosenjit Bose, Paz Carmi, Sbastien Collette, Michiel H. M. Smid |
| 2008 | New Results on the Most Significant Bit of Integer Multiplication. | Beate Bollig, Jochen Klump |
| 2008 | A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. | Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan |
| 2008 | Faster Parameterized Algorithms for Minimum Fill-In. | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
| 2008 | Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. | Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi |
| 2008 | On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. | Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika |
| 2008 | A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. | Jonathan Backer, David G. Kirkpatrick |
| 2008 | An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. | Maxim A. Babenko |
| 2008 | Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. | Tetsuo Asano |
| 2008 | On the Stability of Web Crawling and Web Search. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng |
| 2008 | Quantum Query Complexity of Boolean Functions with Small On-Sets. | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |