| 1 | -- | 20 | Fedor V. Fomin, Geevarghese Philip, Yngve Villanger. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation |
| 21 | -- | 35 | Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. List Coloring in the Absence of a Linear Forest |
| 36 | -- | 52 | Aparna Das, Emden R. Gansner, Michael Kaufmann 0001, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff. Approximating Minimum Manhattan Networks in Higher Dimensions |
| 53 | -- | 65 | T.-H. Hubert Chan, Mingfei Li, Li Ning. Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree |
| 66 | -- | 86 | Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas. Generalised k-Steiner Tree Problems in Normed Planes |
| 87 | -- | 97 | Mingyu Xiao, Jiong Guo. A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments |
| 98 | -- | 119 | Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre. On Tree-Constrained Matchings and Generalizations |
| 120 | -- | 138 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. Colored Hypergraph Isomorphism is Fixed Parameter Tractable |
| 139 | -- | 151 | A. Karim Abu-Affash. The Euclidean Bottleneck Full Steiner Tree Problem |
| 152 | -- | 180 | Son Hoang Dau, Yeow Meng Chee. Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures |
| 181 | -- | 200 | Andreas Emil Feldmann, Peter Widmayer. 4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs |
| 201 | -- | 218 | Ashwin Guha, Ambedkar Dukkipati. n |
| 219 | -- | 231 | Ashish Chiplunkar, Sundar Vishwanathan. Metrical Service Systems with Multiple Servers |