Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
András London
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Partitions of Graphs into Special Bipartite Graphs
2025
Lajos Győrffy
András London
Gábor Nagy
András Pluhár
+
PDF
Chat
Partitions of Graphs into Special Bipartite Graphs
2024
Lajos Győrffy
András London
Gábor Nagy
András Pluhár
+
PDF
Chat
Detecting and generating overlapping nested communities
2023
Imre Gera
András London
+
Intersection of Random Spanning Trees in Small-World Networks
2023
András London
András Pluhár
+
PDF
Chat
Graph clustering via generalized colorings
2022
András London
Ryan R. Martin
András Pluhár
+
Graph clustering via generalized colorings
2021
András London
Ryan R. Martin
András Pluhár
+
PDF
Chat
Stability of network centrality measures: a numerical study
2020
Orsolya Kardos
András London
Tamás Vinkó
+
PDF
Chat
Spanning Tree Game as Prim Would Have Played
2018
András London
András Pluhár
+
PDF
Chat
Core of communities in bipartite networks
2017
Christian Bongiorno
András London
Salvatore Miccichè
Rosario N. Mantegna
Common Coauthors
Coauthor
Papers Together
András Pluhár
6
Lajos Győrffy
2
Ryan R. Martin
2
Gábor Nagy
2
Christian Bongiorno
1
Salvatore Miccichè
1
Rosario N. Mantegna
1
Orsolya Kardos
1
Imre Gera
1
Tamás Vinkó
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Finding and evaluating community structure in networks
2004
Michelle G. Newman
Michelle Girvan
4
+
PDF
Chat
Hierarchical structure in financial markets
1999
Rosario N. Mantegna
2
+
PDF
Chat
Graph clustering via generalized colorings
2022
András London
Ryan R. Martin
András Pluhár
2
+
A Set of Measures of Centrality Based on Betweenness
1977
Linton C. Freeman
1
+
PDF
Chat
Analysis of weighted networks
2004
M. E. J. Newman
1
+
A NEW MEASURE OF RANK CORRELATION
1938
M. G. Kendall
1
+
PDF
Chat
Efficiently inferring community structure in bipartite networks
2014
Daniel B. Larremore
Aaron Clauset
Abigail Z. Jacobs
1
+
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
1983
S. Thomas McCormick
1
+
None
2009
Louigi Addario‐Berry
Nicolas Broutin
Bruce Reed
1
+
Global Maker–Breaker games on sparse graphs
2010
Dan Hefetz
Michael Krivelevich
Miloš Stojaković
Tibor Szabó
1
+
PDF
Chat
Ecological analysis of world trade
2012
Leonardo Ermann
Dima L. Shepelyansky
1
+
PDF
Chat
Emergence of Scaling in Random Networks
1999
Albert‐László Barabási
Réka Albert
1
+
PDF
Chat
Finding community structure in networks using the eigenvectors of matrices
2006
M. E. J. Newman
1
+
Shortest Connection Networks And Some Generalizations
1957
R. C. Prim
1
+
PDF
Chat
Cluster analysis for portfolio optimization
2007
Vincenzo Tola
Fabrizio Lillo
Mauro Gallegati
Rosario N. Mantegna
1
+
On the centrality in a directed graph
1973
U. J. Nieminen
1
+
Generating random spanning trees more quickly than the cover time
1996
David B. Wilson
1
+
PDF
Chat
Statistical mechanics of community detection
2006
Juergen Reichardt
Stefan Bornholdt
1
+
PDF
Chat
Statistical significance of communities in networks
2010
Andrea Lancichinetti
Filippo Radicchi
José J. Ramasco
1
+
PDF
Chat
Modularity and community detection in bipartite networks
2007
Michael Barber
1
+
PDF
Chat
Objective Criteria for the Evaluation of Clustering Methods
1971
Telmo Menezes
Camille Roth
1
+
Extracting the multiscale backbone of complex weighted networks
2009
M. Ángeles Serrano
Marián Boguñá
Alessandro Vespignani
1
+
PDF
Chat
Performance of modularity maximization in practical contexts
2010
Benjamin H. Good
Yves-Alexandre de Montjoye
Aaron Clauset
1
+
Deterministic Graph Games and a Probabilistic Intuition
1994
József Beck
1
+
PDF
Chat
Scale-free trees: The skeletons of complex networks
2004
DH Kim
Jae Dong Noh
Hawoong Jeong
1
+
The chromatic number of random graphs
1988
B Bollobás
1
+
PDF
Chat
Module identification in bipartite and directed networks
2007
Roger Guimerà
Marta Sales‐Pardo
Luı́s A. Nunes Amaral
1
+
PDF
Chat
Statistically Validated Networks in Bipartite Complex Systems
2011
Michele Tumminello
Salvatore Miccichè
Fabrizio Lillo
Jyrki Piilo
Rosario N. Mantegna
1
+
PDF
Chat
Limits of modularity maximization in community detection
2011
Andrea Lancichinetti
Santo Fortunato
1
+
PDF
Chat
Link communities reveal multiscale complexity in networks
2010
Yong‐Yeol Ahn
James P. Bagrow
Sune Lehmann
1
+
An upper bound on the number of cliques in a graph
1993
Martin Farber
Mihály Hujter
Źsolt Tuza
1
+
PDF
Chat
The Dynamics of Nestedness Predicts the Evolution of Industrial Ecosystems
2012
Sebastián Bustos
Charles Gomez
Ricardo Hausmann
César A. Hidalgo
1
+
None
2005
Jeong Han Kim
Oleg Pikhurko
Joel Spencer
Oleg Verbitsky
1
+
PDF
Chat
Statistical mechanics of complex networks
2002
Réka Albert
Albert‐László Barabási
1
+
PDF
Chat
The structure of scientific collaboration networks
2001
M. E. J. Newman
1
+
PDF
Chat
Resolution limit in community detection
2006
Santo Fortunato
Marc Barthélemy
1
+
PDF
Chat
Robustness of community structure in networks
2008
Brian Karrer
Elizaveta Levina
M. E. J. Newman
1
+
Cliques in random graphs
1976
B Bollobás
P. Erdős
1
+
PDF
Chat
Signed networks in social media
2010
Jure Leskovec
Daniel P. Huttenlocher
Jon Kleinberg
1
+
PDF
Chat
Mapping Change in Large Networks
2010
Martin Rosvall
Carl T. Bergstrom
1
+
PDF
Chat
Scalable detection of statistically significant communities and hierarchies, using message passing for modularity
2014
Pan Zhang
Cristopher Moore
1
+
PDF
Chat
Effective graph resistance
2011
Wendy Ellens
F. M. Spieksma
Piet Van Mieghem
Almerima Jamakovic
Robert E. Kooij
1
+
PDF
Chat
The Rise of China in the International Trade Network: A Community Core Detection Approach
2014
Zhen Zhu
Federica Cerina
Alessandro Chessa
Guido Caldarelli
Massimo Riccaboni
1
+
PDF
Chat
Uncovering the overlapping community structure of complex networks in nature and society
2005
Gergely Palla
Imre Derényi
Illés J. Farkas
Tamás Vicsek
1
+
PDF
Chat
Maps of random walks on complex networks reveal community structure
2008
Martin Rosvall
Carl T. Bergstrom
1
+
PDF
Chat
CFinder: locating cliques and overlapping modules in biological networks
2006
Balázs Adamcsek
Gergely Palla
Illés J. Farkas
Imre Derényi
Tamás Vicsek
1
+
PDF
Chat
Positional games on random graphs
2005
Miloš Stojaković
Tibor Szabó
1
+
PDF
Chat
Stability and Continuity of Centrality Measures in Weighted Graphs
2015
Santiago Segarra
Alejandro Ribeiro
1
+
PDF
Chat
Revealing in-block nestedness: Detection and benchmarking
2018
Albert Solé-Ribalta
Claudio J. Tessone
Manuel Sebastian Mariani
Javier Borge‐Holthoefer
1
+
Community Interaction and Conflict on the Web
2018
Srijan Kumar
William L. Hamilton
Jure Leskovec
Dan Jurafsky
1