( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster algorithms for finding and counting subgraphs.

, , , , и . J. Comput. Syst. Sci., 78 (3): 698-706 (2012)

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.

Venkatesh Kolluru

Venkatesh Ramakrishnan

Sreenath Ramanath

Aravamudhan Raman

Natraj Raman

 

Другие публикации лиц с тем же именем

Selecting Small Ranks in EREW PRAM., и . Inf. Process. Lett., 71 (5-6): 183-186 (1999)Fast Stable In-Place Sorting with O (n) Data Moves., и . Algorithmica, 16 (2): 151-160 (1996)Parameterizing above Guaranteed Values: MaxSat and MaxCut., и . J. Algorithms, 31 (2): 335-354 (1999)Sorting with Minimum Data Movement., и . J. Algorithms, 13 (3): 374-393 (1992)An Improved Fixed-Parameter Algorithm for Vertex Cover., , и . Inf. Process. Lett., 65 (3): 163-168 (1998)Succinct ordinal trees with level-ancestor queries., , и . SODA, стр. 1-10. SIAM, (2004)Ontology Re-Engineering: A Case Study from the Automotive Industry, , , , и . AI Magazine, 39 (1): 49--60 (2017)Sorting with Minimum Data Movement (Preliminary Draft)., и . WADS, том 382 из Lecture Notes in Computer Science, стр. 552-562. Springer, (1989)LP can be a cure for Parameterized Problems., , , и . STACS, том 14 из LIPIcs, стр. 338-349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Parameterized Algorithms for Even Cycle Transversal., , , и . WG, том 7551 из Lecture Notes in Computer Science, стр. 172-183. Springer, (2012)