| 545 | -- | 570 | Eric McDermid, Robert W. Irving. Sex-Equal Stable Matchings: Complexity and Exact Algorithms |
| 571 | -- | 609 | Benjamin Doerr, Carola Winzen. Ranking-Based Black-Box Complexity |
| 610 | -- | 625 | Erik D. Demaine, Gad M. Landau, Oren Weimann. On Cartesian Trees and Range Minimum Queries |
| 626 | -- | 642 | Martin Fürer. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks |
| 643 | -- | 670 | Joachim Gehweiler, Christiane Lammersen, Christian Sohler. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem |
| 671 | -- | 691 | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming |
| 692 | -- | 714 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. Scheduling Partially Ordered Jobs Faster than 2 n |
| 715 | -- | 738 | Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion |
| 739 | -- | 757 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo. Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables |
| 758 | -- | 775 | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties |
| 776 | -- | 804 | Jochen Könemann, Ojas Parekh, David Pritchard. Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation |