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