default search action
Deepak Bal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Deepak Bal, Louis DeBiasio:
Large monochromatic components in expansive hypergraphs. Comb. Probab. Comput. 33(4): 467-483 (2024) - [j25]Sarah Acquaviva, Deepak Bal
:
Full degree spanning trees in random regular graphs. Discret. Appl. Math. 353: 85-93 (2024) - [j24]Deepak Bal, Louis DeBiasio, Allan Lo:
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. Eur. J. Comb. 120: 103969 (2024) - [j23]Deepak Bal
Large monochromatic components in hypergraphs with large minimum codegree. J. Graph Theory 105(3): 367-372 (2024) - [j22]Deepak Bal, Alan M. Frieze
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. 38(1): 867-882 (2024) - [i3]Sepideh Vafaie, Deepak Bal, Michael A. S. Thorne, Eric Forgoston:
Exploring the Dynamics of Lotka-Volterra Systems: Efficiency, Extinction Order, and Predictive Machine Learning. CoRR abs/2410.10999 (2024) - 2023
- [j21]Deepak Bal
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs. Electron. J. Comb. 30(1) (2023) - 2022
- [j20]Deepak Bal
New Lower Bounds on the Size-Ramsey Number of a Path. Electron. J. Comb. 29(1) (2022) - [i2]Deepak Bal, Alan M. Frieze, Pawel Pralat:
Rainbow spanning trees in randomly coloured Gk-out. CoRR abs/2210.01327 (2022) - 2021
- [j19]Deepak Bal, Joseph Degaetani:
A note on a candy sharing game. Art Discret. Appl. Math. 4(1) (2021) - [j18]Deepak Bal
Hamiltonian Berge cycles in random hypergraphs. Comb. Probab. Comput. 30(2): 228-238 (2021) - [j17]Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht:
Finding tight Hamilton cycles in random hypergraphs faster. Comb. Probab. Comput. 30(2): 239-257 (2021) - [j16]Deepak Bal
On the size Ramsey number of all cycles versus a path. Discret. Math. 344(5): 112322 (2021) - 2020
- [j15]Deepak Bal
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$. Electron. J. Comb. 27(4): 4 (2020) - [j14]Michael Anastos, Deepak Bal
A Ramsey property of random regular and k -out graphs. J. Graph Theory 93(3): 363-371 (2020)
2010 – 2019
- 2018
- [j13]Deepak Bal
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88(3): 449-481 (2018) - 2017
- [j12]Deepak Bal
Partitioning Random Graphs into Monochromatic Components. Electron. J. Comb. 24(1): 1 (2017) - [j11]Deepak Bal
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. Random Struct. Algorithms 51(4): 587-606 (2017) - 2016
- [j10]Deepak Bal, Patrick Bennett
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j9]Deepak Bal
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83(3): 251-265 (2016) - [j8]Deepak Bal
Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms 48(3): 503-523 (2016) - 2015
- [j7]Deepak Bal
Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j6]Deepak Bal, Anthony Bonato, William B. Kinnersley, Pawel Pralat:
Lazy Cops and Robbers on Hypercubes. Comb. Probab. Comput. 24(6): 829-837 (2015) - 2014
- [j5]Deepak Bal
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j4]Deepak Bal, Patrick Bennett
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30(5): 1073-1086 (2014) - 2012
- [j3]Deepak Bal
Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. 26(2): 435-451 (2012) - [i1]Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze:
A greedy algorithm for finding a large 2-matching on a random cubic graph. CoRR abs/1209.6570 (2012) - 2011
- [j2]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): 2577-2580 (2011)
2000 – 2009
- 2008
- [j1]Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia:
Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. 206(5): 676-693 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: