On SAT01 Problem. - Stanislav Busygin (CP, 1999)

A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. - Stanislav Busygin; Sergiy Butenko; Panos M. Pardalos (J. Comb. Optim., 2002)

On chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds - Stanislav Busygin; Dmitrii V. Pasechnik (Electron. Colloquium Comput. Complex., 2003)

Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. - Stanislav Busygin; Oleg A. Prokopyev; Panos M. Pardalos (J. Comb. Optim., 2005)

A new trust region technique for the maximum weight clique problem. - Stanislav Busygin (Discret. Appl. Math., 2006)

On NP-hardness of the clique partition - Independence number gap recognition and related problems. - Stanislav Busygin; Dmitrii V. Pasechnik (Discret. Math., 2006)

An optimization-based approach for data classification. - Stanislav Busygin; Oleg A. Prokopyev; Panos M. Pardalos (Optim. Methods Softw., 2007)

Application of the data mining techniques to the systems biology of neuritogenesis. - Z. Q. Zhang; Alla R. Kammerdiner; Stanislav Busygin; A. K. Ottens; S. F. Larner; F. H. Kobeissy; Panos M. Pardalos; R. L. Hayes; K. K. Wang (Optim. Methods Softw., 2007)

Biclustering in data mining. - Stanislav Busygin; Oleg A. Prokopyev; Panos M. Pardalos (Comput. Oper. Res., 2008)

Copositive Programming. - Stanislav Busygin (Encyclopedia of Optimization, 2009)

Lovász Number. - Stanislav Busygin (Encyclopedia of Optimization, 2009)

Finding checkerboard patterns via fractional 0-1 programming. - Andrew C. Trapp; Oleg A. Prokopyev; Stanislav Busygin (J. Comb. Optim., 2010)