@InProceedings{kobayashi:LIPIcs.STACS.2020.11,
author = {Kobayashi, Yusuke},
title = {{An FPT Algorithm for Minimum Additive Spanner Problem}},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {11:1--11:16},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.11},
URN = {urn:nbn:de:0030-drops-118729},
doi = {10.4230/LIPIcs.STACS.2020.11},
annote = {Keywords: Graph algorithms, Fixed-parameter tractability, Graph spanner}
}