The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Can Akkan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Can Akkan, Andreas Drexl, Alf Kimms
    Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:62, n:1, pp:1-39 [Journal]
  2. Can Akkan, Andreas Drexl, Alf Kimms
    Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:339-358 [Journal]
  3. Can Akkan, Selçuk Karabati
    The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:159, n:2, pp:420-429 [Journal]

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