Jan Vondr

Computational Theory and Mathematics · 2010

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

Subfields

Whom Jan Vondr trusts overall

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

  1. George L. Nemhauser
  2. Jan Vondr'ak
  3. Alexander A. Ageev
  4. Laurence A. Wolsey
  5. Maxim Sviridenko
  6. Alexander Schrijver
  7. Marshall L. Fisher
  8. Daniel J. Lehmann

Who trusts Jan Vondr overall

  1. Eric Balkanski
  2. Andreas Krause

Papers from Jan Vondr's perspective

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

  1. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  2. An analysis of approximations for maximizing submodular set functions—I
  3. Best Algorithms for Approximating the Maximum of a Submodular Set Function
  4. Optimal approximation for the submodular welfare problem in the value oracle model (Symposium on the Theory of Computing)
  5. Combinatorial auctions with decreasing marginal utilities
  6. Submodular functions and convexity
  7. Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems (INFORMS journal on computing)
  8. On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Operational Research)
  9. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
  10. I and J

Their papers