( en | de | ru )

 

Disambiguation of "Raman, Venkatesh"

Author of the publication

copydeleteadd this publication to your clipboard
Representing Trees of Higher Degree.

, , , , , and . Algorithmica, 43 (4): 275-292 (2005)

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

Succinct ordinal trees with level-ancestor queries., , and . ACM Trans. Algorithms, 2 (4): 510-534 (2006)Faster Algorithms for Finding and Counting Subgraphs, , , , and . CoRR, (2009)FPT Algorithms for Connected Feedback Vertex Set, , , , and . CoRR, (2009)Approximate Block Sorting., , , and . Int. J. Found. Comput. Sci., 17 (2): 337-356 (2006)Static Dictionaries Supporting Rank., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 18-26. Springer, (1999)Succinct Data Structures for Representing Equivalence Classes., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 502-512. Springer, (2013)Parameterized Complexity of Geometric Covering Problems Having Conflicts., , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 61-72. Springer, (2017)On Parameterized Independent Feedback Vertex Set., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 98-109. Springer, (2011)Explicit Deterministic Constructions for Membership in the Bitprobe Model., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 290-299. Springer, (2001)Representing Trees of Higer Degree., , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 169-180. Springer, (1999)