Circular coloring and Mycielski construction. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2010)

A generalization of the Erdös-Ko-Rado theorem. - Meysam Alishahi; Hossein Hajiabolhassan; Ali Taherkhani (Discret. Math., 2010)

Rainbow Paths with Prescribed Ends. - Meysam Alishahi; Ali Taherkhani; Carsten Thomassen (Electron. J. Comb., 2011)

On the dynamic coloring of graphs. - Meysam Alishahi (Discret. Appl. Math., 2011)

Dynamic chromatic number of regular graphs. - Meysam Alishahi (Discret. Appl. Math., 2012)

A Note on Chromatic Sum. - Meysam Alishahi; Ali Taherkhani (Ars Comb., 2014)

On the chromatic number of general Kneser hypergraphs. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory B, 2015)

Colorful Subhypergraphs in Uniform Hypergraphs. - Meysam Alishahi (Electron. J. Comb., 2017)

Fair Splitting of Colored Paths. - Meysam Alishahi; Frédéric Meunier (Electron. J. Comb., 2017)

Chromatic number via Turán number. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2017)

Strengthening topological colorful results for graphs. - Meysam Alishahi; Hossein Hajiabolhassan; Frédéric Meunier (Eur. J. Comb., 2017)

Circular chromatic number of induced subgraphs of Kneser graphs. - Meysam Alishahi; Ali Taherkhani (Ars Math. Contemp., 2018)

Coloring properties of categorical product of general Kneser hypergraphs. - Roya Abyazi Sani; Meysam Alishahi; Ali Taherkhani (Ars Math. Contemp., 2018)

Altermatic number of categorical product of graphs. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2018)

A new lower bound for the chromatic number of general Kneser hypergraphs. - Roya Abyazi Sani; Meysam Alishahi (Eur. J. Comb., 2018)

Chromatic number of random Kneser hypergraphs. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory A, 2018)

Extremal G-free induced subgraphs of Kneser graphs. - Meysam Alishahi; Ali Taherkhani (J. Comb. Theory A, 2018)

A generalization of Gale's lemma. - Meysam Alishahi; Hossein Hajiabolhassan (J. Graph Theory, 2018)

On the random version of the Erdős matching conjecture. - Meysam Alishahi; Ali Taherkhani (Discret. Appl. Math., 2019)

On chromatic number and minimum cut. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory B, 2019)

On the Chromatic Number of Matching Kneser Graphs. - Meysam Alishahi; Hossein Hajiabolhassan (Comb. Probab. Comput., 2020)

Maximum nullity and zero forcing number on graphs with maximum degree at most three. - Meysam Alishahi; Elahe Rezaei-Sani; Elahe Sharifi (Discret. Appl. Math., 2020)

Topological Bounds for Graph Representations over Any Field. - Meysam Alishahi; Frédéric Meunier (SIAM J. Discret. Math., 2021)

No Dimensional Sampling Coresets for Classification. - Meysam Alishahi; Jeff M. Phillips (ICML, 2024)

Linear Distance Metric Learning with Noisy Labels. - Meysam Alishahi; Anna Little; Jeff M. Phillips (J. Mach. Learn. Res., 2024)