The SCEAS System
Navigation Menu

Search the dblp DataBase


Cees Duin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cees Duin
    A Branch-Checking Algorithm for All-Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:131-145 [Journal]
  2. Cees Duin, Stefan Voß
    Efficient path and vertex exchange in steiner tree algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:2, pp:89-105 [Journal]
  3. Cees Duin, Stefan Voß
    The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:3, pp:181-191 [Journal]
  4. Cees Duin, E. Van Der Sluis
    On the Complexity of Adjacent Resource Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:1, pp:49-62 [Journal]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002