Viswanath Nagarajan

Computational Theory and Mathematics · 2009

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

Subfields

Whom Viswanath Nagarajan trusts overall

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

  1. Jan Vondr'ak
  2. Michel X. Goemans

Who trusts Viswanath Nagarajan overall

  1. Himabindu Lakkaraju
  2. Alex Kulesza
  3. Hui-Ching Lin
  4. Shayan Oveis Gharan

Papers from Viswanath Nagarajan's perspective

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

  1. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  2. A threshold of ln n for approximating set cover (preliminary version)
  3. An analysis of approximations for maximizing submodular set functions—I
  4. Submodular functions and convexity
  5. Some optimal inapproximability results
  6. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  7. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  8. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
  9. An Exact Algorithm for Maximum Entropy Sampling
  10. Near-optimal sensor placements in Gaussian processes

Their papers