The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gianpiero Monaco: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:147-158 [Conf]

  2. On the Performances of Nash Equilibria in Isolation Games. [Citation Graph (, )][DBLP]


  3. Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP]


  4. Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]


  5. A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. [Citation Graph (, )][DBLP]


  6. On the complexity of the regenerator placement problem in optical networks. [Citation Graph (, )][DBLP]


  7. Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP]


  8. Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP]


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