| An introduction to multi-parameter complexity analysis of discrete problems | 4 | 0.42 | 2005 |
| On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. | 1 | 0.60 | 2002 |
| Computer-Aided Way to Prove Theorems in Scheduling | 4 | 0.74 | 1998 |
| Makespan minimization in open shops: A polynomial time approximation scheme | 48 | 3.41 | 1998 |
| Seven Problems: So Different yet Close | 0 | 0.34 | 1997 |
| On-line and Off-line Approximation Algorithms for Vector Covering Problems | 9 | 1.58 | 1996 |
