A Lower Bound Theorem for Polytope Pairs. - M. Reza Emamy-Khansary (J. Comb. Theory A, 1985)

On the cuts and cut number of the 4-cube. - M. Reza Emamy-Khansary (J. Comb. Theory A, 1986)

On the covering cuts of cd (d<=5). - M. Reza Emamy-Khansary (Discret. Math., 1988)

The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions. - M. Reza Emamy-Khansary (Discret. Appl. Math., 1989)

On the cut-complexes of the 5-cube. - M. Reza Emamy-Khansary; L. Lazarte (Discret. Math., 1989)

A special class of set covering problems. - M. R. Emamy-K; A. I. Ramírez (Comput. Optim. Appl., 1996)

New Bounds for Hypercube Slicing Numbers. - M. Reza Emamy-Khansary; Martin Ziegler 001 (DM-CCG, 2001)

The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic. - M. Reza Emamy-Khansary (Electron. Notes Discret. Math., 2004)

On the coverings of the d-cube for d<=6. - M. Reza Emamy-Khansary; Martin Ziegler 001 (Discret. Appl. Math., 2008)

Cuts, c-Cuts, and c-Complexes over the n-Cube. - M. Reza Emamy-Khansary (INOC, 2011)

A geometric connection to threshold logic via cubical lattices. - M. Reza Emamy-Khansary (Ann. Oper. Res., 2011)

On the cut number problem for the 4, and 5-cubes. - M. R. Emamy-K; Rafael A. Arce-Nazario (Discret. Appl. Math., 2021)