R. Krithika

50 papers A 1B 10C 3Misc 1Journal 31Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Balanced substructures in bicolored graphs.
Theor. Comput. Sci.
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2026 J jnl
Color-Constrained Arborescences in Edge-Colored Digraphs.
Electron. J. Comb.
P. S. Ardra, Jasine Babu, R. Krithika, Deepak Rajendraprasad
2026 J jnl
Revisiting path contraction and cycle contraction.
J. Comput. Syst. Sci.
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2025 J jnl
A Single Exponential-Time FPT Algorithm for Cactus Contraction.
CoRR
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2025 J jnl
Arborescences and shortest path trees when colors matter.
Theor. Comput. Sci.
P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad
2025 C conf
Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs.
IWOCA
Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh
2025 J jnl
Color-Constrained Arborescences in Edge-Colored Digraphs.
CoRR
P. S. Ardra, Jasine Babu, R. Krithika, Deepak Rajendraprasad
2025 J jnl
The Complexity of Contracting Bipartite Graphs into Small Cycles.
Discret. Math. Theor. Comput. Sci.
R. Krithika, Roohani Sharma, Prafullkumar Tale
2024 J jnl
Arborescences and Shortest Path Trees when Colors Matter.
CoRR
P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad
2024 J jnl
Balanced Substructures in Bicolored Graphs.
CoRR
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2024 J jnl
Packing arc-disjoint cycles in oriented graphs.
J. Comput. Syst. Sci.
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
2024 B conf
Revisiting Path Contraction and Cycle Contraction.
WG
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2024 J jnl
Revisiting Path Contraction and Cycle Contraction.
CoRR
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2023 J jnl
A single exponential-time FPT algorithm for cactus contraction.
Theor. Comput. Sci.
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2023 B conf
Balanced Substructures in Bicolored Graphs.
SOFSEM
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2023 — conf
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.
FSTTCS
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.
CoRR
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
2022 — conf
Packing Arc-Disjoint 4-Cycles in Oriented Graphs.
FSTTCS
Jasine Babu, R. Krithika, Deepak Rajendraprasad
2022 J jnl
Parameterized and Exact Algorithms for Class Domination Coloring.
CoRR
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2022 B conf
The Complexity of Contracting Bipartite Graphs into Small Cycles.
WG
R. Krithika, Roohani Sharma, Prafullkumar Tale
2022 J jnl
The Complexity of Contracting Bipartite Graphs into Small Cycles.
CoRR
R. Krithika, Roohani Sharma, Prafullkumar Tale
2021 J jnl
Packing Arc-Disjoint Cycles in Tournaments.
Algorithmica
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2021 J jnl
Parameterized and exact algorithms for class domination coloring.
Discret. Appl. Math.
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2020 J jnl
A Note on Arc-Disjoint Cycles in Bipartite Tournaments.
CoRR
Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad
2020 B conf
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.
LATIN
Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2020 B conf
Packing Arc-Disjoint Cycles in Bipartite Tournaments.
WALCOM
Ajay Saju Jacob, R. Krithika
2020 J jnl
Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci.
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2020 J jnl
Vertex deletion on split graphs: Beyond 4-hitting set.
Theor. Comput. Sci.
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
2019 B conf
Packing Arc-Disjoint Cycles in Tournaments.
MFCS
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2019 C conf
Quadratic Vertex Kernel for Split Vertex Deletion.
CIAC
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2019 J jnl
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
Algorithmica
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2019 C conf
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set.
CIAC
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
2018 Misc conf
An FPT Algorithm for Contraction to Cactus.
COCOON
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2018 J jnl
Approximability of Clique Transversal in Perfect Graphs.
Algorithmica
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2018 J jnl
Dynamic Parameterized Problems.
Algorithmica
R. Krithika, Abhishek Sahu, Prafullkumar Tale
2018 J jnl
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
Theory Comput. Syst.
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2018 B conf
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
LATIN
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018 J jnl
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.
CoRR
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2017 — conf
On the Parameterized Complexity of Simultaneous Deletion Problems.
FSTTCS
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
2017 B conf
Parameterized and Exact Algorithms for Class Domination Coloring.
SOFSEM
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2017 J jnl
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.
CoRR
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
2016 B conf
Dynamic Parameterized Problems.
IPEC
R. Krithika, Abhishek Sahu, Prafullkumar Tale
2016 — conf
Lossy Kernels for Graph Contraction Problems.
FSTTCS
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale
2014 A conf
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.
ESA
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2013 J jnl
A Dirac-type characterization of
Discret. Math.
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2013 J jnl
Another Disjoint Compression Algorithm for OCT
CoRR
R. Krithika, N. S. Narayanaswamy
2013 J jnl
Another disjoint compression algorithm for odd cycle transversal.
Inf. Process. Lett.
R. Krithika, N. S. Narayanaswamy
2013 J jnl
Parameterized Algorithms for (r, l)-Partization.
J. Graph Algorithms Appl.
R. Krithika, N. S. Narayanaswamy
2012 J jnl
A Dirac-type Characterization of k-chordal Graphs
CoRR
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2012 B conf
Generalized Above Guarantee Vertex Cover and r-Partization.
WALCOM
R. Krithika, N. S. Narayanaswamy