On b-coloring of the Kneser graphs. - Ramin Javadi; Behnaz Omoomi (Discret. Math., 2009)

On the isoperimetric spectrum of graphs and its approximations. - Amir Daneshgar; Hossein Hajiabolhassan; Ramin Javadi (J. Comb. Theory B, 2010)

On b-coloring of cartesian product of graphs. - Ramin Javadi; Behnaz Omoomi (Ars Comb., 2012)

Clustering Using Isoperimetric Number of Trees - Amir Daneshgar; Ramin Javadi; Basir Shariat Razavi (CoRR, 2012)

On the complexity of isoperimetric problems on trees. - Amir Daneshgar; Ramin Javadi (Discret. Appl. Math., 2012)

Clustering and outlier detection using isoperimetric number of trees. - Amir Daneshgar; Ramin Javadi; Basir Shariat Razavi (Pattern Recognit., 2013)

Pairwise balanced designs and sigma clique partitions. - Akbar Davoodi; Ramin Javadi; Behnaz Omoomi (Discret. Math., 2016)

Local Clique Covering of Claw-Free Graphs. - Ramin Javadi; Zeinab Maleki; Behnaz Omoomi (J. Graph Theory, 2016)

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees. - Ramin Javadi; Saleh Ashkboos (CoRR, 2017)

Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. - Ramin Javadi; Afsaneh Khodadadpour; Gholam Reza Omidi (J. Graph Theory, 2018)

On a Question of Erdös and Faudree on the Size Ramsey Numbers. - Ramin Javadi; Gholam Reza Omidi (SIAM J. Discret. Math., 2018)

On the Size-Ramsey Number of Cycles. - Ramin Javadi; Farideh Khoeini; G. R. Omidi; Alexey Pokrovskiy (Comb. Probab. Comput., 2019)

Edge clique cover of claw-free graphs. - Ramin Javadi; Sepehr Hajebi (J. Graph Theory, 2019)

The Game of Cops and Robber on (Claw, Even-hole)-free Graphs. - Ramin Javadi; Ali Momeni (CoRR, 2021)

Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. - Ramin Javadi; Saleh Ashkboos (Discret. Appl. Math., 2021)

The multicolor size-Ramsey numbers of cycles. - Ramin Javadi; Meysam Miralaei (J. Comb. Theory B, 2023)

On the parameterized complexity of the acyclic matching problem. - Sahab Hajebi; Ramin Javadi (Theor. Comput. Sci., 2023)

Minimum Power Point Design of Inverter Based Continuous Time Linear Equalizer (CTLE). - Andrew Ensinger; Ramin Javadi; Xiaohui Lin 012; Bella Bose; Tejasvi Anand (ISCAS, 2024)

An Enhanced Eye-Opening PAM-4 with Encoding for Short-Reach Wireline Communication Systems. - Ramin Javadi; Tejasvi Anand (MWSCAS, 2024)

A High-Performance External Validity Index for Clustering with a Large Number of Clusters. - Mohammad Yasin Karbasian; Ramin Javadi (CoRR, 2024)

Parameterized Complexity of Star Decomposition Problem. - Sahab Hajebi; Ramin Javadi (CoRR, 2024)

Parameterized Complexity of Fair Many-to-One Matchings. - Ramin Javadi; Hossein Shokouhi (CoRR, 2024)

On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems. - Ramin Javadi; Amir Nikabadi (Discret. Appl. Math., 2024)

A 0.055pJ/bit/dB 42Gb/s PAM-4 Wireline Transceiver with Consecutive Symbol to Center (CSC) Encoding and Classification for 26dB Loss in 16nm FinFET. - Ramin Javadi; Tejasvi Anand (CICC, 2025)

On a conjecture of Erdős on size Ramsey number of star forests. - Akbar Davoodi; Ramin Javadi; Azam Kamranian; Ghaffar Raeisi (Ars Math. Contemp., 2025)

A conjecture on rainbow Hamiltonian cycle decomposition. - Ramin Javadi; Meysam Miralaei (Discret. Math., 2026)