( en | de | ru )

 

Disambiguation of "Raman, Venkatesh"

Author of the publication

copydeleteadd this publication to your clipboard
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.

, , and . ISAAC, volume 64 of LIPIcs, page 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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)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)Subexponential Algorithms for Partial Cover Problems., , , and . FSTTCS, volume 4 of LIPIcs, page 193-201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)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)Selecting Small Ranks in EREW PRAM., and . Inf. Process. Lett., 71 (5-6): 183-186 (1999)Fast Stable In-Place Sorting with O (n) Data Moves., and . Algorithmica, 16 (2): 151-160 (1996)Parameterizing above Guaranteed Values: MaxSat and MaxCut., and . J. Algorithms, 31 (2): 335-354 (1999)Sorting with Minimum Data Movement., and . J. Algorithms, 13 (3): 374-393 (1992)An Improved Fixed-Parameter Algorithm for Vertex Cover., , and . Inf. Process. Lett., 65 (3): 163-168 (1998)Succinct ordinal trees with level-ancestor queries., , and . SODA, page 1-10. SIAM, (2004)