PDF) Interactive proofs and the hardness of approximating cliques
Peter G. Kimmel's research works | University of Chicago, IL (UC) and other places
EasyGraph/Mendeley.bib at master · jmikko/EasyGraph · GitHub
Gábor Tardos - Wikiwand
Algorithmic Techniques for Modeling and Mining Large Graphs (AMAzING)
Quanquan C. Liu
PDF) Multiplicative Equations over Commuting Matrices.
PDF) Isomorphism and canonization of tournaments and hypertournaments.
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
Core DecomposiÑon of Networks: Concepts, Algorithms and ApplicaÑons
Péter Frankl - Wikipedia
Most Prolific DBLP Authors
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
prelim/pufferfish.bib at master · fataltes/prelim · GitHub
PDF) On Conway's Thrackle Conjecture
László Babai - Wikipedia
PDF) Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
László Lovász - Wikiwand
洛瓦茲·拉茲洛- 維基百科，自由的百科全書
PDF) Random Graph Isomorphism
PDF) Fast Management of Permutation Groups I
Artificial Intelligence and Industrial Applications
Pedro Felipe Felzenszwalb - AI Profile | 人才画像- AMiner
PDF) Two lower bounds for branching programs
Paul Erdős - Wikiwand
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
彼得·秀尔- Wikiwand
