The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergey V. Sevastianov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Sergey V. Sevastianov
    Seven Problems: So Different yet Close. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:443-458 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]

  12. The Flow Shop Problem with Random Operation Processing Times. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002