Author

Hossein Shokouhi

h-index 1 View on Semantic Scholar

We have 1 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Parameterized Complexity of Fair Coloring Problem

This paper investigates the parameterized complexity of the fair coloring problem with respect to the structural parameters of the input graph and proves that the problem is W[1]-hard with respect to the number of groups for forests and also graphs of modular-width two, even when the number of colors is equal to two.

R. Javadi, Hossein Shokouhi · arXiv.org · 0 citations