Giri Narasimhan

	2009
73		Ion I. Mandoiu, Giri Narasimhan, Yanqing Zhang: Bioinformatics Research and Applications, 5th International Symposium, ISBRA 2009, Fort Lauderdale, FL, USA, May 13-16, 2009, Proceedings Springer 2009
72		Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009)
	2008
71		Gaolin Zheng, Giri Narasimhan: A branch-and-bound approach to knowledge-based protein structure assembly. BIBE 2008: 1-5
70		Erliang Zeng, Giri Narasimhan, Lisa Schneper, Kalai Mathee: A Functional Network of Yeast Genes Using Gene Ontology Information. BIBM 2008: 343-346
69		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008
68		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Geometric Spanners. Encyclopedia of Algorithms 2008
67		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Planar Geometric Spanners. Encyclopedia of Algorithms 2008
66		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008)
65		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)
	2007
64		Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
63		Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Narasimhan: SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing. BIBE 2007: 1343-1347
62		Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan: On the Effectiveness of Constraints Sets in Clustering Genes. BIBE 2007: 79-86
61		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
60		Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan: A Graph Reduction Method for 2D Snake Problems. CVPR 2007
59		Patricia Buendia, Giri Narasimhan: Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples. ISBRA 2007: 109-120
58		Erliang Zeng, Giri Narasimhan: Enhancing Motif Refinement by Incorporating Comparative Genomics Data. ISBRA 2007: 329-337
57		Patricia Buendia, Giri Narasimhan: Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach. Bioinformatics 23(22): 2993-3000 (2007)
56		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007)
	2006
55		Wei Peng, Tao Li, Giri Narasimhan: Mining the Database of Transcription Binding Sites. BIBE 2006: 61-64
54		Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410
53		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
52		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
51		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
50		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
49		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)
	2005
48		Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan: Clustering Genes Using Gene Expression and Text Literature Data. CSB 2005: 329-340
47		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
46		Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan: A Knowledge-Driven Method to Evaluate Multi-source Clustering. ISPA Workshops 2005: 196-202
45		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
44		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Fast Pruning of Geometric Spanners. STACS 2005: 508-520
	2004
43		Patricia Buendia, Giri Narasimhan: MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies. CSB 2004: 110-119
42		Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
	2003
41		Xintao Wei, David N. Kuhn, Giri Narasimhan: Degenerate Primer Design via Clustering. CSB 2003: 75-83
40		Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid: Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228
39		Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49
38		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
	2002
37		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
36		Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
35		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
34		Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
33		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)
32		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)
31		Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002)
30		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
	2001
29		Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan: Algorithms for facility location problems with outliers. SODA 2001: 642-651
28		Giri Narasimhan, Michiel H. M. Smid: Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513
27		Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
26		Giri Narasimhan, Martin Zachariasen: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM Journal of Experimental Algorithmics 6: 6 (2001)
25		Arun K. Jagota, Giri Narasimhan, Lubomír Soltés: A Generalization of maximal independent sets. Discrete Applied Mathematics 109(3): 223-235 (2001)
24		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
	2000
23		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
22		Giri Narasimhan, Michiel H. M. Smid: Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. 30(3): 978-989 (2000)
	1999
21		Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
20		Yuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang: Motif Detection in Protein Sequences. SPIRE/CRIWG 1999: 63-72
19		Giri Narasimhan: On Hamiltonian Triangulations in Simple Polygons. Int. J. Comput. Geometry Appl. 9(3): 261-275 (1999)
	1998
18		Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195
17		Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan: Resource-Constrained Geometric Network Optimization. Symposium on Computational Geometry 1998: 307-316
16		Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan: Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998)
	1997
15		Giri Narasimhan: On Hamiltonian Triangulations in Simple Polygons (Extended Abstract). WADS 1997: 321-330
14		Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. Comput. Geom. 7: 37-57 (1997)
13		Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geometry Appl. 7(4): 297-315 (1997)
	1995
12		Gautam Das, Giri Narasimhan, Jeffrey S. Salowe: A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222
11		Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New sparseness results on graph spanners. Int. J. Comput. Geometry Appl. 5: 125-144 (1995)
	1994
10		Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994: 119-130
9		Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Symposium on Computational Geometry 1994: 132-139
8		Gautam Das, Giri Narasimhan: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Symposium on Computational Geometry 1994: 259-266
7		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)
	1993
6		Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. CCCG 1993: 303-308
5		Gautam Das, Paul J. Heffernan, Giri Narasimhan: Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993: 53-62
	1992
4		Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New Sparseness Results on Graph Spanners. Symposium on Computational Geometry 1992: 192-201
3		Giri Narasimhan, Rachel Manber: Stability number and chromatic number of tolerance graphs. Discrete Applied Mathematics 36(1): 47-56 (1992)
	1991
2		Gautam Das, Giri Narasimhan: Geometric Searching and Link Distance (Extended Abstract). WADS 1991: 261-272
	1989
1		Giri Narasimhan: A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. Inf. Process. Lett. 32(4): 167-170 (1989)

Coauthor Index

1	Heidi L. Alvarez	[61]
2	Mattias Andersson	[36] [38]
3	Esther M. Arkin	[17]
4	Binay K. Bhattacharya	[27] [33]
5	Prosenjit Bose	[39] [42]
6	Changsong Bu	[32]
7	Patricia Buendia	[43] [49] [50] [57] [59] [65]
8	Barun Chandra	[4] [11]
9	Moses Charikar	[29]
10	David C. Chatfield	[61]
11	Shu-Ching Chen	[60]
12	Timothy M. Collins	[50] [65]
13	Donald A. Cox	[61]
14	Eric Crumpler	[61]
15	Cassian D'Cunha	[61]
16	Gautam Das	[2] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [33]
17	Yuan Gao	[20] [32]
18	E. Olusegun George	[52]
19	Joachim Gudmundsson	[21] [23] [24] [30] [35] [36] [37] [38] [40] [44] [53] [54] [56] [64] [66] [67] [68] [69] [72]
20	Ronald Gutierrez	[61]
21	Paul J. Heffernan	[5] [6] [7] [10] [14]
22	Julio Ibarra	[61]
23	Arun K. Jagota	[16] [25]
24	Eric Johnson	[61]
25	Samir Khuller	[29]
26	Rolf Klein	[47] [53] [64]
27	Christian Knauer	[47]
28	Marc J. van Kreveld	[54] [72]
29	David N. Kuhn	[41]
30	Kuldeep Kumar	[61]
31	Christos Levcopoulos	[18] [21] [23] [24] [30] [34] [35] [36] [37] [38] [66]
32	Tao Li	[46] [48] [55] [62]
33	Anil Maheshwari	[39] [42]
34	Rachel Manber	[3]
35	Ion I. Mandoiu	[73]
36	Kalai Mathee	[20] [32] [45] [70]
37	Tom Milledge	[51] [52] [61] [63]
38	Joseph S. B. Mitchell	[17]
39	David M. Mount	[29]
40	Asish Mukhopadhyay	[27] [33]
41	Tim Mullins	[63]
42	Wei Peng	[55]
43	Kenneth W. Regan	[16]
44	Seyed Masoud Sadjadi	[61]
45	Jeffrey S. Salowe	[12]
46	Lisa Schneper	[70]
47	Michiel H. M. Smid	[18] [22] [28] [31] [34] [35] [37] [39] [40] [42] [44] [47] [53] [56] [64] [66] [67] [68] [69]
48	José Soares	[4] [11]
49	Lubomír Soltés	[25]
50	Xuning Wang	[20] [32]
51	Yong Wang	[45]
52	Xintao Wei	[41]
53	Alexander Wolff	[53] [64]
54	Ning Xu	[32]
55	Jianhua Yan	[60]
56	Chengyong Yang	[45] [46] [48] [62]
57	Martin Zachariasen	[26]
58	Norbert Zeh	[39] [42]
59	Erliang Zeng	[46] [48] [58] [62] [70]
60	Chengcui Zhang	[60]
61	Chi Zhang	[61]
62	Keqi Zhang	[60]
63	Yanqing Zhang (Yan-Qing Zhang)	[73]
64	Gaolin Zheng	[51] [52] [63] [71]

Colors in the list of coauthors