default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamin Javadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ramin Javadi
, Amir Nikabadi:
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems. Discret. Appl. Math. 355: 1-12 (2024)- [c2]Andrew Ensinger, Ramin Javadi, Xiaohui Lin, Bella Bose, Tejasvi Anand:
Minimum Power Point Design of Inverter Based Continuous Time Linear Equalizer (CTLE). ISCAS 2024: 1-5 - [c1]Ramin Javadi, Tejasvi Anand:
An Enhanced Eye-Opening PAM-4 with Encoding for Short-Reach Wireline Communication Systems. MWSCAS 2024: 68-71 - [i10]Mohammad Yasin Karbasian, Ramin Javadi:
A High-Performance External Validity Index for Clustering with a Large Number of Clusters. CoRR abs/2409.14455 (2024) - [i9]Sahab Hajebi, Ramin Javadi:
Parameterized Complexity of Star Decomposition Problem. CoRR abs/2411.13348 (2024) - [i8]Ramin Javadi, Hossein Shokouhi:
Parameterized Complexity of Fair Many-to-One Matchings. CoRR abs/2411.18367 (2024) - 2023
- [j14]Ramin Javadi, Meysam Miralaei:
The multicolor size-Ramsey numbers of cycles. J. Comb. Theory B 158(Part): 264-285 (2023) - [j13]Sahab Hajebi, Ramin Javadi:
On the parameterized complexity of the acyclic matching problem. Theor. Comput. Sci. 958: 113862 (2023) - 2021
- [j12]Ramin Javadi, Saleh Ashkboos:
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. Discret. Appl. Math. 289: 281-291 (2021) - [i7]Sahab Hajebi, Ramin Javadi:
On the Parameterized Complexity of the Acyclic Matching Problem. CoRR abs/2109.06004 (2021) - [i6]Ramin Javadi, Ali Momeni:
The Game of Cops and Robber on (Claw, Even-hole)-free Graphs. CoRR abs/2112.07503 (2021)
2010 – 2019
- 2019
- [j11]Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
On the Size-Ramsey Number of Cycles. Comb. Probab. Comput. 28(6): 871-880 (2019) - [j10]Ramin Javadi, Sepehr Hajebi:
Edge clique cover of claw-free graphs. J. Graph Theory 90(3): 311-405 (2019) - [i5]Ramin Javadi, Amir Nikabadi:
On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems. CoRR abs/1910.12353 (2019) - 2018
- [j9]Ramin Javadi, Afsaneh Khodadadpour, Gholam Reza Omidi:
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. J. Graph Theory 88(3): 507-520 (2018) - [j8]Ramin Javadi, Gholam Reza Omidi:
On a Question of Erdös and Faudree on the Size Ramsey Numbers. SIAM J. Discret. Math. 32(3): 2217-2228 (2018) - 2017
- [i4]Ramin Javadi, Saleh Ashkboos:
An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees. CoRR abs/1702.04739 (2017) - [i3]Ramin Javadi, Saleh Ashkboos:
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. CoRR abs/1702.05570 (2017) - 2016
- [j7]Akbar Davoodi, Ramin Javadi, Behnaz Omoomi:
Pairwise balanced designs and sigma clique partitions. Discret. Math. 339(5): 1450-1458 (2016) - [j6]Ramin Javadi, Zeinab Maleki, Behnaz Omoomi:
Local Clique Covering of Claw-Free Graphs. J. Graph Theory 81(1): 92-104 (2016) - 2013
- [j5]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering and outlier detection using isoperimetric number of trees. Pattern Recognit. 46(12): 3371-3382 (2013) - 2012
- [j4]Ramin Javadi, Behnaz Omoomi:
On b-coloring of cartesian product of graphs. Ars Comb. 107: 521-536 (2012) - [j3]Amir Daneshgar, Ramin Javadi:
On the complexity of isoperimetric problems on trees. Discret. Appl. Math. 160(1-2): 116-131 (2012) - [i2]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering Using Isoperimetric Number of Trees. CoRR abs/1203.4204 (2012) - 2010
- [j2]Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory B 100(4): 390-412 (2010) - [i1]Amir Daneshgar, Ramin Javadi:
On Complexity of Isoperimetric Problems on Trees. CoRR abs/1009.0706 (2010)
2000 – 2009
- 2009
- [j1]Ramin Javadi, Behnaz Omoomi:
On b-coloring of the Kneser graphs. Discret. Math. 309(13): 4399-4408 (2009)
Coauthor Index
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.
last updated on 2025-01-21 00:12 CET 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:
