default search action
András London
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Imre Gera
, András London:
Detecting and generating overlapping nested communities. Appl. Netw. Sci. 8(1): 51 (2023) - [j8]András London, András Pluhár:
Intersection of random spanning trees in complex networks. Appl. Netw. Sci. 8(1): 72 (2023) - 2022
- [j7]Peter Juma Ochieng
A Forward-Looking Approach to Compare Ranking Methods for Sports. Inf. 13(5): 232 (2022) - [j6]András London
Graph clustering via generalized colorings. Theor. Comput. Sci. 918: 94-104 (2022) - [c5]András London, András Pluhár:
Intersection of Random Spanning Trees in Small-World Networks. COMPLEX NETWORKS (2) 2022: 337-345 - 2020
- [j5]Orsolya Kardos, András London
Stability of network centrality measures: a numerical study. Soc. Netw. Anal. Min. 10(1): 80 (2020)
2010 – 2019
- 2018
- [b1]András London:
Complex network models, graph mining and information extraction from real-world systems. University of Szeged, Hungary, 2018 - [j4]András London
Spanning Tree Game as Prim Would Have Played. Acta Cybern. 23(3): 921-927 (2018) - 2017
- [j3]Lajos Gyõrffy
The Structure of Pairing Strategies for k-in-a-row Type Games. Acta Cybern. 23(2): 561-572 (2017) - [i2]Christian Bongiorno, András London, Salvatore Miccichè, Rosario N. Mantegna:
Core of communities in bipartite networks. CoRR abs/1704.01524 (2017) - 2015
- [c4]András London
Applying graph-based data mining concepts to the educational sphere. CompSysTech 2015: 358-365 - [c3]Andor Haznagy, Istvan Fi, András London
Complex network analysis of public transportation networks: A comprehensive study. MT-ITS 2015: 371-378 - 2014
- [j2]András London
Time-dependent Network Algorithm for Ranking in Sports. Acta Cybern. 21(3): 495-506 (2014) - [c2]András London
Student evaluation by graph based data mining of administrational systems of education. CompSysTech 2014: 363-369 - 2013
- [j1]Peter Csermely, András London, Ling-Yun Wu, Brian Uzzi:
Structure and dynamics of core/periphery networks. J. Complex Networks 1(2): 93-123 (2013) - [c1]András London
HITS based network algorithm for evaluating the professional skills of wine tasters. SACI 2013: 197-200 - [i1]Peter Csermely, András London, Ling-Yun Wu, Brian Uzzi:
Structure and dynamics of core-periphery networks. CoRR abs/1309.6928 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: