Generalized Above Guarantee Vertex Cover and r-Partization. - R. Krithika 001; N. S. Narayanaswamy (WALCOM, 2012)

A Dirac-type Characterization of k-chordal Graphs - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (CoRR, 2012)

Another Disjoint Compression Algorithm for OCT - R. Krithika 001; N. S. Narayanaswamy (CoRR, 2013)

A Dirac-type characterization of k-chordal graphs. - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (Discret. Math., 2013)

Another disjoint compression algorithm for odd cycle transversal. - R. Krithika 001; N. S. Narayanaswamy (Inf. Process. Lett., 2013)

Parameterized Algorithms for (r, l)-Partization. - R. Krithika 001; N. S. Narayanaswamy (J. Graph Algorithms Appl., 2013)

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. - Samuel Fiorini; R. Krithika 001; N. S. Narayanaswamy; Venkatesh Raman 001 (ESA, 2014)

Lossy Kernels for Graph Contraction Problems. - R. Krithika 001; Pranabendu Misra; Ashutosh Rai 001; Prafullkumar Tale (FSTTCS, 2016)

Dynamic Parameterized Problems. - R. Krithika 001; Abhishek Sahu; Prafullkumar Tale (IPEC, 2016)

On the Parameterized Complexity of Simultaneous Deletion Problems. - Akanksha Agrawal 001; R. Krithika 001; Daniel Lokshtanov; Amer E. Mouawad; M. S. Ramanujan 001 (FSTTCS, 2017)

Parameterized and Exact Algorithms for Class Domination Coloring. - R. Krithika 001; Ashutosh Rai 001; Saket Saurabh 001; Prafullkumar Tale (SOFSEM, 2017)

An FPT Algorithm for Contraction to Cactus. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (COCOON, 2018)

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. - R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (LATIN, 2018)

Approximability of Clique Transversal in Perfect Graphs. - Samuel Fiorini; R. Krithika 001; N. S. Narayanaswamy; Venkatesh Raman 001 (Algorithmica, 2018)

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. - R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (CoRR, 2018)

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. - R. Krithika 001; Diptapriyo Majumdar; Venkatesh Raman 001 (Theory Comput. Syst., 2018)

Quadratic Vertex Kernel for Split Vertex Deletion. - Akanksha Agrawal 001; Sushmita Gupta; Pallavi Jain 001; R. Krithika 001 (CIAC, 2019)

Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. - Pratibha Choudhary; Pallavi Jain 001; R. Krithika 001; Vibha Sahlot (CIAC, 2019)

Packing Arc-Disjoint Cycles in Tournaments. - Stéphane Bessy; Marin Bougeret; R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Jocelyn Thiebaut; Meirav Zehavi (MFCS, 2019)

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. - Petr A. Golovach; R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (LATIN, 2020)

Packing Arc-Disjoint Cycles in Bipartite Tournaments. - Ajay Saju Jacob; R. Krithika 001 (WALCOM, 2020)

A Note on Arc-Disjoint Cycles in Bipartite Tournaments. - Jasine Babu; Ajay Saju Jacob; R. Krithika 001; Deepak Rajendraprasad (CoRR, 2020)

Packing Arc-Disjoint 4-Cycles in Oriented Graphs. - Jasine Babu; R. Krithika 001; Deepak Rajendraprasad (FSTTCS, 2022)

The Complexity of Contracting Bipartite Graphs into Small Cycles. - R. Krithika 001; Roohani Sharma; Prafullkumar Tale (WG, 2022)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. - R. Krithika 001; V. K. Kutty Malu; Roohani Sharma; Prafullkumar Tale (FSTTCS, 2023)

Balanced Substructures in Bicolored Graphs. - P. S. Ardra; R. Krithika 001; Saket Saurabh 001; Roohani Sharma (SOFSEM, 2023)

A single exponential-time FPT algorithm for cactus contraction. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (Theor. Comput. Sci., 2023)

Revisiting Path Contraction and Cycle Contraction. - R. Krithika 001; V. K. Kutty Malu; Prafullkumar Tale (WG, 2024)

Packing arc-disjoint cycles in oriented graphs. - Jasine Babu; Ajay Saju Jacob; R. Krithika 001; Deepak Rajendraprasad (J. Comput. Syst. Sci., 2024)

Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. - Tanmay Inamdar 002; Lawqueen Kanesh; R. Krithika 001; Harshil Mittal; Saket Saurabh 001 (IWOCA, 2025)

Arborescences and shortest path trees when colors matter. - P. S. Ardra; Jasine Babu; Kritika Kashyap; R. Krithika 001; Sreejith K. Pallathumadam; Deepak Rajendraprasad (Theor. Comput. Sci., 2025)

Color-Constrained Arborescences in Edge-Colored Digraphs. - P. S. Ardra; Jasine Babu; R. Krithika 001; Deepak Rajendraprasad (CoRR, 2025)