Krithika Ramaswamy - Research Publications - IIT Palakkad Research Profile

Publications (24)

Sort by Year (most recent)

Sort by Year (oldest first)

Sort by Most Cited

Sort by Recently Added

Sort (A-Z)

Sort (Z-A)

Open Access
Packing Arc-Disjoint Cycles in Tournaments
Stéphane Bessy, Marin Bougeret,
Krithika Ramaswamy
, ..., Meirav Zehavi (7 authors)
2021 | Springer Nature
Articles
Packing Arc-Disjoint Cycles in Tournaments
S. Bessy, M. Bougeret,
Krithika Ramaswamy
, ..., M. Zehavi (7 authors)
2021 | Springer
PDFPublisher Copy
Conference Proceeding
Vertex deletion on split graphs: Beyond 4-hitting set
Pratibha Choudhary, Pallavi Jain,
Krithika Ramaswamy
and Vibha Sahlot
2020 | Elsevier
Other
Open Access
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Jasine Babu, Ajay Saju Jacob,
Krithika Ramaswamy
and Deepak Rajendraprasad
2020
Articles
Vertex deletion on split graphs: Beyond 4-hitting set
P. Choudhary, P. Jain,
Krithika Ramaswamy
and V. Sahlot
2020 | Elsevier B.V.
Conferences
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
P.A. Golovach,
Krithika Ramaswamy
, ..., M. Zehavi (5 authors)
2020 | Springer Science and Business Media Deutschland GmbH
Conferences
Packing arc-disjoint cycles in bipartite tournaments
A.S. Jacob and
Krithika Ramaswamy
2020 | Springer
Conferences
Quadratic Vertex Kernel for Split Vertex Deletion
A. Agrawal, S. Gupta, ...,
Krithika Ramaswamy
(4 authors)
2019 | Springer Verlag
Articles
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
Krithika Ramaswamy
, A. Sahu, ..., M. Zehavi (4 authors)
2019 | Springer New York LLC
Conference Proceeding
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
Krithika Ramaswamy
, Abhishek Sahu, ..., Meirav Zehavi (4 authors)
2018 | Springer Nature
Articles
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments
Krithika Ramaswamy
, A Sahu, ..., M Zehavi (4 authors)
2018
Conferences
An FPT algorithm for contraction to cactus
Krithika Ramaswamy
, P. Misra and P. Tale
2018 | Springer Verlag
Articles
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
Krithika Ramaswamy
, D. Majumdar and V. Raman
2018 | Springer New York LLC
PDFPostprint
Articles
Approximability of Clique Transversal in Perfect Graphs
S. Fiorini,
Krithika Ramaswamy
, ..., V. Raman (4 authors)
2018 | Springer New York LLC
Conferences
On the parameterized complexity of simultaneous deletion problems
A. Agrawal,
Krithika Ramaswamy
, ..., M.S. Ramanujan (5 authors)
2018 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Dynamic Parameterized Problems
Krithika Ramaswamy
, A. Sahu and P. Tale
2018 | Springer New York LLC
PDFPublisher Copy
Book
Open Access
Dynamic Parameterized Problems
Krithika Ramaswamy
, Sahu Abhishek and Tale Prafullkumar
2017 | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Conferences
Parameterized and exact algorithms for class domination coloring
Krithika Ramaswamy
, A. Rai, ..., P. Tale (4 authors)
2017 | Springer Verlag
Conferences
Lossy kernels for graph contraction problems
Krithika Ramaswamy
, P. Misra, ..., P. Tale (4 authors)
2016 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
LP approaches to improved approximation for clique transversal in perfect graphs
S. Fiorini,
Krithika Ramaswamy
, ..., V. Raman (4 authors)
2014 | Springer Verlag

Showing 1-20 of 24 results