Rajesh Chitnis

Publications

  1. Published

    A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)

    Rajesh Chitnis, , , , & , 3 Dec 2014, Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Cygan, M. & Heggernes, P. (eds.). Springer Verlag, p. 159-171 (Lecture Notes in Computer Science ; vol. 8894).

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

  2. Published

    A tight algorithm for Strongly Connected Steiner Subgraph on two terminals with demands

    Rajesh Chitnis, , , , & , 1 Apr 2017, In: Algorithmica. 77, 4, p. 1216-1239 24 p.

    Research output: Contribution to journalArticlepeer-review

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

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

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

  6. Published

    Brief announcement: New streaming algorithms for parameterized maximal matching & beyond

    Rajesh Chitnis, , , & , 13 Jun 2015, SPAA 2015: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery , p. 56-58 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

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

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

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

  9. Published

    Directed subset feedback vertex set is fixed-parameter tractable

    Rajesh Chitnis, , & , Apr 2015, In: ACM Transactions on Algorithms. 11, 4, 28 p., 28.

    Research output: Contribution to journalArticlepeer-review

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

Previous 1 2 Next