The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Kononov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eric Angel, Evripidis Bampis, Alexander Kononov
    A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:194-205 [Conf]
  2. Evripidis Bampis, Alexander Kononov
    On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:200- [Conf]
  3. Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov
    Scheduling tasks with small communication delays for clusters of processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:314-315 [Conf]
  4. Evripidis Bampis, Alexander Kononov
    Bicriteria approximation algorithms for scheduling problems with communications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:252-253 [Conf]
  5. Alexander Kononov, Maxim Sviridenko
    A linear time approximation scheme for makespan minimization in an open shop with release dates. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:4, pp:276-280 [Journal]
  6. Evripidis Bampis, Alexander Kononov
    Bicriteria approximation algorithms for scheduling problems with communications delays. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:4, pp:281-294 [Journal]
  7. Eric Angel, Evripidis Bampis, Alexander Kononov
    On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:319-338 [Journal]
  8. Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov
    Approximation Algorithms for the Black and White Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:559-567 [Conf]

  9. Integrality Property in Preemptive Parallel Machine Scheduling. [Citation Graph (, )][DBLP]


  10. Complete Complexity Classification of Short Shop Scheduling. [Citation Graph (, )][DBLP]


  11. The Routing Open Shop Problem: New Approximation Algorithms. [Citation Graph (, )][DBLP]


  12. Bounded Max-Colorings of Graphs [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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