Publication:5090473
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2019.25MaRDI QIDQ5090473
Fahad Panolan, Ondřej Suchý, Eduard Eiben, Dušan Knop
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1802.08189
planar graphs; parameterized algorithms; exponential time hypothesis; bounded genus; directed Steiner network
68Qxx: Theory of computing