In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Time-approximation trade-offs for inapproximable problems
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 27:1-27:14. ISSN 1868-8969
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
In: 10th ACM Conference on Recommender Systems, RecSys 2016 RecSys 2016 - Proceedings of the 10th ACM Conference on Recommender Systems ACM Press, New York, pp. 425-426.