The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vadim G. Timkovsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philippe Baptiste, Vadim G. Timkovsky
    On preemption redundancy in scheduling unit processing time jobs on two parallel machines. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:200- [Conf]
  2. Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
    Ten notes on equal-processing-time scheduling. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:2, pp:111-127 [Journal]
  3. Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
    Ideal preemptive schedules on two processors. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:8, pp:597-612 [Journal]
  4. Vadim G. Timkovsky
    A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:2, pp:185-200 [Journal]
  5. Vadim G. Timkovsky
    Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:2, pp:149-162 [Journal]
  6. Martin Middendorf, Vadim G. Timkovsky
    Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:4, pp:417-435 [Journal]
  7. Philippe Baptiste, Vadim G. Timkovsky
    On preemption redundancy in scheduling unit processing time jobs on two parallel machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:5, pp:205-212 [Journal]
  8. Anatoly R. Rubinov, Vadim G. Timkovsky
    String Noninclusion Optimization Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:456-467 [Journal]
  9. Tao Jiang, Vadim G. Timkovsky
    Shortest Consistent Superstrings Computable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:113-122 [Journal]
  10. Vadim G. Timkovsky
    Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:355-376 [Journal]

  11. Some Approximations for Shortest Common Nonsubsequences and Supersequences. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002