| 481 | -- | 497 | A. García, Pedro Jodrá, Javier Tejel. Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon |
| 498 | -- | 516 | Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh. Improved Approximation Algorithms for the Spanning Star Forest Problem |
| 517 | -- | 544 | Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. The Parameterized Complexity of Unique Coverage and Its Variants |
| 545 | -- | 561 | MohammadHossein Bateni, Julia Chuzhoy. k-Stroll Problems |
| 562 | -- | 583 | Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots |
| 584 | -- | 604 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh. Computing Optimal Steiner Trees in Polynomial Space |
| 605 | -- | 633 | Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong. Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy |
| 634 | -- | 661 | Bhaskar DasGupta, S. Muthukrishnan. Stochastic Budget Optimization in Internet Advertising |
| 662 | -- | 684 | Shoshana Neuburger, Dina Sokol. Succinct 2D Dictionary Matching |
| 685 | -- | 709 | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith. Sublinear Algorithms for Approximating String Compressibility |