default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Krithika 0001
Person information
- affiliation: Indian Institute of Technology Palakkad, India
- affiliation: The Institute of Mathematical Sciences, HBNI, Chennai, India
Other persons with the same name
- R. Krithika 0002 — Department of Computer Science, Amrita Vishwa Vidyapeetham, Amritapuri, Kollam, Kerala, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Jasine Babu, Ajay Saju Jacob, R. Krithika
, Deepak Rajendraprasad:
Packing arc-disjoint cycles in oriented graphs. J. Comput. Syst. Sci. 143: 103530 (2024)- [i11]R. Krithika, V. K. Kutty Malu, Prafullkumar Tale:
Revisiting Path Contraction and Cycle Contraction. CoRR abs/2403.06290 (2024) - [i10]P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Arborescences and Shortest Path Trees when Colors Matter. CoRR abs/2403.06580 (2024) - [i9]P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. CoRR abs/2403.06608 (2024) - 2023
- [j12]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954: 113803 (2023) - [c17]R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS 2023: 8:1-8:18 - [c16]P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. SOFSEM 2023: 177-191 - [i8]R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR abs/2307.10607 (2023) - 2022
- [c15]Jasine Babu, R. Krithika, Deepak Rajendraprasad:
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS 2022: 5:1-5:16 - [c14]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG 2022: 356-369 - [i7]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022) - [i6]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR abs/2206.07358 (2022) - 2021
- [j11]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j10]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - 2020
- [j9]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833: 164-172 (2020) - [j8]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845: 21-37 (2020) - [c13]Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN 2020: 104-115 - [c12]Ajay Saju Jacob, R. Krithika:
Packing Arc-Disjoint Cycles in Bipartite Tournaments. WALCOM 2020: 249-260 - [i5]Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad:
A Note on Arc-Disjoint Cycles in Bipartite Tournaments. CoRR abs/2002.06912 (2020)
2010 – 2019
- 2019
- [j7]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica 81(9): 3803-3841 (2019) - [c11]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC 2019: 1-12 - [c10]Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot:
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC 2019: 161-173 - [c9]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - 2018
- [j6]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80(8): 2221-2239 (2018) - [j5]R. Krithika, Abhishek Sahu, Prafullkumar Tale:
Dynamic Parameterized Problems. Algorithmica 80(9): 2637-2655 (2018) - [j4]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. Theory Comput. Syst. 62(8): 1690-1714 (2018) - [c8]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
An FPT Algorithm for Contraction to Cactus. COCOON 2018: 341-352 - [c7]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN 2018: 712-726 - [i4]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR abs/1802.07090 (2018) - 2017
- [c6]Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - [c5]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM 2017: 336-349 - [i3]R. Krithika, Diptapriyo Majumdar, Venkatesh Raman:
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. CoRR abs/1711.07872 (2017) - 2016
- [c4]R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale:
Lossy Kernels for Graph Contraction Problems. FSTTCS 2016: 23:1-23:14 - [c3]R. Krithika, Abhishek Sahu, Prafullkumar Tale:
Dynamic Parameterized Problems. IPEC 2016: 19:1-19:14 - 2014
- [c2]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA 2014: 430-442 - 2013
- [j3]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type characterization of k-chordal graphs. Discret. Math. 313(24): 2865-2867 (2013) - [j2]R. Krithika, N. S. Narayanaswamy:
Another disjoint compression algorithm for odd cycle transversal. Inf. Process. Lett. 113(22-24): 849-851 (2013) - [j1]R. Krithika, N. S. Narayanaswamy:
Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. 17(2): 129-146 (2013) - [i2]R. Krithika, N. S. Narayanaswamy:
Another Disjoint Compression Algorithm for OCT. CoRR abs/1303.1671 (2013) - 2012
- [c1]R. Krithika, N. S. Narayanaswamy:
Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM 2012: 17-27 - [i1]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type Characterization of k-chordal Graphs. CoRR abs/1206.5397 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
