default search action
Giri Narasimhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
- [b1]Giri Narasimhan, Michiel H. M. Smid:
Geometric spanner networks. Cambridge University Press 2007, pp. I-XV, 1-500
Journal Articles
- 2023
- [j40]Camilo Valdes, Vitalii Stebliankin, Daniel Ruiz-Perez, Ji In Park, Hajeong Lee, Giri Narasimhan:
Microbiome maps: Hilbert curve visualizations of metagenomic profiles. Frontiers Bioinform. 3 (2023) - [j39]Vitalii Stebliankin, Azam Shirali, Prabin Baral, Jimeng Shi, Prem Chapagain, Kalai Mathee, Giri Narasimhan:
Evaluating protein binding interfaces with transformer networks. Nat. Mac. Intell. 5(9): 1042-1053 (2023) - 2022
- [j38]Zhipeng Cai, Giri Narasimhan, Pavel Skums:
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 207-208 (2022) - 2021
- [j37]Ion I. Mandoiu, T. M. Murali, Giri Narasimhan, Sanguthevar Rajasekaran, Pavel Skums, Alexander Zelikovsky:
Special Issue: 9th International Computational Advances in Bio and Medical Sciences (ICCABS 2019). J. Comput. Biol. 28(2): 115-116 (2021) - 2020
- [j36]Daniel Ruiz-Perez, Haibin Guan, Purnima Madhivanan, Kalai Mathee, Giri Narasimhan:
So you think you can PLS-DA? BMC Bioinform. 21-S(1): 2 (2020) - 2019
- [j35]Camilo Valdes, Vitalii Stebliankin, Giri Narasimhan:
Large scale microbiome profiling in the cloud. Bioinform. 35(14): i13-i22 (2019) - [j34]Trevor Cickovski, Vanessa Aguiar-Pulido, Giri Narasimhan:
MATria: a unified centrality algorithm. BMC Bioinform. 20-S(11): 278:1-278:9 (2019) - 2018
- [j33]Trevor Cickovski, Giri Narasimhan:
Constructing lightweight and flexible pipelines using Plugin-Based Microbiome Analysis (PluMA). Bioinform. 34(17): 2881-2888 (2018) - 2017
- [j32]Trevor Cickovski, Eli Peake, Vanessa Aguiar-Pulido, Giri Narasimhan:
ATria: a novel centrality algorithm applied to biological networks. BMC Bioinform. 18(8): 239:1-239:10 (2017) - 2015
- [j31]Trevor Cickovski, Tiffany Flor, Galen Irving-Sachs, Philip Novikov, James Parda, Giri Narasimhan:
GPUDePiCt: A Parallel Implementation of a Clustering Algorithm for Computing Degenerate Primers on Graphics Processing Units. IEEE ACM Trans. Comput. Biol. Bioinform. 12(2): 445-454 (2015) - [j30]Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan:
Automatic Construction of 3-D Building Model From Airborne LIDAR Data Through 2-D Snake Algorithm. IEEE Trans. Geosci. Remote. Sens. 53(1): 3-14 (2015) - 2010
- [j29]Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan:
Clustering Genes Using Heterogeneous Data Sources. Int. J. Knowl. Discov. Bioinform. 1(2): 12-28 (2010) - [j28]Ion I. Mandoiu, Giri Narasimhan, Yi Pan, Yanqing Zhang:
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 577-578 (2010) - 2009
- [j27]Patricia Buendia, Giri Narasimhan:
Serial evolutionary networks of within-patient HIV-1 sequences reveal patterns of evolution of X4 strains. BMC Syst. Biol. 3: 62 (2009) - [j26]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan:
Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009) - [j25]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
On the dilation spectrum of paths, cycles, and trees. Comput. Geom. 42(9): 923-933 (2009) - 2008
- [j24]Patricia Buendia, Timothy M. Collins, Giri Narasimhan:
The role of internal node sequences and the molecular clock in the analysis of serially-sampled data. Int. J. Bioinform. Res. Appl. 4(1): 107-121 (2008) - [j23]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1): 10:1-10:34 (2008) - 2007
- [j22]Patricia Buendia, Giri Narasimhan:
Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach. Bioinform. 23(22): 2993-3000 (2007) - [j21]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007) - 2006
- [j20]Patricia Buendia, Giri Narasimhan:
Serial NetEvolve: a flexible utility for generating serially-sampled sequences along a tree or recombinant network. Bioinform. 22(18): 2313-2314 (2006) - 2004
- [j19]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
- [j18]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. 13(4): 303-316 (2003) - 2002
- [j17]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002) - [j16]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) - [j15]Giri Narasimhan, Changsong Bu, Yuan Gao, Xuning Wang, Ning Xu, Kalai Mathee:
Mining Protein Sequences for Motifs. J. Comput. Biol. 9(5): 707-720 (2002) - [j14]Giri Narasimhan, Michiel H. M. Smid:
Approximation Algorithms for the Bottleneck Stretch Factor Problem. Nord. J. Comput. 9(1): 13-31 (2002) - [j13]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002) - 2001
- [j12]Arun K. Jagota, Giri Narasimhan, Lubomír Soltés:
A Generalization of maximal independent sets. Discret. Appl. Math. 109(3): 223-235 (2001) - [j11]Giri Narasimhan, Martin Zachariasen:
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM J. Exp. Algorithmics 6: 6 (2001) - [j10]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001) - 2000
- [j9]Giri Narasimhan, Michiel H. M. Smid:
Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput. 30(3): 978-989 (2000) - 1999
- [j8]Giri Narasimhan:
On Hamiltonian Triangulations in Simple Polygons. Int. J. Comput. Geom. Appl. 9(3): 261-275 (1999) - 1998
- [j7]Arun K. Jagota, Giri Narasimhan, Kenneth W. Regan:
Information capacity of binary weights associative memories. Neurocomputing 19(1-3): 35-58 (1998) - 1997
- [j6]Gautam Das, Paul J. Heffernan, Giri Narasimhan:
LR-visibility in Polygons. Comput. Geom. 7: 37-57 (1997) - [j5]Gautam Das, Giri Narasimhan:
A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geom. Appl. 7(4): 297-315 (1997) - 1995
- [j4]Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
New sparseness results on graph spanners. Int. J. Comput. Geom. Appl. 5: 125-144 (1995) - 1994
- [j3]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) - 1992
- [j2]Giri Narasimhan, Rachel Manber:
Stability number and chromatic number of tolerance graphs. Discret. Appl. Math. 36(1): 47-56 (1992) - 1989
- [j1]Giri Narasimhan:
A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. Inf. Process. Lett. 32(4): 167-170 (1989)
Conference and Workshop Papers
- 2024
- [c62]Nimmi Arunachalam, Stephanie J. Lunn, Mark Allen Weiss, Jason Liu, Giri Narasimhan:
Foot in the Door: Developing Opportunities for Computing Undergraduates to Gain Industry Experience. SIGCSE (1) 2024: 74-80 - 2023
- [c61]Jimeng Shi, Rukmangadh Myana, Vitalii Stebliankin, Azam Shirali, Giri Narasimhan:
Explainable Parallel RCNN with Novel Feature Representation for Time Series Forecasting. AALTD@ECML/PKDD 2023: 56-75 - [c60]Zichong Wang, Giri Narasimhan, Xin Yao, Wenbin Zhang:
Mitigating Multisource Biases in Graph Neural Networks via Real Counterfactual Samples. ICDM 2023: 638-647 - 2021
- [c59]Farzana Beente Yusuf, Shaoming Cheng, Sukumar Ganapati, Giri Narasimhan:
Causal Inference Methods and their Challenges: The Case of 311 Data. DG.O 2021: 49-59 - [c58]Liana V. Rodriguez, Farzana Beente Yusuf, Steven Lyons, Eysler Paz, Raju Rangaswami, Jason Liu, Ming Zhao, Giri Narasimhan:
Learning Cache Replacement with CACHEUS. FAST 2021: 341-354 - 2019
- [c57]Trevor Cickovski, Astrid Manuel, Kalai Mathee, Michael Campos, Giri Narasimhan:
Effects of Various Alpha-1 Antitrypsin Supplement Dosages on the Lung Microbiome and Metabolome. ICCABS 2019: 90-101 - 2018
- [c56]Giuseppe Vietri, Liana V. Rodriguez, Wendy A. Martinez, Steven Lyons, Jason Liu, Raju Rangaswami, Ming Zhao, Giri Narasimhan:
Driving Cache Replacement with ML-based LeCaR. HotStorage 2018 - [c55]Daniel Ruiz-Perez, Haibin Guan, Purnima Madhivanan, Kalai Mathee, Giri Narasimhan:
So you think you can PLS-DA? ICCABS 2018: 1 - [c54]Musfiqur Rahman Sazal, Daniel Ruiz-Perez, Trevor Cickovski, Giri Narasimhan:
Inferring Relationships in Microbiomes from Signed Bayesian Networks. ICCABS 2018: 1 - 2017
- [c53]Trevor Cickovski, Vanessa Aguiar-Pulido, Giri Narasimhan:
MATria: A unified centrality algorithm. ICCABS 2017: 1 - 2016
- [c52]Wenji Li, Gregory Jean-Baptise, Juan Riveros, Giri Narasimhan, Tony Zhang, Ming Zhao:
CacheDedup: In-line Deduplication for Flash Caching. FAST 2016: 301-314 - 2015
- [c51]Trevor Cickovski, Eli Peake, Vanessa Aguiar-Pulido, Giri Narasimhan:
ATria: A novel centrality algorithm applied to biological networks. ICCABS 2015: 1 - 2013
- [c50]Mario E. Consuegra, Giri Narasimhan:
Geometric Avatar Problems. FSTTCS 2013: 389-400 - [c49]Mario E. Consuegra, Giri Narasimhan, Raju Rangaswami:
Vector repacking algorithms for power-aware computing. IGCC 2013: 1-8 - 2011
- [c48]Giri Narasimhan:
Invited: Comparative microbial genomics. ICCABS 2011: 8 - [c47]Xing Yang, Daniel Medvin, Giri Narasimhan, Deborah Yoder-Himes, Stephen Lory:
CloG: A pipeline for closing gaps in a draft assembly using short reads. ICCABS 2011: 202-207 - 2009
- [c46]Yi Zhang, Erliang Zeng, Tao Li, Giri Narasimhan:
Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks. ICMLA 2009: 539-544 - [c45]S. Lakshminarayanan, J. Joung, Giri Narasimhan, Ravi Kapre, M. Slanina, J. Tung, Morgan Whately, C.-L. Hou, W.-J. Liao, S.-C. Lin, P.-G. Ma, C.-W. Fan, M.-C. Hsieh, F.-C. Liu, K.-L. Yeh, W.-C. Tseng, S. W. Lu:
Standby power reduction and SRAM cell optimization for 65nm technology. ISQED 2009: 471-475 - 2008
- [c44]Gaolin Zheng, Giri Narasimhan:
A branch-and-bound approach to knowledge-based protein structure assembly. BIBE 2008: 1-5 - [c43]Erliang Zeng, Giri Narasimhan, Lisa Schneper, Kalai Mathee:
A Functional Network of Yeast Genes Using Gene Ontology Information. BIBM 2008: 343-346 - 2007
- [c42]Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasimhan:
On the Effectiveness of Constraints Sets in Clustering Genes. BIBE 2007: 79-86 - [c41]Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Narasimhan:
SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing. BIBE 2007: 1343-1347 - [c40]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 - [c39]Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching Chen, Giri Narasimhan:
A Graph Reduction Method for 2D Snake Problems. CVPR 2007 - [c38]Patricia Buendia, Giri Narasimhan:
Searching for Recombinant Donors in a Phylogenetic Network of Serial Samples. ISBRA 2007: 109-120 - [c37]Erliang Zeng, Giri Narasimhan:
Enhancing Motif Refinement by Incorporating Comparative Genomics Data. ISBRA 2007: 329-337 - 2006
- [c36]Wei Peng, Tao Li, Giri Narasimhan:
Mining the Database of Transcription Binding Sites. BIBE 2006: 61-64 - [c35]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan:
Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410 - [c34]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 - [c33]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 - [c32]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 - 2005
- [c31]Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan:
Clustering Genes Using Gene Expression and Text Literature Data. CSB 2005: 329-340 - [c30]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 - [c29]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 - [c28]Chengyong Yang, Erliang Zeng, Tao Li, Giri Narasimhan:
A Knowledge-Driven Method to Evaluate Multi-source Clustering. ISPA Workshops 2005: 196-202 - [c27]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Fast Pruning of Geometric Spanners. STACS 2005: 508-520 - 2004
- [c26]Patricia Buendia, Giri Narasimhan:
MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies. CSB 2004: 110-119 - 2003
- [c25]Xintao Wei, David N. Kuhn, Giri Narasimhan:
Degenerate Primer Design via Clustering. CSB 2003: 75-83 - [c24]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228 - [c23]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49 - 2002
- [c22]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35 - [c21]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate Distance Oracles Revisited. ISAAC 2002: 357-368 - [c20]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric graphs. SODA 2002: 828-837 - 2001
- [c19]Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan:
Algorithms for facility location problems with outliers. SODA 2001: 642-651 - [c18]Giri Narasimhan, Michiel H. M. Smid:
Approximation Algorithms for the Bottleneck Stretch Factor Problem. STACS 2001: 502-513 - [c17]Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan:
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449 - 2000
- [c16]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327 - 1999
- [c15]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38 - [c14]Yuan Gao, Kalai Mathee, Giri Narasimhan, Xuning Wang:
Motif Detection in Protein Sequences. SPIRE/CRIWG 1999: 63-72 - 1998
- [c13]Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan:
Resource-Constrained Geometric Network Optimization. SCG 1998: 307-316 - [c12]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195 - 1997
- [c11]Giri Narasimhan:
On Hamiltonian Triangulations in Simple Polygons (Extended Abstract). WADS 1997: 321-330 - 1995
- [c10]Gautam Das, Giri Narasimhan:
Short cuts in higher dimensional space. CCCG 1995: 103-108 - [c9]Gautam Das, Giri Narasimhan, Jeffrey S. Salowe:
A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222 - 1994
- [c8]Gautam Das, Giri Narasimhan:
A Fast Algorithm for Constructing Sparse Euclidean Spanners. SCG 1994: 132-139 - [c7]Gautam Das, Giri Narasimhan:
Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. SCG 1994: 259-266 - [c6]Gautam Das, Paul J. Heffernan, Giri Narasimhan:
Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994: 119-130 - 1993
- [c5]Gautam Das, Paul J. Heffernan, Giri Narasimhan:
LR-visibility in Polygons. CCCG 1993: 303-308 - [c4]Gautam Das, Paul J. Heffernan, Giri Narasimhan:
Optimally Sparse Spanners in 3-Dimensional Euclidean Space. SCG 1993: 53-62 - 1992
- [c3]Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
New Sparseness Results on Graph Spanners. SCG 1992: 192-201 - 1991
- [c2]Gautam Das, Giri Narasimhan:
Geometric Searching and Link Distance (Extended Abstract). WADS 1991: 261-272 - 1990
- [c1]Giri Narasimhan, Rachel Manber:
A Generalization of Lovasz's 0_ Function. Polyhedral Combinatorics 1990: 19-28
Parts in Books or Collections
- 2005
- [p4]Leonardo Bobadilla, Fernando Niño, Giri Narasimhan:
Predicting and Characterizing metal-binding sites using Support Vector Machines. Advances in Bioinformatics and Its Applications 2005 - [p3]Tom Milledge, Gaolin Zheng, Giri Narasimhan:
An Application of Association Rule Mining to HLA-a*0201 epitope Prediction. Advances in Bioinformatics and Its Applications 2005 - [p2]Yanli Sun, Zhengyue Deng, Giri Narasimhan, Kalai Mathee:
Training Set Design for Pattern Discovery with Applications to protein Motif Detection. Advances in Bioinformatics and Its Applications 2005 - [p1]Chengyong Yang, Erliang Zeng, Kalai Mathee, Giri Narasimhan:
Querying a Database of regulatory Elements. Advances in Bioinformatics and Its Applications 2005
Editorship
- 2022
- [e6]Donald A. Adjeroh, Qi Long, Xinghua Mindy Shi, Fei Guo, Xiaohua Hu, Srinivas Aluru, Giri Narasimhan, Jianxin Wang, Mingon Kang, Ananda Mondal, Jin Liu:
IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022, Las Vegas, NV, USA, December 6-8, 2022. IEEE 2022, ISBN 978-1-6654-6819-0 [contents] - 2020
- [e5]Ion I. Mandoiu, T. M. Murali, Giri Narasimhan, Sanguthevar Rajasekaran, Pavel Skums, Alexander Zelikovsky:
Computational Advances in Bio and Medical Sciences - 9th International Conference, ICCABS 2019, Miami, FL, USA, November 15-17, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12029, Springer 2020, ISBN 978-3-030-46164-5 [contents] - [e4]Zhipeng Cai, Ion I. Mandoiu, Giri Narasimhan, Pavel Skums, Xuan Guo:
Bioinformatics Research and Applications - 16th International Symposium, ISBRA 2020, Moscow, Russia, December 1-4, 2020, Proceedings. Lecture Notes in Computer Science 12304, Springer 2020, ISBN 978-3-030-57820-6 [contents] - 2009
- [e3]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. Lecture Notes in Computer Science 5542, Springer 2009, ISBN 978-3-642-01550-2 [contents] - 2007
- [e2]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2005
- [e1]Matthew He, Giri Narasimhan, Sergei V. Petoukhov:
Advances in Bioinformatics and Its Applications. Series in mathematical biology and medicine 8, World Scientific 2005, ISBN 978-981-256-148-0 [contents]
Reference Works
- 2016
- [r6]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2016: 86-90 - [r5]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2016: 846-852 - [r4]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2016: 1570-1574 - 2008
- [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008 - [r2]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2008 - [r1]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2024
- [i12]Jimeng Shi, Zeda Yin, Arturo S. Leon, Jayantha Obeysekera, Giri Narasimhan:
FIDLAR: Forecast-Informed Deep Learning Architecture for Flood Mitigation. CoRR abs/2402.13371 (2024) - [i11]Jimeng Shi, Bowen Jin, Jiawei Han, Giri Narasimhan:
CoDiCast: Conditional Diffusion Model for Weather Prediction with Uncertainty Quantification. CoRR abs/2409.05975 (2024) - [i10]Jimeng Shi, Azam Shirali, Giri Narasimhan:
ReFine: Boosting Time Series Prediction of Extreme Events by Reweighting and Fine-tuning. CoRR abs/2409.14232 (2024) - 2023
- [i9]Jimeng Shi, Rukmangadh Myana, Vitalii Stebliankin, Azam Shirali, Giri Narasimhan:
Explainable Parallel RCNN with Novel Feature Representation for Time Series Forecasting. CoRR abs/2305.04876 (2023) - [i8]FNU Shariful, Justin Weathers, Anirban Ghosh, Giri Narasimhan:
Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees. CoRR abs/2305.11312 (2023) - [i7]Jimeng Shi, Zeda Yin, Rukmangadh Myana, Khandker Ishtiaq, Anupama John, Jayantha Obeysekera, Arturo S. Leon, Giri Narasimhan:
Deep Learning Models for Water Stage Predictions in South Florida. CoRR abs/2306.15907 (2023) - [i6]Jimeng Shi, Vitalii Stebliankin, Zhaonan Wang, Shaowen Wang, Giri Narasimhan:
Graph Transformer Network for Flood Forecasting with Heterogeneous Covariates. CoRR abs/2310.07631 (2023) - [i5]Jimeng Shi, Vitalii Stebliankin, Giri Narasimhan:
The Power of Explainability in Forecast-Informed Deep Learning Models for Flood Mitigation. CoRR abs/2310.19166 (2023) - 2022
- [i4]Jimeng Shi, Mahek Jain, Giri Narasimhan:
Time Series Forecasting (TSF) Using Various Deep Learning Models. CoRR abs/2204.11115 (2022) - 2020
- [i3]Farzana Beente Yusuf, Camilo Valdes, Vitalii Stebliankin, Giuseppe Vietri, Giri Narasimhan:
EXP4-DFDC: A Non-Stochastic Multi-Armed Bandit for Cache Replacement. CoRR abs/2009.11330 (2020) - 2015
- [i2]Leo Shao, Mario E. Consuegra, Raju Rangaswami, Giri Narasimhan:
Analyzing Adaptive Cache Replacement Strategies. CoRR abs/1503.07624 (2015) - 2006
- [i1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint