@article{MTMT:34428928,
	title = {Támogatási nagyüzem – az egyedi kormánydöntések példája},
	url = {https://m2.mtmt.hu/api/publication/34428928},
	author = {Voszka, Éva and Végh, Marcell Zoltán and London, András},
	doi = {10.18414/KSZ.2023.12.1297},
	journal-iso = {KÖZGAZDASÁGI SZEMLE},
	journal = {KÖZGAZDASÁGI SZEMLE},
	volume = {70},
	unique-id = {34428928},
	issn = {0023-4346},
	abstract = {A beruházásösztönzés évek óta az iparpolitika alapvető eleme világszerte. A közelmúltban más területeken is erősödött az állam szerepvállalása és a támogatási verseny, amiből Magyarország sem marad ki. A szakirodalom eddig elsősorban az uniós források felhasználását és a kisvállalatok támogatását vizsgálta. Ez a cikk a hazai költségvetési forrásokon alapuló, nagyberuházásokat támogató egyedi kormánydöntéseket veszi szemügyre 2004-től napjainkig. Az elemzés szerint erős a koncentráció: a támogatás jelentős részét külföldi (főként német) beruházások, a kormány stratégiai partnerei és a járműipar vállalatai kapták. Ezek a nemcsak Magyarországra jellemző vonások növelik a gazdaság sebezhetőségét, amihez az elmúlt két évtizedben minden kormányzat hozzájárult. Legújabban a külföldi befektetések és az akkumulátoriparral kiegészített autógyártás kormányzati felértékelése növeli a kockázatot. A vállalati mérlegek adatain alapuló számításaink nem igazolják, de nem is cáfolják az állami ráfordítások nemzetgazdasági megtérülését, a cégekre gyakorolt hatás pedig csak a beruházások időleges növelésében érzékelhető. A kutatás során felmerült módszertani dilemmák és eredményeink korlátozottsága is arra hívja fel a figyelmet, hogy a kutatói közösségnek fontos feladata a támogatások hatásvizsgálatának továbbfejlesztése.*
		Journal of Economic Literature (JEL) kód: H71, L52, L62.},
	year = {2023},
	pages = {1297-1337},
	orcid-numbers = {London, András/0000-0003-1957-5368}
}

@article{MTMT:34197583,
	title = {Intersection of random spanning trees in complex networks},
	url = {https://m2.mtmt.hu/api/publication/34197583},
	author = {London, András and Pluhár, András},
	doi = {10.1007/s41109-023-00600-4},
	journal-iso = {APPL NETW SCI},
	journal = {APPLIED NETWORK SCIENCE},
	volume = {8},
	unique-id = {34197583},
	abstract = {In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023). A simple formula was derived for the size of the minimum expected intersection of two spanning trees chosen uniformly at random. Monte Carlo experiments were run for real networks. In this paper, we provide a broader context and motivations for the concept, discussing its game theoretic origins, examples, its applications to network optimization problems, and its potential use in quantifying the resilience and modular structure of complex networks.},
	year = {2023},
	eissn = {2364-8228},
	orcid-numbers = {London, András/0000-0003-1957-5368; Pluhár, András/0000-0001-6576-4202}
}

@inproceedings{MTMT:34154764,
	title = {Graph-Based Prioritization of Related Cancer Genes},
	url = {https://m2.mtmt.hu/api/publication/34154764},
	author = {Ochieng, Peter Juma and Dombi, József and Kalmár, Tibor and London, András and Krész, Miklós},
	booktitle = {Proceedings of the 17th International Symposium on Operational Research in Slovenia, SOR 2023},
	unique-id = {34154764},
	year = {2023},
	pages = {371-374},
	orcid-numbers = {Ochieng, Peter Juma/0000-0001-6497-6481; Dombi, József/0000-0001-9459-912X; Kalmár, Tibor/0000-0002-0419-2009; London, András/0000-0003-1957-5368}
}

@article{MTMT:34093227,
	title = {Detecting and generating overlapping nested communities},
	url = {https://m2.mtmt.hu/api/publication/34093227},
	author = {Gera, Imre and London, András},
	doi = {10.1007/s41109-023-00575-2},
	journal-iso = {APPL NETW SCI},
	journal = {APPLIED NETWORK SCIENCE},
	volume = {8},
	unique-id = {34093227},
	abstract = {Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with similar limitations. Clustering approaches also fail to uncover the overlap between fully nested subgraphs, as they assign vertices to a single group only. In this paper, we look at the nestedness of a network through an auxiliary graph, in which a directed edge represents a nested relationship between the two corresponding vertices of the network. We present an algorithm that recovers this so-called community graph, and finds the overlapping fully nested subgraphs of a network. We also introduce an algorithm for generating graphs with such nested structure, given by a community graph. This algorithm can be used to test a nested community detection algorithm of this kind, and potentially to evaluate different metrics of nestedness as well. Finally, we evaluate our nested community detection algorithm on a large variety of networks, including bipartite and non-bipartite ones, too. We derive a new metric from the community graph to quantify the nestedness of both bipartite and non-bipartite networks.},
	year = {2023},
	eissn = {2364-8228},
	orcid-numbers = {London, András/0000-0003-1957-5368}
}

@inproceedings{MTMT:33603916,
	title = {Intersection of Random Spanning Trees in Small-World Networks},
	url = {https://m2.mtmt.hu/api/publication/33603916},
	author = {London, András and Pluhár, András},
	booktitle = {Complex Networks and Their Applications XI},
	doi = {10.1007/978-3-031-21131-7_26},
	unique-id = {33603916},
	year = {2023},
	pages = {337-345},
	orcid-numbers = {London, András/0000-0003-1957-5368; Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:33341004,
	title = {The various European capitalism models: Convergence and growth in the 2014–2019 inter-crisis period},
	url = {https://m2.mtmt.hu/api/publication/33341004},
	author = {Kuruczleki, Éva and London, András and Pelle, Anita and Végh, Marcell Zoltán},
	doi = {10.1556/032.2022.00029},
	journal-iso = {ACTA OECON},
	journal = {ACTA OECONOMICA},
	volume = {72},
	unique-id = {33341004},
	issn = {0001-6373},
	abstract = {The Varieties of Capitalism (VoC) literature has recently manifested a dynamic development. Among others, the member states of the European Union (EU) have been studied extensively from this viewpoint, and main capitalism models have been identified. Yet, the global financial and economic crisis and its aftermath in Europe have impacted the member states' economies, typically in asymmetric ways and, in 2020, a highly diverse EU faced the COVID-19 induced economic crisis.},
	year = {2022},
	eissn = {1588-2659},
	pages = {413-436},
	orcid-numbers = {London, András/0000-0003-1957-5368; Pelle, Anita/0000-0001-9115-4264}
}

@inproceedings{MTMT:33203006,
	title = {Greedy algorithm for edge-based nested community detection},
	url = {https://m2.mtmt.hu/api/publication/33203006},
	author = {Gera, Imre and London, András and Pluhár, András},
	booktitle = {2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)},
	doi = {10.1109/CITDS54976.2022.9914051},
	unique-id = {33203006},
	year = {2022},
	pages = {86-91},
	orcid-numbers = {London, András/0000-0003-1957-5368; Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:33063525,
	title = {Hierarchikus klaszterezés és a portfólió-kiválasztás probléma},
	url = {https://m2.mtmt.hu/api/publication/33063525},
	author = {Gera, Imre and London, András},
	journal-iso = {SZIGMA},
	journal = {SZIGMA},
	volume = {53},
	unique-id = {33063525},
	issn = {0039-8128},
	year = {2022},
	pages = {73-88},
	orcid-numbers = {London, András/0000-0003-1957-5368}
}

@article{MTMT:32818122,
	title = {A Forward-Looking Approach to Compare Ranking Methods for Sports},
	url = {https://m2.mtmt.hu/api/publication/32818122},
	author = {Ochieng, Peter Juma and London, András and Krész, Miklós},
	doi = {10.3390/info13050232},
	journal-iso = {INFORMATION-BASEL},
	journal = {INFORMATION (BASEL)},
	volume = {13},
	unique-id = {32818122},
	year = {2022},
	eissn = {2078-2489},
	orcid-numbers = {Ochieng, Peter Juma/0000-0001-6497-6481; London, András/0000-0003-1957-5368}
}

@article{MTMT:32818120,
	title = {Graph clustering via generalized colorings},
	url = {https://m2.mtmt.hu/api/publication/32818120},
	author = {London, András and Martin, Ryan Robert and Pluhár, András},
	doi = {10.1016/j.tcs.2022.03.023},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {918},
	unique-id = {32818120},
	issn = {0304-3975},
	year = {2022},
	eissn = {1879-2294},
	pages = {94-104},
	orcid-numbers = {London, András/0000-0003-1957-5368; Martin, Ryan Robert/0000-0003-0683-1414; Pluhár, András/0000-0001-6576-4202}
}