Maximizing Traveling Salesman Problem for Special Matrices. - David Blokh; Gregory Z. Gutin (Discret. Appl. Math., 1995)

An approximate algorithm for combinatorial optimization problems with two parameters. - David Blokh; Gregory Z. Gutin (Australas. J Comb., 1996)

The Maximum Traveling Salesman Problem on Banded Matrices. - David Blokh; Eugene Levner (Int. J. Found. Comput. Sci., 2001)

An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices. - David Blokh; Eugene Levner (Discret. Appl. Math., 2002)

A problem of finding an acceptable variant in generalized project networks. - David Blokh; Gregory Z. Gutin; Anders Yeo (Adv. Decis. Sci., 2005)

A Cluster Pattern Algorithm for the Analysis of Multiparametric Cell Assays. - Menachem Kaufman; David Blokh; Naomi Zurgil; Yana Shafran; Mordechai Deutsch (J. Comput. Biol., 2005)

Breast cancer detection by Michaelis-Menten constants via linear programming. - David Blokh; Elena Afrimzon; Ilia Stambler; Eden Korech; Yana Shafran; Naomi Zurgil; Mordechai Deutsch (Comput. Methods Programs Biomed., 2007)

Comparative analysis of cell parameter groups for breast cancer detection. - David Blokh; Ilia Stambler; Elena Afrimzon; Max Platkov; Yana Shafran; Eden Korech; Judith Sandbank; Naomi Zurgil; Mordechai Deutsch (Comput. Methods Programs Biomed., 2009)

An Information Theory Approach for the Analysis of Individual and Combined Evaluation Parameters of Multiple Age-Related Diseases. - David Blokh; Ilia Stambler; Emilia Lubart; Eliyahu H. Mizrahi (Entropy, 2019)