TY  - CONF

T1  - FPT inapproximability of directed cut and connectivity problems

CY  - Dagstuhl, Germany

JO  - Leibniz International Proceedings in Informatics, LIPIcs

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

PY  - 2019/12/04

AU  - Chitnis R

AU  - Feldmann AE

ED  - Jansen BMP

ED  - Telle JA

DO  - DOI: 10.4230/LIPIcs.IPEC.2019.8

PB  - Schloss Dagstuhl - Leibniz-Zentrum

SN  - 978-3-95977-129-0

VL  - 148

SP  - 8:1

EP  - 8:20

Y2  - 2025/12/07

ER  -