Follow
R. Krithika
R. Krithika
Indian Institute of Technology Palakkad
Verified email at iitpkd.ac.in - Homepage
Title
Cited by
Cited by
Year
Lossy kernels for graph contraction problems
R Krithika, P Misra, A Rai, P Tale
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
222016
Revisiting connected vertex cover: FPT algorithms and lossy kernels
R Krithika, D Majumdar, V Raman
Theory of Computing Systems 62, 1690-1714, 2018
202018
Dynamic Parameterized Problems
R Krithika, A Sahu, P Tale
LIPIcs-Leibniz International Proceedings in Informatics 63, 2017
202017
A Dirac-type characterization of k-chordal graphs
R Krithika, R Mathew, NS Narayanaswamy, N Sadagopan
Discrete Mathematics 313 (24), 2865-2867, 2013
162013
Packing arc-disjoint cycles in tournaments
S Bessy, M Bougeret, R Krithika, A Sahu, S Saurabh, J Thiebaut, ...
Algorithmica 83, 1393-1420, 2021
152021
Parameterized and exact algorithms for class domination coloring
R Krithika, A Rai, S Saurabh, P Tale
Discrete Applied Mathematics 291, 286-299, 2021
152021
Parameterized Algorithms for (г, l)-Partization
R Krithika, NS Narayanaswamy
122013
An FPT algorithm for contraction to cactus
R Krithika, P Misra, P Tale
International Computing and Combinatorics Conference, 341-352, 2018
82018
The parameterized complexity of cycle packing: indifference is not an issue
R Krithika, A Sahu, S Saurabh, M Zehavi
Algorithmica 81, 3803-3841, 2019
52019
Another disjoint compression algorithm for odd cycle transversal
R Krithika, NS Narayanaswamy
Information Processing Letters 113 (22-24), 849-851, 2013
52013
Packing arc-disjoint cycles in bipartite tournaments
AS Jacob, R Krithika
International Workshop on Algorithms and Computation, 249-260, 2020
42020
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments
R Krithika, A Sahu, S Saurabh, M Zehavi
arXiv preprint arXiv:1802.07090, 2018
42018
Vertex deletion on split graphs: Beyond 4-hitting set
P Choudhary, P Jain, R Krithika, V Sahlot
Theoretical Computer Science 845, 21-37, 2020
32020
Quadratic vertex kernel for split vertex deletion
A Agrawal, S Gupta, P Jain, R Krithika
Theoretical Computer Science 833, 164-172, 2020
22020
Approximability of clique transversal in perfect graphs
S Fiorini, R Krithika, NS Narayanaswamy, V Raman
Algorithmica 80, 2221-2239, 2018
22018
The Complexity of Contracting Bipartite Graphs into Small Cycles
R Krithika, R Sharma, P Tale
International Workshop on Graph-Theoretic Concepts in Computer Science, 356-369, 2022
12022
Packing Arc-Disjoint 4-Cycles in Oriented Graphs
J Babu, R Krithika, D Rajendraprasad
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
12022
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
PA Golovach, R Krithika, A Sahu, S Saurabh, M Zehavi
Latin American Symposium on Theoretical Informatics, 104-115, 2020
12020
On the Parameterized Complexity of Simultaneous Deletion Problems
A Agrawal, R Krithika, D Lokshtanov, AE Mouawad, MS Ramanujan
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
12018
LP approaches to improved approximation for clique transversal in perfect graphs
S Fiorini, R Krithika, NS Narayanaswamy, V Raman
European Symposium on Algorithms, 430-442, 2014
12014
The system can't perform the operation now. Try again later.
Articles 1–20