Deepak Bal, Ph.D.
Affiliations: | 2013 | Carnegie Mellon University, Pittsburgh, PA |
Area:
Mathematics, Applied MathematicsGoogle:
"Deepak Bal"Parents
Sign in to add mentorAlan Frieze | grad student | 2013 | Carnegie Mellon | |
(Colorings, Matchings and Packings in Random and Pseudo-Random Graphs.) |
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. |
Anastos M, Bal D. (2020) A Ramsey Property of Random Regular and $k$-out Graphs Journal of Graph Theory. 93: 363-371 |
Bal D, Bennett P, Bohman T, et al. (2018) A greedy algorithm for finding a large 2‐matching on a random cubic graph Journal of Graph Theory. 88: 449-481 |
Bal D, DeBiasio L. (2017) Partitioning Random Graphs into Monochromatic Components Electronic Journal of Combinatorics. 24: 1-18 |
Bal D, Bennett P, Pérez-Giménez X, et al. (2017) Rainbow perfect matchings and Hamilton cycles in the random geometric graph Random Structures and Algorithms. 51: 587-606 |
Bal D, Bonato A, Kinnersley WB, et al. (2016) Lazy Cops and Robbers played on random graphs and graphs on surfaces The Journal of Combinatorics. 7: 627-642 |
Bal D, Bennett P, Dudek A, et al. (2016) The Total Acquisition Number of Random Graphs Electronic Journal of Combinatorics. 23: 2-55 |
Bal D, Frieze A. (2016) Rainbow matchings and Hamilton cycles in random graphs Random Structures and Algorithms. 48: 503-523 |
Bal D, Bennett P, Dudek A, et al. (2016) The total acquisition number of random graphs Electronic Journal of Combinatorics. 23 |
Bal D, Bennett P, Frieze A, et al. (2015) Power of k choices and rainbow spanning trees in random graphs Electronic Journal of Combinatorics. 22 |
Bal D, Bonato A, Kinnersley WB, et al. (2015) Lazy Cops and Robbers on Hypercubes Combinatorics Probability and Computing. 24: 829-837 |