@inproceedings{inproceedings, title  = {{FPT inapproximability of directed cut and connectivity problems}},

 publisher = {{Schloss Dagstuhl - Leibniz-Zentrum}},

 url = {{https://eprints.whiterose.ac.uk/id/eprint/200954 }},

 year = {{2019}},

 month = {{12}},

 author = {{Chitnis R and Feldmann AE}},

 doi = {{10.4230/LIPIcs.IPEC.2019.8}},

 isbn = {{978-3-95977-129-0}},

 volume = {{148}},

 journal = {{Leibniz International Proceedings in Informatics, LIPIcs}},

 pages = {{8:1-8:20}},

 note = {{Accessed on 2025/12/07}}}