Rajesh Chitnis

Publications

  1. 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

  2. Published

    Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams

    Rajesh Chitnis, , , , , & , 10 Jan 2016, Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms. Krauthgamer, R. (ed.). Society for Industrial and Applied Mathematics (SIAM), p. 1326-1344 19 p. (The Annual ACM - SIAM Symposium on Discrete Algorithms. Proceedings).

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

  3. Published

    Designing FPT algorithms for cut problems using randomized contractions

    Rajesh Chitnis, , , & , 6 Jul 2016, In: SIAM Journal on Computing. 45, 4, p. 1171-1229 59 p.

    Research output: Contribution to journalArticlepeer-review

  4. 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

  5. Published

    Parameterized complexity of the anchored k-core problem for directed graphs

    Rajesh Chitnis, & , 1 Apr 2016, In: Information and Computation. 247, p. 11-22

    Research output: Contribution to journalArticlepeer-review

  6. 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

  7. Published

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

    Rajesh Chitnis, & , 5 Jan 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Chekuri, C. (ed.). Association for Computing Machinery , p. 1782-1801 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

  8. 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

  9. 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

  10. 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

Previous 1 2 Next