| 105 | -- | 118 | Sergey Bereg, Adrian Dumitrescu, Minghui Jiang. Maximum Area Independent Sets in Disk Intersection Graphs |
| 119 | -- | 146 | Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta. Generalized Watchman Route Problem with Discrete View Cost |
| 147 | -- | 173 | Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx. Computing Geometric Minimum-Dilation Graphs is NP-Hard |
| 175 | -- | 201 | Tsunehiko Kameda, John Z. Zhang. Finding All Door Locations that Make a Room Searchable |
| 203 | -- | 222 | Mark de Berg, Elena Mumford, Bettina Speckmann. Optimal BSPs and Rectilinear Cartograms |
| 223 | -- | 244 | Andrzej Zak. Dissections of Polygons into Convex Polygons |