default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArvind Gupta
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j27]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)
2010 – 2019
- 2019
- [j26]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): 24-27 (2019) - 2016
- [j25]Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros:
Contraction obstructions for connected graph searching. Discret. Appl. Math. 209: 27-47 (2016) - 2013
- [j24]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): S14 (2013) - 2012
- [j23]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): 439-454 (2012) - 2011
- [c41]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227 - [c40]Pankaj Jalote, Arvind Gupta:
Using global pairs for reducing software development time. ISEC 2011: 115-118 - [c39]Ján Manuch, Murray Patterson, Arvind Gupta:
Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA 2011: 440-451 - 2010
- [j22]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: 217-232 (2010) - [j21]Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan Remy Brinkman:
Data reduction for spectral clustering to analyze high throughput flow cytometry data. BMC Bioinform. 11: 403 (2010) - [j20]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): 1435-1449 (2010) - [c38]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264
2000 – 2009
- 2009
- [j19]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): 2310-2324 (2009) - [j18]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): 19-30 (2009) - [j17]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): 769-802 (2009) - [c37]Mehdi Karimi, Arvind Gupta:
Minimum Cost Homomorphism to Oriented Cycles with Some Loops. CATS 2009: 7-17 - [c36]Ján Manuch, Murray Patterson, Arvind Gupta:
On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON 2009: 268-276 - 2008
- [j16]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): 832-847 (2008) - [c35]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: 49-58 - [c34]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 - [c33]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
A Robust Class of Stable Proteins in the 2D HPC Model. BIRD 2008: 180-192 - [c32]Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA 2008: 374-383 - [c31]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298 - [c30]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193 - 2007
- [c29]Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta:
An efficient data structure for applying multiple seeds in homology search. BIBE 2007: 1374-1378 - [c28]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 - [c27]Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta:
Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI 2007: 161-166 - [c26]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132 - [i2]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. CoRR abs/0708.2514 (2007) - [i1]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. CoRR abs/0712.0804 (2007) - 2006
- [j15]Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho:
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4(6): 1309-1328 (2006) - [c25]Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta:
Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306 - [c24]Jonathan 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 - 2005
- [j14]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-connected graphs of pathwidth k. Discret. Appl. Math. 145(2): 242-265 (2005) - [j13]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Ordered 3-colorings. Electron. Notes Discret. Math. 22: 299-300 (2005) - [j12]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12(10): 1328-1345 (2005) - [c23]Mat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta:
DJammer: a new digital, mobile, virtual, personal musical instrument. ICME 2005: 65-68 - 2004
- [c22]Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu:
Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243 - [c21]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318 - [c20]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208 - 2003
- [j11]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): 87-91 (2003) - [j10]Arvind Gupta, Ramesh Krishnamurti:
Parallel Algorithms For Vehicle Routing Problems. Parallel Process. Lett. 13(4): 673-687 (2003) - 2002
- [j9]James P. Delgrande, Arvind Gupta:
Updating <=, <-chains. Inf. Process. Lett. 82(5): 261-268 (2002) - 2001
- [j8]James 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
- [j7]Arvind Gupta, Damon Kaller, Thomas C. Shermer:
Linear-Time Algorithms for Partial k-Tree Complements. Algorithmica 27(3): 254-274 (2000) - [c19]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
1990 – 1999
- 1999
- [c18]James P. Delgrande, Arvind Gupta, Tim Van Allen:
Point-Based Approaches to Qualitative Temporal Reasoning. AAAI/IAAI 1999: 739-744 - [c17]Arvind Gupta, Damon Kaller, Thomas C. Shermer:
On the Complements of Partial k-Trees. ICALP 1999: 382-391 - [e1]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. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0 [contents] - 1998
- [j6]Arvind Gupta, Naomi Nishimura:
Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998) - [c16]James P. Delgrande, Arvind Gupta:
Revising TimeGraph-II. Canadian AI 1998: 349-362 - [c15]Tim Van Allen, James P. Delgrande, Arvind Gupta:
Point-Based Approaches to Qualitative Temporal Reasoning. PRICAI 1998: 305-316 - 1997
- [j5]Arvind Gupta, Sanjeev Mahajan:
Using Amplification to Compute Majority with Small Majority Gates. Comput. Complex. 6(1): 46-63 (1997) - [j4]Arvind Gupta, Russell Impagliazzo:
Bounding the Size of Planar Intertwines. SIAM J. Discret. Math. 10(3): 337-358 (1997) - [c14]Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics 1997: 143-158 - [c13]Arvind Gupta, Ramesh Krishnamurti:
Parallel algorithms for vehicle routing problems. HiPC 1997: 144-151 - 1996
- [j3]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) - [j2]Arvind Gupta, Naomi Nishimura:
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996) - [c12]James P. Delgrande, Arvind Gupta:
A Representation for Efficient Temporal Reasoning. AAAI/IAAI, Vol. 1 1996: 381-388 - [c11]Arvind Gupta, Naomi Nishimura:
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464 - [c10]Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172 - 1995
- [j1]Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995) - [c9]Arvind Gupta, Naomi Nishimura:
finding Smallest Supertrees. ISAAC 1995: 112-121 - [c8]Arvind Gupta, Naomi Nishimura:
Finding Largest Common Embeddable Subtrees. STACS 1995: 397-408 - [c7]Damon Kaller, Arvind Gupta, Thomas C. Shermer:
The Chi-t-Coloring Problem. STACS 1995: 409-420 - [c6]Damon Kaller, Arvind Gupta, Thomas C. Shermer:
Regular-Factors In The Complements Of Partial k-Trees. WADS 1995: 403-414 - 1994
- [c5]Arvind Gupta, Naomi Nishimura:
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182 - 1993
- [c4]Arvind Gupta:
Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). ICALP 1993: 359-370 - 1992
- [c3]Arvind Gupta:
A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. LFCS 1992: 174-185 - [c2]Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS 1992: 21-32 - 1991
- [b1]Arvind Gupta:
Constructivity issues in tree minors. University of Toronto, Canada, 1991 - [c1]Arvind Gupta, Russell Impagliazzo:
Computing Planar Intertwines. FOCS 1991: 802-811
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
