| 2025 | SIGCSE | Creating a Joint-Faculty Artificial Intelligence Concentration within a Graduate Program. | En-Shiun Annie Lee, Arvind Gupta, Amane Takeuchi, Stacey A. Koornneef |
| 2009 | COCOON | On the Generalised Character Compatibility Problem for Non-branching Character Trees. | Jn Manuch, Murray Patterson, Arvind Gupta |
| 2008 | APBC | Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. | Alireza Hadj Khodabakhshi, Jn Manuch, Arash Rafiey, Arvind Gupta |
| 2008 | COCOA | Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. | Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey |
| 2008 | COCOON | Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. | Arvind Gupta, Jn Manuch, Ladislav Stacho, Xiaohong Zhao |
| 2008 | LATIN | Minimum Cost Homomorphisms to Reflexive Digraphs. | Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey |
| 2007 | BIBE | An efficient data structure for applying multiple seeds in homology search. | Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta |
| 2007 | IJCAI | Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. | Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta |
| 2006 | APBC | Characterization of the Existence of Galled-Tree Networks. | Jn Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta |
| 2006 | LPAR | Constructing Camin-Sokal Phylogenies Via Answer Set Programming. | Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Jn Manuch, Xiaohong Zhao, Arvind Gupta |
| 2004 | CPM | Small Phylogeny Problem: Character Evolution Trees. | Arvind Gupta, Jn Manuch, Ladislav Stacho, Chenchen Zhu |
| 2004 | SIROCCO | Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. | Arvind Gupta, Jn Manuch, Ladislav Stacho |
| 1999 | AAAI | Point-Based Approaches to Qualitative Temporal Reasoning. | James P. Delgrande, Arvind Gupta, Tim Van Allen |
| 1999 | ICALP | On the Complements of Partial k-Trees. | Arvind Gupta, Damon Kaller, Thomas C. Shermer |
| 1998 | AI | Revising TimeGraph-II. | James P. Delgrande, Arvind Gupta |
| 1998 | PRICAI | Point-Based Approaches to Qualitative Temporal Reasoning. | Tim Van Allen, James P. Delgrande, Arvind Gupta |
| 1997 | HiPC | Parallel algorithms for vehicle routing problems. | Arvind Gupta, Ramesh Krishnamurti |
| 1996 | AAAI | A Representation for Efficient Temporal Reasoning. | James P. Delgrande, Arvind Gupta |
| 1996 | STACS | Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. | Arvind Gupta, Naomi Nishimura |
| 1995 | ISAAC | finding Smallest Supertrees. | Arvind Gupta, Naomi Nishimura |
| 1995 | STACS | Finding Largest Common Embeddable Subtrees. | Arvind Gupta, Naomi Nishimura |
| 1995 | STACS | The Chi-t-Coloring Problem. | Damon Kaller, Arvind Gupta, Thomas C. Shermer |
| 1995 | WADS | Regular-Factors In The Complements Of Partial k-Trees. | Damon Kaller, Arvind Gupta, Thomas C. Shermer |
| 1993 | ICALP | Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). | Arvind Gupta |
| 1992 | LFCS | A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. | Arvind Gupta |
| 1992 | STACS | The Parallel Complexity of Tree Embedding Problems (Extended Abstract). | Arvind Gupta, Naomi Nishimura |
| 1991 | FOCS | Computing Planar Intertwines | Arvind Gupta, Russell Impagliazzo |