15 citations · 26 across the 27 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 1 cited
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…
math.CO2019
On the packing for triples
Ramin Javadi, Ehsan Poorhadi, Farshad Fallah
For positive integers , a collection of -subsets of an -set is called a -packing if every -subset of appears in at most one s…