@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: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}
}

@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: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}
}

@article{MTMT:31783782,
	title = {A discrepancy version of the Hajnal–Szemerédi theorem},
	url = {https://m2.mtmt.hu/api/publication/31783782},
	author = {Balogh, József and Csaba, Béla and Pluhár, András and Treglown, Andrew},
	doi = {10.1017/S0963548320000516},
	journal-iso = {COMB PROBAB COMPUT},
	journal = {COMBINATORICS PROBABILITY & COMPUTING},
	volume = {30},
	unique-id = {31783782},
	issn = {0963-5483},
	year = {2021},
	eissn = {1469-2163},
	pages = {444-459},
	orcid-numbers = {Csaba, Béla/0000-0002-6696-3219; Pluhár, András/0000-0001-6576-4202}
}

@misc{MTMT:32541771,
	title = {Hálózati inverz fertőzési modellek a járványterjedés vizsgálatában},
	url = {https://m2.mtmt.hu/api/publication/32541771},
	author = {London, András and Pluhár, András},
	unique-id = {32541771},
	year = {2020},
	orcid-numbers = {London, András/0000-0003-1957-5368; Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:31623919,
	title = {Lineáris egyenletrendszerek konzisztenciájának kombinatorikai jelentései},
	url = {https://m2.mtmt.hu/api/publication/31623919},
	author = {Pluhár, András},
	doi = {10.37070/AML.2020.37.2.07},
	journal-iso = {ALK MAT LAP},
	journal = {ALKALMAZOTT MATEMATIKAI LAPOK},
	volume = {37},
	unique-id = {31623919},
	issn = {0133-3399},
	year = {2020},
	pages = {225-232},
	orcid-numbers = {Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:31305949,
	title = {On the Discrepancies of Graphs},
	url = {https://m2.mtmt.hu/api/publication/31305949},
	author = {Balogh, József and Csaba, Béla and Jing, Yifan and Pluhár, András},
	doi = {10.37236/8425},
	journal-iso = {ELECTRON J COMB},
	journal = {ELECTRONIC JOURNAL OF COMBINATORICS},
	volume = {27},
	unique-id = {31305949},
	issn = {1097-1440},
	year = {2020},
	eissn = {1077-8926},
	orcid-numbers = {Csaba, Béla/0000-0002-6696-3219; Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:31289829,
	title = {Linear Time Ordering of Bins using a Conveyor System},
	url = {https://m2.mtmt.hu/api/publication/31289829},
	author = {Makay, Géza and Pluhár, András},
	doi = {10.14232/actacyb.24.2.2019.2},
	journal-iso = {ACTA CYBERN-SZEGED},
	journal = {ACTA CYBERNETICA},
	volume = {24},
	unique-id = {31289829},
	issn = {0324-721X},
	year = {2019},
	eissn = {2676-993X},
	pages = {187-195},
	orcid-numbers = {Pluhár, András/0000-0001-6576-4202}
}

@article{MTMT:30379905,
	title = {The pairing strategies of the 9-in-a-row game},
	url = {https://m2.mtmt.hu/api/publication/30379905},
	author = {Győrffy, Lajos and Makay, Géza and Pluhár, András},
	doi = {10.26493/1855-3974.1350.990},
	journal-iso = {ARS MATH CONTEMPOR},
	journal = {ARS MATHEMATICA CONTEMPORANEA},
	volume = {16},
	unique-id = {30379905},
	issn = {1855-3966},
	year = {2019},
	eissn = {1855-3974},
	pages = {97-109},
	orcid-numbers = {Győrffy, Lajos/0000-0002-4606-5390; Pluhár, András/0000-0001-6576-4202}
}