Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Giri Narasimhan
2010 – today
- 2011
[c46]- [c45]Xing Yang, Daniel Medvin, Giri Narasimhan, Deborah Yoder-Himes, Stephen Lory: CloG: A pipeline for closing gaps in a draft assembly using short reads. ICCABS 2011: 202-207
- 2010
- [j28]Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan: Clustering Genes Using Heterogeneous Data Sources. IJKDB 1(2): 12-28 (2010)
- [j27]Ion I. Mandoiu, Giri Narasimhan, Yi Pan, Yanqing Zhang: Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 577-578 (2010)
2000 – 2009
- 2009
- [j26]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009)
- [j25]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid: On the dilation spectrum of paths, cycles, and trees. Comput. Geom. 42(9): 923-933 (2009)
- [c44]Yi Zhang, Erliang Zeng, Tao Li, Giri Narasimhan: Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks. ICMLA 2009: 539-544
- [e2]Ion I. Mandoiu, Giri Narasimhan, Yanqing Zhang (Eds.): Bioinformatics Research and Applications, 5th International Symposium, ISBRA 2009, Fort Lauderdale, FL, USA, May 13-16, 2009, Proceedings. Lecture Notes in Computer Science 5542, Springer 2009, ISBN 978-3-642-01550-2
- 2008
- [j24]Patricia Buendia, Timothy M. Collins, Giri Narasimhan: The role of internal node sequences and the molecular clock in the analysis of serially-sampled data. IJBRA 4(1): 107-121 (2008)
- [j23]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1) (2008)
- [c43]Gaolin Zheng, Giri Narasimhan: A branch-and-bound approach to knowledge-based protein structure assembly. BIBE 2008: 1-5
- [c42]Erliang Zeng, Giri Narasimhan, Lisa Schneper, Kalai Mathee: A Functional Network of Yeast Genes Using Gene Ontology Information. BIBM 2008: 343-346
- [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
- [r2]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
- [r1]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
- 2007
- [b1]Giri Narasimhan, Michiel H. M. Smid: Geometric spanner networks. Cambridge University Press 2007, pp. I-XV, 1-500
- [j22]Patricia Buendia, Giri Narasimhan: Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach. Bioinformatics 23(22): 2993-3000 (2007)
- [j21]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
- [c41]Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan: On the Effectiveness of Constraints Sets in Clustering Genes. BIBE 2007: 79-86
- [c40]Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Narasimhan: SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing. BIBE 2007: 1343-1347
- [c39]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, Seyed Masoud Sadjadi, Chi Zhang: CyberBridges A Model Collaboration Infrastructure for e-Science. CCGRID 2007: 65-72
- [c38]Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan: A Graph Reduction Method for 2D Snake Problems. CVPR 2007
- [c37]Patricia Buendia, Giri Narasimhan: Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples. ISBRA 2007: 109-120
- [c36]Erliang Zeng, Giri Narasimhan: Enhancing Motif Refinement by Incorporating Comparative Genomics Data. ISBRA 2007: 329-337
- [e1]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff (Eds.): Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- 2006
- [j20]Patricia Buendia, Giri Narasimhan: Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant network. Bioinformatics 22(18): 2313-2314 (2006)
- [c35]
- [c34]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006
- [c33]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410
- [c32]Gaolin Zheng, Tom Milledge, E. Olusegun George, Giri Narasimhan: Pooling Evidence to Identify Cell Cycle-Regulated Genes. International Conference on Computational Science (2) 2006: 694-701
- [c31]Tom Milledge, Gaolin Zheng, Giri Narasimhan: Discovering Sequence-Structure Patterns in Proteins with Variable Secondary Structure. International Conference on Computational Science (2) 2006: 702-709
- [c30]Patricia Buendia, Timothy M. Collins, Giri Narasimhan: Reconstructing Ancestor-Descendant Lineages from Serially-Sampled Data: A Comparison Study. International Conference on Computational Science (2) 2006: 807-814
- 2005
- [c29]Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan: Clustering Genes Using Gene Expression and Text Literature Data. CSB 2005: 329-340
- [c28]Yong Wang, Chengyong Yang, Kalai Mathee, Giri Narasimhan: Clustering Using Adaptive Self-organizing Maps (ASOM) and Applications. International Conference on Computational Science (2) 2005: 944-951
- [c27]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid: Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. ISAAC 2005: 849-858
- [c26]Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan: A Knowledge-Driven Method to Evaluate Multi-source Clustering. ISPA Workshops 2005: 196-202
- [c25]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
- 2004
- [j19]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
- [c24]Patricia Buendia, Giri Narasimhan: MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies. CSB 2004: 110-119
- 2003
- [j18]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
- [c23]Xintao Wei, David N. Kuhn, Giri Narasimhan: Degenerate Primer Design via Clustering. CSB 2003: 75-83
- [c22]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
- [c21]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49
- 2002
- [j17]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
- [j16]Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan: Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002)
- [j15]Giri Narasimhan, Changsong Bu, Yuan Gao, Xuning Wang, Ning Xu, Kalai Mathee: Mining Protein Sequences for Motifs. Journal of Computational Biology 9(5): 707-720 (2002)
- [j14]Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002)
- [j13]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
- [c20]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
- [c19]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
- [c18]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
- 2001
- [j12]Arun K. Jagota, Giri Narasimhan, Lubomír Soltés: A Generalization of maximal independent sets. Discrete Applied Mathematics 109(3): 223-235 (2001)
- [j11]Giri Narasimhan, Martin Zachariasen: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM Journal of Experimental Algorithmics 6: 6 (2001)
- [j10]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
- [c17]Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan: Algorithms for facility location problems with outliers. SODA 2001: 642-651
- [c16]Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513
- [c15]Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
- 2000
- [j9]Giri Narasimhan, Michiel H. M. Smid: Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. 30(3): 978-989 (2000)
- [c14]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
1990 – 1999
- 1999
- [j8]Giri Narasimhan: On Hamiltonian Triangulations in Simple Polygons. Int. J. Comput. Geometry Appl. 9(3): 261-275 (1999)
- [c13]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
- [c12]Yuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang: Motif Detection in Protein Sequences. SPIRE/CRIWG 1999: 63-72
- 1998
- [j7]Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan: Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998)
- [c11]Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan: Resource-Constrained Geometric Network Optimization. Symposium on Computational Geometry 1998: 307-316
- [c10]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195
- 1997
- [j6]Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. Comput. Geom. 7: 37-57 (1997)
- [j5]Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geometry Appl. 7(4): 297-315 (1997)
- [c9]Giri Narasimhan: On Hamiltonian Triangulations in Simple Polygons (Extended Abstract). WADS 1997: 321-330
- 1995
- [j4]Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New sparseness results on graph spanners. Int. J. Comput. Geometry Appl. 5: 125-144 (1995)
- [c8]Gautam Das, Giri Narasimhan, Jeffrey S. Salowe: A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222
- 1994
- [j3]Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput. 1(4): 433-457 (1994)
- [c7]Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Symposium on Computational Geometry 1994: 132-139
- [c6]Gautam Das, Giri Narasimhan: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Symposium on Computational Geometry 1994: 259-266
- [c5]Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994: 119-130
- 1993
- [c4]
- [c3]Gautam Das, Paul J. Heffernan, Giri Narasimhan: Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993: 53-62
- 1992
- [j2]Giri Narasimhan, Rachel Manber: Stability number and chromatic number of tolerance graphs. Discrete Applied Mathematics 36(1): 47-56 (1992)
- [c2]Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New Sparseness Results on Graph Spanners. Symposium on Computational Geometry 1992: 192-201
- 1991
- [c1]Gautam Das, Giri Narasimhan: Geometric Searching and Link Distance (Extended Abstract). WADS 1991: 261-272
1980 – 1989
- 1989
- [j1]Giri Narasimhan: A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. Inf. Process. Lett. 32(4): 167-170 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:13 CEST by the dblp team