S. Rao

JACM · with Arora · 2009

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Whom S. Rao trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Uriel Feige

Who trusts S. Rao overall

1. Isabelle Stanton
2. Sanjeev Arora

Papers from S. Rao's perspective

Ordered by how strongly the researchers S. Rao trusts endorse each paper. Same corpus, a different order for every researcher.

1. Improved approximation algorithms for minimum-weight vertex separators (Symposium on the Theory of Computing)
2. Expander flows, geometric embeddings and graph partitioning (Symposium on the Theory of Computing)
3. Some optimal inapproximability results
4. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ (IEEE Annual Symposium on Foundations of Computer Science)
5. Introduction to graph theory
6. Finding Good Approximate Vertex and Edge Partitions is NP-Hard
7. A threshold of ln n for approximating set cover (preliminary version)
8. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (45th Annual IEEE Symposium on Foundations of Computer Science)
9. Probabilistic checking of proofs: a new characterization of NP
10. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

Their papers

• Expander flows, geometric embeddings and graph partitioning (2009) — 383 citations