We stand with Ukraine  

Meysam Alishahi

Orcid: 0000-0001-6588-8520

According to our database1, Meysam Alishahi authored at least 25 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
No Dimensional Sampling Coresets for Classification.
[BibTeX]
[DOI]
Meysam Alishahi
,
Jeff M. Phillips
CoRR, 2024

2023
Linear Distance Metric Learning with Noisy Labels.
[BibTeX]
[DOI]
Meysam Alishahi
,
Anna Little
,
Jeff M. Phillips
CoRR, 2023

2021
Topological Bounds for Graph Representations over Any Field.
[BibTeX]
[DOI]
Meysam Alishahi
,
Frédéric Meunier
SIAM J. Discret. Math., 2021

2020
Maximum nullity and zero forcing number on graphs with maximum degree at most three.
[BibTeX]
[DOI]
Meysam Alishahi
,
Elahe Rezaei-Sani
,
Elahe Sharifi
Discret. Appl. Math., 2020

On the Chromatic Number of Matching Kneser Graphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
Comb. Probab. Comput., 2020

2019
On chromatic number and minimum cut.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
J. Comb. Theory, Ser. B, 2019

On the random version of the Erdős matching conjecture.
[BibTeX]
[DOI]
Meysam Alishahi
,
Ali Taherkhani
Discret. Appl. Math., 2019

2018
A generalization of Gale's lemma.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
J. Graph Theory, 2018

Extremal <i>G</i>-free induced subgraphs of Kneser graphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Ali Taherkhani
J. Comb. Theory, Ser. A, 2018

Chromatic number of random Kneser hypergraphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
J. Comb. Theory, Ser. A, 2018

A new lower bound for the chromatic number of general Kneser hypergraphs.
[BibTeX]
[DOI]
Roya Abyazi Sani
,
Meysam Alishahi
Eur. J. Comb., 2018

Altermatic number of categorical product of graphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
Discret. Math., 2018

Coloring properties of categorical product of general Kneser hypergraphs.
[BibTeX]
[DOI]
Roya Abyazi Sani
,
Meysam Alishahi
,
Ali Taherkhani
Ars Math. Contemp., 2018

Circular chromatic number of induced subgraphs of Kneser graphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Ali Taherkhani
Ars Math. Contemp., 2018

2017
Strengthening topological colorful results for graphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
,
Frédéric Meunier
Eur. J. Comb., 2017

Chromatic number via Turán number.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
Discret. Math., 2017

Fair Splitting of Colored Paths.
[BibTeX]
[DOI]
Meysam Alishahi
,
Frédéric Meunier
Electron. J. Comb., 2017

Colorful Subhypergraphs in Uniform Hypergraphs.
[BibTeX]
[DOI]
Meysam Alishahi
Electron. J. Comb., 2017

2015
On the chromatic number of general Kneser hypergraphs.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
J. Comb. Theory, Ser. B, 2015

2014
A Note on Chromatic Sum.
[BibTeX]
Meysam Alishahi
,
Ali Taherkhani
Ars Comb., 2014

2012
Dynamic chromatic number of regular graphs.
[BibTeX]
[DOI]
Meysam Alishahi
Discret. Appl. Math., 2012

2011
On the dynamic coloring of graphs.
[BibTeX]
[DOI]
Meysam Alishahi
Discret. Appl. Math., 2011

Rainbow Paths with Prescribed Ends.
[BibTeX]
[DOI]
Meysam Alishahi
,
Ali Taherkhani
,
Carsten Thomassen
Electron. J. Comb., 2011

2010
A generalization of the Erdös-Ko-Rado theorem.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
,
Ali Taherkhani
Discret. Math., 2010

Circular coloring and Mycielski construction.
[BibTeX]
[DOI]
Meysam Alishahi
,
Hossein Hajiabolhassan
Discret. Math., 2010


  Loading...