András London

Orcid: 0000-0003-1957-5368

According to our database1, András London authored at least 15 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Intersection of random spanning trees in complex networks.
Appl. Netw. Sci., December, 2023

Detecting and generating overlapping nested communities.
Appl. Netw. Sci., December, 2023

2022
Graph clustering via generalized colorings.
Theor. Comput. Sci., 2022

A Forward-Looking Approach to Compare Ranking Methods for Sports.
Inf., 2022

2020
Stability of network centrality measures: a numerical study.
Soc. Netw. Anal. Min., 2020

2018
Complex network models, graph mining and information extraction from real-world systems
PhD thesis, 2018

Spanning Tree Game as Prim Would Have Played.
Acta Cybern., 2018

2017
Core of communities in bipartite networks.
CoRR, 2017

The Structure of Pairing Strategies for k-in-a-row Type Games.
Acta Cybern., 2017

2015
Complex network analysis of public transportation networks: A comprehensive study.
Proceedings of the 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), 2015

Applying graph-based data mining concepts to the educational sphere.
Proceedings of the 16th International Conference on Computer Systems and Technologies, 2015

2014
Time-dependent Network Algorithm for Ranking in Sports.
Acta Cybern., 2014

Student evaluation by graph based data mining of administrational systems of education.
Proceedings of the 15th International Conference on Computer Systems and Technologies, 2014

2013
Structure and dynamics of core/periphery networks.
J. Complex Networks, 2013

HITS based network algorithm for evaluating the professional skills of wine tasters.
Proceedings of the IEEE 8th International Symposium on Applied Computational Intelligence and Informatics, 2013


  Loading...