| 2025 | IWOCA | Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. | Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh |
| 2024 | WG | Revisiting Path Contraction and Cycle Contraction. | R. Krithika, V. K. Kutty Malu, Prafullkumar Tale |
| 2023 | SOFSEM | Balanced Substructures in Bicolored Graphs. | P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma |
| 2022 | WG | The Complexity of Contracting Bipartite Graphs into Small Cycles. | R. Krithika, Roohani Sharma, Prafullkumar Tale |
| 2020 | LATIN | Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. | Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2020 | WALCOM | Packing Arc-Disjoint Cycles in Bipartite Tournaments. | Ajay Saju Jacob, R. Krithika |
| 2019 | CIAC | Quadratic Vertex Kernel for Split Vertex Deletion. | Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika |
| 2019 | CIAC | Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. | Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot |
| 2019 | MFCS | Packing Arc-Disjoint Cycles in Tournaments. | Stphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi |
| 2018 | COCOON | An FPT Algorithm for Contraction to Cactus. | R. Krithika, Pranabendu Misra, Prafullkumar Tale |
| 2018 | LATIN | The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. | R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2017 | SOFSEM | Parameterized and Exact Algorithms for Class Domination Coloring. | R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale |
| 2014 | ESA | LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. | Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman |
| 2012 | WALCOM | Generalized Above Guarantee Vertex Cover and r-Partization. | R. Krithika, N. S. Narayanaswamy |