R. Javadi

works on

fair coloring 1 graph coloring 1 neighborhood diversity 1 parameterized complexity 1 structural graph parameters 1

From the 1 of 7 linked papers with an AI index.

activity

20242026

collaborators

7 papers

cs.CC2026

Parameterized Complexity of Fair Coloring Problem

Ramin Javadi, Hossein Shokouhi

The paper studies the fair graph coloring problem, analyzing its parameterized complexity with respect to various structural graph parameters and showing both hardness and fixed-pa…

math.CO2026

The multicolor induced size-Ramsey number of long subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $k$ and a graph $H$ , the $k$ -color induced size-Ramsey number $R^_{ind} (H, k)$ is the minimum integer $m$ for which there exists a graph $G$ wi…

math.CO2026

The Multicolor Size-Ramsey Number of Bipartite Long Subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $r$ , the $r$ -color size-Ramsey number~ $R_{r} (H)$ of a graph $H$ is the minimum number of edges in a graph $G$ such that every $r$ -edge coloring of $G…

cs.LG2026

Exact Recovery in the Data Block Model

Amir R. Asadi, Akbar Davoodi, Ramin Javadi +1

Community detection in networks is a fundamental problem in machine learning and statistical inference, with applications in social networks, biological systems, and communication…

cs.DM2025

On the structure of ( $4 K_{1}$ , $C_{4}$ , $P_{6}$ )-free graphs

ChÃnh T. HoÃ ng, Ramin Javadi, Nicolas Trotignon

Determining the complexity of colouring ( $4 K_{1}, C_{4}$ )-free graph is a long open problem. Recently Penev showed that there is a polynomial-time algorithm to colour a ($4K_1, C_4, C_…

cs.CC2025

Parameterized Complexity of the Star Decomposition Problem

Sahab Hajebi, Ramin Javadi

A star of length $ℓ$ is defined as the complete bipartite graph $K_{1, ℓ}$ . In this paper we deal with the problem of edge decomposition of graphs into stars of varying l…