( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Updating <=, <-chains.

, и . Inf. Process. Lett., 82 (5): 261-268 (2002)

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.

Arvind Batra

Arvind Agarwal

Arvind Krishnamurthy

Arvind Dev

Arvind Krishnaswamy

 

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

Haplotype Inferring via Galled-Tree Networks Is NP-Complete., , , , и . J. Comput. Biol., 17 (10): 1435-1449 (2010)Using Amplification to Compute Majority with Small Majority Gates., и . Comput. Complex., 6 (1): 46-63 (1997)Haplotype Inferring Via Galled-Tree Networks Is NP-Complete., , , и . COCOON, том 5092 из Lecture Notes in Computer Science, стр. 287-298. Springer, (2008)finding Smallest Supertrees., и . ISAAC, том 1004 из Lecture Notes in Computer Science, стр. 112-121. Springer, (1995)On the Complements of Partial k-Trees., , и . ICALP, том 1644 из Lecture Notes in Computer Science, стр. 382-391. Springer, (1999)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , и . LPAR, том 4246 из Lecture Notes in Computer Science, стр. 452-466. Springer, (2006)The Chi-t-Coloring Problem., , и . STACS, том 900 из Lecture Notes in Computer Science, стр. 409-420. Springer, (1995)Computer-aided engineering analysis for the performance augmentation of a fin-tube heat exchanger using vortex generator., , и . Concurr. Eng. Res. Appl., (2020)Updating <=, <-chains., и . Inf. Process. Lett., 82 (5): 261-268 (2002)Finding Largest Subtrees and Smallest Supertrees., и . Algorithmica, 21 (2): 183-210 (1998)