dblp.uni-trier.dewww.uni-trier.de

Arvind Gupta Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
54EEJán Manuch, Murray Patterson, Arvind Gupta: On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON 2009: 268-276
53EEArvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discrete Applied Mathematics 157(10): 2310-2324 (2009)
2008
52EEAlireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. APBC 2008: 49-58
51 Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP 2008: 619-625
50EEAlireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta: A Robust Class of Stable Proteins in the 2D HPC Model. BIRD 2008: 180-192
49EEArvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey: Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA 2008: 374-383
48EEArvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298
47EEArvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193
46EEArvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete Math. 22(2): 832-847 (2008)
2007
45EEAlireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta: An efficient data structure for applying multiple seeds in homology search. BIBE 2007: 1374-1378
44 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
43EEMurray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta: Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI 2007: 161-166
42EEArvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132
41EEArvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs CoRR abs/0708.2514: (2007)
40EEArvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey: Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR abs/0712.0804: (2007)
2006
39EEJán Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
38EEJonathan 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
37EEArvind 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
36EEMat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta: DJammer: a new digital, mobile, virtual, personal musical instrument. ICME 2005: 65-68
35EEArvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
34EEArvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)
33EEArvind Gupta, Ján Manuch, Ladislav Stacho: Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. Journal of Computational Biology 12(10): 1328-1345 (2005)
2004
32EEArvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
31EEArvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
30EEArvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
2003
29EEDaya 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)
28EEArvind Gupta, Ramesh Krishnamurti: Parallel Algorithms For Vehicle Routing Problems. Parallel Processing Letters 13(4): 673-687 (2003)
2002
27EEJames P. Delgrande, Arvind Gupta: Updating <=, <-chains. Inf. Process. Lett. 82(5): 261-268 (2002)
2001
26EEJames 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
25EEArvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
24EEArvind 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
21EEArvind 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
19EETim 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)
16EEArvind 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
14EEArvind Gupta, Naomi Nishimura: Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464
13EEArvind 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)
11EEArvind Gupta, Naomi Nishimura: The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996)
1995
10EEArvind Gupta, Naomi Nishimura: finding Smallest Supertrees. ISAAC 1995: 112-121
9EEArvind Gupta, Naomi Nishimura: Finding Largest Common Embeddable Subtrees. STACS 1995: 397-408
8EEDamon 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
5EEArvind Gupta, Naomi Nishimura: Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182
1993
4EEArvind 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
2EEArvind 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)