( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Roots of Graphs Is Hard.

, и . Discret. Appl. Math., 54 (1): 81-88 (1994)

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.

Rajeev Sudra

Rajeev Gangula

Rajeev Ranjan

Rajeev Kumar

Rajeev Kavety

 

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

Constructive Results from Graph Minors: Linkless Embeddings, , и . FOCS, стр. 398-409. IEEE Computer Society, (1988)Switch Scheduling via Randomized Edge Coloring., , , и . FOCS, стр. 502-512. IEEE Computer Society, (2003)Finding Interesting Associations without Support Pruning., , , , , , , и . ICDE, стр. 489-500. IEEE Computer Society, (2000)Extracting Schema from Semistructured Data., , и . SIGMOD Conference, стр. 295-306. ACM Press, (1998)Robust and Efficient Fuzzy Match for Online Data Cleaning., , , и . SIGMOD Conference, стр. 313-324. ACM, (2003)The Price of Validity in Dynamic Networks., , , и . SIGMOD Conference, стр. 515-526. ACM, (2004)Computing Roots of Graphs Is Hard., и . Discret. Appl. Math., 54 (1): 81-88 (1994)RAPID: Randomized pharmacophore identification for drug design, , , , , , и . Comput. Geom., 10 (4): 263--272 (1998)Earlier version in SOCG'97.Finding large cycles in Hamiltonian graphs, и . Discrete Applied Mathematics, 158 (8): 882--893 (2010)Earlier version in SODA'05.Lower bounds on locality sensitive hashing., , и . SCG, стр. 154-157. ACM, (2006)