Domingos Dellamonica, Ph.D.
Affiliations: | 2012 | Math and Computer Science | Emory University, Atlanta, GA |
Area:
MathematicsGoogle:
"Domingos Dellamonica"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Dellamonica D, Kohayakawa Y, Lee SJ, et al. (2017) The number of Bh-sets of a given cardinality Proceedings of the London Mathematical Society. 116: 629-669 |
| Dellamonica D, Kohayakawa Y, Lee SJ, et al. (2016) On the Number of Bh-Sets Combinatorics Probability and Computing. 25: 108-129 |
| Dellamonica D, Kohayakawa Y, Lee SJ, et al. (2016) The number of B3-sets of a given cardinality Journal of Combinatorial Theory. Series A. 142: 44-76 |
| Dellamonica D, Kalyanasundaram S, Martin DM, et al. (2015) An optimal algorithm for finding frieze-kannan regular partitions Combinatorics Probability and Computing. 24: 407-437 |
| Dellamonica D, La Fleur S, Rödl V. (2015) On induced ramsey numbers for k-uniform hypergraphs Random Structures and Algorithms |
| Dellamonica D, Kohayakawa Y, Rödl V, et al. (2015) An improved upper bound on the density of universal random graphs Random Structures and Algorithms. 46: 274-299 |
| Dellamonica D, Haxell P, Luczak T, et al. (2012) Tree-minimal graphs are almost regular Journal of Combinatorics. 3: 49-62 |
| Dellamonica D, Kalyanasundaram S, Martin D, et al. (2012) A deterministic algorithm for the frieze-kannan regularity lemma Siam Journal On Discrete Mathematics. 26: 15-29 |
| Dellamonica D, Kohayakawa Y, Rödl V, et al. (2012) Universality of random graphs Siam Journal On Discrete Mathematics. 26: 353-374 |
| Dellamonica D, Rödl V. (2012) Distance preserving ramsey graphs Combinatorics Probability and Computing. 21: 554-581 |