( en | de | ru )

 

Disambiguation of "Gupta, Arvind"

Author of the publication

copydeleteadd this publication to your clipboard
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

, , , , and . CoRR, (2007)

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.

Arvind Batra

Arvind Agarwal

Arvind Dev

Arvind Krishnamurthy

Arvind Krishnaswamy

 

Other publications of authors with the same name

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete., , , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 287-298. Springer, (2008)Using Amplification to Compute Majority with Small Majority Gates., and . Comput. Complex., 6 (1): 46-63 (1997)Computing Planar Intertwines, and . FOCS, page 802-811. IEEE Computer Society, (1991)Inverse Protein Folding in 2D HP Mode (Extended Abstract)., , and . CSB, page 311-318. IEEE Computer Society, (2004)Updating <=, <-chains., and . Inf. Process. Lett., 82 (5): 261-268 (2002)Finding Largest Subtrees and Smallest Supertrees., and . Algorithmica, 21 (2): 183-210 (1998)Point-Based Approaches to Qualitative Temporal Reasoning., , and . AAAI/IAAI, page 739-744. AAAI Press / The MIT Press, (1999)finding Smallest Supertrees., and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 112-121. Springer, (1995)The Chi-t-Coloring Problem., , and . STACS, volume 900 of Lecture Notes in Computer Science, page 409-420. Springer, (1995)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 452-466. Springer, (2006)