Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
R. Krithika
Observed names:
Krithika, R.,
Krithika, Ramaswamy
Institution:
Indian Institute of Technology Palakkad
Observed institutions:
Indian Institute of Technology Madras,
Indian Institute of Technology Palakkad,
Institute of Mathematical Sciences,
Indian Institute of Technology Indore
ORCID:
0000-0002-5319-7981
Observed ORCID:
0000-0002-5319-7981
OpenAlex ID:
A5023086362
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
2018
·
R. Krithika
, Diptapriyo Majumdar
, et al.
·
Theory of Computing Systems
·
22
PDF
Lossy Kernels for Graph Contraction Problems
2016
·
Krithika, R.
, Misra, Pranabendu
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
20
PDF
Dynamic Parameterized Problems
2017
·
R. Krithika
, Abhishek Sahu
, et al.
·
Algorithmica
·
19
PDF
Packing Arc-Disjoint Cycles in Tournaments
2021
·
Stéphane Bessy
, Marin Bougeret
, et al.
·
Algorithmica
·
15
PDF
A Dirac-type characterization of k -chordal graphs
2013
·
R. Krithika
, Rogers Mathew
, et al.
·
Discrete Mathematics
·
15
Parameterized Algorithms for (r,l)-Partization
2013
·
R. Krithika
, N. S. Narayanaswamy
·
Journal of Graph Algorithms and Applications
·
13
Parameterized and Exact Algorithms for Class Domination Coloring
2017
·
R. Krithika
, Ashutosh Rai
, et al.
·
Lecture notes in computer science
·
10
An FPT Algorithm for Contraction to Cactus
2018
·
R. Krithika
, Pranabendu Misra
, et al.
·
Lecture notes in computer science
·
9
Parameterized and exact algorithms for class domination coloring
2020
·
R. Krithika
, Ashutosh Rai
, et al.
·
Discrete Applied Mathematics
·
8
PDF
Packing Arc-Disjoint Cycles in Tournaments
2019
·
Bessy, Stéphane
, Bougeret, Marin
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Another disjoint compression algorithm for odd cycle transversal
2013
·
R. Krithika
, N.S. Narayanaswamy
·
Information Processing Letters
·
6
PDF
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
2020
·
Petr A. Golovach
, R. Krithika
, et al.
·
Lecture notes in computer science
·
5
Vertex deletion on split graphs: Beyond 4-hitting set
2020
·
Pratibha Choudhary
, Pallavi Jain
, et al.
·
Theoretical Computer Science
·
5
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments
2018
·
Krithika, R.
, Sahu, Abhishek
, et al.
·
arXiv (Cornell University)
·
5
PDF
Packing arc-disjoint cycles in oriented graphs
2024
·
Jasine Babu
, Ajay Saju Jacob
, et al.
·
Journal of Computer and System Sciences
·
4
PDF
Packing Arc-Disjoint Cycles in Bipartite Tournaments
2020
·
Ajay Saju Jacob
, R. Krithika
·
Lecture notes in computer science
·
4
On the Parameterized Complexity of Simultaneous Deletion Problems
2018
·
Agrawal, Akanksha
, Krithika, R.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
2014
·
Samuel Fiorini
, R. Krithika
, et al.
·
Lecture notes in computer science
·
4
Quadratic vertex kernel for split vertex deletion
2020
·
Akanksha Agrawal
, Sushmita Gupta
, et al.
·
Theoretical Computer Science
·
3
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
2019
·
R. Krithika
, Abhishek Sahu
, et al.
·
Algorithmica
·
3
Approximability of Clique Transversal in Perfect Graphs
2017
·
Samuel Fiorini
, R. Krithika
, et al.
·
Algorithmica
·
3
The Complexity of Contracting Bipartite Graphs into Small Cycles
2025
·
R. Krithika
, Roohani Sharma
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
2
PDF
Arborescences and shortest path trees when colors matter
2025
·
P.S. Ardra
, Jasine Babu
, et al.
·
Theoretical Computer Science
·
2
PDF
A single exponential-time FPT algorithm for cactus contraction
2023
·
R. Krithika
, Pranabendu Misra
, et al.
·
Theoretical Computer Science
·
2
PDF
The Complexity of Contracting Bipartite Graphs into Small Cycles
2022
·
R. Krithika
, Roohani Sharma
, et al.
·
Lecture notes in computer science
·
1
Show more works
View as search
Works count:
37
Citation count:
194
H-index:
8
I10-index:
7
Year
Topic
Type