Rainbow matchings and Hamilton cycles in random graphs D Bal, A Frieze Random Structures & Algorithms 48 (3), 503-523, 2016 | 29 | 2016 |

Partitioning random graphs into monochromatic components D Bal, L DeBiasio arXiv preprint arXiv:1509.09168, 2015 | 22 | 2015 |

Lazy Cops and Robbers on Hypercubes. D Bal, A Bonato, WB Kinnersley, P Pralat Comb. Probab. Comput. 24 (6), 829-837, 2015 | 19 | 2015 |

Graph connectivity, partial words, and a theorem of Fine and Wilf F Blanchet-Sadri, D Bal, G Sisodia Information and Computation 206 (5), 676-693, 2008 | 19 | 2008 |

Packing tight Hamilton cycles in uniform hypergraphs D Bal, A Frieze SIAM Journal on Discrete Mathematics 26 (2), 435-451, 2012 | 16 | 2012 |

Lazy cops and robbers played on random graphs and graphs on surfaces D Bal, A Bonato, WB Kinnersley, P Prałat | 15 | 2016 |

New lower bounds on the size-Ramsey number of a path D Bal, L DeBiasio arXiv preprint arXiv:1909.06354, 2019 | 11 | 2019 |

Rainbow arborescence in random digraphs D Bal, P Bennett, C Cooper, A Frieze, P Prałat Journal of Graph Theory 83 (3), 251-265, 2016 | 7 | 2016 |

The total acquisition number of random graphs D Bal, P Bennett, A Dudek, P Prałat arXiv preprint arXiv:1402.2854, 2014 | 6 | 2014 |

The t-tone chromatic number of random graphs D Bal, P Bennett, A Dudek, A Frieze Graphs and Combinatorics 30 (5), 1073-1086, 2014 | 5 | 2014 |

Rainbow perfect matchings and Hamilton cycles in the random geometric graph D Bal, P Bennett, X Pérez‐Giménez, P Prałat Random Structures & Algorithms 51 (4), 587-606, 2017 | 4 | 2017 |

Packing tree factors in random and pseudo-random graphs D Bal, A Frieze, M Krivelevich, PS Loh arXiv preprint arXiv:1304.2429, 2013 | 4 | 2013 |

Power of choices and rainbow spanning trees in random graphs D Bal, P Bennett, A Frieze, P Prałat arXiv preprint arXiv:1410.3405, 2014 | 3 | 2014 |

Leibniz, Bernoulli and the logarithms of negative numbers D Bal Hämtad från http://www. math. cmu. edu/~ dbal/files/LeibBernLogs. pdf, 2014 | 3 | 2014 |

On the maximum number of edges in a hypergraph with a unique perfect matching D Bal, A Dudek, ZB Yilma Discrete mathematics 311 (21), 2577-2580, 2011 | 3 | 2011 |

Hamiltonian Berge cycles in random hypergraphs D Bal, R Berkowitz, P Devlin, M Schacht Combinatorics, Probability and Computing 30 (2), 228-238, 2021 | 2 | 2021 |

Zero forcing number of random regular graphs D Bal, P Bennett, S English, C MacRury, P Prałat arXiv preprint arXiv:1812.06477, 2018 | 2 | 2018 |

Lazy Cops and Robbers played on Graphs D Bal, A Bonato, WB Kinnersley, P Prałat arXiv preprint arXiv:1312.1750, 2013 | 2 | 2013 |

The Johansson-Kahn-Vu solution of the Shamir problem D Bal, A Frieze | 2 | 2013 |

On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited D Bal arXiv preprint arXiv:1302.1162, 2013 | 2 | 2013 |