16 citations · 20 across the 10 of their papers we have counts for
11 papers
A Single Exponential-Time FPT Algorithm for Cactus Contraction
R. Krithika, Pranabendu Misra, Prafullkumar Tale
For a collection of graphs, the -\textsc{Contraction} problem takes a graph and an integer as input and decides if can be modified to some gr…
Revisiting Path Contraction and Cycle Contraction
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
The Path Contraction and Cycle Contraction problems take as input an undirected graph with vertices, edges and an integer and determine whether one can obtain a pat…
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
R. Krithika, V. K. Kutty Malu, Roohani Sharma +1
In this work, we initiate the complexity study of Biclique Contraction and Balanced Biclique Contraction. In these problems, given as input a graph G and an integer k, the objectiv…
The Complexity of Contracting Bipartite Graphs into Small Cycles
R. Krithika, Roohani Sharma, Prafullkumar Tale
For a positive integer , the -Contractibility problem takes as input an undirected simple graph and determines whether can be transformed into a graph…
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh +1
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some ver…
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Jasine Babu, Ajay Saju Jacob, R. Krithika +1
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).