Arvind Gupta

Publication Activity (10 Years)

Years Active: 1991-2020
Publications (10 Years): 3

Top Topics

Automatic Diagnosis

Top Venues

J. Comput. Biol.

Discret. Appl. Math.

Concurr. Eng. Res. Appl.

Publications

Sachin Gupta, Aditya Roy, Arvind Gupta
Computer-aided engineering analysis for the performance augmentation of a fin-tube heat exchanger using vortex generator. Concurr. Eng. Res. Appl. 28 (1) (2020)
Arvind Gupta, Biplav Srivastava, Daby Sow, Ching-Hua Chen, Oshani Seneviratne
Reflections on the Ingredients for Success in AI Research: An Interview with Arvind Gupta. AI Mag. 40 (4) (2019)
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
Contraction obstructions for connected graph searching. Discret. Appl. Math. 209 (2016)
Habil Zare, Gholamreza Haffari, Arvind Gupta, Ryan Remy Brinkman
Scoring relevancy of features based on combinatorial analysis of Lasso with application to lymphoma diagnosis. BMC Genom. 14 (S-1) (2013)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. 19 (4) (2012)
Pankaj Jalote, Arvind Gupta
Using global pairs for reducing software development time. ISEC (2011)
Ján Manuch, Murray Patterson, Arvind Gupta
Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA (2011)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Evolutionary Conservation of Human Phosphorylation Sites. BIBM (2011)
Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. 17 (10) (2010)
Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan Remy Brinkman
Data reduction for spectral clustering to analyze high throughput flow cytometry data. BMC Bioinform. 11 (2010)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Prediction of human protein kinase substrate specificities. BIBM (2010)
Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. 46 (2010)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. J. Comput. Biol. 16 (6) (2009)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. J. Comput. Biol. 16 (1) (2009)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. 157 (10) (2009)
Mehdi Karimi, Arvind Gupta
Minimum Cost Homomorphism to Oriented Cycles with Some Loops. CATS (2009)
Ján Manuch, Murray Patterson, Arvind Gupta
On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON (2009)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP (2008)
Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA (2008)
Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN (2008)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON (2008)
Alireza 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)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
A Robust Class of Stable Proteins in the 2D HPC Model. BIRD (2008)
Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
On the Complexity of Ordered Colorings. SIAM J. Discret. Math. 22 (2) (2008)
Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
Minimum Cost Homomorphisms to Reflexive Digraphs CoRR (2007)
Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta
An efficient data structure for applying multiple seeds in homology search. BIBE (2007)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA (2007)
Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta
Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI (2007)
Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR (2007)
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)
Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
Characterization of the Existence of Galled-Tree Networks. APBC (2006)
Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR (2006)
Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4 (6) (2006)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. Discret. Appl. Math. 145 (2) (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Ordered 3-colorings. Electron. Notes Discret. Math. 22 (2005)
Mat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta
DJammer: a new digital, mobile, virtual, personal musical instrument. ICME (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12 (10) (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
Small Phylogeny Problem: Character Evolution Trees. CPM (2004)
Arvind Gupta, Ramesh Krishnamurti
Parallel Algorithms For Vehicle Routing Problems. Parallel Process. Lett. 13 (4) (2003)
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) (2003)
James P. Delgrande, Arvind Gupta
Updating <=, <-chains. Inf. Process. Lett. 82 (5) (2002)
James P. Delgrande, Arvind Gupta, Tim Van Allen
A comparison of point-based approaches to qualitative temporal reasoning. Artif. Intell. 131 (1-2) (2001)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. SWAT (2000)
Arvind Gupta, Damon Kaller, Thomas C. Shermer
-Tree Complements. Algorithmica 27 (3) (2000)
Arvind Gupta, Damon Kaller, Thomas C. Shermer
On the Complements of Partial k-Trees. ICALP (1999)
James P. Delgrande, Arvind Gupta, Tim Van Allen
Point-Based Approaches to Qualitative Temporal Reasoning. AAAI/IAAI (1999)
James P. Delgrande, Arvind Gupta
Revising TimeGraph-II. Canadian Conference on AI (1998)
Arvind Gupta, Naomi Nishimura
Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21 (2) (1998)
Tim Van Allen, James P. Delgrande, Arvind Gupta
Point-Based Approaches to Qualitative Temporal Reasoning. PRICAI (1998)
Arvind Gupta, Ramesh Krishnamurti
Parallel algorithms for vehicle routing problems. HiPC (1997)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics (1997)
Arvind Gupta, Sanjeev Mahajan
Using Amplification to Compute Majority with Small Majority Gates. Comput. Complex. 6 (1) (1997)
Arvind Gupta, Russell Impagliazzo
Bounding the Size of Planar Intertwines. SIAM J. Discret. Math. 10 (3) (1997)
Arvind Gupta, Naomi Nishimura
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164 (1&2) (1996)
Arvind Gupta, Naomi Nishimura
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS (1996)
James P. Delgrande, Arvind Gupta
The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. Ann. Math. Artif. Intell. 18 (1) (1996)
James P. Delgrande, Arvind Gupta
A Representation for Efficient Temporal Reasoning. AAAI/IAAI, Vol. 1 (1996)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
Vertex Partitioning Problems On Partial k-Trees. SWAT (1996)
Arvind Gupta, Naomi Nishimura
Finding Largest Common Embeddable Subtrees. STACS (1995)
Arvind Gupta, Naomi Nishimura
The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18 (1) (1995)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
The Chi-t-Coloring Problem. STACS (1995)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
Regular-Factors In The Complements Of Partial k-Trees. WADS (1995)
Arvind Gupta, Naomi Nishimura
finding Smallest Supertrees. ISAAC (1995)
Arvind Gupta, Naomi Nishimura
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT (1994)
Arvind Gupta
Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). ICALP (1993)
Arvind Gupta
A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. LFCS (1992)
Arvind Gupta, Naomi Nishimura
The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS (1992)
Arvind Gupta, Russell Impagliazzo
Computing Planar Intertwines FOCS (1991)