( en | de | ru )

 

Disambiguation of "Krithika, R."

Author of the publication

copydeleteadd this publication to your clipboard
A single exponential-time FPT algorithm for cactus contraction.

, , and . Theor. Comput. Sci., (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

R Chaudhury

R Bässler

R Giese

R Sailer

R Oppelt

 

Other publications of authors with the same name

Learning to Grade Short Answers using Machine Learning Techniques., and . WCI, page 262-271. ACM, (2015)A single exponential-time FPT algorithm for cactus contraction., , and . Theor. Comput. Sci., (2023)Packing Arc-Disjoint 4-Cycles in Oriented Graphs., , and . FSTTCS, volume 250 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Packing Arc-Disjoint Cycles in Tournaments., , , , , , and . Algorithmica, 83 (5): 1393-1420 (2021)Balanced Substructures in Bicolored Graphs., , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 177-191. Springer, (2023)Quadratic Vertex Kernel for Split Vertex Deletion., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 1-12. Springer, (2019)A Dirac-type Characterization of k-chordal Graphs, , , and . CoRR, (2012)The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments., , , and . CoRR, (2018)Parameterized Algorithms for (r, l)-Partization., and . J. Graph Algorithms Appl., 17 (2): 129-146 (2013)Vertex deletion on split graphs: Beyond 4-hitting set., , , and . Theor. Comput. Sci., (2020)