Ramin Javadi

Theor. Comput. Sci., May, 2023

The multicolor size-Ramsey numbers of cycles.

[BibT_eX]

[DOI]

Meysam Miralaei

J. Comb. Theory, Ser. B, 2023

2021

Multi-way sparsest cut problem on trees with a control on the number of parts and outliers.

[BibT_eX]

[DOI]

Saleh Ashkboos

Discret. Appl. Math., 2021

The Game of Cops and Robber on (Claw, Even-hole)-free Graphs.

[BibT_eX]

[DOI]

Ali Momeni

CoRR, 2021

2019

Edge clique cover of claw-free graphs.

[BibT_eX]

[DOI]

Sepehr Hajebi

J. Graph Theory, 2019

On the Size-Ramsey Number of Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems.

[BibT_eX]

[DOI]

Amir Nikabadi

CoRR, 2019

2018

On a Question of Erdös and Faudree on the Size Ramsey Numbers.

[BibT_eX]

[DOI]

Gholam Reza Omidi

SIAM J. Discret. Math., 2018

Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles.

[BibT_eX]

[DOI]

Afsaneh Khodadadpour

Gholam Reza Omidi

J. Graph Theory, 2018

2017

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees.

[BibT_eX]

[DOI]

Saleh Ashkboos

CoRR, 2017

2016

Local Clique Covering of Claw-Free Graphs.

[BibT_eX]

[DOI]

Zeinab Maleki

J. Graph Theory, 2016

Pairwise balanced designs and sigma clique partitions.

[BibT_eX]

[DOI]

Akbar Davoodi

Discret. Math., 2016

2013

Clustering and outlier detection using isoperimetric number of trees.

[BibT_eX]

[DOI]

Basir Shariat Razavi

Pattern Recognit., 2013

2012

On the complexity of isoperimetric problems on trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Clustering Using Isoperimetric Number of Trees

[BibT_eX]

[DOI]

Basir Shariat Razavi

CoRR, 2012

On b-coloring of cartesian product of graphs.

[BibT_eX]

Ars Comb., 2012

2010

On the isoperimetric spectrum of graphs and its approximations.

[BibT_eX]

[DOI]

Hossein Hajiabolhassan

J. Comb. Theory, Ser. B, 2010

2009

On b-coloring of the Kneser graphs.

[BibT_eX]

[DOI]