Ramin Javadi

Orcid: 0009-0002-9818-6220

According to our database1, Ramin Javadi authored at least 26 papers between 2009 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2026
A conjecture on rainbow Hamiltonian cycle decomposition.
Discret. Math., 2026

2025
On a conjecture of Erdős on size Ramsey number of star forests.
Ars Math. Contemp., 2025

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.
Proceedings of the IEEE Custom Integrated Circuits Conference, 2025

2024
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems.
Discret. Appl. Math., 2024

Parameterized Complexity of Fair Many-to-One Matchings.
CoRR, 2024

Parameterized Complexity of Star Decomposition Problem.
CoRR, 2024

A High-Performance External Validity Index for Clustering with a Large Number of Clusters.
CoRR, 2024

An Enhanced Eye-Opening PAM-4 with Encoding for Short-Reach Wireline Communication Systems.
Proceedings of the 67th IEEE International Midwest Symposium on Circuits and Systems, 2024

Minimum Power Point Design of Inverter Based Continuous Time Linear Equalizer (CTLE).
Proceedings of the IEEE International Symposium on Circuits and Systems, 2024

2023
On the parameterized complexity of the acyclic matching problem.
Theor. Comput. Sci., May, 2023

The multicolor size-Ramsey numbers of cycles.
J. Comb. Theory B, 2023

2021
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers.
Discret. Appl. Math., 2021

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

2019
Edge clique cover of claw-free graphs.
J. Graph Theory, 2019

On the Size-Ramsey Number of Cycles.
Comb. Probab. Comput., 2019

2018
On a Question of Erdös and Faudree on the Size Ramsey Numbers.
SIAM J. Discret. Math., 2018

Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles.
J. Graph Theory, 2018

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

2016
Local Clique Covering of Claw-Free Graphs.
J. Graph Theory, 2016

Pairwise balanced designs and sigma clique partitions.
Discret. Math., 2016

2013
Clustering and outlier detection using isoperimetric number of trees.
Pattern Recognit., 2013

2012
On the complexity of isoperimetric problems on trees.
Discret. Appl. Math., 2012

Clustering Using Isoperimetric Number of Trees
CoRR, 2012

On b-coloring of cartesian product of graphs.
Ars Comb., 2012

2010
On the isoperimetric spectrum of graphs and its approximations.
J. Comb. Theory B, 2010

2009
On b-coloring of the Kneser graphs.
Discret. Math., 2009


  Loading...