@InProceedings{feldmann_et_al:LIPIcs.SWAT.2018.19,
  author =	{Feldmann, Andreas Emil and Marx, D\'{a}niel},
  title =	{{The Parameterized Hardness of the k-Center Problem in Transportation Networks}},
  booktitle =	{16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)},
  pages =	{19:1--19:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-068-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{101},
  editor =	{Eppstein, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.19},
  URN =		{urn:nbn:de:0030-drops-88450},
  doi =		{10.4230/LIPIcs.SWAT.2018.19},
  annote =	{Keywords: k-center, parameterized complexity, planar graphs, doubling dimension, highway dimension, treewidth}
}