Lisa Fleischer

Symposium on the Theory of Computing · 2000–2006

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

Whom Lisa Fleischer trusts overall

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

  1. Gruia Calinescu
  2. Chandra Chekuri
  3. Jan Vondr'ak

Who trusts Lisa Fleischer overall

  1. Jan Vondr'ak
  2. Gruia Calinescu
  3. Zuo-Jun Max Shen
  4. James B. Orlin
  5. Chandra Chekuri
  6. Paul D. Seymour
  7. Vladimir Kolmogorov
  8. Frans Schalekamp
  9. Martin Pál
  10. Dieter Fox

Papers from Lisa Fleischer's perspective

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

  1. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
  2. Submodular functions and convexity
  3. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
  4. Fast approximation algorithms for fractional packing and covering problems
  5. Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
  6. A threshold of ln n for approximating set cover (preliminary version)
  7. An analysis of approximations for maximizing submodular set functions—I
  8. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  9. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  10. The Probabilistic Method, Second Edition

Their papers