Giri Narasimhan
ACM-SIAM Symposium on Discrete Algorithms · 2001–2017
A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Giri Narasimhan trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Giri Narasimhan overall
- Jackson Gorham
- Nicolás Emilio Bordenabe
- Lester W. Mackey
- Steven S. Skiena
- Konstantinos Chatzikokolakis
- Catuscia Palamidessi
Papers from Giri Narasimhan's perspective
Ordered by how strongly the researchers Giri Narasimhan trusts endorse each paper. Same corpus, a different order for every researcher.
- A threshold of ln n for approximating set cover (preliminary version)
- Primal-dual approximation algorithms for metric facility location and k-median problems
- Approximation algorithms for facility location problems
- Robust Regression and Outlier Detection (Wiley Series in Probability and Statistics)
- Algorithms for Clustering Data
- Analysis of a local search heuristic for facility location problems (ACM-SIAM Symposium on Discrete Algorithms)
- Independent Component Analysis
- The Budgeted Maximum Coverage Problem
- Tumor classification by partial least squares using microarray gene expression data (Bioinform.)
- Multivariate Analysis in Metabolomics. (Current Metabolomics)
Their papers
- So you think you can PLS-DA? (2017) — 351 citations
- Geometric spanner networks (2007) — 503 citations
- Algorithms for facility location problems with outliers (2001) — 464 citations