Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/swat/0002MPPSL24
%A Johnson, Matthew
%A Martin, Barnaby
%A Pandey, Sukanya
%A Paulusma, Daniël
%A Smith, Siani
%A van Leeuwen, Erik Jan
%B SWAT
%D 2024
%E Bodlaender, Hans L.
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 29:1-29:17
%T Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.
%U http://dblp.uni-trier.de/db/conf/swat/swat2024.html#0002MPPSL24
%V 294
%@ 978-3-95977-318-8
@inproceedings{conf/swat/0002MPPSL24,
added-at = {2024-06-03T00:00:00.000+0200},
author = {Johnson, Matthew and Martin, Barnaby and Pandey, Sukanya and Paulusma, Daniël and Smith, Siani and van Leeuwen, Erik Jan},
biburl = {https://www.bibsonomy.org/bibtex/201403eec2ea8a9311de28e6333f54b26/dblp},
booktitle = {SWAT},
crossref = {conf/swat/2024},
editor = {Bodlaender, Hans L.},
ee = {https://doi.org/10.4230/LIPIcs.SWAT.2024.29},
interhash = {35654fb9a91a1fa0d1b0eda3468c39be},
intrahash = {01403eec2ea8a9311de28e6333f54b26},
isbn = {978-3-95977-318-8},
keywords = {dblp},
pages = {29:1-29:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-06-10T07:16:13.000+0200},
title = {Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.},
url = {http://dblp.uni-trier.de/db/conf/swat/swat2024.html#0002MPPSL24},
volume = 294,
year = 2024
}