@InProceedings{kratsch_et_al:LIPIcs.STACS.2020.38,
author = {Kratsch, Stefan and Nelles, Florian},
title = {{Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths}},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-140-5},
ISSN = {1868-8969},
year = {2020},
volume = {154},
editor = {Paul, Christophe and Bl\"{a}ser, Markus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.38},
URN = {urn:nbn:de:0030-drops-118992},
doi = {10.4230/LIPIcs.STACS.2020.38},
annote = {Keywords: All-pairs shortest Paths, efficient parameterized Algorithms, parameterized Complexity, Clique-width, Modular-width}
}