HITS based network algorithm for evaluating the professional skills of wine tasters. - András London; Tibor Csendes (SACI, 2013)

Structure and dynamics of core/periphery networks. - Peter Csermely; András London; Ling-Yun Wu; Brian Uzzi (J. Complex Networks, 2013)

Student evaluation by graph based data mining of administrational systems of education. - András London; Tamás Németh (CompSysTech, 2014)

Time-dependent Network Algorithm for Ranking in Sports. - András London; József Németh; Tamás Németh (Acta Cybern., 2014)

Applying graph-based data mining concepts to the educational sphere. - András London; Áron Pelyhe; Csaba Holló; Tamás Németh (CompSysTech, 2015)

Complex network analysis of public transportation networks: A comprehensive study. - Andor Haznagy; Istvan Fi; András London; Tamás Németh (MT-ITS, 2015)

The Structure of Pairing Strategies for k-in-a-row Type Games. - Lajos Gyõrffy; András London; Géza Makay (Acta Cybern., 2017)

Core of communities in bipartite networks. - Christian Bongiorno; András London; Salvatore Miccichè; Rosario N. Mantegna (CoRR, 2017)

Spanning Tree Game as Prim Would Have Played. - András London; András Pluhár (Acta Cybern., 2018)

Complex network models, graph mining and information extraction from real-world systems - András London (2018)

Stability of network centrality measures: a numerical study. - Orsolya Kardos; András London; Tamás Vinkó (Soc. Netw. Anal. Min., 2020)

Intersection of Random Spanning Trees in Small-World Networks. - András London; András Pluhár (COMPLEX NETWORKS (2), 2022)

A Forward-Looking Approach to Compare Ranking Methods for Sports. - Peter Juma Ochieng; András London; Miklós Krész (Inf., 2022)

Graph clustering via generalized colorings. - András London; Ryan R. Martin; András Pluhár (Theor. Comput. Sci., 2022)

Detecting and generating overlapping nested communities. - Imre Gera; András London (Appl. Netw. Sci., 2023)

Intersection of random spanning trees in complex networks. - András London; András Pluhár (Appl. Netw. Sci., 2023)

A network clustering method based on intersection of random spanning trees. - László Hajdu; András London; András Pluhár (FedCSIS, 2024)

Recovering nested structures in networks: an evaluation of hierarchical clustering techniques. - Imre Gera; András London (J. Complex Networks, 2024)