@inproceedings{0353d0157781415f8d41550f6985f0dd,
title = "Removing connected obstacles in the plane is FPT",
keywords = "Barrier coverage, Barrier resilience, Colored path, Minimum constraint removal, Motion planning, Parameterized complexity and algorithms, Planar graphs",
author = "Eduard Eiben and Daniel Lokshtanov",
year = "2020",
month = jun,
day = "8",
doi = "10.4230/LIPIcs.SoCG.2020.39",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "1--14",
editor = "Sergio Cabello and Chen, {Danny Z.}",
booktitle = "36th International Symposium on Computational Geometry, SoCG 2020",
note = "36th International Symposium on Computational Geometry, SoCG 2020 ; Conference date: 23-06-2020 Through 26-06-2020",
}