Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{husfeldt:LIPIcs:2017:6947, author = {Thore Husfeldt}, title = {{Computing Graph Distances Parameterized by Treewidth and Diameter}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {16:116:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770231}, ISSN = {18688969}, year = {2017}, volume = {63}, editor = {Jiong Guo and Danny Hermelin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6947}, URN = {urn:nbn:de:0030drops69476}, doi = {10.4230/LIPIcs.IPEC.2016.16}, annote = {Keywords: Graph algorithms, diameter, treewidth, Strong Exponential Time Hypothesis} }
Keywords:  Graph algorithms, diameter, treewidth, Strong Exponential Time Hypothesis  
Seminar:  11th International Symposium on Parameterized and Exact Computation (IPEC 2016)  
Issue Date:  2017  
Date of publication:  31.01.2017 