 | 2009 |
|---|
| 9 |       | Vittorio Bilò,
Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli:
On the Performances of Nash Equilibria in Isolation Games.
COCOON 2009: 17-26 |
| 8 | | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Hadas Shachnai,
Mordechai Shalom,
Tami Tamir,
Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks.
IPDPS 2009: 1-12 |
| 7 | | Michele Flammini,
Alberto Marchetti-Spaccamela,
Gianpiero Monaco,
Luca Moscardelli,
Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks.
SPAA 2009: 154-162 |
| 2008 |
|---|
| 6 | | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Euro-Par 2008: 920-929 |
| 5 | | Ioannis Caragiannis,
Gianpiero Monaco:
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.
MFCS 2008: 205-216 |
| 4 | | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Selfishness, collusion and power of local search for the ADMs minimization problem.
Computer Networks 52(9): 1721-1731 (2008) |
| 3 | | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distrib. Comput. 68(7): 939-948 (2008) |
| 2007 |
|---|
| 2 | | Stefania Di Giannantonio,
Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
WINE 2007: 404-411 |
| 2006 |
|---|
| 1 | | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks.
WG 2006: 147-158 |
