( en | de | ru )

 

Disambiguation of "Raman, Venkatesh"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds for Finding Degrees from the Adjacency Matrix.

, , and . LATIN, volume 911 of Lecture Notes in Computer Science, page 49-59. Springer, (1995)

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

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 985-996. Springer, (2015)On Parameterized Independent Feedback Vertex Set., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 98-109. Springer, (2011)Representing Trees of Higer Degree., , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 169-180. Springer, (1999)Parameterized Complexity of Geometric Covering Problems Having Conflicts., , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 61-72. Springer, (2017)Explicit Deterministic Constructions for Membership in the Bitprobe Model., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 290-299. Springer, (2001)Triangles, 4-Cycles and Parameterized (In-)Tractability., and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 304-315. Springer, (2006)Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime., , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 50-59. Springer, (2017)Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs., , , and . MFCS, volume 58 of LIPIcs, page 75:1-75:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Sorting and Selection with Equality Comparisons., , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 434-445. Springer, (2015)Subexponential Algorithms for Partial Cover Problems., , , and . FSTTCS, volume 4 of LIPIcs, page 193-201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)