| 2009 |
|---|
| 7 | EE | Yury L. Orlovich,
Valery S. Gordon,
Dominique de Werra:
On the inapproximability of independent domination in 2P3-free perfect graphs.
Theor. Comput. Sci. 410(8-10): 977-982 (2009) |
| 2008 |
|---|
| 6 | EE | Valery S. Gordon,
Yury L. Orlovich,
Frank Werner:
Hamiltonian properties of triangular grid graphs.
Discrete Mathematics 308(24): 6166-6188 (2008) |
| 5 | EE | Yury L. Orlovich,
Gerd Finke,
Valery S. Gordon,
Igor E. Zverovich:
Approximability results for the maximum and minimum maximal induced matching problems.
Discrete Optimization 5(3): 584-593 (2008) |
| 4 | EE | Valery S. Gordon,
Chris N. Potts,
Vitaly A. Strusevich,
J. Douglass Whitehead:
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.
J. Scheduling 11(5): 357-370 (2008) |
| 2007 |
|---|
| 3 | EE | Yury L. Orlovich,
Valery S. Gordon,
Chris N. Potts,
Vitaly A. Strusevich:
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
Electronic Notes in Discrete Mathematics 29: 169-173 (2007) |
| 1999 |
|---|
| 2 | EE | Valery S. Gordon,
Vitaly A. Strusevich:
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment.
Computers & OR 26(2): 157-177 (1999) |
| 1998 |
|---|
| 1 | EE | Valery S. Gordon,
Wieslaw Kubiak:
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs.
Inf. Process. Lett. 68(3): 153-159 (1998) |
