R. Krithika

From MaRDI portal
Revision as of 08:18, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:394279

Available identifiers

zbMath Open krithika.rMaRDI QIDQ394279

List of research outcomes

PublicationDate of PublicationType
Packing arc-disjoint cycles in oriented graphs2024-04-09Paper
Balanced substructures in bicolored graphs2023-08-14Paper
The complexity of contracting bipartite graphs into small cycles2023-05-05Paper
A single exponential-time FPT algorithm for cactus contraction2023-04-12Paper
Graph Hamiltonicity parameterized by proper interval deletion set2022-10-13Paper
Packing Arc-Disjoint Cycles in Tournaments2022-07-21Paper
Packing arc-disjoint cycles in tournaments2021-04-19Paper
Parameterized and exact algorithms for class domination coloring2021-03-25Paper
https://portal.mardi4nfdi.de/entity/Q51362982020-11-25Paper
Vertex deletion on split graphs: beyond 4-hitting set2020-10-22Paper
Quadratic vertex kernel for split vertex deletion2020-08-03Paper
Packing arc-disjoint cycles in bipartite tournaments2020-07-22Paper
The parameterized complexity of cycle packing: indifference is not an issue2020-02-12Paper
Quadratic vertex kernel for split vertex deletion2020-02-06Paper
Vertex deletion on split graphs: beyond 4-hitting set2020-02-06Paper
Revisiting connected vertex cover: FPT algorithms and lossy kernels2019-09-05Paper
The parameterized complexity of cycle packing: indifference is not an issue2019-08-20Paper
An FPT algorithm for contraction to cactus2018-10-04Paper
Dynamic parameterized problems2018-07-26Paper
Approximability of clique transversal in perfect graphs2018-07-25Paper
Lossy Kernels for Graph Contraction Problems2018-04-19Paper
Dynamic Parameterized Problems2018-04-10Paper
Parameterized and Exact Algorithms for Class Domination Coloring2017-04-04Paper
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs2014-10-08Paper
Another disjoint compression algorithm for odd cycle transversal2014-04-14Paper
A Dirac-type characterization of \(k\)-chordal graphs2014-01-27Paper
Parameterized Algorithms for (r,l)-Partization2013-03-19Paper
Generalized Above Guarantee Vertex Cover and r-Partization2012-06-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: R. Krithika