Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)
Sriram Bhyravarapu and A Mohanapriya. Eccentricity Shortest Path Is W[1]-Hard Parameterized by Distance to Spider Graphs. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{bhyravarapu_et_al:LIPIcs.IPEC.2026.16,
author = {Bhyravarapu, Sriram and Mohanapriya, A},
title = {{Eccentricity Shortest Path Is W\lbrack1\rbrack-Hard Parameterized by Distance to Spider Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.16},
URN = {urn:nbn:de:0030-drops-281896},
doi = {10.4230/LIPIcs.IPEC.2026.16},
annote = {Keywords: shortest path, W\lbrack1\rbrack-hard, feedback vertex set, path-width, clique-width, spider graphs, feedback edge set}
}