@InProceedings{johnson_et_al:LIPIcs.SWAT.2024.29,
author = {Johnson, Matthew and Martin, Barnaby and Pandey, Sukanya and Paulusma, Dani\"{e}l and Smith, Siani and van Leeuwen, Erik Jan},
title = {{Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs}},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)},
pages = {29:1--29:17},
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.29},
URN = {urn:nbn:de:0030-drops-200699},
doi = {10.4230/LIPIcs.SWAT.2024.29},
annote = {Keywords: multiway cut, planar subcubic graph, complexity dichotomy, graph containment}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode