| On the resilience of long cycles in random graphs D Dellamonica Jr, Y Kohayakawa, M Marciniszyn, A Steger the electronic journal of combinatorics 15 (1), R32, 2008 | 42 | 2008 |
| The size‐Ramsey number of trees D Dellamonica Jr Random Structures & Algorithms 40 (1), 49-73, 2012 | 28 | 2012 |
| An improved upper bound on the density of universal random graphs D Dellamonica Jr, Y Kohayakawa, V Rödl, A Ruciński Random Structures & Algorithms 46 (2), 274-299, 2015 | 26 | 2015 |
| An exact algorithm for optimal mae stack filter design D Dellamonica, PJS Silva, C Humes, NST Hirata, J Barrera IEEE transactions on image processing 16 (2), 453-462, 2007 | 26 | 2007 |
| Rainbow paths D Dellamonica Jr, C Magnant, DM Martin Discrete mathematics 310 (4), 774-781, 2010 | 23 | 2010 |
| The number of B3-sets of a given cardinality D Dellamonica Jr, Y Kohayakawa, SJ Lee, V Rödl, W Samotij Journal of Combinatorial Theory, Series A 142, 44-76, 2016 | 17 | 2016 |
| On a conjecture of Thomassen concerning subgraphs of large girth D Dellamonica Jr, V Koubek, DM Martin, V Rödl Journal of Graph Theory 67 (4), 316-331, 2011 | 14 | 2011 |
| Universality of random graphs. D Dellamonica Jr, Y Kohayakawa, V Rödl, A Rucinski SODA 8, 782-788, 2008 | 13 | 2008 |
| Distance preserving Ramsey graphs D Dellamonica, V RÖDL Combinatorics, Probability and Computing 21 (4), 554-581, 2012 | 12 | 2012 |
| A deterministic algorithm for the Frieze–Kannan regularity lemma D Dellamonica, S Kalyanasundaram, D Martin, V Rödl, A Shapira SIAM Journal on Discrete Mathematics 26 (1), 15-29, 2012 | 12 | 2012 |
| Tree-minimal graphs are almost regular D Dellamonica, P Haxell, T Luczak, D Mubayi, B Nagle, Y Person, V Rödl, ... Journal of Combinatorics 3 (1), 49-62, 2012 | 11 | 2012 |
| Hereditary quasirandom properties of hypergraphs D Dellamonica Jr, V Rödl Combinatorica 31 (2), 165-182, 2011 | 11 | 2011 |
| An optimal algorithm for finding Frieze–Kannan regular partitions D Dellamonica, S Kalyanasundaram, DM Martin, V RÖDL, A Shapira Combinatorics, Probability and Computing 24 (2), 407-437, 2015 | 10 | 2015 |
| Universality of random graphs D Dellamonica Jr, Y Kohayakawa, V Rödl, A Ruciński SIAM Journal on Discrete Mathematics 26 (1), 353-374, 2012 | 10 | 2012 |
| A note on Thomassenʼs conjecture D Dellamonica Jr, V Rödl Journal of Combinatorial Theory, Series B 101 (6), 509-515, 2011 | 9 | 2011 |
| An algorithmic Friedman–Pippenger theorem on tree embeddings and applications D Dellamonica Jr, Y Kohayakawa The Electronic Journal of Combinatorics, R127-R127, 2008 | 9 | 2008 |
| On even-degree subgraphs of linear hypergraphs D Dellamonica, P Haxell, T Łuczak, D Mubayi, B Nagle, Y Person, V Rödl, ... Combinatorics, Probability and Computing 21 (1-2), 113-127, 2012 | 8 | 2012 |
| An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing D Dellamonica Jr, Y Kohayakawa Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 5 | 2006 |
| A note on induced Ramsey numbers D Conlon, D Dellamonica, S La Fleur, V Rödl, M Schacht A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, 357-366, 2017 | 4 | 2017 |
| Hereditary quasi-random properties of hypergraphs D Dellamonica Jr, V Rödl Electronic Notes in Discrete Mathematics 34, 495-499, 2009 | 1 | 2009 |
