Emergence of segregation in evolving social networks AD Henry, P Prałat, CQ Zhang Proceedings of the National Academy of Sciences 108 (21), 8605-8610, 2011 | 163 | 2011 |
A spatial web graph model with local influence regions W Aiello, A Bonato, C Cooper, J Janssen, P Prałat Internet Mathematics 5 (1-2), 175-196, 2008 | 108 | 2008 |
Clustering via hypergraph modularity B Kamiński, V Poulin, P Prałat, P Szufel, F Théberge PloS one 14 (11), e0224307, 2019 | 88 | 2019 |
Chasing robbers on random graphs: zigzag theorem T Łuczak, P Prałat Random Structures & Algorithms 37 (4), 516-524, 2010 | 73 | 2010 |
Cops and robbers from a distance A Bonato, E Chiniforooshan, P Prałat Theoretical Computer Science 411 (43), 3834-3844, 2010 | 66 | 2010 |
On some multicolor Ramsey properties of random graphs A Dudek, P Prałat SIAM Journal on Discrete Mathematics 31 (3), 2079-2092, 2017 | 61 | 2017 |
An alternative proof of the linearity of the size-Ramsey number of paths A Dudek, P Prałat Combinatorics, Probability and Computing 24 (3), 551-555, 2015 | 60 | 2015 |
Models of online social networks A Bonato, N Hadi, P Horn, P Prałat, C Wang Internet Mathematics 6 (3), 285-313, 2009 | 59 | 2009 |
Cleaning a network with brushes ME Messinger, RJ Nowakowski, P Prałat Theoretical Computer Science 399 (3), 191-205, 2008 | 56 | 2008 |
When does a random graph have constant cop number? P Pralat Australas. J Comb. 46, 285-296, 2010 | 54 | 2010 |
On-line Ramsey numbers for paths and stars JA Grytczuk, HA Kierstead, P Prałat Discrete Mathematics & Theoretical Computer Science 10 (Graph and Algorithms), 2008 | 54 | 2008 |
Cops and invisible robbers: The cost of drunkenness A Kehagias, D Mitsche, P Prałat Theoretical Computer Science 481, 100-120, 2013 | 53 | 2013 |
Dimensionality of social networks using motifs and eigenvalues A Bonato, DF Gleich, M Kim, D Mitsche, P Prałat, Y Tian, SJ Young PloS one 9 (9), e106052, 2014 | 45 | 2014 |
Metric dimension for random graphs B Bollobás, D Mitsche, P Pralat arXiv preprint arXiv:1208.3801, 2012 | 45 | 2012 |
Burning graphs: a probabilistic perspective D Mitsche, P Prałat, E Roshanbin Graphs and Combinatorics 33, 449-471, 2017 | 44 | 2017 |
Some typical properties of the spatial preferred attachment model C Cooper, A Frieze, P Prałat Internet Mathematics 10 (1-2), 116-136, 2014 | 44 | 2014 |
Modularity of Complex Networks Models. LO Prokhorenkova, P Pralat, AM Raigorodskii WAW, 115-126, 2016 | 43 | 2016 |
Cleaning regular graphs with brushes N Alon, PŁ PraŁat, N Wormald SIAM Journal on Discrete Mathematics 23 (1), 233-250, 2009 | 43 | 2009 |
Meyniel's conjecture holds for random graphs P Prałat, N Wormald Random Structures & Algorithms 48 (2), 396-421, 2016 | 42* | 2016 |
Geometric protean graphs A Bonato, J Janssen, P Prałat Internet Mathematics 8 (1-2), 2-28, 2012 | 42 | 2012 |