3 citations · 4 across the 6 of their papers we have counts for
6 papers
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 $…
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…
Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths
Ramin Javadi, Afsaneh Khodadadpour, Gholamreza Omidi
In 1981, Alspach conjectured that the complete graph could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This…
Pairwise Balanced Designs and Sigma Clique Partitions
Akbar Davoodi, Ramin Javadi, Behnaz Omoomi
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the la…
Clustering Using Isoperimetric Number of Trees
Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi
In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show…
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…