Netanya Academic College

most citedEfficient Approximation of Convex Recolorings

1 citations

researchers with a paper here

Mikhail Muzychuk1
Qing Xiang1
Sagi Snir1
Shlomo Moran1

collaborating institutions

Technion – Israel Institute of TechnologyIL1 paper
University of DelawareUS1 paper

2 papers

cs.DS2005★ 1 cited

Efficient Approximation of Convex Recolorings

Shlomo Moran, Sagi Snir

A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if…

math.CO2005

Symmetric Bush-type Hadamard matrices of order $4 m^{4}$ exist for all odd $m$

Mikhail Muzychuk, Qing Xiang

Using reversible Hadamard difference sets, we construct symmetric Bush-type Hadamard matrices of order $4 m^{4}$ for all odd integer $m$ .

Efficient Approximation of Convex Recolorings

Symmetric Bush-type Hadamard matrices of order 4m4 exist for all odd m

Symmetric Bush-type Hadamard matrices of order $4 m^{4}$ exist for all odd $m$