| 2025 | FCT | On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. | Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest |
| 2024 | WAOA | Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. | Rajesh Chitnis, Samuel Thomas, Anthony Wirth |
| 2023 | WADS | Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. | Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth |
| 2022 | ALT | Refined Lower Bounds for Nearest Neighbor Condensation. | Rajesh Chitnis |
| 2021 | CIAC | A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. | Rajesh Chitnis |
| 2018 | CSR | A Tight Lower Bound for Steiner Orientation. | Rajesh Chitnis, Andreas Emil Feldmann |
| 2018 | CSR | Can We Create Large k-Cores by Adding Few Edges? | Rajesh Chitnis, Nimrod Talmon |
| 2018 | ESA | Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. | Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi |
| 2018 | LATIN | Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. | Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis |
| 2016 | SODA | Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. | Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova |
| 2016 | WG | Tight Bounds for Gomory-Hu-like Cut Counting. | Rajesh Chitnis, Lior Kamma, Robert Krauthgamer |