Computing Planar Intertwines - Arvind Gupta; Russell Impagliazzo (FOCS, 1991)

Constructivity issues in tree minors. - Arvind Gupta (1991)

A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. - Arvind Gupta (LFCS, 1992)

The Parallel Complexity of Tree Embedding Problems (Extended Abstract). - Arvind Gupta; Naomi Nishimura (STACS, 1992)

Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). - Arvind Gupta (ICALP, 1993)

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. - Arvind Gupta; Naomi Nishimura (SWAT, 1994)

finding Smallest Supertrees. - Arvind Gupta; Naomi Nishimura (ISAAC, 1995)

Finding Largest Common Embeddable Subtrees. - Arvind Gupta; Naomi Nishimura (STACS, 1995)

The Chi-t-Coloring Problem. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (STACS, 1995)

Regular-Factors In The Complements Of Partial k-Trees. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (WADS, 1995)

The Parallel Complexity of Tree Embedding Problems. - Arvind Gupta; Naomi Nishimura (J. Algorithms, 1995)

A Representation for Efficient Temporal Reasoning. - James P. Delgrande; Arvind Gupta (AAAI/IAAI, Vol. 1, 1996)

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. - Arvind Gupta; Naomi Nishimura (STACS, 1996)

Vertex Partitioning Problems On Partial k-Trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (SWAT, 1996)

The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. - James P. Delgrande; Arvind Gupta (Ann. Math. Artif. Intell., 1996)

The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. - Arvind Gupta; Naomi Nishimura (Theor. Comput. Sci., 1996)

The generalized matching problem on partial $k$-trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (Contemporary Trends in Discrete Mathematics, 1997)

Using Amplification to Compute Majority with Small Majority Gates. - Arvind Gupta; Sanjeev Mahajan (Comput. Complex., 1997)

Bounding the Size of Planar Intertwines. - Arvind Gupta; Russell Impagliazzo (SIAM J. Discret. Math., 1997)

Revising TimeGraph-II. - James P. Delgrande; Arvind Gupta (Canadian AI, 1998)

Finding Largest Subtrees and Smallest Supertrees. - Arvind Gupta; Naomi Nishimura (Algorithmica, 1998)

Point-Based Approaches to Qualitative Temporal Reasoning. - James P. Delgrande; Arvind Gupta; Tim Van Allen (AAAI/IAAI, 1999)

On the Complements of Partial k-Trees. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (ICALP, 1999)

Linear-Time Algorithms for Partial k-Tree Complements. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (Algorithmica, 2000)

A comparison of point-based approaches to qualitative temporal reasoning. - James P. Delgrande; Arvind Gupta; Tim Van Allen (Artif. Intell., 2001)

Updating <=, <-chains. - James P. Delgrande; Arvind Gupta (Inf. Process. Lett., 2002)

A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. - Daya Ram Gaur; Arvind Gupta; Ramesh Krishnamurti (Inf. Process. Lett., 2003)

Parallel Algorithms For Vehicle Routing Problems. - Arvind Gupta; Ramesh Krishnamurti (Parallel Process. Lett., 2003)

Small Phylogeny Problem: Character Evolution Trees. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Chenchen Zhu (CPM, 2004)

Inverse Protein Folding in 2D HP Mode (Extended Abstract). - Arvind Gupta; Ján Manuch; Ladislav Stacho (CSB, 2004)

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. - Arvind Gupta; Ján Manuch; Ladislav Stacho (SIROCCO, 2004)

DJammer: a new digital, mobile, virtual, personal musical instrument. - Mat Hans; April Slayden; Mark Smith; Banny Banerjee; Arvind Gupta (ICME, 2005)

Embeddings of k-connected graphs of pathwidth k. - Arvind Gupta; Naomi Nishimura; Andrzej Proskurowski; Prabhakar Ragde (Discret. Appl. Math., 2005)

Ordered 3-colorings. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (Electron. Notes Discret. Math., 2005)

Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. - Arvind Gupta; Ján Manuch; Ladislav Stacho (J. Comput. Biol., 2005)

Constructing Camin-Sokal Phylogenies Via Answer Set Programming. - Jonathan Kavanagh; David G. Mitchell; Eugenia Ternovska; Ján Manuch; Xiaohong Zhao; Arvind Gupta (LPAR, 2006)

Characterization of the Existence of Galled-tree Networks. - Arvind Gupta; Ján Manuch; Xiaohong Zhao; Ladislav Stacho (J. Bioinform. Comput. Biol., 2006)

An efficient data structure for applying multiple seeds in homology search. - Alireza Hadj Khodabakhshi; Mehdi Mirzazadeh; Arvind Gupta (BIBE, 2007)

Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. - Arvind Gupta; Mehdi Karimi 001; Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey (BIOCOMP, 2007)

Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. - Murray Patterson; Yongmei Liu 001; Eugenia Ternovska; Arvind Gupta (IJCAI, 2007)

Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (ISBRA, 2007)

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs - Arvind Gupta; Gregory Z. Gutin; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (CoRR, 2007)

Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. - Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey; Arvind Gupta (APBC, 2008)

Inverse protein folding in 3D hexagonal prism lattice under HP model. - Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey; Arvind Gupta (BIOCOMP, 2008)

A Robust Class of Stable Proteins in the 2D HPC Model. - Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey; Arvind Gupta (BIRD, 2008)

Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. - Arvind Gupta; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (COCOA, 2008)

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (COCOON, 2008)

Minimum Cost Homomorphisms to Reflexive Digraphs. - Arvind Gupta; Pavol Hell; Mehdi Karimi 001; Arash Rafiey (LATIN, 2008)

On the Complexity of Ordered Colorings. - Arvind Gupta; Jan van den Heuvel; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (SIAM J. Discret. Math., 2008)

Minimum Cost Homomorphism to Oriented Cycles with Some Loops. - Mehdi Karimi 001; Arvind Gupta (CATS, 2009)

On the Generalised Character Compatibility Problem for Non-branching Character Trees. - Ján Manuch; Murray Patterson; Arvind Gupta (COCOON, 2009)

Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (Discret. Appl. Math., 2009)

Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. - Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey; Arvind Gupta (J. Comput. Biol., 2009)

Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. - Alireza Hadj Khodabakhshi; Ján Manuch; Arash Rafiey; Arvind Gupta (J. Comput. Biol., 2009)

Prediction of human protein kinase substrate specificities. - Javad Safaei; Ján Manuch; Arvind Gupta; Ladislav Stacho; Steven Pelech (BIBM, 2010)

Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. - Arvind Gupta; Gregory Z. Gutin; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (Australas. J Comb., 2010)

Data reduction for spectral clustering to analyze high throughput flow cytometry data. - Habil Zare; Parisa Shooshtari; Arvind Gupta; Ryan Remy Brinkman (BMC Bioinform., 2010)

Haplotype Inferring via Galled-Tree Networks Is NP-Complete. - Arvind Gupta; Mohammad M. Karimi; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (J. Comput. Biol., 2010)

Evolutionary Conservation of Human Phosphorylation Sites. - Javad Safaei; Ján Manuch; Arvind Gupta; Ladislav Stacho; Steven Pelech (BIBM, 2011)

Using global pairs for reducing software development time. - Pankaj Jalote; Arvind Gupta (ISEC, 2011)

Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. - Ján Manuch; Murray Patterson; Arvind Gupta (ISBRA, 2011)

Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. - Arvind Gupta; Ján Manuch; Ladislav Stacho; Xiaohong Zhao (J. Comput. Biol., 2012)

Scoring relevancy of features based on combinatorial analysis of Lasso with application to lymphoma diagnosis. - Habil Zare; Gholamreza Haffari; Arvind Gupta; Ryan Remy Brinkman (BMC Genom., 2013)

Contraction obstructions for connected graph searching. - Micah J. Best; Arvind Gupta; Dimitrios M. Thilikos; Dimitris Zoros (Discret. Appl. Math., 2016)

Reflections on the Ingredients for Success in AI Research: An Interview with Arvind Gupta. - Arvind Gupta; Biplav Srivastava; Daby Sow; Ching-Hua Chen; Oshani Seneviratne (AI Mag., 2019)

Computer-aided engineering analysis for the performance augmentation of a fin-tube heat exchanger using vortex generator. - Sachin Gupta; Aditya Roy; Arvind Gupta (Concurr. Eng. Res. Appl., 2020)

Creating a Joint-Faculty Artificial Intelligence Concentration within a Graduate Program. - En-Shiun Annie Lee; Arvind Gupta; Amane Takeuchi; Stacey A. Koornneef (SIGCSE (2), 2025)

CLEP-GAN: An Innovative Approach to Subject-Independent ECG Reconstruction from PPG Signals. - Xiaoyan Li; Shixin Xu; Faisal Habib; Neda Aminnejad; Arvind Gupta; Huaxiong Huang (CoRR, 2025)

Beyond 1D: Vision Transformers and Multichannel Signal Images for PPG-to-ECG Reconstruction. - Xiaoyan Li; Shixin Xu; Faisal Habib; Arvind Gupta; Huaxiong Huang (CoRR, 2025)