R. Krithika

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 34

Top Topics

Bipartite Graph

Packing Problem

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad
Arborescences and Shortest Path Trees when Colors Matter. CoRR (2024)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. CoRR (2024)
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
Packing arc-disjoint cycles in oriented graphs. J. Comput. Syst. Sci. 143 (2024)
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
Revisiting Path Contraction and Cycle Contraction. CoRR (2024)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. SOFSEM (2023)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954 (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR (2023)
Jasine Babu, R. Krithika, Deepak Rajendraprasad
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291 (2021)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83 (5) (2021)
Ajay Saju Jacob, R. Krithika
Packing Arc-Disjoint Cycles in Bipartite Tournaments. WALCOM (2020)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833 (2020)
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845 (2020)
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
A Note on Arc-Disjoint Cycles in Bipartite Tournaments. CoRR (2020)
Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN (2020)
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC (2019)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. MFCS (2019)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC (2019)
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica 81 (9) (2019)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
An FPT Algorithm for Contraction to Cactus. COCOON (2018)
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80 (8) (2018)
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR (2018)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62 (8) (2018)
R. Krithika, Abhishek Sahu, Prafullkumar Tale
Dynamic Parameterized Problems. Algorithmica 80 (9) (2018)
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN (2018)
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR (2017)
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS (2017)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM (2017)
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale
Lossy Kernels for Graph Contraction Problems. FSTTCS (2016)
R. Krithika, Abhishek Sahu, Prafullkumar Tale
Dynamic Parameterized Problems. IPEC (2016)
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA (2014)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
-chordal graphs. Discret. Math. 313 (24) (2013)
R. Krithika, N. S. Narayanaswamy
Another disjoint compression algorithm for odd cycle transversal. Inf. Process. Lett. 113 (22-24) (2013)
R. Krithika, N. S. Narayanaswamy
Another Disjoint Compression Algorithm for OCT CoRR (2013)
R. Krithika, N. S. Narayanaswamy
Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. 17 (2) (2013)
R. Krithika, N. S. Narayanaswamy
Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM (2012)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
A Dirac-type Characterization of k-chordal Graphs CoRR (2012)