Published in: LIPIcs, Volume 294, 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)
Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jaime Venne. Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bumpus_et_al:LIPIcs.SWAT.2024.19, author = {Bumpus, Benjamin Merlin and Jansen, Bart M. P. and Venne, Jaime}, title = {{Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.19}, URN = {urn:nbn:de:0030-drops-200595}, doi = {10.4230/LIPIcs.SWAT.2024.19}, annote = {Keywords: fixed-parameter tractability, certified algorithms} }