Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Dagstuhl Seminar 15511: The Graph Isomorphism Problem
Quanquan C. Liu
48 TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs
How good is Yale University's computer science department? - Quora
Algorithmic Techniques for Modeling and Mining Large Graphs (AMAzING)
Evaluating cooperation in communities with the k-core structure
Daniel Stefankovic - University of Rochester
PDF) Covering Minima and Lattice-Point-Free Convex Bodies
Most Prolific DBLP Authors
László Babai: Hungarian mathematician and computer scientist (1950-) | Biography, Facts, Information, Career, Wiki, Life
prelim/pufferfish.bib at master · fataltes/prelim · GitHub
PDF) Two lower bounds for branching programs
Péter Frankl - Wikipedia
PDF) On Conway's Thrackle Conjecture
PDF) Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
Pedro Felipe Felzenszwalb - AI Profile | 人才画像- AMiner
Gábor Tardos - Wikiwand
Peter G. Kimmel's research works | University of Chicago, IL (UC) and other places
洛瓦茲·拉茲洛- 維基百科，自由的百科全書
Paul Erdős - Wikiwand
Relational Representation Learning for Dynamic (Knowledge) Graphs: A Survey | DeepAI
PDF) Multiplicative Equations over Commuting Matrices.
EasyGraph/Mendeley.bib at master · jmikko/EasyGraph · GitHub
PDF) Isomorphism of Graphs with Bounded Eigenvalue Multiplicity
László Lovász - Wikiwand
彼得·秀尔- Wikiwand
Artificial Intelligence and Industrial Applications
