Uriel Feige

Computational Theory and Mathematics · 1996–2011

A researcher in the Science corpus: 6 papers; trusts 13 researchers and is trusted by 124 researchers here, as inferred from the citation graph.

Subfields

Whom Uriel Feige trusts overall

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

  1. Michel X. Goemans
  2. Ana-Diana Pop
  3. Ron Lavi
  4. Sanjeev Arora
  5. Jan Vondr'ak
  6. George L. Nemhauser
  7. David P. Williamson
  8. Chaitanya Swamy
  9. Adi Shamir
  10. Gruia Calinescu

Who trusts Uriel Feige overall

  1. Jan Vondr'ak
  2. Andreas Krause
  3. Niv Buchbinder
  4. Gruia Calinescu
  5. D. Golovin
  6. Xiaojin Zhu
  7. Moran Feldman
  8. J. Håstad
  9. Subhash Khot
  10. Rishabh K. Iyer

Papers from Uriel Feige's perspective

Ordered by how strongly the researchers Uriel Feige 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. Some optimal inapproximability results
  4. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
  5. Probabilistic checking of proofs: a new characterization of NP
  6. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  7. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (45th Annual IEEE Symposium on Foundations of Computer Science)
  8. Expander flows, geometric embeddings and graph partitioning (Symposium on the Theory of Computing)
  9. The Probabilistic Method, Second Edition
  10. Combinatorial auctions with decreasing marginal utilities

Their papers