The SCEAS System
| |||||||

## Search the dblp DataBase
Sergey V. Sevastianov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
**On-line and Off-line Approximation Algorithms for Vector Covering Problems.**[Citation Graph (0, 0)][DBLP] ESA, 1996, pp:406-418 [Conf] - Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastyanov, René Sitters
**Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:580-591 [Conf] - Sergey V. Sevastianov
**Seven Problems: So Different yet Close.**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:443-458 [Conf] - Sergey V. Sevastianov, I. D. Tchernykh
**Computer-Aided Way to Prove Theorems in Scheduling.**[Citation Graph (0, 0)][DBLP] ESA, 1998, pp:502-513 [Conf] - Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
**Open Block Scheduling in Optical Communication Networks.**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:13-26 [Conf] - Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
**On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal] - Sergey V. Sevastianov, Gerhard J. Woeginger
**Makespan Minimization in Preemptive Two Machine Job Shops.**[Citation Graph (0, 0)][DBLP] Computing, 1998, v:60, n:1, pp:73-80 [Journal] - K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
**A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:255-271 [Journal] - Sergey V. Sevastianov, Gerhard J. Woeginger
**Linear time approximation scheme for the multiprocessor open shop problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:273-288 [Journal] - Sergey V. Sevastianov, Gerhard J. Woeginger
**Makespan minimization in open shops: A polynomial time approximation scheme.**[Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:82, n:, pp:191-198 [Journal] - Sergey V. Sevastianov
**An introduction to multi-parameter complexity analysis of discrete problems.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:2, pp:387-397 [Journal] **The Flow Shop Problem with Random Operation Processing Times.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |