( en | de | ru )

 

Disambiguation of "Raman, Venkatesh"

Author of the publication

copydeleteadd this publication to your clipboard
Tractability of Konig Edge Deletion Problems.

, , , and . CoRR, (2018)

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.

Venkatesh Kolluru

Venkatesh Ramakrishnan

Sreenath Ramanath

Aravamudhan Raman

Natraj Raman

 

Other publications of authors with the same name

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles., , , and . Algorithmica, 68 (2): 504-530 (2014)A Polynomial Sized Kernel for Tracking Paths Problem., , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 94-107. Springer, (2018)Selection and Sorting in the "Restore" Model., , and . ACM Trans. Algorithms, 14 (2): 11:1-11:18 (2018)Parameterized Complexity of Directed Feedback Set Problems in Tournaments., and . WADS, volume 2748 of Lecture Notes in Computer Science, page 484-492. Springer, (2003)Parameterized Algorithms for Generalized Domination., , and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 116-126. Springer, (2008)Succinct Representations of Permutations., , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 345-356. Springer, (2003)A Quartic Kernel for Pathwidth-One Vertex Deletion., , and . WG, volume 6410 of Lecture Notes in Computer Science, page 196-207. (2010)Upper and Lower Bounds for Weak Backdoor Set Detection., , , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 394-402. Springer, (2013)Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems., , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 139-151. Springer, (2006)Selection from Read-Only Memory and Sorting with Optimum Data Movement., and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 380-391. Springer, (1992)