Michele Flammini - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

When ignorance helps: Graphical multicast cost sharing gamesVittorio BilÃ², Angelo Fanelli, Michele Flammini, Luca Moscardelli. TCS, 411(3):660-671, 2010. [doi]

Designing Fast Converging Cost Sharing Methods for Multicast TransmissionsVittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli. mst, 47(2):507-530, 2010. [doi]

On the Convergence of Multicast Games in Directed NetworksAngelo Fanelli, Michele Flammini, Luca Moscardelli. algorithmica, 57(2):301-324, 2010. [doi]

Stackelberg Strategies for Network Design GamesAngelo Fanelli, Michele Flammini, Luca Moscardelli. wine 2010: 222-233 [doi]

Minimizing total busy time in parallel scheduling with application to optical networksMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks. TCS, 411(40-42):3553-3562, 2010. [doi]

On the bicriteria ::::k::::-server problemMichele Flammini, Gaia Nicosia. talg, 7(1):6, 2010. [doi]

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

2009

On the Performances of Nash Equilibria in Isolation GamesVittorio BilÃ², Michele Flammini, Gianpiero Monaco, Luca Moscardelli. cocoon 2009: 17-26 [doi]

Performances of One-Round Walks in Linear Congestion GamesVittorio BilÃ², Angelo Fanelli, Michele Flammini, Luca Moscardelli. sagt 2009: 311-322 [doi]

On minimizing the number of ADMs in a general topology optical networkMichele Flammini, Mordechai Shalom, Shmuel Zaks. DAM, 157(12):2701-2717, 2009. [doi]

Minimizing total busy time in parallel scheduling with application to optical networksMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks. ipps 2009: 1-12 [doi]

On the complexity of the regenerator placement problem in optical networksMichele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks. spaa 2009: 154-162 [doi]

Layouts for mobility management in wireless ATM networksMichele Flammini, Alfredo Navarra. DAM, 157(1):98-111, 2009. [doi]

2008

Graphical Congestion GamesVittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. wine 2008: 70-81 [doi]

On Nash equilibria for multicast transmissions in ad-hoc wireless networksVittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli. winet, 14(2):147-157, 2008. [doi]

When Ignorance Helps: Graphical Multicast Cost Sharing GamesVittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. mfcs 2008: 108-119 [doi]

Graphical congestion games with linear latenciesVittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. spaa 2008: 194-196 [doi]

The Speed of Convergence in Congestion Games under Best-Response DynamicsAngelo Fanelli, Michele Flammini, Luca Moscardelli. icalp 2008: 796-807 [doi]

Tightening the upper bound for the minimum energy broadcastingMichele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes. winet, 14(5):659-669, 2008. [doi]

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMsMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. europar 2008: 920-929 [doi]

Approximating the traffic grooming problemMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. jda, 6(3):472-479, 2008. [doi]

Approximating the traffic grooming problem in tree and star networksMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. jpdc, 68(7):939-948, 2008. [doi]

Selfishness, collusion and power of local search for the ADMs minimization problemMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. cn, 52(9):1721-1731, 2008. [doi]

Asymptotically Optimal Solutions for Small World GraphsMichele Flammini, Luca Moscardelli, Alfredo Navarra, Stephane Perennes. mst, 42(4):632-650, 2008. [doi]

2007

Extending the Notion of Rationality of Selfish Agents: Second Order Nash EquilibriaVittorio Bilò, Michele Flammini. mfcs 2007: 621-632 [doi]

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless NetworksIoannis Caragiannis, Michele Flammini, Luca Moscardelli. icalp 2007: 447-458 [doi]

Experimental Evaluations of Algorithms for IP Table MinimizationAngelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli. wea 2007: 324-337 [doi]

On the convergence of multicast games in directed networksAngelo Fanelli, Michele Flammini, Luca Moscardelli. spaa 2007: 330-338 [doi]

On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessingMichele Flammini, Mordechai Shalom, Shmuel Zaks. jpdc, 67(4):448-455, 2007. [doi]

Improved Approximation Results for the Minimum Energy Broadcasting ProblemMichele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes. algorithmica, 49(4):318-336, 2007. [doi]

Selfishness, Collusion and Power of Local Search for the ADMs Minimization ProblemStefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. wine 2007: 404-411 [doi]

2006

Synthesis of Concurrent and Distributed Adaptors for Component-Based SystemsMarco Autili, Michele Flammini, Paola Inverardi, Alfredo Navarra, Massimo Tivoli. ewsa 2006: 17-32 [doi]

Pareto approximations for the bicriteria scheduling problemVittorio Bilò, Michele Flammini, Luca Moscardelli. jpdc, 66(3):393-402, 2006. [doi]

Sharing the cost of multicast transmissions in wireless networksVittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra. TCS, 369(1-3):269-284, 2006. [doi]

Tight Bounds for Selfish and Greedy Load BalancingIoannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli. icalp 2006: 311-322 [doi]

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish MovesAngelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli. mfcs 2006: 363-374 [doi]

Efficient offline algorithms for the bicriteria ::::k::::-server problem and online applicationsMichele Flammini, Alfredo Navarra, Gaia Nicosia. jda, 4(3):414-432, 2006. [doi]

On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without PreprocessingMichele Flammini, Mordechai Shalom, Shmuel Zaks. caan 2006: 72-85 [doi]

Approximating the Traffic Grooming Problem in Tree and Star NetworksMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. criwg 2006: 147-158 [doi]

On Minimizing the Number of ADMs in a General Topology Optical NetworkMichele Flammini, Mordechai Shalom, Shmuel Zaks. wdag 2006: 459-473 [doi]

Competitive algorithms for the bicriteria k-server problemMichele Flammini, Gaia Nicosia. DAM, 154(15):2117-2127, 2006. [doi]

The real approximation factor of the MST heuristic for the minimum energy broadcastingMichele Flammini, Alfredo Navarra, Stephane Perennes. jea, 11, 2006. [doi]

2005

On Nash Equilibria in Non-cooperative All-Optical NetworksVittorio Bilò, Michele Flammini, Luca Moscardelli. STACS 2005: 448-459 [doi]

Approximating the Traffic Grooming ProblemMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. isaac 2005: 915-924 [doi]

The Real Approximation Factor of the MST Heuristic for the Minimum Energy BroadcastingMichele Flammini, Alfredo Navarra, Stéphane Pérennes. wea 2005: 22-31 [doi]

Lower bounds on systolic gossipMichele Flammini, Stéphane Pérennes. iandc, 196(2):71-94, 2005. [doi]

Wireless ATM Layouts for Chain NetworksMichele Flammini, Giorgio Gambosi, Alfredo Navarra. monet, 10(1-2):35-45, 2005. [doi]

On routing of wavebands for all-to-all communications in all-optical paths and cyclesMichele Flammini, Alfredo Navarra, Andrzej Proskurowski. TCS, 333(3):401-413, 2005. [doi]

Asymptotically Optimal Solutions for Small World GraphsMichele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes. wdag 2005: 414-428 [doi]

2004

On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless NetworksVittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli. isaac 2004: 172-183 [doi]

Sharing the cost of multicast transmissions in wireless networksVittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo. spaa 2004: 180-187 [doi]

Pareto Approximations for the Bicriteria Scheduling ProblemVittorio Bilò, Michele Flammini, Luca Moscardelli. ipps 2004: [doi]

On the IP Routing Tables Minimization with Addresses ReassignmentVittorio Bilò, Michele Flammini. ipps 2004: [doi]

Experimental analysis of online algorithms for the bicriteria scheduling problemVittorio Bilò, Michele Flammini, Roberto Giovannelli. jpdc, 64(9):1086-1100, 2004. [doi]

Improved approximation results for the minimum energy broadcasting problemMichele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes. dialm 2004: 85-91 [doi]

Lower Bounds on the Broadcasting and Gossiping Time of Restricted ProtocolsMichele Flammini, Stéphane Pérennes. siamdm, 17(4):521-540, 2004. [doi]

2003

Minimum Flow Time Graph OrderingClaudio Arbib, Michele Flammini, Fabrizio Marinelli. criwg 2003: 23-33 [doi]

Deadlock Prevention by Acyclic OrientationsJean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes. DAM, 129(1):31-47, 2003. [doi]

Quality of Service in Wireless NetworksVittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti. ipps 2003: 224 [doi]

Experimental Analysis of Online Algorithms for the Bicriteria Scheduling ProblemVittorio Bilò, Michele Flammini, Roberto Giovannelli. wea 2003: 33-46 [doi]

Dynamic Layouts for Wireless ATMMichele Flammini, Giorgio Gambosi, Alessandro Gasparini, Alfredo Navarra. europar 2003: 1056-1063 [doi]

Wireless ATM Layouts for Chain NetworksMichele Flammini, Giorgio Gambosi, Alfredo Navarra. ipps 2003: 220 [doi]

On Routing of Wavebands for Gossiping in All-Optical Paths and CyclesMichele Flammini, Alfredo Navarra, Andrzej Proskurowski. sirocco 2003: 133-145

2002

2001

2000

1999

Compact-Port Routing Models and Applications to Distance-Hereditary GraphsSerafino Cicerone, Gabriele Di Stefano, Michele Flammini. sirocco 1999: 62-77

Deadlock-free interval routing schemesMichele Flammini. networks, 34(1):47-60, 1999. [doi]

Simple, Efficient Routing Schemes for All-Optical NetworksMichele Flammini, Christian Scheideler. mst, 32(3):387-420, 1999. [doi]

1998

1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes. criwg 1997: 52-64

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)Tamar Eilam, Michele Flammini, Shmuel Zaks. icalp 1997: 527-537

Lower Bounds on Systolic GossipMichele Flammini, Stephane Perennes. ipps 1997: 517-521 [doi]

ATM Layouts with Bounded Hop Count and CongestionMichele Flammini, Enrico Nardelli, Guido Proietti. wdag 1997: 52-65

Deadlock-Free Interval Routing SchemesMichele Flammini. STACS 1997: 351-362

Simple, Efficient Routing Schemes for All-Optical NetworksMichele Flammini, Christian Scheideler. spaa 1997: 170-179 [doi]

On Devising Boolean Routing SchemesMichele Flammini, Giorgio Gambosi. TCS, 186(1-2):171-198, 1997. [doi]

On the Hardness of Devising Interval Routing SchemesMichele Flammini. ppl, 7(1):39-47, 1997.

1996

Interval Routing SchemesMichele Flammini, Giorgio Gambosi, Sandro Salomone. algorithmica, 16(6):549-568, 1996.

1995

Interval Routing SchemesMichele Flammini, Giorgio Gambosi, Sandro Salomone. STACS 1995: 279-290

Multi-Dimensional Interval Routing SchemesMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan. wdag 1995: 131-144

Systolic Acyclic Orientations for Deadlock PreventionMiriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone. sirocco 1996: 1-12

PreviousNext