15 citations · 26 across the 27 of their papers we have counts for
4 papers · 1 filter
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…
A High-Performance External Validity Index for Clustering with a Large Number of Clusters
Mohammad Yasin Karbasian, Ramin Javadi
This paper introduces the Stable Matching Based Pairing (SMBP) algorithm, a high-performance external validity index for clustering evaluation in large-scale datasets with a large…
A Conjecture on Rainbow Hamiltonian Cycle Decomposition
Ramin Javadi, Meysam Miralaei
Wu in 1999 conjectured that if is a subgraph of the complete graph with edges, then there is a Hamiltonian cycle decomposition of such that each edge…