default search action
Mahya Ghandehari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Mahya Ghandehari, Teddy Mishura:
Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach. Electron. J. Comb. 31(4) (2024) - [j9]Mahya Ghandehari, Jeannette C. M. Janssen:
Graph sequences sampled from Robinson graphons. Eur. J. Comb. 116: 103859 (2024) - [i5]Mahya Ghandehari, Jeannette C. M. Janssen, Silo Murphy:
Unified Fourier bases for GSP on stochastic block model graphs. CoRR abs/2406.06306 (2024) - 2023
- [i4]Kathryn Beck, Mahya Ghandehari, Skyler Hudson, Jenna Paltenstein:
Frames for signal processing on Cayley graphs. CoRR abs/2303.02812 (2023) - [i3]Kathryn Beck, Mahya Ghandehari, Jeannette C. M. Janssen, Nauzer Kalyaniwalla:
Signal processing on large networks with group symmetries. CoRR abs/2303.17065 (2023) - 2022
- [c1]Kathryn Beck, Mahya Ghandehari:
Frames for Graph Signals on the Symmetric Group: A Representation Theoretic Approach. EUSIPCO 2022: 2071-2075 - [i2]Kathryn Beck, Mahya Ghandehari:
Frames for Graph Signals on the Symmetric Group: A Representation Theoretic Approach. CoRR abs/2203.03036 (2022) - 2021
- [j8]Yemon Choi
, Mahya Ghandehari
Unavoidable subprojections in union-closed set systems of infinite breadth. Eur. J. Comb. 94: 103311 (2021)
2010 – 2019
- 2019
- [j7]Mahya Ghandehari
An Optimization Parameter for Seriation of Noisy Data. SIAM J. Discret. Math. 33(2): 712-730 (2019) - 2017
- [j6]Huda Chuangpishit, Mahya Ghandehari
Uniform linear embeddings of graphons. Eur. J. Comb. 61: 47-68 (2017) - 2015
- [j5]Huda Chuangpishit, Mahya Ghandehari, Jeannette C. M. Janssen
Uniform Linear Embeddings of Spatial Random Graphs. Electron. Notes Discret. Math. 49: 541-547 (2015) - [j4]Huda Chuangpishit, Mahya Ghandehari
Linear embeddings of graphs and graph limits. J. Comb. Theory B 113: 162-184 (2015) - 2012
- [i1]Huda Chuangpishit, Mahya Ghandehari, Matt Hurshman, Jeannette C. M. Janssen, Nauzer Kalyaniwalla:
Linear embeddings of graphs and graph limits. CoRR abs/1210.4451 (2012)
2000 – 2009
- 2008
- [j3]Mahya Ghandehari
Fourier analysis and large independent sets in powers of complete graphs. J. Comb. Theory B 98(1): 164-172 (2008) - 2005
- [j2]Mahya Ghandehari
On the size of the minimum critical set of a Latin square. Discret. Math. 293(1-3): 121-127 (2005) - [j1]Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005)
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-08 21:30 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: