 | 2010 |
|---|
| 10 |       | Andrew C. Trapp,
Oleg A. Prokopyev,
Stanislav Busygin:
Finding checkerboard patterns via fractional 0-1 programming.
J. Comb. Optim. 20(1): 1-26 (2010) |
| 2009 |
|---|
| 9 | | Stanislav Busygin:
Lovász Number.
Encyclopedia of Optimization 2009: 1931-1937 |
| 8 | | Stanislav Busygin:
Copositive Programming.
Encyclopedia of Optimization 2009: 564-567 |
| 2008 |
|---|
| 7 | | Stanislav Busygin,
Oleg A. Prokopyev,
Panos M. Pardalos:
Biclustering in data mining.
Computers & OR 35(9): 2964-2987 (2008) |
| 2006 |
|---|
| 6 | | Stanislav Busygin:
A new trust region technique for the maximum weight clique problem.
Discrete Applied Mathematics 154(15): 2080-2096 (2006) |
| 5 | | Stanislav Busygin,
Dmitrii V. Pasechnik:
On NP-hardness of the clique partition - Independence number gap recognition and related problems.
Discrete Mathematics 306(4): 460-463 (2006) |
| 2005 |
|---|
| 4 | | Stanislav Busygin,
Oleg A. Prokopyev,
Panos M. Pardalos:
Feature Selection for Consistent Biclustering via Fractional 0-1 Programming.
J. Comb. Optim. 10(1): 7-21 (2005) |
| 2003 |
|---|
| 3 | | Stanislav Busygin,
Dmitrii V. Pasechnik:
On ~chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds
Electronic Colloquium on Computational Complexity (ECCC)(052): (2003) |
| 2002 |
|---|
| 2 | | Stanislav Busygin,
Sergiy Butenko,
Panos M. Pardalos:
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere.
J. Comb. Optim. 6(3): 287-297 (2002) |
| 1999 |
|---|
| 1 | | Stanislav Busygin:
On SAT01 Problem.
CP 1999: 476-477 |
Data released under the ODC-BY 1.0 license — See also our legal information page