@InProceedings{husfeldt:LIPIcs.IPEC.2016.16,
  author =	{Husfeldt, Thore},
  title =	{{Computing Graph Distances Parameterized by Treewidth and Diameter}},
  booktitle =	{11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
  pages =	{16:1--16:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-023-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{63},
  editor =	{Guo, Jiong and Hermelin, Danny},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.16},
  URN =		{urn:nbn:de:0030-drops-69476},
  doi =		{10.4230/LIPIcs.IPEC.2016.16},
  annote =	{Keywords: Graph algorithms, diameter, treewidth, Strong Exponential Time Hypothesis}
}