| 2007 | Approximate String Matching with Swap and Mismatch. | Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur |
| 2007 | Space Efficient Indexes for String Matching with Don't Cares. | Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu |
| 2007 | Energy Efficient Deadline Scheduling in Two Processor Systems. | Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong |
| 2007 | Capacitated Domination Problem. | Mong-Jen Kao, Chung-Shou Liao |
| 2007 | Unbounded-Error Classical and Quantum Communication Complexity. | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. | Toshimasa Ishii |
| 2007 | Using Nash Implementation to Achieve Better Frugality Ratios. | Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang |
| 2007 | Approximating the Crossing Number of Toroidal Graphs. | Petr Hlinen, Gelasio Salazar |
| 2007 | Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. | Jiong Guo |
| 2007 | Fast Adaptive Diagnosis with a Minimum Number of Tests. | Samuel Guilbault, Andrzej Pelc |
| 2007 | Compressing Spatio-temporal Trajectories. | Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle |
| 2007 | Checking Value-Sensitive Data Structures in Sublinear Space. | Michael T. Goodrich, Jonathan Z. Sun |
| 2007 | More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. | Mordecai J. Golin, Jian Li |
| 2007 | On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. | Darin Goldstein, Kojiro Kobayashi |
| 2007 | Computing Upward Topological Book Embeddings of Upward Planar Digraphs. | Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis |
| 2007 | Dynamic Distance Hereditary Graphs Using Split Decomposition. | Emeric Gioan, Christophe Paul |
| 2007 | Distributed Relationship Schemes for Trees. | Cyril Gavoille, Arnaud Labourel |
| 2007 | Spanning Trees with Many Leaves in Regular Bipartite Graphs. | Emanuele G. Fusco, Angelo Monti |
| 2007 | Approximability of Packing Disjoint Cycles. | Zachary Friggstad, Mohammad R. Salavatipour |
| 2007 | On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. | Uffe Flarup, Pascal Koiran, Laurent Lyaudet |
| 2007 | Bounded Tree-Width and CSP-Related Problems. | Tommy Frnqvist, Peter Jonsson |
| 2007 | Sensor Network Gossiping or How to Break the Broadcast Lower Bound. | Martin Farach-Colton, Miguel A. Mosteiro |
| 2007 | Width-Optimal Visibility Representations of Plane Graphs. | Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen |
| 2007 | Manipulation in Games. | Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer |
| 2007 | Coloring Triangle-Free Graphs on Surfaces. | Zdenek Dvork, Daniel Krl, Robin Thomas |