default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeysam Alishahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Meysam Alishahi, Anna Little, Jeff M. Phillips:
Linear Distance Metric Learning with Noisy Labels. J. Mach. Learn. Res. 25: 121:1-121:53 (2024)- [c1]Meysam Alishahi, Jeff M. Phillips:
No Dimensional Sampling Coresets for Classification. ICML 2024 - [i2]Meysam Alishahi, Jeff M. Phillips:
No Dimensional Sampling Coresets for Classification. CoRR abs/2402.05280 (2024) - 2023
- [i1]Meysam Alishahi, Anna Little, Jeff M. Phillips:
Linear Distance Metric Learning with Noisy Labels. CoRR abs/2306.03173 (2023) - 2021
- [j23]Meysam Alishahi, Frédéric Meunier:
Topological Bounds for Graph Representations over Any Field. SIAM J. Discret. Math. 35(1): 91-104 (2021) - 2020
- [j22]Meysam Alishahi, Hossein Hajiabolhassan
:
On the Chromatic Number of Matching Kneser Graphs. Comb. Probab. Comput. 29(1): 1-21 (2020) - [j21]Meysam Alishahi, Elahe Rezaei-Sani, Elahe Sharifi:
Maximum nullity and zero forcing number on graphs with maximum degree at most three. Discret. Appl. Math. 284: 179-194 (2020)
2010 – 2019
- 2019
- [j20]Meysam Alishahi, Ali Taherkhani:
On the random version of the Erdős matching conjecture. Discret. Appl. Math. 254: 1-9 (2019) - [j19]Meysam Alishahi, Hossein Hajiabolhassan:
On chromatic number and minimum cut. J. Comb. Theory B 139: 27-46 (2019) - 2018
- [j18]Roya Abyazi Sani, Meysam Alishahi, Ali Taherkhani:
Coloring properties of categorical product of general Kneser hypergraphs. Ars Math. Contemp. 15(1): 113-126 (2018) - [j17]Meysam Alishahi, Ali Taherkhani:
Circular chromatic number of induced subgraphs of Kneser graphs. Ars Math. Contemp. 15(1): 161-172 (2018) - [j16]Meysam Alishahi, Hossein Hajiabolhassan:
Altermatic number of categorical product of graphs. Discret. Math. 341(5): 1316-1324 (2018) - [j15]Roya Abyazi Sani, Meysam Alishahi:
A new lower bound for the chromatic number of general Kneser hypergraphs. Eur. J. Comb. 71: 229-245 (2018) - [j14]Meysam Alishahi, Hossein Hajiabolhassan:
Chromatic number of random Kneser hypergraphs. J. Comb. Theory A 154: 1-20 (2018) - [j13]Meysam Alishahi, Ali Taherkhani:
Extremal G-free induced subgraphs of Kneser graphs. J. Comb. Theory A 159: 269-282 (2018) - [j12]Meysam Alishahi, Hossein Hajiabolhassan:
A generalization of Gale's lemma. J. Graph Theory 88(2): 337-346 (2018) - 2017
- [j11]Meysam Alishahi:
Colorful Subhypergraphs in Uniform Hypergraphs. Electron. J. Comb. 24(1): 1 (2017) - [j10]Meysam Alishahi, Frédéric Meunier:
Fair Splitting of Colored Paths. Electron. J. Comb. 24(3): 3 (2017) - [j9]Meysam Alishahi, Hossein Hajiabolhassan:
Chromatic number via Turán number. Discret. Math. 340(10): 2366-2377 (2017) - [j8]Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier:
Strengthening topological colorful results for graphs. Eur. J. Comb. 64: 27-44 (2017) - 2015
- [j7]Meysam Alishahi, Hossein Hajiabolhassan:
On the chromatic number of general Kneser hypergraphs. J. Comb. Theory B 115: 186-209 (2015) - 2014
- [j6]Meysam Alishahi, Ali Taherkhani:
A Note on Chromatic Sum. Ars Comb. 116: 49-54 (2014) - 2012
- [j5]Meysam Alishahi:
Dynamic chromatic number of regular graphs. Discret. Appl. Math. 160(15): 2098-2103 (2012) - 2011
- [j4]Meysam Alishahi, Ali Taherkhani, Carsten Thomassen:
Rainbow Paths with Prescribed Ends. Electron. J. Comb. 18(1) (2011) - [j3]Meysam Alishahi:
On the dynamic coloring of graphs. Discret. Appl. Math. 159(2-3): 152-156 (2011) - 2010
- [j2]Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani:
A generalization of the Erdös-Ko-Rado theorem. Discret. Math. 310(1): 188-191 (2010) - [j1]Meysam Alishahi, Hossein Hajiabolhassan:
Circular coloring and Mycielski construction. Discret. Math. 310(10-11): 1544-1550 (2010)
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-09-18 00:14 CEST 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:
