| 1 | -- | 25 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir. Near-Linear Approximation Algorithms for Geometric Hitting Sets |
| 26 | -- | 38 | Adrian Kosowski, Alfredo Navarra. Graph Decomposition for Memoryless Periodic Exploration |
| 39 | -- | 50 | Raphael Yuster. Almost Exact Matchings |
| 51 | -- | 90 | Elliot Anshelevich, Martin Hoefer. Contribution Games in Networks |
| 91 | -- | 116 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha. On the Hitting Times of Quantum Versus Random Walks |
| 117 | -- | 136 | Scott M. Summers. Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming |
| 137 | -- | 157 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky. Maximum Series-Parallel Subgraph |
| 158 | -- | 190 | David Coudert, Florian Huc, Dorian Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees |
| 191 | -- | 200 | Donglei Du, Ruixing Lu, Dachuan Xu. A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties |
| 201 | -- | 223 | Craig Dillabaugh, Meng He, Anil Maheshwari. Succinct and I/O Efficient Data Structures for Traversal in Trees |
| 224 | -- | 245 | Telikepalli Kavitha. Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs |
| 246 | -- | 273 | Leah Epstein, Asaf Levin. On Equilibria for ADM Minimization Games |
| 274 | -- | 295 | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. Minimize the Maximum Duty in Multi-interface Networks |
| 296 | -- | 322 | Gokarna Sharma, Costas Busch. A Competitive Analysis for Balanced Transactional Memory Workloads |
| 323 | -- | 346 | Daniel Binkele-Raible, Henning Fernau. An Exact Exponential Time Algorithm for Power Dominating Set |
| 347 | -- | 362 | Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian. Improved Approximation Algorithms for Data Migration |
| 363 | -- | 397 | Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond. Interval Partitions and Polynomial Factorization |
| 398 | -- | 410 | Zeev Nutov. Approximating Node-Connectivity Augmentation Problems |
| 411 | -- | 424 | Alexander Kesselman, Kirill Kogan, Michael Segal. Improved Competitive Performance Bounds for CIOQ Switches |
| 425 | -- | 456 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani. Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs |
| 457 | -- | 475 | Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao 0001. External Memory Planar Point Location with Logarithmic Updates |
| 476 | -- | 489 | Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat. Layered Working-Set Trees |
| 490 | -- | 508 | Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav. Bipartite Matching in the Semi-streaming Model |
| 509 | -- | 531 | Frédérique Bassino, Julien David, Cyril Nicaud. Average Case Analysis of Moore's State Minimization Algorithm |
| 532 | -- | 550 | Stefan Kratsch. Polynomial Kernelizations for MIN F+Π1 and MAX NP |
| 551 | -- | 567 | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès. Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm |