Core DecomposiÑon of Networks: Concepts, Algorithms and ApplicaÑons
EasyGraph/Mendeley.bib at master · jmikko/EasyGraph · GitHub
Evaluating cooperation in communities with the k-core structure
Most Prolific DBLP Authors
洛瓦茲·拉茲洛- 維基百科，自由的百科全書
PDF) Isomorphism of Graphs with Bounded Eigenvalue Multiplicity
彼得·秀尔- Wikiwand
László Lovász - Wikiwand
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
László Babai - Wikipedia
PDF) Weights of Exact Threshold Functions
Quanquan C. Liu
Paul Erdős - Wikiwand
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Peter G. Kimmel's research works | University of Chicago, IL (UC) and other places
PDF) Two lower bounds for branching programs
Pedro Felipe Felzenszwalb - AI Profile | 人才画像- AMiner
Quanquan C. Liu
László Babai: Hungarian mathematician and computer scientist (1950-) | Biography, Facts, Information, Career, Wiki, Life
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
PDF) Random Graph Isomorphism
PDF) Interactive proofs and the hardness of approximating cliques
Paul Erdős - Wikiwand
48 TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs
Gábor Tardos - Wikiwand
PDF) Checking Computations in Polylogarithmic Time
Artificial Intelligence and Industrial Applications
PDF) Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
How good is Yale University's computer science department? - Quora
