Giri Narasimhan

According to our database1, Giri Narasimhan
  • authored at least 93 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
ATria: a novel centrality algorithm applied to biological networks.
BMC Bioinformatics, 2017

MATria: A unified centrality algorithm.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017

2016
Planar Geometric Spanners.
Encyclopedia of Algorithms, 2016

Geometric Spanners.
Encyclopedia of Algorithms, 2016

Applications of Geometric Spanner Networks.
Encyclopedia of Algorithms, 2016

CacheDedup: In-line Deduplication for Flash Caching.
Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

2015
Automatic Construction of 3-D Building Model From Airborne LIDAR Data Through 2-D Snake Algorithm.
IEEE Trans. Geoscience and Remote Sensing, 2015

GPUDePiCt: A Parallel Implementation of a Clustering Algorithm for Computing Degenerate Primers on Graphics Processing Units.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

Analyzing Adaptive Cache Replacement Strategies.
CoRR, 2015

ATria: A novel centrality algorithm applied to biological networks.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2013
Vector repacking algorithms for power-aware computing.
Proceedings of the International Green Computing Conference, 2013

Geometric Avatar Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2011
CloG: A pipeline for closing gaps in a draft assembly using short reads.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Invited: Comparative microbial genomics.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Clustering Genes Using Heterogeneous Data Sources.
IJKDB, 2010

2009
On the dilation spectrum of paths, cycles, and trees.
Comput. Geom., 2009

Region-restricted clustering for geographic data mining.
Comput. Geom., 2009

Serial evolutionary networks of within-patient HIV-1 sequences reveal patterns of evolution of X4 strains.
BMC Systems Biology, 2009

Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks.
Proceedings of the International Conference on Machine Learning and Applications, 2009

2008
Planar Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms, 2008

Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms, 2008

Applications of Geometric Spanner Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximate distance oracles for geometric spanners.
ACM Trans. Algorithms, 2008

The role of internal node sequences and the molecular clock in the analysis of serially-sampled data.
IJBRA, 2008

A Functional Network of Yeast Genes Using Gene Ontology Information.
Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008

A branch-and-bound approach to knowledge-based protein structure assembly.
Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, 2008

2007
Distance-preserving approximations of polygonal paths.
Comput. Geom., 2007

Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach.
Bioinformatics, 2007

Enhancing Motif Refinement by Incorporating Comparative Genomics Data.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

A Graph Reduction Method for 2D Snake Problems.
Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 2007

CyberBridges A Model Collaboration Infrastructure for e-Science.
Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007), 2007

On the Effectiveness of Constraints Sets in Clustering Genes.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Geometric spanner networks.
Cambridge University Press, 2007

2006
Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant network.
Bioinformatics, 2006

Pooling Evidence to Identify Cell Cycle-Regulated Genes.
Proceedings of the Computational Science, 2006

Discovering Sequence-Structure Patterns in Proteins with Variable Secondary Structure.
Proceedings of the Computational Science, 2006

Reconstructing Ancestor-Descendant Lineages from Serially-Sampled Data: A Comparison Study.
Proceedings of the Computational Science, 2006

Region-Restricted Clustering for Geographic Data Mining.
Proceedings of the Algorithms, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

Mining the Database of Transcription Binding Sites.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

2005
Fast Pruning of Geometric Spanners.
Proceedings of the STACS 2005, 2005

A Knowledge-Driven Method to Evaluate Multi-source Clustering.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Clustering Using Adaptive Self-organizing Maps (ASOM) and Applications.
Proceedings of the Computational Science, 2005

Clustering Genes Using Gene Expression and Text Literature Data.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005

2004
Approximating geometric bottleneck shortest paths.
Comput. Geom., 2004

MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2003
Balanced Partition of Minimum Spanning Trees.
Int. J. Comput. Geometry Appl., 2003

Approximating Geometric Bottleneck Shortest Paths.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Distance-Preserving Approximations of Polygonal Paths.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Degenerate Primer Design via Clustering.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.
SIAM J. Comput., 2002

Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Nord. J. Comput., 2002

Mining Protein Sequences for Motifs.
Journal of Computational Biology, 2002

Optimally computing a shortest weakly visible line segment inside a simple polygon.
Comput. Geom., 2002

Improved Algorithms for Constructing Fault-Tolerant Spanners.
Algorithmica, 2002

Approximate distance oracles for geometric graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Balanced Partition of Minimum Spanning Trees.
Proceedings of the Computational Science - ICCS 2002, 2002

2001
Approximating a Minimum Manhattan Network.
Nord. J. Comput., 2001

Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions.
ACM Journal of Experimental Algorithmics, 2001

A Generalization of maximal independent sets.
Discrete Applied Mathematics, 2001

Optimal Algorithms for Two-Guard Walkability of Simple Polygons.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Algorithms for the Bottleneck Stretch Factor Problem.
Proceedings of the STACS 2001, 2001

Algorithms for facility location problems with outliers.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Approximating the Stretch Factor of Euclidean Graphs.
SIAM J. Comput., 2000

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.
Proceedings of the Algorithm Theory, 2000

1999
On Hamiltonian Triangulations in Simple Polygons.
Int. J. Comput. Geometry Appl., 1999

Motif Detection in Protein Sequences.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Approximating Minimum Manhattan Networks.
Proceedings of the Randomization, 1999

1998
Information capacity of binary weights associative memories.
Neurocomputing, 1998

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Resource-Constrained Geometric Network Optimization.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
A Fast Algorithm for Constructing Sparse Euclidean Spanners.
Int. J. Comput. Geometry Appl., 1997

LR-visibility in Polygons.
Comput. Geom., 1997

On Hamiltonian Triangulations in Simple Polygons (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1995
New sparseness results on graph spanners.
Int. J. Comput. Geometry Appl., 1995

A New Way to Weigh Malnourished Euclidean Graphs.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Short cuts in higher dimensional space.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Finding all Weakly-Visible Chords of a Polygon in Linear Time.
Nord. J. Comput., 1994

Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

A Fast Algorithm for Constructing Sparse Euclidean Spanners.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Optimally Sparse Spanners in 3-Dimensional Euclidean Space.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

LR-visibility in Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Stability number and chromatic number of tolerance graphs.
Discrete Applied Mathematics, 1992

New Sparseness Results on Graph Spanners.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Geometric Searching and Link Distance (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1991

1990
A Generalization of Lovasz's 0_ Function.
Proceedings of the Polyhedral Combinatorics, 1990

1989
A Note on the Hamiltonian Circuit Problem on Directed Path Graphs.
Inf. Process. Lett., 1989


  Loading...