Minimum Fill-in of Sparse Graphs: Kernelization and Approximation Fedor V. FominGeevarghese PhilipYngve Villanger OriginalPaper 11 April 2013 Pages: 1 - 20
List Coloring in the Absence of a Linear Forest Jean-François CouturierPetr A. GolovachDaniël Paulusma OriginalPaper 06 April 2013 Pages: 21 - 35
Approximating Minimum Manhattan Networks in Higher Dimensions Aparna DasEmden R. GansnerAlexander Wolff OriginalPaper 18 April 2013 Pages: 36 - 52
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree T.-H. Hubert ChanMingfei LiLi Ning OriginalPaper 19 April 2013 Pages: 53 - 65
Generalised k-Steiner Tree Problems in Normed Planes Marcus BrazilCharl J. RasDoreen A. Thomas OriginalPaper 19 April 2013 Pages: 66 - 86
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments Mingyu XiaoJiong Guo OriginalPaper 20 April 2013 Pages: 87 - 97
On Tree-Constrained Matchings and Generalizations Stefan CanzarKhaled ElbassioniJulián Mestre OriginalPaper 24 April 2013 Pages: 98 - 119
Colored Hypergraph Isomorphism is Fixed Parameter Tractable V. ArvindBireswar DasSeinosuke Toda OriginalPaper 30 April 2013 Pages: 120 - 138
The Euclidean Bottleneck Full Steiner Tree Problem A. Karim Abu-Affash OriginalPaper 20 April 2013 Pages: 139 - 151
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures Son Hoang DauYeow Meng Chee OriginalPaper 27 April 2013 Pages: 152 - 180
An \(O(n^4)\) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs Andreas Emil FeldmannPeter Widmayer OriginalPaper 14 August 2014 Pages: 181 - 200
An Algorithmic Characterization of Polynomial Functions over \({\mathbb{Z}}_{p^{n}} \) Ashwin GuhaAmbedkar Dukkipati OriginalPaper 07 June 2013 Pages: 201 - 218
Metrical Service Systems with Multiple Servers Ashish ChiplunkarSundar Vishwanathan OriginalPaper 19 June 2014 Pages: 219 - 231