Gianpiero Monaco

Ioannis Caragiannis, Gianpiero Monaco: A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25(1): 60-77 (2013)

Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco: Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52(4): 668-686 (2013)

Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli: Mobile Network Creation Games. SIROCCO 2012: 159-170

Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski: The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE 2012: 546-552

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)

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011)

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)

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

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)

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458

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

Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli: On the Performances of Nash Equilibria in Isolation Games. COCOON 2009: 17-26

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

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

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)

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)

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

Ioannis Caragiannis, Gianpiero Monaco: A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. MFCS 2008: 205-216

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

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158