Arvind Gupta

According to our database, Arvind Gupta authored at least 66 papers between 1991 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

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

2019

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

2016

Contraction obstructions for connected graph searching.

Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros

Discret. Appl. Math., 2016

2013

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

2012

Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

J. Comput. Biol., 2012

2011

Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees.

Ján Manuch, Murray Patterson, Arvind Gupta

Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

Using global pairs for reducing software development time.

Pankaj Jalote, Arvind Gupta

Proceedings of the Proceeding of the 4th Annual India Software Engineering Conference, 2011

Evolutionary Conservation of Human Phosphorylation Sites.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

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

Data reduction for spectral clustering to analyze high throughput flow cytometry data.

Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan Remy Brinkman

BMC Bioinform., 2010

Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.

Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey

Australas. J Comb., 2010

Prediction of human protein kinase substrate specificities.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

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

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

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

On the Generalised Character Compatibility Problem for Non-branching Character Trees.

Ján Manuch, Murray Patterson, Arvind Gupta

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Minimum Cost Homomorphism to Oriented Cycles with Some Loops.

Mehdi Karimi, Arvind Gupta

Proceedings of the Theory of Computing 2009, 2009

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 Homomorphisms to Reflexive Digraphs.

Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.

Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey

Proceedings of the Combinatorial Optimization and Applications, 2008

A Robust Class of Stable Proteins in the 2D HPC Model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the Bioinformatics Research and Development, 2008

Inverse protein folding in 3D hexagonal prism lattice under HP model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey

CoRR, 2007

Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions.

Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta

Proceedings of the IJCAI 2007, 2007

Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model.

Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

An efficient data structure for applying multiple seeds in homology search.

Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006

Characterization of the Existence of Galled-tree Networks.

Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho

J. Bioinform. Comput. Biol., 2006

Constructing Camin-Sokal Phylogenies Via Answer Set Programming.

Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta

Proceedings of the Logic for Programming, 2006

2005

Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model.

Arvind Gupta, Ján Manuch, Ladislav Stacho

J. Comput. Biol., 2005

Ordered 3-colorings.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Electron. Notes Discret. Math., 2005

Embeddings of <i>k</i>-connected graphs of pathwidth <i>k</i>.

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde

Discret. Appl. Math., 2005

DJammer: a new digital, mobile, virtual, personal musical instrument.

Mat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta

Proceedings of the 2005 IEEE International Conference on Multimedia and Expo, 2005

2004

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the Structural Information and Communication Complexity, 2004

Inverse Protein Folding in 2D HP Mode (Extended Abstract).

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Small Phylogeny Problem: Character Evolution Trees.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Parallel Algorithms For Vehicle Routing Problems.

Arvind Gupta, Ramesh Krishnamurti

Parallel Process. Lett., 2003

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

2002

Updating <=, <-chains.

James P. Delgrande, Arvind Gupta

Inf. Process. Lett., 2002

2001

A comparison of point-based approaches to qualitative temporal reasoning.

James P. Delgrande, Arvind Gupta, Tim Van Allen

Artif. Intell., 2001

2000

Linear-Time Algorithms for Partial <i>k</i>-Tree Complements.

Arvind Gupta, Damon Kaller, Thomas C. Shermer

Algorithmica, 2000

1999

On the Complements of Partial k-Trees.

Arvind Gupta, Damon Kaller, Thomas C. Shermer

Proceedings of the Automata, 1999

Point-Based Approaches to Qualitative Temporal Reasoning.

James P. Delgrande, Arvind Gupta, Tim Van Allen

Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998

Finding Largest Subtrees and Smallest Supertrees.

Arvind Gupta, Naomi Nishimura

Algorithmica, 1998

Revising TimeGraph-II.

James P. Delgrande, Arvind Gupta

Proceedings of the Advances in Artificial Intelligence, 1998

1997

Bounding the Size of Planar Intertwines.

Arvind Gupta, Russell Impagliazzo

SIAM J. Discret. Math., 1997

Using Amplification to Compute Majority with Small Majority Gates.

Arvind Gupta, Sanjeev Mahajan

Comput. Complex., 1997

The generalized matching problem on partial $k$-trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees.

Arvind Gupta, Naomi Nishimura

Theor. Comput. Sci., 1996

The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae.

James P. Delgrande, Arvind Gupta

Ann. Math. Artif. Intell., 1996

Vertex Partitioning Problems On Partial k-Trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Algorithm Theory, 1996

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.

Arvind Gupta, Naomi Nishimura

Proceedings of the STACS 96, 1996

A Representation for Efficient Temporal Reasoning.

James P. Delgrande, Arvind Gupta

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

The Parallel Complexity of Tree Embedding Problems.

Arvind Gupta, Naomi Nishimura

J. Algorithms, 1995

Regular-Factors In The Complements Of Partial k-Trees.

Damon Kaller, Arvind Gupta, Thomas C. Shermer

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The Chi-t-Coloring Problem.

Damon Kaller, Arvind Gupta, Thomas C. Shermer

Proceedings of the STACS 95, 1995

Finding Largest Common Embeddable Subtrees.

Arvind Gupta, Naomi Nishimura

Proceedings of the STACS 95, 1995

finding Smallest Supertrees.

Arvind Gupta, Naomi Nishimura

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees.

Arvind Gupta, Naomi Nishimura

Proceedings of the Algorithm Theory, 1994

1993

Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract).

Arvind Gupta

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

The Parallel Complexity of Tree Embedding Problems (Extended Abstract).

Arvind Gupta, Naomi Nishimura

Proceedings of the STACS 92, 1992

A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors.

Arvind Gupta

Proceedings of the Logical Foundations of Computer Science, 1992

1991

Constructivity issues in tree minors.

Arvind Gupta

PhD thesis, 1991

Computing Planar Intertwines

Arvind Gupta, Russell Impagliazzo

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991