| Emergence of bimodality in controlling complex networks T Jia, YY Liu, E Csóka, M Pósfai, JJ Slotine, AL Barabási Nature communications 4 (1), 1-6, 2013 | 250 | 2013 |
| Core percolation on complex networks YY Liu, E Csóka, H Zhou, M Pósfai Physical review letters 109 (20), 205703, 2012 | 94 | 2012 |
| Invariant Gaussian processes and independent sets on regular graphs of large girth E Csóka, B Gerencsér, V Harangi, B Virág Random Structures & Algorithms 47 (2), 284-303, 2015 | 56 | 2015 |
| Invariant random perfect matchings in Cayley graphs E Csóka, G Lippner Groups, Geometry, and Dynamics 11 (1), 211-243, 2017 | 31* | 2017 |
| Independent sets and cuts in large-girth regular graphs E Csóka arXiv preprint arXiv:1602.02747, 2016 | 17 | 2016 |
| Kőnig’s line coloring and Vizing’s theorems for graphings E Csóka, G Lippner, O Pikhurko Forum of Mathematics, Sigma 4, e27, 2016 | 17 | 2016 |
| The extremal function for disconnected minors E Csóka, I Lo, S Norin, H Wu, L Yepremyan Journal of Combinatorial Theory, Series B 126, 162-174, 2017 | 16 | 2017 |
| Borel version of the Local Lemma E Csóka, Ł Grabowski, A Máthé, O Pikhurko, K Tyros arXiv preprint arXiv:1605.04877, 2016 | 16 | 2016 |
| Positive graphs OA Camarena, E Csóka, T Hubai, G Lippner, L Lovász European Journal of Combinatorics 52, 290-301, 2016 | 14 | 2016 |
| Moser-Tardos Algorithm with small number of random bits E Csóka, Ł Grabowski, A Máthé, O Pikhurko, K Tyros arXiv preprint arXiv:2203.05888, 2022 | 7 | 2022 |
| Application-oriented mathematical algorithms for group testing E Csóka arXiv preprint arXiv:2005.02388, 2020 | 7 | 2020 |
| Maximum flow is approximable by deterministic constant-time algorithm in sparse networks E Csóka Journal of Graph Theory, 1-8, 2016 | 7 | 2016 |
| Locally common graphs E Csóka, T Hubai, L Lovász Journal of Graph Theory 102 (3), 472-483, 2023 | 6 | 2023 |
| Entropy and expansion E Csóka, V Harangi, B Virág Annales de l'Institut Henri Poincaré - Probabilités et Statistiques 56 (4 …, 2020 | 6 | 2020 |
| The solution to an open problem for a caching game E Csóka, T Lidbetter Naval Research Logistics (NRL) 63 (1), 23-31, 2016 | 5 | 2016 |
| Limit theory of discrete mathematics problems E Csóka arXiv preprint arXiv:1505.06984, 2015 | 4* | 2015 |
| An undecidability result on limits of sparse graphs E Csóka The Electronic Journal of Combinatorics 19 (2), 2012 | 4 | 2012 |
| Upper bounds for the necklace folding problems E Csóka, ZL Blázsik, Z Király, D Lenger Journal of Combinatorial Theory, Series B 157, 123-143, 2022 | 3 | 2022 |
| Local algorithms with public randomisation on sparse graphs E Csóka arXiv preprint arXiv:1202.1565, 2012 | 3 | 2012 |
| Random local algorithms E Csóka Preprint. Available at, 2012 | 2 | 2012 |
Yang-Yu LiuAssociate Professor, Harvard Medical School; Associate Scientist, Brigham and Women’s HospitalVerified email at channing.harvard.edu
