Qinglin Yu

2008–2009

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

Whom Qinglin Yu trusts overall

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

  1. Tomasz Łuczak

Papers from Qinglin Yu's perspective

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

  1. Paths, Trees, and Flowers
  2. Introduction to graph theory
  3. The Complexity of Computing the Permanent
  4. A Szemerédi-type regularity lemma in abelian groups, with applications
  5. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
  6. On a conditionally Poissonian graph process (Advances in Applied Probability)
  7. On the size of k-fold sum and product sets of integers
  8. A NEW PROOF OF SZEMER ´ EDI'S THEOREM
  9. An analog of Freiman's theorem in groups (Astérisque)
  10. Foundations of a Structural Theory of Set Addition

Their papers