Rajesh Chitnis

Publications

  1. 2020
  2. Published

    Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)

    Rajesh Chitnis, , & , 25 Mar 2020, In: SIAM Journal on Computing. 49, 2, p. 318–364 47 p.

    Research output: Contribution to journalArticlepeer-review

  3. 2019
  4. Published

    FPT inapproximability of directed cut and connectivity problems

    Rajesh Chitnis & , 1 Dec 2019, 14th International Symposium on Parameterized and Exact Computation, (IPEC 2019). Jansen, B. M. P. & Telle, J. A. (eds.). Schloss Dagstuhl, 20 p. 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 148).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Published

    Towards a theory of parameterized streaming algorithms

    Rajesh Chitnis & , 1 Dec 2019, 14th International Symposium on Parameterized and Exact Computation, (IPEC 2019). Jansen, B. M. P. & Telle, J. A. (eds.). Schloss Dagstuhl, 15 p. 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 148).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  6. Published

    A tight lower bound for planar Steiner Orientation

    Rajesh Chitnis, & , 1 Aug 2019, In: Algorithmica. 81, 8, p. 3200-3216 17 p.

    Research output: Contribution to journalArticlepeer-review

  7. 2018
  8. Published

    Parameterized approximation algorithms for bidirected steiner network problems

    Rajesh Chitnis, & , 1 Aug 2018, 26th European Symposium on Algorithms, (ESA 2018).. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl, 16 p. 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  9. Published

    A tight lower bound for steiner orientation

    Rajesh Chitnis & , 25 Apr 2018, Computer Science - Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. Podolskii, V. V. & Fomin, F. V. (eds.). Springer Verlag, p. 65-77 13 p. (Lecture Notes in Computer Science ; vol. 10846 ).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  10. Published

    Can we create large k-cores by adding few edges?

    Rajesh Chitnis & , 25 Apr 2018, Computer Science - Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. Podolskii, V. V. & Fomin, F. V. (eds.). Springer Verlag, p. 78-89 11 p. (Lecture Notes in Computer Science ; vol. 10846).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  11. Published

    Algorithms and hardness results for nearest neighbor problems in bicolored point sets

    Rajesh Chitnis, 13 Mar 2018, LATIN 2018 -Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Mosteiro, M. A., Bender, M. A. & Farach-Colton, M. (eds.). Springer Verlag, p. 80-93 (Lecture Notes in Computer Science ; vol. 10807).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  12. 2017
  13. Published

    Faster exact algorithms for some terminal set problems

    Rajesh Chitnis, , , , & , 1 Sep 2017, In: Journal of Computer and System Sciences. 88, September, p. 195-207 13 p.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    List H-coloring a graph by removing few vertices

    Rajesh Chitnis, & , May 2017, In: Algorithmica. 78, 1, p. 110-146 37 p.

    Research output: Contribution to journalArticlepeer-review

Previous 1 2 Next