Arvind Gupta

2008
44	EE	Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193
2007
43	EE	Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta: An efficient data structure for applying multiple seeds in homology search. BIBE 2007: 1374-1378
42		Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey: Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. BIOCOMP 2007: 362-369
41	EE	Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta: Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI 2007: 161-166
40	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132
39	EE	Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs CoRR abs/0708.2514: (2007)
38	EE	Arvind Gupta, Gregory Gutin, Mehdi Karimi, E. J. Kim, Arash Rafiey: Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR abs/0712.0804: (2007)
2006
37	EE	Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
36	EE	Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta: Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466
35	EE	Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho: Characterization of the Existence of Galled-tree Networks. J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006)
2005
34	EE	Mat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta: DJammer: a new digital, mobile, virtual, personal musical instrument. ICME 2005: 65-68
33	EE	Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
2004
32	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
31	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
30	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
2003
29	EE	Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti: A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86(2): 87-91 (2003)
28	EE	Arvind Gupta, Ramesh Krishnamurti: Parallel Algorithms For Vehicle Routing Problems. Parallel Processing Letters 13(4): 673-687 (2003)
2002
27	EE	James P. Delgrande, Arvind Gupta: Updating <=, <-chains. Inf. Process. Lett. 82(5): 261-268 (2002)
2001
26	EE	James P. Delgrande, Arvind Gupta, Tim Van Allen: A comparison of point-based approaches to qualitative temporal reasoning. Artif. Intell. 131(1-2): 135-170 (2001)
2000
25	EE	Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
24	EE	Arvind Gupta, Damon Kaller, Thomas C. Shermer: Linear-Time Algorithms for Partial k-Tree Complements. Algorithmica 27(3): 254-274 (2000)
1999
23		Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings Springer 1999
22		James P. Delgrande, Arvind Gupta, Tim Van Allen: Point-Based Approaches to Qualitative Temporal Reasoning. AAAI/IAAI 1999: 739-744
21	EE	Arvind Gupta, Damon Kaller, Thomas C. Shermer: On the Complements of Partial k-Trees. ICALP 1999: 382-391
1998
20		James P. Delgrande, Arvind Gupta: Revising TimeGraph-II. Canadian Conference on AI 1998: 349-362
19		Tim Van Allen, James P. Delgrande, Arvind Gupta: Point-Based Approaches to Qualitative Temporal Reasoning. PRICAI 1998: 305-316
18		Arvind Gupta, Naomi Nishimura: Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998)
1997
17		Arvind Gupta, Sanjeev Mahajan: Using Amplification to Compute Majority with Small Majority Gates. Computational Complexity 6(1): 46-63 (1997)
16	EE	Arvind Gupta, Russell Impagliazzo: Bounding the Size of Planar Intertwines. SIAM J. Discrete Math. 10(3): 337-358 (1997)
1996
15		James P. Delgrande, Arvind Gupta: A Representation for Efficient Temporal Reasoning. AAAI/IAAI, Vol. 1 1996: 381-388
14		Arvind Gupta, Naomi Nishimura: Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464
13		Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer: Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172
12		James P. Delgrande, Arvind Gupta: The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. Ann. Math. Artif. Intell. 18(1): 51-67 (1996)
11	EE	Arvind Gupta, Naomi Nishimura: The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996)
1995
10		Arvind Gupta, Naomi Nishimura: finding Smallest Supertrees. ISAAC 1995: 112-121
9		Arvind Gupta, Naomi Nishimura: Finding Largest Common Embeddable Subtrees. STACS 1995: 397-408
8		Damon Kaller, Arvind Gupta, Thomas C. Shermer: The Chi-t-Coloring Problem. STACS 1995: 409-420
7		Damon Kaller, Arvind Gupta, Thomas C. Shermer: Regular-Factors In The Complements Of Partial k-Trees. WADS 1995: 403-414
6		Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995)
1994
5		Arvind Gupta, Naomi Nishimura: Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182
1993
4		Arvind Gupta: Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). ICALP 1993: 359-370
1992
3		Arvind Gupta: A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. LFCS 1992: 174-185
2		Arvind Gupta, Naomi Nishimura: The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS 1992: 21-32
1991
1		Arvind Gupta, Russell Impagliazzo: Computing Planar Intertwines FOCS 1991: 802-811

Coauthor Index

1	Tim Van Allen	[19] [22] [26]
2	Banny Banerjee	[34]
3	Frank K. H. A. Dehne	[23]
4	James P. Delgrande	[12] [15] [19] [20] [22] [26] [27]
5	Daya Ram Gaur	[29]
6	Gregory Gutin	[38]
7	Mat Hans	[34]
8	Pavol Hell	[39] [44]
9	Russell Impagliazzo	[1] [16]
10	Damon Kaller	[7] [8] [13] [21] [24]
11	Mehdi Karimi	[38] [39] [42] [44]
12	Jonathan Kavanagh	[36]
13	Alireza Hadj Khodabakhshi	[42] [43]
14	E. J. Kim	[38]
15	Ramesh Krishnamurti	[28] [29]
16	Yongmei Liu	[41]
17	Sanjeev Mahajan	[13] [17]
18	Ján Manuch	[30] [31] [32] [35] [36] [37] [40] [42]
19	Mehdi Mirzazadeh	[43]
20	April Slayden Mitchell (April Slayden)	[34]
21	David G. Mitchell	[36]
22	Naomi Nishimura	[2] [5] [6] [9] [10] [11] [14] [18] [25] [33]
23	Murray Patterson	[41]
24	Andrzej Proskurowski	[25] [33]
25	Arash Rafiey	[38] [39] [42] [44]
26	Prabhakar Ragde	[25] [33]
27	Jörg-Rüdiger Sack	[23]
28	Thomas C. Shermer	[7] [8] [13] [21] [24]
29	Mark Smith	[34]
30	Ladislav Stacho	[30] [31] [32] [35] [37] [40]
31	Roberto Tamassia	[23]
32	Eugenia Ternovska (Eugenia Ternovskaia)	[36] [41]
33	Xiaohong Zhao	[35] [36] [37] [40]
34	Chenchen Zhu	[32]

Colors in the list of coauthors