| 2010 |
|---|
| 26 | Clustering Genes Using Heterogeneous Data Sources. Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan. IJKDB (1): 12-28 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 25 | Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks. Yi Zhang, Erliang Zeng, Tao Li, Giri Narasimhan. ICMLA 2009, 539-544. Web SearchBibTeXDownload |
| 2007 |
|---|
| 24 | On the Effectiveness of Constraints Sets in Clustering Genes. Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan. BIBE 2007, 79-86. Web SearchBibTeXDownload |
| 23 | CyberBridges A Model Collaboration Infrastructure for e-Science. 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. CCGRID 2007, 65-72. Web SearchBibTeXDownload |
| 22 | A Graph Reduction Method for 2D Snake Problems. Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan. CVPR 2007. Web SearchBibTeXDownload |
| 2006 |
|---|
| 21 | Mining the Database of Transcription Binding Sites. Wei Peng, Tao Li, Giri Narasimhan. BIBE 2006, 61-64. Web SearchBibTeXDownload |
| 2005 |
|---|
| 20 | Clustering Genes Using Gene Expression and Text Literature Data. Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan. CSB 2005, 329-340. Web SearchBibTeXDownload |
| 19 | A Knowledge-Driven Method to Evaluate Multi-source Clustering. Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan. ISPA Workshops 2005, 196-202. Web SearchBibTeXDownload |
| 2004 |
|---|
| 18 | Approximating geometric bottleneck shortest paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (29): 233-249 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 17 | Approximating Geometric Bottleneck Shortest Paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. STACS 2003, 38-49. Web SearchBibTeXDownload |
| 2002 |
|---|
| 16 | Optimally computing a shortest weakly visible line segment inside a simple polygon. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan. Comput. Geom. (23): 1-29 (2002). Cited by 3Web SearchBibTeXDownload |
| 15 | Mining Protein Sequences for Motifs. Giri Narasimhan, Changsong Bu, Yuan Gao, Xuning Wang, Ning Xu, Kalai Mathee. Journal of Computational Biology (9): 707-720 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 14 | Algorithms for facility location problems with outliers. Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan. SODA 2001, 642-651. Web SearchBibTeXDownload |
| 1999 |
|---|
| 13 | Motif Detection in Protein Sequences. Yuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang. SPIRE/CRIWG 1999, 63-72. Web SearchBibTeXDownload |
| 1997 |
|---|
| 12 | LR-visibility in Polygons. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Comput. Geom. (7): 37-57 (1997). Cited by 34Web SearchBibTeXDownload |
| 11 | A Fast Algorithm for Constructing Sparse Euclidean Spanners. Gautam Das, Giri Narasimhan. Int. J. Comput. Geometry Appl. (7): 297-315 (1997). Cited by 74Web SearchBibTeXDownload |
| 1995 |
|---|
| 10 | New sparseness results on graph spanners. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares. Int. J. Comput. Geometry Appl. (5): 125-144 (1995). Web SearchBibTeXDownload |
| 9 | A New Way to Weigh Malnourished Euclidean Graphs. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe. SODA 1995, 215-222. Cited by 55Web SearchBibTeXDownload |
| 1994 |
|---|
| 8 | Finding all Weakly-Visible Chords of a Polygon in Linear Time. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Nord. J. Comput. (1): 433-457 (1994). Cited by 13Web SearchBibTeX |
| 7 | Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). Gautam Das, Paul J. Heffernan, Giri Narasimhan. SWAT 1994, 119-130. Web SearchBibTeXDownload |
| 6 | Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Gautam Das, Giri Narasimhan. Symposium on Computational Geometry 1994, 259-266. Cited by 15Web SearchBibTeXDownload |
| 5 | A Fast Algorithm for Constructing Sparse Euclidean Spanners. Gautam Das, Giri Narasimhan. Symposium on Computational Geometry 1994, 132-139. Cited by 74Web SearchBibTeXDownload |
| 1993 |
|---|
| 4 | LR-visibility in Polygons. Gautam Das, Paul J. Heffernan, Giri Narasimhan. CCCG 1993, 303-308. Cited by 34Web SearchBibTeX |
| 3 | Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Symposium on Computational Geometry 1993, 53-62. Cited by 47Web SearchBibTeXDownload |
| 1992 |
|---|
| 2 | New Sparseness Results on Graph Spanners. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares. Symposium on Computational Geometry 1992, 192-201. Cited by 127Web SearchBibTeXDownload |
| 1991 |
|---|
| 1 | Geometric Searching and Link Distance (Extended Abstract). Gautam Das, Giri Narasimhan. WADS 1991, 261-272. Web SearchBibTeXDownload |
