| 479 | -- | 511 | Feodor F. Dragan, Yang Xiang. How to Use Spanning Trees to Navigate in Graphs |
| 512 | -- | 540 | Ioannis Caragiannis. Efficient Coordination Mechanisms for Unrelated Machine Scheduling |
| 541 | -- | 563 | Minghui Jiang. Recognizing d-Interval Graphs and d-Track Interval Graphs |
| 564 | -- | 594 | Erik Krohn, Bengt J. Nilsson. Approximate Guarding of Monotone and Rectilinear Polygons |
| 595 | -- | 614 | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma. Median Trajectories |
| 615 | -- | 640 | Avivit Lazar, Arie Tamir. Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs |
| 641 | -- | 653 | Longkun Guo, Hong Shen. On Finding Min-Min Disjoint Paths |
| 654 | -- | 681 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
| 682 | -- | 713 | Danny Z. Chen, Haitao Wang. Approximating Points by a Piecewise Linear Function |
| 714 | -- | 738 | Katharina T. Huber, Vincent Moulton. Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets |