The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arvind Gupta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James P. Delgrande, Arvind Gupta
    A Representation for Efficient Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:381-388 [Conf]
  2. James P. Delgrande, Arvind Gupta, Tim Van Allen
    Point-Based Approaches to Qualitative Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1999, pp:739-744 [Conf]
  3. James P. Delgrande, Arvind Gupta
    Revising TimeGraph-II. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 1998, pp:349-362 [Conf]
  4. Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
    Characterization of the Existence of Galled-Tree Networks. [Citation Graph (0, 0)][DBLP]
    APBC, 2006, pp:297-306 [Conf]
  5. Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
    Small Phylogeny Problem: Character Evolution Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:230-243 [Conf]
  6. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Inverse Protein Folding in 2D HP Mode (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:311-318 [Conf]
  7. Arvind Gupta, Russell Impagliazzo
    Computing Planar Intertwines [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:802-811 [Conf]
  8. Arvind Gupta
    Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:359-370 [Conf]
  9. Arvind Gupta, Damon Kaller, Thomas C. Shermer
    On the Complements of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:382-391 [Conf]
  10. Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta
    Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:161-166 [Conf]
  11. Arvind Gupta, Naomi Nishimura
    finding Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:112-121 [Conf]
  12. Arvind Gupta
    A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:174-185 [Conf]
  13. Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
    Constructing Camin-Sokal Phylogenies Via Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:452-466 [Conf]
  14. Tim Van Allen, James P. Delgrande, Arvind Gupta
    Point-Based Approaches to Qualitative Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    PRICAI, 1998, pp:305-316 [Conf]
  15. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:197-208 [Conf]
  16. Arvind Gupta, Naomi Nishimura
    The Parallel Complexity of Tree Embedding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:21-32 [Conf]
  17. Arvind Gupta, Naomi Nishimura
    Finding Largest Common Embeddable Subtrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:397-408 [Conf]
  18. Arvind Gupta, Naomi Nishimura
    Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:453-464 [Conf]
  19. Damon Kaller, Arvind Gupta, Thomas C. Shermer
    The Chi-t-Coloring Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:409-420 [Conf]
  20. Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
    Vertex Partitioning Problems On Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:161-172 [Conf]
  21. Arvind Gupta, Naomi Nishimura
    Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:172-182 [Conf]
  22. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-Connected Graphs of Pathwidth k. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:111-124 [Conf]
  23. Damon Kaller, Arvind Gupta, Thomas C. Shermer
    Regular-Factors In The Complements Of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:403-414 [Conf]
  24. James P. Delgrande, Arvind Gupta, Tim Van Allen
    A comparison of point-based approaches to qualitative temporal reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:131, n:1-2, pp:135-170 [Journal]
  25. Arvind Gupta, Damon Kaller, Thomas C. Shermer
    Linear-Time Algorithms for Partial k-Tree Complements. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:254-274 [Journal]
  26. Arvind Gupta, Naomi Nishimura
    Finding Largest Subtrees and Smallest Supertrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:183-210 [Journal]
  27. James P. Delgrande, Arvind Gupta
    The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:51-67 [Journal]
  28. Arvind Gupta, Sanjeev Mahajan
    Using Amplification to Compute Majority with Small Majority Gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:1, pp:46-63 [Journal]
  29. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-connected graphs of pathwidth k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:242-265 [Journal]
  30. James P. Delgrande, Arvind Gupta
    Updating <=, <-chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:5, pp:261-268 [Journal]
  31. Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti
    A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:87-91 [Journal]
  32. Arvind Gupta, Naomi Nishimura
    The Parallel Complexity of Tree Embedding Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:1, pp:176-200 [Journal]
  33. Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
    Characterization of the Existence of Galled-tree Networks. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:6, pp:1309-1328 [Journal]
  34. Arvind Gupta, Ramesh Krishnamurti
    Parallel Algorithms For Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2003, v:13, n:4, pp:673-687 [Journal]
  35. Arvind Gupta, Russell Impagliazzo
    Bounding the Size of Planar Intertwines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:337-358 [Journal]
  36. Arvind Gupta, Naomi Nishimura
    The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:287-298 [Journal]
  37. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
    Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:121-132 [Conf]
  38. Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
    Minimum Cost Homomorphisms to Reflexive Digraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  39. Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. [Citation Graph (, )][DBLP]


  40. An efficient data structure for applying multiple seeds in homology search. [Citation Graph (, )][DBLP]


  41. Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. [Citation Graph (, )][DBLP]


  42. Inverse protein folding in 3D hexagonal prism lattice under HP model. [Citation Graph (, )][DBLP]


  43. Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. [Citation Graph (, )][DBLP]


  44. On the Generalised Character Compatibility Problem for Non-branching Character Trees. [Citation Graph (, )][DBLP]


  45. DJammer: a new digital, mobile, virtual, personal musical instrument. [Citation Graph (, )][DBLP]


  46. Minimum Cost Homomorphisms to Reflexive Digraphs. [Citation Graph (, )][DBLP]


  47. A Robust Class of Stable Proteins in the 2D HPC Model. [Citation Graph (, )][DBLP]


  48. Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. [Citation Graph (, )][DBLP]


  49. Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs [Citation Graph (, )][DBLP]


  50. Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. [Citation Graph (, )][DBLP]


Search in 0.088secs, Finished in 0.092secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002