| 461 | -- | 470 | Igor L. Markov, Yaoyun Shi. Constant-Degree Graph Expansions that Preserve Treewidth |
| 471 | -- | 488 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. New Approximation Algorithms for Minimum Cycle Bases of Graphs |
| 489 | -- | 509 | Jochen Könemann, Ojas Parekh, Danny Segev. A Unified Approach to Approximating Partial Covering Problems |
| 510 | -- | 520 | Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao. Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum ::::k::::-Way Cut Problem |
| 521 | -- | 568 | Victor Chepoi, Morgan Seston. Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for ::::l::::::∞::-Fitting Robinson Structures to Distances |
| 569 | -- | 582 | Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs. Competitive Algorithms for Due Date Scheduling |
| 583 | -- | 600 | Liam Roditty, Michael Segal. On Bounded Leg Shortest Paths Problems |
| 601 | -- | 620 | Eduardo Sany Laber, Marco Molinaro. An Approximation Algorithm for Binary Searching in Trees |
| 621 | -- | 633 | Asaf Shapira, Raphael Yuster, Uri Zwick. All-Pairs Bottleneck Paths in Vertex Weighted Graphs |