Graph connectivity, partial words, and a theorem of Fine and Wilf. - Francine Blanchet-Sadri; Deepak Bal; Gautam Sisodia (Inf. Comput., 2008)

On the maximum number of edges in a hypergraph with a unique perfect matching. - Deepak Bal; Andrzej Dudek; Zelealem B. Yilma (Discret. Math., 2011)

Packing Tight Hamilton Cycles in Uniform Hypergraphs. - Deepak Bal; Alan M. Frieze (SIAM J. Discret. Math., 2012)

Packing Tree Factors in Random and Pseudo-random Graphs. - Deepak Bal; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Electron. J. Comb., 2014)

The t-Tone Chromatic Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Alan M. Frieze (Graphs Comb., 2014)

Power of k Choices and Rainbow Spanning Trees in Random Graphs. - Deepak Bal; Patrick Bennett; Alan M. Frieze; Pawel Pralat (Electron. J. Comb., 2015)

Lazy Cops and Robbers on Hypercubes. - Deepak Bal; Anthony Bonato; William B. Kinnersley; Pawel Pralat (Comb. Probab. Comput., 2015)

The Total Acquisition Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Pawel Pralat (Electron. J. Comb., 2016)

Rainbow Arborescence in Random Digraphs. - Deepak Bal; Patrick Bennett; Colin Cooper; Alan M. Frieze; Pawel Pralat (J. Graph Theory, 2016)

Rainbow matchings and Hamilton cycles in random graphs. - Deepak Bal; Alan M. Frieze (Random Struct. Algorithms, 2016)

Partitioning Random Graphs into Monochromatic Components. - Deepak Bal; Louis DeBiasio (Electron. J. Comb., 2017)

Rainbow perfect matchings and Hamilton cycles in the random geometric graph. - Deepak Bal; Patrick Bennett; Xavier Pérez-Giménez; Pawel Pralat (Random Struct. Algorithms, 2017)

A greedy algorithm for finding a large 2-matching on a random cubic graph. - Deepak Bal; Patrick Bennett; Tom Bohman; Alan M. Frieze (J. Graph Theory, 2018)

The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. - Deepak Bal; Patrick Bennett (Electron. J. Comb., 2020)

A Ramsey property of random regular and k -out graphs. - Michael Anastos; Deepak Bal (J. Graph Theory, 2020)

A note on a candy sharing game. - Deepak Bal; Joseph Degaetani (Art Discret. Appl. Math., 2021)

Hamiltonian Berge cycles in random hypergraphs. - Deepak Bal; Ross Berkowitz; Pat Devlin 001; Mathias Schacht (Comb. Probab. Comput., 2021)

Finding tight Hamilton cycles in random hypergraphs faster. - Deepak Bal; Ross Berkowitz; Pat Devlin 001; Mathias Schacht (Comb. Probab. Comput., 2021)

On the size Ramsey number of all cycles versus a path. - Deepak Bal; Ely Schudrich (Discret. Math., 2021)

New Lower Bounds on the Size-Ramsey Number of a Path. - Deepak Bal; Louis DeBiasio (Electron. J. Comb., 2022)

Rainbow spanning trees in randomly coloured Gk-out. - Deepak Bal; Alan M. Frieze; Pawel Pralat (CoRR, 2022)

The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. - Deepak Bal; Patrick Bennett (Electron. J. Comb., 2023)

Exploring the Dynamics of Lotka-Volterra Systems: Efficiency, Extinction Order, and Predictive Machine Learning. - Sepideh Vafaie; Deepak Bal; Michael A. S. Thorne; Eric Forgoston (CoRR, 2024)

Large monochromatic components in expansive hypergraphs. - Deepak Bal; Louis DeBiasio (Comb. Probab. Comput., 2024)

Full degree spanning trees in random regular graphs. - Sarah Acquaviva; Deepak Bal (Discret. Appl. Math., 2024)

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. - Deepak Bal; Louis DeBiasio; Allan Lo (Eur. J. Comb., 2024)

Large monochromatic components in hypergraphs with large minimum codegree. - Deepak Bal; Louis DeBiasio (J. Graph Theory, 2024)

Rainbow Spanning Trees in Randomly Colored ( boldsymbol{G}_{ boldsymbol{k}- boldsymbol{out}} ). - Deepak Bal; Alan M. Frieze; Pawel Pralat (SIAM J. Discret. Math., 2024)

On the Number of Monochromatic Cliques in a Graph. - Deepak Bal; Jonathan Cutler; Luke Pebody (Electron. J. Comb., 2025)