Items where authors include "Chitnis, R."

Article

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2021) Parameterized approximation algorithms for bidirected Steiner network problems. ACM Transactions on Algorithms, 17 (2). ARTN 12. pp. 1-68. ISSN 1549-6325

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Suchý, O. (2019) A Tight Lower Bound for Planar Steiner Orientation. Algorithmica, 81 (8). pp. 3200-3216. ISSN 0178-4617

Proceedings Paper

Chitnis, R. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2019) FPT inapproximability of directed cut and connectivity problems. In: Jansen, B. M. P. and Telle, J. A., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 11-13 Sep 2019, Munich, Germany. Leibniz International Proceedings in Informatics, 148 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 8:1-8:20. ISBN 978-3-95977-129-0

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2018) Parameterized approximation algorithms for bidirected steiner network problems. In: Azar, Y., Bast, H. and Herman, G., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 26th Annual European Symposium on Algorithms (ESA 2018), 20-24 Aug 2018, Helsinki, Finland. Leibniz International Proceedings in Informatics, 112 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany . ISBN 978-3-95977-081-1

Chitnis, R. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2018) A tight lower bound for Steiner Orientation. In: Fomin, F.V. and Podolskii, V.V., (eds.) Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. 13th International Computer Science Symposium in Russia, CSR 2018, 06-10 Jun 2018, Moscow, Russia. Lecture Notes in Computer Science, LNTCS 10846 . Springer International Publishing , pp. 65-77. ISBN 9783319905297