| Year |
Citation |
Score |
| 2017 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of Bh-sets of a given cardinality Proceedings of the London Mathematical Society. 116: 629-669. DOI: 10.1112/Plms.12082 |
0.54 |
|
| 2016 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. On the Number of Bh-Sets Combinatorics Probability and Computing. 25: 108-129. DOI: 10.1017/S0963548315000206 |
0.555 |
|
| 2016 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality Journal of Combinatorial Theory. Series A. 142: 44-76. DOI: 10.1016/J.Jcta.2016.03.004 |
0.647 |
|
| 2015 |
Dellamonica D, Kalyanasundaram S, Martin DM, Rödl V, Shapira A. An optimal algorithm for finding frieze-kannan regular partitions Combinatorics Probability and Computing. 24: 407-437. DOI: 10.1017/S0963548314000200 |
0.689 |
|
| 2015 |
Dellamonica D, La Fleur S, Rödl V. On induced ramsey numbers for k-uniform hypergraphs Random Structures and Algorithms. DOI: 10.1002/Rsa.20580 |
0.525 |
|
| 2015 |
Dellamonica D, Kohayakawa Y, Rödl V, Ruciński A. An improved upper bound on the density of universal random graphs Random Structures and Algorithms. 46: 274-299. DOI: 10.1002/Rsa.20545 |
0.68 |
|
| 2012 |
Dellamonica D, Haxell P, Luczak T, Mubayi D, Nagle B, Person Y, Rödl V, Schacht M. Tree-minimal graphs are almost regular Journal of Combinatorics. 3: 49-62. DOI: 10.4310/Joc.2012.V3.N1.A2 |
0.689 |
|
| 2012 |
Dellamonica D, Kalyanasundaram S, Martin D, Rödl V, Shapira A. A deterministic algorithm for the frieze-kannan regularity lemma Siam Journal On Discrete Mathematics. 26: 15-29. DOI: 10.1137/110846373 |
0.593 |
|
| 2012 |
Dellamonica D, Kohayakawa Y, Rödl V, Rucínski A. Universality of random graphs Siam Journal On Discrete Mathematics. 26: 353-374. DOI: 10.1137/10079882X |
0.674 |
|
| 2012 |
Dellamonica D, Rödl V. Distance preserving ramsey graphs Combinatorics Probability and Computing. 21: 554-581. DOI: 10.1017/S096354831200003X |
0.639 |
|
| 2012 |
Dellamonica D, Haxell P, Łuczak T, Mubayi D, Nagle B, Person Y, Rödl V, Schacht M, Verstraëte J. On even-degree subgraphs of linear hypergraphs Combinatorics Probability and Computing. 21: 113-127. DOI: 10.1017/S0963548311000575 |
0.637 |
|
| 2012 |
Dellamonica D. The size-Ramsey number of trees Random Structures and Algorithms. 40: 49-73. DOI: 10.1002/Rsa.20363 |
0.476 |
|
| 2011 |
Dellamonica D, Rödl V. A note on Thomassen's conjecture Journal of Combinatorial Theory. Series B. 101: 509-515. DOI: 10.1016/J.Jctb.2011.04.002 |
0.621 |
|
| 2011 |
Dellamonica D, Rödl V. Hereditary quasirandom properties of hypergraphs Combinatorica. 31: 165-182. DOI: 10.1016/J.Endm.2009.07.082 |
0.636 |
|
| 2011 |
Dellamonica D, Koubek V, Martin DM, Rödl V. On a conjecture of Thomassen concerning subgraphs of large girth Journal of Graph Theory. 67: 316-331. DOI: 10.1002/Jgt.20534 |
0.683 |
|
| 2010 |
Dellamonica D, Magnant C, Martin DM. Rainbow paths Discrete Mathematics. 310: 774-781. DOI: 10.1016/J.Disc.2009.09.010 |
0.581 |
|
| 2009 |
Dellamonica D, Rödl V. Hereditary quasi-random properties of hypergraphs Electronic Notes in Discrete Mathematics. 34: 495-499. DOI: 10.1016/j.endm.2009.07.082 |
0.608 |
|
| 2008 |
Dellamonica D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications Electronic Journal of Combinatorics. 15. DOI: 10.37236/851 |
0.564 |
|
| 2008 |
Dellamonica D, Kohayakawa Y, Marciniszyn M, Steger A. On the resilience of long cycles in random graphs Electronic Journal of Combinatorics. 15. |
0.361 |
|
| 2006 |
Dellamonica D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications to routing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1038-1044. |
0.379 |
|
| Show low-probability matches. |