On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał

Journal title: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science

Journal publisher: IEEE

Published year: 2018

Published pages: 474-484

DOI identifier: 10.1109/FOCS.2018.00052