@InProceedings{gaspers_et_al:LIPIcs.ISAAC.2019.59,
author = {Gaspers, Serge and Lau, Joshua},
title = {{Minimizing and Computing the Inverse Geodesic Length on Trees}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {59:1--59:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.59},
URN = {urn:nbn:de:0030-drops-115555},
doi = {10.4230/LIPIcs.ISAAC.2019.59},
annote = {Keywords: Trees, Treewidth, Fixed-Parameter Tractability, Inverse Geodesic Length, Vertex deletion, Polynomial multiplication, Distance distribution}
}