default search action
Shagnik Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Shagnik Das
, Charlotte Knierim, Patrick Morris
Schur properties of randomly perturbed sets. Eur. J. Comb. 121: 103843 (2024) - [j23]Shagnik Das
Tight bounds for divisible subdivisions. J. Comb. Theory B 165: 1-19 (2024) - 2023
- [j22]Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Yvonne Den Bakker:
Covering grids with multiplicity. Comb. Theory 3(3) (2023) - [j21]Anurag Bishnoi, Simona Boyadzhiyska
Subspace coverings with multiplicities. Comb. Probab. Comput. 32(5): 782-795 (2023) - [i2]Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri:
Strong blocking sets and minimal codes from expander graphs. CoRR abs/2305.15297 (2023) - 2021
- [j20]Anurag Bishnoi, Shagnik Das
Ryser's Conjecture for t-intersecting hypergraphs. J. Comb. Theory A 179: 105366 (2021) - [j19]Shagnik Das
Isomorphic bisections of cubic graphs. J. Comb. Theory B 151: 465-481 (2021) - 2020
- [j18]Shagnik Das
Ramsey properties of randomly perturbed graphs: cliques and cycles. Comb. Probab. Comput. 29(6): 830-867 (2020) - [j17]Simona Boyadzhiyska
Enumerating extensions of mutually orthogonal Latin squares. Des. Codes Cryptogr. 88(10): 2187-2206 (2020) - [j16]David Conlon
Ramsey games near the critical threshold. Random Struct. Algorithms 57(4): 940-957 (2020) - [j15]Shagnik Das
Vertex Ramsey properties of randomly perturbed graphs. Random Struct. Algorithms 57(4): 983-1006 (2020)
2010 – 2019
- 2019
- [j14]József Balogh, Shagnik Das
Structure and Supersaturation for Intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - [j13]Shagnik Das
Colouring set families without monochromatic k-chains. J. Comb. Theory A 168: 84-119 (2019) - 2018
- [j12]Dennis Clemens
Colourings without monochromatic disjoint pairs. Eur. J. Comb. 70: 99-124 (2018) - 2017
- [i1]Shagnik Das, Tamás Mészáros:
A Semi-Random Construction of Small Covering Arrays. CoRR abs/1703.05252 (2017) - 2016
- [j11]Shagnik Das
The minimum number of disjoint pairs in set systems and related problems. Comb. 36(6): 623-660 (2016) - [j10]Shagnik Das
Almost-Fisher families. J. Comb. Theory A 138: 175-207 (2016) - [j9]Shagnik Das
Removal and Stability for Erdös-Ko-Rado. SIAM J. Discret. Math. 30(2): 1102-1114 (2016) - 2015
- [j8]Shagnik Das
Most Probably Intersecting Hypergraphs. Electron. J. Comb. 22(1): 1 (2015) - [j7]Shagnik Das
Sperner's Theorem and a Problem of Erdős, Katona and Kleitman. Comb. Probab. Comput. 24(4): 585-608 (2015) - [j6]Tuan Tran, Shagnik Das:
A simple removal lemma for large nearly-intersecting families. Electron. Notes Discret. Math. 49: 93-99 (2015) - [j5]Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. Electron. Notes Discret. Math. 49: 293-300 (2015) - [j4]Noga Alon, Shagnik Das
Comparable pairs in families of sets. J. Comb. Theory B 115: 164-185 (2015) - [j3]József Balogh, Shagnik Das
Intersecting families of discrete structures are typically trivial. J. Comb. Theory A 132: 224-245 (2015) - 2013
- [j2]Shagnik Das
Rainbow Turán problem for even cycles. Eur. J. Comb. 34(5): 905-915 (2013) - [j1]Shagnik Das
A problem of Erdős on the minimum number of k-cliques. J. Comb. Theory B 103(3): 344-373 (2013)
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-11-26 20:42 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: