R. Krithika

According to our database, R. Krithika authored at least 30 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Packing arc-disjoint cycles in oriented graphs.

Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad

J. Comput. Syst. Sci., 2024

Arborescences and Shortest Path Trees when Colors Matter.

P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad

CoRR, 2024

Revisiting Path Contraction and Cycle Contraction.

R. Krithika, V. K. Kutty Malu, Prafullkumar Tale

CoRR, 2024

2023

A single exponential-time FPT algorithm for cactus contraction.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Theor. Comput. Sci., 2023

Balanced Substructures in Bicolored Graphs.

P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.

R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

The Complexity of Contracting Bipartite Graphs into Small Cycles.

R. Krithika, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Packing Arc-Disjoint 4-Cycles in Oriented Graphs.

Jasine Babu, R. Krithika, Deepak Rajendraprasad

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Parameterized and exact algorithms for class domination coloring.

R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale

Discret. Appl. Math., 2021

Packing Arc-Disjoint Cycles in Tournaments.

Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi

Algorithmica, 2021

2020

Vertex deletion on split graphs: Beyond 4-hitting set.

Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot

Theor. Comput. Sci., 2020

Quadratic vertex kernel for split vertex deletion.

Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika

Theor. Comput. Sci., 2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments.

Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad

CoRR, 2020

Packing Arc-Disjoint Cycles in Bipartite Tournaments.

Ajay Saju Jacob, R. Krithika

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.

Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.

R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi

Algorithmica, 2019

2018

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.

R. Krithika, Diptapriyo Majumdar, Venkatesh Raman

Theory Comput. Syst., 2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.

R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi

CoRR, 2018

Dynamic Parameterized Problems.

R. Krithika, Abhishek Sahu, Prafullkumar Tale

Algorithmica, 2018

Approximability of Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Algorithmica, 2018

An FPT Algorithm for Contraction to Cactus.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

On the Parameterized Complexity of Simultaneous Deletion Problems.

Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Lossy Kernels for Graph Contraction Problems.

R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2014

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Proceedings of the Algorithms - ESA 2014, 2014

2013

Parameterized Algorithms for (r, l)-Partization.

R. Krithika, N. S. Narayanaswamy

J. Graph Algorithms Appl., 2013

Another disjoint compression algorithm for odd cycle transversal.

R. Krithika, N. S. Narayanaswamy

Inf. Process. Lett., 2013

A Dirac-type characterization of <i>k</i>-chordal graphs.

R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan

Discret. Math., 2013

Another Disjoint Compression Algorithm for OCT

R. Krithika, N. S. Narayanaswamy

CoRR, 2013

2012

A Dirac-type Characterization of k-chordal Graphs

R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan

CoRR, 2012

Generalized Above Guarantee Vertex Cover and r-Partization.

R. Krithika, N. S. Narayanaswamy

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012