Gianpiero Monaco

	2011
16		Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111
15		Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks: On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19(2): 498-511 (2011)
14		Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli: On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22(3): 378-391 (2011)
13		Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011)
	2010
12		Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458
11		Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT 2010: 90-101
10		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. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010)
	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

Coauthor Index

1	Vittorio Bilò	[9] [11] [14]
2	Ioannis Caragiannis	[5] [11]
3	Angelo Fanelli	[11]
4	Michele Flammini	[1] [2] [3] [4] [6] [7] [8] [9] [10] [12] [13] [14] [15] [16]
5	Stefania Di Giannantonio	[2]
6	Alberto Marchetti-Spaccamela	[7] [15]
7	Luca Moscardelli	[1] [2] [3] [4] [6] [7] [8] [9] [10] [12] [13] [14] [15] [16]
8	Hadas Shachnai	[8] [10]
9	Mordechai Shalom	[1] [2] [3] [4] [6] [8] [10] [12] [13] [16]
10	Tami Tamir	[8] [10]
11	Shmuel Zaks	[1] [2] [3] [4] [6] [7] [8] [10] [12] [13] [15] [16]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page