Giri Narasimhan

Orcid: 0000-0003-0535-4871

According to our database1, Giri Narasimhan authored at least 111 papers between 1989 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FIDLAR: Forecast-Informed Deep Learning Architecture for Flood Mitigation.
CoRR, 2024

Foot in the Door: Developing Opportunities for Computing Undergraduates to Gain Industry Experience.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2023
Evaluating protein binding interfaces with transformer networks.
Nat. Mac. Intell., September, 2023

Microbiome maps: Hilbert curve visualizations of metagenomic profiles.
Frontiers Bioinform., May, 2023

The Power of Explainability in Forecast-Informed Deep Learning Models for Flood Mitigation.
CoRR, 2023

Graph Transformer Network for Flood Forecasting with Heterogeneous Covariates.
CoRR, 2023

Deep Learning Models for Water Stage Predictions in South Florida.
CoRR, 2023

Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees.
CoRR, 2023

Mitigating Multisource Biases in Graph Neural Networks via Real Counterfactual Samples.
Proceedings of the IEEE International Conference on Data Mining, 2023

Explainable Parallel RCNN with Novel Feature Representation for Time Series Forecasting.
Proceedings of the Advanced Analytics and Learning on Temporal Data, 2023

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

Time Series Forecasting (TSF) Using Various Deep Learning Models.
CoRR, 2022

2021
Special Issue: 9th International Computational Advances in Bio and Medical Sciences (ICCABS 2019).
J. Comput. Biol., 2021

Learning Cache Replacement with CACHEUS.
Proceedings of the 19th USENIX Conference on File and Storage Technologies, 2021

Causal Inference Methods and their Challenges: The Case of 311 Data.
Proceedings of the DG.O'21: The 22nd Annual International Conference on Digital Government Research, 2021

2020
EXP4-DFDC: A Non-Stochastic Multi-Armed Bandit for Cache Replacement.
CoRR, 2020

So you think you can PLS-DA?
BMC Bioinform., 2020

2019
MATria: a unified centrality algorithm.
BMC Bioinform., 2019

Large scale microbiome profiling in the cloud.
Bioinform., 2019

Effects of Various Alpha-1 Antitrypsin Supplement Dosages on the Lung Microbiome and Metabolome.
Proceedings of the Computational Advances in Bio and Medical Sciences, 2019

2018
Constructing lightweight and flexible pipelines using Plugin-Based Microbiome Analysis (PluMA).
Bioinform., 2018

Inferring Relationships in Microbiomes from Signed Bayesian Networks.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Driving Cache Replacement with ML-based LeCaR.
Proceedings of the 10th USENIX Workshop on Hot Topics in Storage and File Systems, 2018

2017
ATria: a novel centrality algorithm applied to biological networks.
BMC Bioinform., 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. Geosci. Remote. Sens., 2015

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

Analyzing Adaptive Cache Replacement Strategies.
CoRR, 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. Biol. Bioinform., 2010

Clustering Genes Using Heterogeneous Data Sources.
Int. J. Knowl. Discov. Bioinform., 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 Syst. Biol., 2009

Standby power reduction and SRAM cell optimization for 65nm technology.
Proceedings of the 10th International Symposium on Quality of Electronic Design (ISQED 2009), 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 Edition, 2008

Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Applications of Geometric Spanner Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 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.
Int. J. Bioinform. Res. Appl., 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.
Bioinform., 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.
Bioinform., 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

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

Querying a Database of regulatory Elements.
Proceedings of the Advances in Bioinformatics and Its Applications, 2005

Training Set Design for Pattern Discovery with Applications to protein Motif Detection.
Proceedings of the Advances in Bioinformatics and Its Applications, 2005

An Application of Association Rule Mining to HLA-a*0201 epitope Prediction.
Proceedings of the Advances in Bioinformatics and Its Applications, 2005

Predicting and Characterizing metal-binding sites using Support Vector Machines.
Proceedings of the Advances in Bioinformatics and Its Applications, 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. Geom. Appl., 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.
J. Comput. Biol., 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

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

Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions.
ACM J. Exp. Algorithmics, 2001

A Generalization of maximal independent sets.
Discret. Appl. Math., 2001

Optimal Algorithms for Two-Guard Walkability of Simple Polygons.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 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. Geom. 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. Geom. 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. Geom. 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

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

1992
Stability number and chromatic number of tolerance graphs.
Discret. Appl. Math., 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...