![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2024
- Meysam Alishahi, Jeff M. Phillips:
No Dimensional Sampling Coresets for Classification. CoRR abs/2402.05280 (2024) - 2023
- Meysam Alishahi, Anna Little, Jeff M. Phillips:
Linear Distance Metric Learning with Noisy Labels. CoRR abs/2306.03173 (2023) - 2021
- Meysam Alishahi, Frédéric Meunier:
Topological Bounds for Graph Representations over Any Field. SIAM J. Discret. Math. 35(1): 91-104 (2021) - 2020
- Meysam Alishahi, Hossein Hajiabolhassan
:
On the Chromatic Number of Matching Kneser Graphs. Comb. Probab. Comput. 29(1): 1-21 (2020) - 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) - 2019
- Meysam Alishahi
, Ali Taherkhani
:
On the random version of the Erdős matching conjecture. Discret. Appl. Math. 254: 1-9 (2019) - Meysam Alishahi
, Hossein Hajiabolhassan
:
On chromatic number and minimum cut. J. Comb. Theory B 139: 27-46 (2019) - 2018
- Meysam Alishahi
, Ali Taherkhani:
Circular chromatic number of induced subgraphs of Kneser graphs. Ars Math. Contemp. 15(1): 161-172 (2018) - Roya Abyazi Sani, Meysam Alishahi, Ali Taherkhani:
Coloring properties of categorical product of general Kneser hypergraphs. Ars Math. Contemp. 15(1): 113-126 (2018) - Meysam Alishahi
, Hossein Hajiabolhassan
:
Altermatic number of categorical product of graphs. Discret. Math. 341(5): 1316-1324 (2018) - Roya Abyazi Sani, Meysam Alishahi
:
A new lower bound for the chromatic number of general Kneser hypergraphs. Eur. J. Comb. 71: 229-245 (2018) - Meysam Alishahi
, Hossein Hajiabolhassan
:
Chromatic number of random Kneser hypergraphs. J. Comb. Theory A 154: 1-20 (2018) - Meysam Alishahi
, Ali Taherkhani
:
Extremal G-free induced subgraphs of Kneser graphs. J. Comb. Theory A 159: 269-282 (2018) - Meysam Alishahi
, Hossein Hajiabolhassan
:
A generalization of Gale's lemma. J. Graph Theory 88(2): 337-346 (2018) - 2017
- Meysam Alishahi:
Colorful Subhypergraphs in Uniform Hypergraphs. Electron. J. Comb. 24(1): 1 (2017) - Meysam Alishahi, Frédéric Meunier:
Fair Splitting of Colored Paths. Electron. J. Comb. 24(3): 3 (2017) - Meysam Alishahi
, Hossein Hajiabolhassan
:
Chromatic number via Turán number. Discret. Math. 340(10): 2366-2377 (2017) - Meysam Alishahi
, Hossein Hajiabolhassan
, Frédéric Meunier:
Strengthening topological colorful results for graphs. Eur. J. Comb. 64: 27-44 (2017) - 2015
- Meysam Alishahi
, Hossein Hajiabolhassan
:
On the chromatic number of general Kneser hypergraphs. J. Comb. Theory B 115: 186-209 (2015) - 2014
- Meysam Alishahi, Ali Taherkhani:
A Note on Chromatic Sum. Ars Comb. 116: 49-54 (2014) - 2012
- Meysam Alishahi
:
Dynamic chromatic number of regular graphs. Discret. Appl. Math. 160(15): 2098-2103 (2012) - 2011
- Meysam Alishahi, Ali Taherkhani, Carsten Thomassen:
Rainbow Paths with Prescribed Ends. Electron. J. Comb. 18(1) (2011) - Meysam Alishahi
:
On the dynamic coloring of graphs. Discret. Appl. Math. 159(2-3): 152-156 (2011) - 2010
- Meysam Alishahi
, Hossein Hajiabolhassan
:
Circular coloring and Mycielski construction. Discret. Math. 310(10-11): 1544-1550 (2010) - Meysam Alishahi
, Hossein Hajiabolhassan
, Ali Taherkhani
:
A generalization of the Erdös-Ko-Rado theorem. Discret. Math. 310(1): 188-191 (2010)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 04:58 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint