Deepak Bal

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 19

Top Topics

Greedy Algorithm

Grow Exponentially

Top Venues

Electron. J. Comb.

J. Graph Theory

Comb. Probab. Comput.

Random Struct. Algorithms

Publications

Deepak Bal, Alan M. Frieze, Pawel Pralat
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. 38 (1) (2024)
Deepak Bal, Louis DeBiasio
Large monochromatic components in hypergraphs with large minimum codegree. J. Graph Theory 105 (3) (2024)
Deepak Bal, Louis DeBiasio, Allan Lo
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. Eur. J. Comb. 120 (2024)
Sarah Acquaviva, Deepak Bal
Full degree spanning trees in random regular graphs. Discret. Appl. Math. 353 (2024)
Deepak Bal, Patrick Bennett
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Electron. J. Comb. 30 (1) (2023)
Deepak Bal, Alan M. Frieze, Pawel Pralat
. CoRR (2022)
Deepak Bal, Louis DeBiasio
New Lower Bounds on the Size-Ramsey Number of a Path. Electron. J. Comb. 29 (1) (2022)
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
Hamiltonian Berge cycles in random hypergraphs. Comb. Probab. Comput. 30 (2) (2021)
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
Finding tight Hamilton cycles in random hypergraphs faster. Comb. Probab. Comput. 30 (2) (2021)
Deepak Bal, Joseph Degaetani
A note on a candy sharing game. Art Discret. Appl. Math. 4 (1) (2021)
Deepak Bal, Ely Schudrich
On the size Ramsey number of all cycles versus a path. Discret. Math. 344 (5) (2021)
Deepak Bal, Patrick Bennett
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. Electron. J. Comb. 27 (4) (2020)
Michael Anastos, Deepak Bal
A Ramsey property of random regular and k -out graphs. J. Graph Theory 93 (3) (2020)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88 (3) (2018)
Deepak Bal, Louis DeBiasio
Partitioning Random Graphs into Monochromatic Components. Electron. J. Comb. 24 (1) (2017)
Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. Random Struct. Algorithms 51 (4) (2017)
Deepak Bal, Alan M. Frieze
Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms 48 (3) (2016)
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83 (3) (2016)
Deepak Bal, Patrick Bennett, Andrzej Dudek, Pawel Pralat
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23 (2) (2016)
Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. 22 (1) (2015)
Deepak Bal, Anthony Bonato, William B. Kinnersley, Pawel Pralat
Lazy Cops and Robbers on Hypercubes. Comb. Probab. Comput. 24 (6) (2015)
Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30 (5) (2014)
Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21 (2) (2014)
Deepak Bal, Alan M. Frieze
Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. 26 (2) (2012)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph CoRR (2012)
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
On the maximum number of edges in a hypergraph with a unique perfect matching. Discret. Math. 311 (21) (2011)
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia
Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. 206 (5) (2008)