László Lovász

2005

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

Whom László Lovász trusts

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

  1. Paul D. Seymour (in Computational Theory and Mathematics)

Papers from László Lovász's perspective

Ordered by how strongly the researchers László Lovász trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Graph Minors. XX. Wagner's conjecture (J. Comb. Theory B)
  2. Recognizing Berge Graphs (Comb.)
  3. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  4. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
  5. The Theory of Determinants
  6. Introduction to graph theory
  7. The Complexity of Computing the Permanent

Their papers