×

Found 2 Documents (Results 1–2)

Newest Citations Relevance
Chitnis, Rajesh; Feldmann, Andreas Emil

FPT inapproximability of directed cut and connectivity problems. (English) Zbl 07650216

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 8, 20 p. (2019).
MSC:  68Q25 68Q27 68Wxx
Cite Review PDF
Full Text: DOI arXiv
Feldmann, Andreas Emil; Marx, Dániel

The complexity landscape of fixed-parameter directed Steiner network problems. (English) Zbl 1388.68228

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 27, 14 p. (2016).
MSC:  68R10 68Q17 68Q25
Cite Review PDF
Full Text: DOI arXiv

Filter Results by …

Author

Year of Publication

Main Field