Items where authors include "Marx, D."

Article

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2023) The complexity landscape of fixed-parameter Directed Steiner Network problems. ACM Transactions on Computation Theory, 15 (3-4). ISSN 1942-3454

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2020) The parameterized hardness of the k-center problem in transportation networks. Algorithmica, 82 (7). pp. 1989-2005. ISSN 0178-4617

Chitnis, R.H. orcid.org/0000-0002-6098-7770, Feldmann, A.E. orcid.org/0000-0001-6229-5332, HajiAghayi, M.T. et al. (1 more author) (2020) Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions). SIAM Journal on Computing, 49 (2). pp. 318-364. ISSN 0097-5397

Proceedings Paper

Abbasi, F., Banerjee, S., Byrka, J. et al. (6 more authors) (2023) Parameterized approximation schemes for clustering with general norm objectives. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) Proceedings. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 06-09 Nov 2023, Santa Cruz, CA, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 1377-1399. ISBN 9798350318951

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2018) The parameterized hardness of the k-center problem in transportation networks. In: Eppstein, D., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 18-20 Jun 2018, Malmö, Sweden. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 19:1-19:13. ISBN 9783959770682

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2016) The complexity landscape of fixed-parameter directed steiner network problems. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. and Sangiorgi, D., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 12-15 Jul 2016, Rome, Italy. Leibniz International Proceedings in Informatics, 55 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 27:1-27:14. ISBN 978-3-95977-013-2