Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ramin Javadi
@article{DBLP:journals/jctb/JavadiM23,
author = {Ramin Javadi and
Meysam Miralaei},
title = {The multicolor size-Ramsey numbers of cycles},
journal = {J. Comb. Theory, Ser. {B}},
volume = {158},
number = {Part},
pages = {264--285},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2022.10.003},
doi = {10.1016/J.JCTB.2022.10.003},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/JavadiM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HajebiJ23,
author = {Sahab Hajebi and
Ramin Javadi},
title = {On the parameterized complexity of the acyclic matching problem},
journal = {Theor. Comput. Sci.},
volume = {958},
pages = {113862},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113862},
doi = {10.1016/J.TCS.2023.113862},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HajebiJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JavadiA21,
author = {Ramin Javadi and
Saleh Ashkboos},
title = {Multi-way sparsest cut problem on trees with a control on the number
of parts and outliers},
journal = {Discret. Appl. Math.},
volume = {289},
pages = {281--291},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.11.013},
doi = {10.1016/J.DAM.2020.11.013},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JavadiA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06004,
author = {Sahab Hajebi and
Ramin Javadi},
title = {On the Parameterized Complexity of the Acyclic Matching Problem},
journal = {CoRR},
volume = {abs/2109.06004},
year = {2021},
url = {https://arxiv.org/abs/2109.06004},
eprinttype = {arXiv},
eprint = {2109.06004},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-07503,
author = {Ramin Javadi and
Ali Momeni},
title = {The Game of Cops and Robber on (Claw, Even-hole)-free Graphs},
journal = {CoRR},
volume = {abs/2112.07503},
year = {2021},
url = {https://arxiv.org/abs/2112.07503},
eprinttype = {arXiv},
eprint = {2112.07503},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-07503.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/JavadiKOP19,
author = {Ramin Javadi and
Farideh Khoeini and
G. R. Omidi and
Alexey Pokrovskiy},
title = {On the Size-Ramsey Number of Cycles},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {871--880},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000221},
doi = {10.1017/S0963548319000221},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/JavadiKOP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JavadiH19,
author = {Ramin Javadi and
Sepehr Hajebi},
title = {Edge clique cover of claw-free graphs},
journal = {J. Graph Theory},
volume = {90},
number = {3},
pages = {311--405},
year = {2019},
url = {https://doi.org/10.1002/jgt.22403},
doi = {10.1002/JGT.22403},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JavadiH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-12353,
author = {Ramin Javadi and
Amir Nikabadi},
title = {On the Parameterized Complexity of Sparsest Cut and Small-set Expansion
Problems},
journal = {CoRR},
volume = {abs/1910.12353},
year = {2019},
url = {http://arxiv.org/abs/1910.12353},
eprinttype = {arXiv},
eprint = {1910.12353},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-12353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JavadiKO18,
author = {Ramin Javadi and
Afsaneh Khodadadpour and
Gholam Reza Omidi},
title = {Decomposition of complete uniform multi-hypergraphs into Berge paths
and cycles},
journal = {J. Graph Theory},
volume = {88},
number = {3},
pages = {507--520},
year = {2018},
url = {https://doi.org/10.1002/jgt.22226},
doi = {10.1002/JGT.22226},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JavadiKO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JavadiO18,
author = {Ramin Javadi and
Gholam Reza Omidi},
title = {On a Question of Erd{\"{o}}s and Faudree on the Size Ramsey Numbers},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {2217--2228},
year = {2018},
url = {https://doi.org/10.1137/17M1115022},
doi = {10.1137/17M1115022},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JavadiO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JavadiA17,
author = {Ramin Javadi and
Saleh Ashkboos},
title = {An Efficient Parallel Data Clustering Algorithm Using Isoperimetric
Number of Trees},
journal = {CoRR},
volume = {abs/1702.04739},
year = {2017},
url = {http://arxiv.org/abs/1702.04739},
eprinttype = {arXiv},
eprint = {1702.04739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JavadiA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JavadiA17a,
author = {Ramin Javadi and
Saleh Ashkboos},
title = {Multi-way sparsest cut problem on trees with a control on the number
of parts and outliers},
journal = {CoRR},
volume = {abs/1702.05570},
year = {2017},
url = {http://arxiv.org/abs/1702.05570},
eprinttype = {arXiv},
eprint = {1702.05570},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JavadiA17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DavoodiJO16,
author = {Akbar Davoodi and
Ramin Javadi and
Behnaz Omoomi},
title = {Pairwise balanced designs and sigma clique partitions},
journal = {Discret. Math.},
volume = {339},
number = {5},
pages = {1450--1458},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.09.008},
doi = {10.1016/J.DISC.2015.09.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DavoodiJO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JavadiMO16,
author = {Ramin Javadi and
Zeinab Maleki and
Behnaz Omoomi},
title = {Local Clique Covering of Claw-Free Graphs},
journal = {J. Graph Theory},
volume = {81},
number = {1},
pages = {92--104},
year = {2016},
url = {https://doi.org/10.1002/jgt.21864},
doi = {10.1002/JGT.21864},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JavadiMO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/DaneshgarJR13,
author = {Amir Daneshgar and
Ramin Javadi and
Basir Shariat Razavi},
title = {Clustering and outlier detection using isoperimetric number of trees},
journal = {Pattern Recognit.},
volume = {46},
number = {12},
pages = {3371--3382},
year = {2013},
url = {https://doi.org/10.1016/j.patcog.2013.05.015},
doi = {10.1016/J.PATCOG.2013.05.015},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pr/DaneshgarJR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/JavadiO12,
author = {Ramin Javadi and
Behnaz Omoomi},
title = {On b-coloring of cartesian product of graphs},
journal = {Ars Comb.},
volume = {107},
pages = {521--536},
year = {2012},
timestamp = {Tue, 12 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/JavadiO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DaneshgarJ12,
author = {Amir Daneshgar and
Ramin Javadi},
title = {On the complexity of isoperimetric problems on trees},
journal = {Discret. Appl. Math.},
volume = {160},
number = {1-2},
pages = {116--131},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.08.015},
doi = {10.1016/J.DAM.2011.08.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DaneshgarJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-4204,
author = {Amir Daneshgar and
Ramin Javadi and
Basir Shariat Razavi},
title = {Clustering Using Isoperimetric Number of Trees},
journal = {CoRR},
volume = {abs/1203.4204},
year = {2012},
url = {http://arxiv.org/abs/1203.4204},
eprinttype = {arXiv},
eprint = {1203.4204},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-4204.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DaneshgarHJ10,
author = {Amir Daneshgar and
Hossein Hajiabolhassan and
Ramin Javadi},
title = {On the isoperimetric spectrum of graphs and its approximations},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {4},
pages = {390--412},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2010.01.002},
doi = {10.1016/J.JCTB.2010.01.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/DaneshgarHJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0706,
author = {Amir Daneshgar and
Ramin Javadi},
title = {On Complexity of Isoperimetric Problems on Trees},
journal = {CoRR},
volume = {abs/1009.0706},
year = {2010},
url = {http://arxiv.org/abs/1009.0706},
eprinttype = {arXiv},
eprint = {1009.0706},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0706.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JavadiO09,
author = {Ramin Javadi and
Behnaz Omoomi},
title = {On b-coloring of the Kneser graphs},
journal = {Discret. Math.},
volume = {309},
number = {13},
pages = {4399--4408},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.01.017},
doi = {10.1016/J.DISC.2009.01.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JavadiO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:50 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:
