The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Giri Narasimhan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wei Peng, Tao Li, Giri Narasimhan
    Mining the Database of Transcription Binding Sites. [Citation Graph (0, 0)][DBLP]
    BIBE, 2006, pp:61-64 [Conf]
  2. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:303-308 [Conf]
  3. Heidi L. Alvarez, David C. Chatfield, Donald A. Cox, Eric Crumpler, Cassian D'Cunha, Ronald Gutierrez, Julio Ibarra, Eric Johnson, Kuldeep Kumar, Tom Milledge, Giri Narasimhan, S. Masoud Sadjadi, Chi Zhang
    CyberBridges A Model Collaboration Infrastructure for e-Science. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2007, pp:65-72 [Conf]
  4. Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan
    Resource-Constrained Geometric Network Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:307-316 [Conf]
  5. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
    New Sparseness Results on Graph Spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:192-201 [Conf]
  6. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Optimally Sparse Spanners in 3-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:53-62 [Conf]
  7. Gautam Das, Giri Narasimhan
    A Fast Algorithm for Constructing Sparse Euclidean Spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:132-139 [Conf]
  8. Gautam Das, Giri Narasimhan
    Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:259-266 [Conf]
  9. Patricia Buendia, Giri Narasimhan
    MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies. [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:110-119 [Conf]
  10. Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan
    Clustering Genes Using Gene Expression and Text Literature Data. [Citation Graph (0, 0)][DBLP]
    CSB, 2005, pp:329-340 [Conf]
  11. Xintao Wei, David N. Kuhn, Giri Narasimhan
    Degenerate Primer Design via Clustering. [Citation Graph (0, 0)][DBLP]
    CSB, 2003, pp:75-83 [Conf]
  12. Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan
    Region-Restricted Clustering for Geographic Data Mining. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:399-410 [Conf]
  13. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-Preserving Approximations of Polygonal Paths. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:217-228 [Conf]
  14. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2002, pp:26-35 [Conf]
  15. Patricia Buendia, Timothy M. Collins, Giri Narasimhan
    Reconstructing Ancestor-Descendant Lineages from Serially-Sampled Data: A Comparison Study. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:807-814 [Conf]
  16. Tom Milledge, Gaolin Zheng, Giri Narasimhan
    Discovering Sequence-Structure Patterns in Proteins with Variable Secondary Structure. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:702-709 [Conf]
  17. Yong Wang, Chengyong Yang, Kalai Mathee, Giri Narasimhan
    Clustering Using Adaptive Self-organizing Maps (ASOM) and Applications. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:944-951 [Conf]
  18. Gaolin Zheng, Tom Milledge, E. Olusegun George, Giri Narasimhan
    Pooling Evidence to Identify Cell Cycle-Regulated Genes. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:694-701 [Conf]
  19. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate Distance Oracles Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:357-368 [Conf]
  20. Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid
    Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:849-858 [Conf]
  21. Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan
    A Knowledge-Driven Method to Evaluate Multi-source Clustering. [Citation Graph (0, 0)][DBLP]
    ISPA Workshops, 2005, pp:196-202 [Conf]
  22. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:28-38 [Conf]
  23. Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
    Algorithms for facility location problems with outliers. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:642-651 [Conf]
  24. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe
    A New Way to Weigh Malnourished Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:215-222 [Conf]
  25. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate distance oracles for geometric graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:828-837 [Conf]
  26. Yuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang
    Motif Detection in Protein Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE/CRIWG, 1999, pp:63-72 [Conf]
  27. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:38-49 [Conf]
  28. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Fast Pruning of Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:508-520 [Conf]
  29. Giri Narasimhan, Michiel H. M. Smid
    Approximation Algorithms for the Bottleneck Stretch Factor Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:502-513 [Conf]
  30. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:186-195 [Conf]
  31. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:119-130 [Conf]
  32. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:314-327 [Conf]
  33. Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
    Optimal Algorithms for Two-Guard Walkability of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:438-449 [Conf]
  34. Gautam Das, Giri Narasimhan
    Geometric Searching and Link Distance (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:261-272 [Conf]
  35. Giri Narasimhan
    On Hamiltonian Triangulations in Simple Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:321-330 [Conf]
  36. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Improved Algorithms for Constructing Fault-Tolerant Spanners. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:144-156 [Journal]
  37. Patricia Buendia, Giri Narasimhan
    Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant network. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:18, pp:2313-2314 [Journal]
  38. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan
    Optimally computing a shortest weakly visible line segment inside a simple polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:1-29 [Journal]
  39. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal]
  40. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:37-57 [Journal]
  41. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:183-196 [Journal]
  42. Arun K. Jagota, Giri Narasimhan, Lubomír Soltés
    A Generalization of maximal independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:3, pp:223-235 [Journal]
  43. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:303-316 [Journal]
  44. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
    New sparseness results on graph spanners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:125-144 [Journal]
  45. Gautam Das, Giri Narasimhan
    A Fast Algorithm for Constructing Sparse Euclidean Spanners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:297-315 [Journal]
  46. Giri Narasimhan
    On Hamiltonian Triangulations in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:261-275 [Journal]
  47. Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan
    Information capacity of binary weights associative memories. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 1998, v:19, n:1-3, pp:35-58 [Journal]
  48. Giri Narasimhan
    A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:4, pp:167-170 [Journal]
  49. Giri Narasimhan, Changsong Bu, Yuan Gao, Xuning Wang, Ning Xu, Kalai Mathee
    Mining Protein Sequences for Motifs. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:5, pp:707-720 [Journal]
  50. Giri Narasimhan, Martin Zachariasen
    Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:6- [Journal]
  51. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating a Minimum Manhattan Network. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:2, pp:219-232 [Journal]
  52. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Finding all Weakly-Visible Chords of a Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:433-457 [Journal]
  53. Giri Narasimhan, Michiel H. M. Smid
    Approximation Algorithms for the Bottleneck Stretch Factor Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:13-31 [Journal]
  54. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1479-1500 [Journal]
  55. Giri Narasimhan, Michiel H. M. Smid
    Approximating the Stretch Factor of Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:978-989 [Journal]
  56. Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan
    A Graph Reduction Method for 2D Snake Problems. [Citation Graph (0, 0)][DBLP]
    CVPR, 2007, pp:- [Conf]
  57. Erliang Zeng, Giri Narasimhan
    Enhancing Motif Refinement by Incorporating Comparative Genomics Data. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:329-337 [Conf]
  58. Patricia Buendia, Giri Narasimhan
    Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:109-120 [Conf]

  59. On the Effectiveness of Constraints Sets in Clustering Genes. [Citation Graph (, )][DBLP]


  60. A branch-and-bound approach to knowledge-based protein structure assembly. [Citation Graph (, )][DBLP]


  61. SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing. [Citation Graph (, )][DBLP]


  62. 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. [Citation Graph (, )][DBLP]


  63. Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks. [Citation Graph (, )][DBLP]


  64. A Functional Network of Yeast Genes Using Gene Ontology Information. [Citation Graph (, )][DBLP]


  65. Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach. [Citation Graph (, )][DBLP]


  66. Region-restricted clustering for geographic data mining. [Citation Graph (, )][DBLP]


  67. On the dilation spectrum of paths, cycles, and trees. [Citation Graph (, )][DBLP]


  68. Stability number and chromatic number of tolerance graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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