Arvind Gupta - RankMe

76 papers A* 4A 5B 10C 2Misc 4Journal 32Unranked 18

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Beyond 1D: Vision Transformers and Multichannel Signal Images for PPG-to-ECG Reconstruction. CoRR Xiaoyan Li, Shixin Xu, Faisal Habib, Arvind Gupta, Huaxiong Huang
2025	J	`jnl`	CLEP-GAN: An Innovative Approach to Subject-Independent ECG Reconstruction from PPG Signals. CoRR Xiaoyan Li, Shixin Xu, Faisal Habib, Neda Aminnejad, Arvind Gupta, Huaxiong Huang
2025	J	`jnl`	CLEP-GAN: an innovative approach to subject-independent ECG reconstruction from PPG signals. BMC Bioinform. Xiaoyan Li, Shixin Xu, Faisal Habib, Neda Aminnejad, Arvind Gupta, Huaxiong Huang
2025	—	`conf`	Creating a Joint-Faculty Artificial Intelligence Concentration within a Graduate Program. SIGCSE (2) En-Shiun Annie Lee, Arvind Gupta, Amane Takeuchi, Stacey A. Koornneef
2020	J	`jnl`	Computer-aided engineering analysis for the performance augmentation of a fin-tube heat exchanger using vortex generator. Concurr. Eng. Res. Appl. Sachin Gupta, Aditya Roy, Arvind Gupta
2019	J	`jnl`	Reflections on the Ingredients for Success in AI Research: An Interview with Arvind Gupta. AI Mag. Arvind Gupta, Biplav Srivastava, Daby Sow, Ching-Hua Chen, Oshani Seneviratne
2016	J	`jnl`	Contraction obstructions for connected graph searching. Discret. Appl. Math. Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
2013	J	`jnl`	Scoring relevancy of features based on combinatorial analysis of Lasso with application to lymphoma diagnosis. BMC Genom. Habil Zare, Gholamreza Haffari, Arvind Gupta, Ryan Remy Brinkman
2012	J	`jnl`	Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2011	—	`conf`	Evolutionary Conservation of Human Phosphorylation Sites. BIBM Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
2011	—	`conf`	Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA Ján Manuch, Murray Patterson, Arvind Gupta
2011	—	`conf`	Using global pairs for reducing software development time. ISEC Pankaj Jalote, Arvind Gupta
2010	J	`jnl`	Data reduction for spectral clustering to analyze high throughput flow cytometry data. BMC Bioinform. Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan Remy Brinkman
2010	J	`jnl`	Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2010	J	`jnl`	Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2010	—	`conf`	Prediction of human protein kinase substrate specificities. BIBM Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
2009	J	`jnl`	Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2009	J	`jnl`	Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. J. Comput. Biol. Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
2009	—	`conf`	Minimum Cost Homomorphism to Oriented Cycles with Some Loops. CATS Mehdi Karimi, Arvind Gupta
2009	Misc	`conf`	On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON Ján Manuch, Murray Patterson, Arvind Gupta
2009	J	`jnl`	Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. J. Comput. Biol. Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
2008	—	`conf`	A Robust Class of Stable Proteins in the 2D HPC Model. BIRD Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
2008	Misc	`conf`	Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2008	—	`conf`	Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
2008	C	`conf`	Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2008	B	`conf`	Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
2008	J	`jnl`	On the Complexity of Ordered Colorings. SIAM J. Discret. Math. Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2008	B	`conf`	Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. APBC Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
2007	—	`conf`	Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2007	C	`conf`	An efficient data structure for applying multiple seeds in homology search. BIBE Alireza Hadj Khodabakhshi, Mehdi Mirzazadeh, Arvind Gupta
2007	—	`conf`	Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. BIOCOMP Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey
2007	A*	`conf`	Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta
2007	J	`jnl`	Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2007	J	`jnl`	Minimum Cost Homomorphisms to Reflexive Digraphs CoRR Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
2006	B	`conf`	Characterization of the Existence of Galled-Tree Networks. APBC Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
2006	J	`jnl`	Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
2006	B	`conf`	Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
2005	A	`conf`	DJammer: a new digital, mobile, virtual, personal musical instrument. ICME Mat Hans, April Slayden, Mark Smith, Banny Banerjee, Arvind Gupta
2005	J	`jnl`	Embeddings of Discret. Appl. Math. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2005	J	`jnl`	Ordered 3-colorings. Electron. Notes Discret. Math. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
2005	J	`jnl`	Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	B	`conf`	Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	—	`conf`	Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB Arvind Gupta, Ján Manuch, Ladislav Stacho
2004	B	`conf`	Small Phylogeny Problem: Character Evolution Trees. CPM Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
2003	J	`jnl`	A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti
2003	J	`jnl`	Parallel Algorithms For Vehicle Routing Problems. Parallel Process. Lett. Arvind Gupta, Ramesh Krishnamurti
2002	J	`jnl`	Updating <=, <-chains. Inf. Process. Lett. James P. Delgrande, Arvind Gupta
2001	J	`jnl`	A comparison of point-based approaches to qualitative temporal reasoning. Artif. Intell. James P. Delgrande, Arvind Gupta, Tim Van Allen
2000	—	`conf`	Embeddings of SWAT Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2000	J	`jnl`	Linear-Time Algorithms for Partial Algorithmica Arvind Gupta, Damon Kaller, Thomas C. Shermer
1999	B	`ed.`	Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings WADS Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia
1999	A*	`conf`	On the Complements of Partial k-Trees. ICALP Arvind Gupta, Damon Kaller, Thomas C. Shermer
1999	—	`conf`	Point-Based Approaches to Qualitative Temporal Reasoning. AAAI/IAAI James P. Delgrande, Arvind Gupta, Tim Van Allen
1998	J	`jnl`	Finding Largest Subtrees and Smallest Supertrees. Algorithmica Arvind Gupta, Naomi Nishimura
1998	B	`conf`	Point-Based Approaches to Qualitative Temporal Reasoning. PRICAI Tim Van Allen, James P. Delgrande, Arvind Gupta
1998	—	`conf`	Revising TimeGraph-II. Canadian AI James P. Delgrande, Arvind Gupta
1997	J	`jnl`	Bounding the Size of Planar Intertwines. SIAM J. Discret. Math. Arvind Gupta, Russell Impagliazzo
1997	Misc	`conf`	Parallel algorithms for vehicle routing problems. HiPC Arvind Gupta, Ramesh Krishnamurti
1997	—	`conf`	The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
1997	J	`jnl`	Using Amplification to Compute Majority with Small Majority Gates. Comput. Complex. Arvind Gupta, Sanjeev Mahajan
1996	—	`conf`	A Representation for Efficient Temporal Reasoning. AAAI/IAAI, Vol. 1 James P. Delgrande, Arvind Gupta
1996	A	`conf`	Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS Arvind Gupta, Naomi Nishimura
1996	J	`jnl`	The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. Ann. Math. Artif. Intell. James P. Delgrande, Arvind Gupta
1996	J	`jnl`	The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. Arvind Gupta, Naomi Nishimura
1996	—	`conf`	Vertex Partitioning Problems On Partial k-Trees. SWAT Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
1995	A	`conf`	Finding Largest Common Embeddable Subtrees. STACS Arvind Gupta, Naomi Nishimura
1995	B	`conf`	Regular-Factors In The Complements Of Partial k-Trees. WADS Damon Kaller, Arvind Gupta, Thomas C. Shermer
1995	A	`conf`	The Chi-t-Coloring Problem. STACS Damon Kaller, Arvind Gupta, Thomas C. Shermer
1995	J	`jnl`	The Parallel Complexity of Tree Embedding Problems. J. Algorithms Arvind Gupta, Naomi Nishimura
1995	B	`conf`	finding Smallest Supertrees. ISAAC Arvind Gupta, Naomi Nishimura
1994	—	`conf`	Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT Arvind Gupta, Naomi Nishimura
1993	A*	`conf`	Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). ICALP Arvind Gupta
1992	Misc	`conf`	A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. LFCS Arvind Gupta
1992	A	`conf`	The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS Arvind Gupta, Naomi Nishimura
1991	A*	`conf`	Computing Planar Intertwines FOCS Arvind Gupta, Russell Impagliazzo
1991	—	`—`	Constructivity issues in tree minors. Arvind Gupta