Joseph (Seffi) Naor

Computational Theory and Mathematics · 1999–2015

A researcher in the Science corpus: 9 papers; trusts 27 researchers and is trusted by 48 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 31 citations into it; #1,779 of 12,182 by trust here, #2,298 by citations
• Computer Graphics and Computer-Aided Design — 16 citations into it; #988 of 1,584 by trust here, #1,034 by citations
• Computer Networks and Communications — 15 citations into it; #1,549 of 9,886 by trust here, #3,005 by citations
• Optimization & Training — 11 citations into it; #2,519 of 2,601 by trust here, #2,112 by citations
• Artificial Intelligence — 10 citations into it; #7,648 of 35,345 by trust here, #13,544 by citations
• Algorithms & Complexity — 9 citations into it; #176 of 516 by trust here, #169 by citations
• Management Science and Operations Research — 9 citations into it; #3,820 of 11,946 by trust here, #6,024 by citations

Whom Joseph (Seffi) Naor trusts overall

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

1. Jan Vondr'ak
2. Uriel Feige
3. George L. Nemhauser
4. Andreas Krause
5. L. Lov'asz
6. Shayan Oveis Gharan
7. Niv Buchbinder
8. Gruia Calinescu
9. Maxim Sviridenko
10. Prabhakar Raghavan

Who trusts Joseph (Seffi) Naor overall

1. Alex Kulesza
2. Niv Buchbinder
3. Aranyak Mehta
4. Ashwinkumar Badanidiyuru
5. Jennifer Gillenwater
6. Francis R. Bach
7. Moran Feldman
8. B. Taskar
9. Jan Vondr'ak
10. Andreas Krause

Papers from Joseph (Seffi) Naor's perspective

Ordered by how strongly the researchers Joseph (Seffi) Naor 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. An analysis of approximations for maximizing submodular set functions—I
3. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
4. Submodular functions and convexity
5. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
6. Best Algorithms for Approximating the Maximum of a Submodular Set Function
7. Maximizing the spread of influence through a social network
8. Maximizing Non-Monotone Submodular Functions
9. Near-optimal Nonmyopic Value of Information in Graphical Models
10. Non-monotone submodular maximization under matroid and knapsack constraints

Their papers

• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (2012) — 477 citations
• Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract) (2011) — 51 citations
• The Design of Competitive Online Algorithms via a Primal-Dual Approach (2009) — 424 citations
• A Unified Continuous Greedy Algorithm for Submodular Maximization (2011) — 294 citations
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue (2007) — 379 citations
• Submodular Maximization with Cardinality Constraints (2014) — 341 citations
• A unified approach to approximating resource allocation and scheduling (2001) — 394 citations
• Near optimal placement of virtual network functions (2015) — 498 citations
• The Budgeted Maximum Coverage Problem (1999)