Gruia Calinescu

Computational Theory and Mathematics · 2001–2011

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

Subfields

• Computational Theory and Mathematics — 13 citations into it; #3,102 of 12,182 by trust here, #2,489 by citations
• Computer Networks and Communications — 10 citations into it; #3,215 of 9,886 by trust here, #3,155 by citations
• Computer Graphics and Computer-Aided Design — 5 citations into it; #889 of 1,584 by trust here, #1,271 by citations
• Optimization & Training — 5 citations into it

Whom Gruia Calinescu trusts overall

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

1. Uriel Feige
2. Chandra Chekuri
3. Alexander A. Ageev
4. Jan Vondr'ak
5. George L. Nemhauser
6. Maxim Sviridenko
7. Lisa Fleischer
8. Alexander Schrijver
9. Sanjeev Khanna
10. Vahab S. Mirrokni

Who trusts Gruia Calinescu overall

1. Jan Vondr'ak
2. Moran Feldman
3. Chandra Chekuri
4. Shayan Oveis Gharan
5. Maxim Sviridenko
6. Niv Buchbinder
7. Ashwinkumar Badanidiyuru
8. Antoine Désir
9. L. Elisa Celis
10. Andreas Krause

Papers from Gruia Calinescu's perspective

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

1. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
2. A threshold of ln n for approximating set cover (preliminary version)
3. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
4. An analysis of approximations for maximizing submodular set functions—I
5. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
6. The Probabilistic Method, Second Edition
7. Optimal approximation for the submodular welfare problem in the value oracle model (Symposium on the Theory of Computing)
8. Maximizing Non-Monotone Submodular Functions
9. Combinatorial optimization. Polyhedra and efficiency.
10. Non-monotone submodular maximization under matroid and knapsack constraints

Their papers

• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (2007) — 478 citations
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (2011) — 919 citations
• Minimum-energy broadcast routing in static ad hoc wireless networks (2001) — 418 citations
• Distributed construction of a planar spanner and routing for ad hoc wireless networks (2002) — 297 citations