Hossein Shokouhi

collaborators

2 papers

cs.CC2026

Parameterized Complexity of Fair Coloring Problem

Ramin Javadi, Hossein Shokouhi

Given a graph $G = (V, E)$ , a (proper) $k$ -coloring for $G$ is a vertex coloring with $k$ colors such that every two adjacent vertices receive different colors. Suppose that the verte…

cs.CC2024

Parameterized Complexity of Fair Many-to-One Matchings

Ramin Javadi, Hossein Shokouhi

Given a bipartite graph $G = (U \cup V, E)$ , a left-perfect many-to-one matching is a subset $M \subseteq E$ such that each vertex in $U$ is incident with exactly one edge in $M$ . If $…