Ojas D. Parekh

2006

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

Whom Ojas D. Parekh trusts overall

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

  1. Subhash Khot
  2. Harald Räcke
  3. Kamal Kumar Jain

Who trusts Ojas D. Parekh overall

  1. Jacob Bien

Papers from Ojas D. Parekh's perspective

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

  1. A threshold of ln n for approximating set cover (preliminary version)
  2. On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
  3. Algorithms for facility location problems with outliers (ACM-SIAM Symposium on Discrete Algorithms)
  4. Minimizing Congestion in General Networks (IEEE Annual Symposium on Foundations of Computer Science)
  5. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation (JACM)
  6. The geometry of graphs and some of its algorithmic applications
  7. Some optimal inapproximability results
  8. Primal-dual approximation algorithms for metric facility location and k-median problems
  9. Approximation algorithms for facility location problems
  10. Expander flows, geometric embeddings and graph partitioning (Symposium on the Theory of Computing)

Their papers