Andrzej Rucinski
Algorithms & Complexity · 2000–2011
A researcher in the Science corpus: 7 papers; trusts 3 researchers and is trusted by 43 researchers here, as inferred from the citation graph.
Subfields
- Algorithms & Complexity — 6 citations into it
Whom Andrzej Rucinski trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrzej Rucinski overall
- Peter Keevash
- Svante Janson
- D. Kühn
- Yi Zhao
- Sourav Chatterjee
- Allan Siu Lun Lo
- Stefan Glock
- Vojtech Rödl
- Deryk Osthus
- Jeong Han Kim
Papers from Andrzej Rucinski's perspective
Ordered by how strongly the researchers Andrzej Rucinski trusts endorse each paper. Same corpus, a different order for every researcher.
- On the evolution of random graphs
- On the Evolution of Random Graphs
- Statistical mechanics of complex networks
- Recent advances on Dirac-type problems for hypergraphs
- Generalization of the Borel-Cantelli Lemma
- Graphs and Hypergraphs (Clustering)
- Directed graphs, Hamiltonicity and doubly stochastic matrices
- Logarithmic Combinatorial Structures: A Probabilistic Approach
- Mathematical results on scale‐free random graphs
- Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
Their papers
- Random graphs (2000) — 1,480 citations
- Upper tails for subgraph counts in random graphs (2004) — 133 citations
- A Dirac-Type Theorem for 3-Uniform Hypergraphs (2006) — 303 citations
- Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) (2010) — 172 citations
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs (2011) — 98 citations
- Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) — 453 citations
- Encyclopaedia of Mathematics, Supplement III (2002) — 57 citations