default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaryam Sharifzadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Leila Badakhshian, Victor Falgas-Ravry, Maryam Sharifzadeh:
On Density Conditions for Transversal Trees in Multipartite Graphs. Electron. J. Comb. 31(4) (2024)- 2023
- [j16]Andrea Freschi, Simón Piga
, Maryam Sharifzadeh, Andrew Treglown:
The induced saturation problem for posets. Comb. Theory 3(3) (2023) - 2021
- [j15]Hong Liu, Maryam Sharifzadeh, Katherine Staden:
On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums. Electron. J. Comb. 28(1): 1 (2021) - [j14]Hong Liu, Maryam Sharifzadeh:
Groups with few maximal sum-free sets. J. Comb. Theory A 177: 105333 (2021) - 2020
- [j13]Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec:
Characterization of quasirandom permutations by a pattern sum. Random Struct. Algorithms 57(4): 920-939 (2020) - 2019
- [j12]József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran:
Structure and Supersaturation for Intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - [j11]Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh:
Edges not in any monochromatic copy of a fixed graph. J. Comb. Theory B 135: 16-43 (2019) - 2017
- [j10]József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh:
The typical structure of graphs with no large cliques. Comb. 37(4): 617-632 (2017) - [j9]Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Local Conditions for Exponentially Many Subdivisions. Comb. Probab. Comput. 26(3): 423-430 (2017) - [j8]Jaehoon Kim, Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Proof of Komlós's conjecture on Hamiltonian subsets. Electron. Notes Discret. Math. 61: 727-733 (2017) - [j7]József Balogh, Hong Liu, Maryam Sharifzadeh:
On Two Problems in Ramsey-Turán Theory. SIAM J. Discret. Math. 31(3): 1848-1866 (2017) - 2016
- [j6]József Balogh, Theodore Molla, Maryam Sharifzadeh:
Triangle factors of graphs without large independent sets and of weighted graphs. Random Struct. Algorithms 49(4): 669-693 (2016) - 2015
- [j5]Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager:
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree. Discret. Appl. Math. 185: 71-78 (2015) - [j4]József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49: 57-64 (2015) - [j3]József Balogh, Hong Liu, Maryam Sharifzadeh:
Subdivisions of a large clique in C6-free graphs. J. Comb. Theory B 112: 18-35 (2015) - [j2]József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh:
Intersecting families of discrete structures are typically trivial. J. Comb. Theory A 132: 224-245 (2015) - 2012
- [j1]Maryam Sharifzadeh, Gholam Zamani, Ezatollah Hossein Karami, Davar Khalili, Arthur Tatnall:
The Iranian Wheat Growers' Climate Information Use: An Actor-Network Theory Perspective. InnovaInt. J. Actor Netw. Theory Technol. Innov. 4(4): 1-22 (2012)
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 2025-01-09 12:46 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:
