Roman Glebov

Computational Theory and Mathematics · 2013

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

Subfields

• Computational Theory and Mathematics — 5 citations into it
• Discrete Mathematics and Combinatorics — 5 citations into it
• Geometry and Topology — 5 citations into it

Whom Roman Glebov trusts overall

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

1. Alexander A. Razborov
2. Christian Borgs
3. Jennifer Tour Chayes
4. L. Lov'asz
5. Vera T. Sós

Papers from Roman Glebov's perspective

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

1. Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics
2. Flag algebras (Journal of Symbolic Logic (JSL))
3. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing
4. Limits of dense graph sequences (J. Comb. Theory B)
5. Emergence of Scaling in Random Networks
6. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
7. Emergence of Scaling in Random Networks
8. Counting Graph Homomorphisms
9. Directed scale-free graphs (ACM-SIAM Symposium on Discrete Algorithms)
10. The Diameter of a Scale-Free Random Graph (Comb.)

Their papers

• A problem of Erdős and Sós on 3-graphs (2013) — 58 citations