TY  - CONF

T1  - Parameterized algorithms for Steiner forest in bounded width graphs

JO  - 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)

UR  - https://eprints.whiterose.ac.uk/id/eprint/219939

PY  - 2024/07/02

AU  - Feldmann AE

AU  - Lampis M

ED  - Bringmann K

ED  - Grohe M

ED  - Puppis G

ED  - Svensson O

DO  - DOI: 10.4230/LIPIcs.ICALP.2024.61

SN  - 978-3-95977-322-5

VL  - 297

SP  - 61:1

EP  - 61:20

Y2  - 2025/12/07

ER  -