15 citations · 26 across the 27 of their papers we have counts for
6 papers · 1 filter
Parameterized Complexity of Fair Coloring Problem
Ramin Javadi, Hossein Shokouhi
Given a graph , a (proper) -coloring for is a vertex coloring with colors such that every two adjacent vertices receive different colors. Suppose that the verte…
Parameterized Complexity of Fair Many-to-One Matchings
Ramin Javadi, Hossein Shokouhi
Given a bipartite graph , a left-perfect many-to-one matching is a subset such that each vertex in is incident with exactly one edge in . If $…
Parameterized Complexity of the Star Decomposition Problem
Sahab Hajebi, Ramin Javadi
A star of length is defined as the complete bipartite graph . In this paper we deal with the problem of edge decomposition of graphs into stars of varying l…
On the Parameterized Complexity of the Acyclic Matching Problem
Sahab Hajebi, Ramin Javadi
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph…
On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems
Ramin Javadi, Amir Nikabadi
We present a parameterized dichotomy for the \textsc{-Sparsest Cut} problem in weighted and unweighted versions. In particular, we show that the weighted \textsc{-Sparsest Cu…
On Complexity of Isoperimetric Problems on Trees
Amir Daneshgar, Ramin Javadi
This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters c…