J3) V. Bilò, M. Flammini, G. Melideo, L. Moscardelli, A. Navarra
"Sharing the Cost of Multicast Transmission in Euclidean and General Wireless Networks". Theoretical Computer Science 369 (2006) pp. 269-284.
doi:10.1016/j.tcs.2006.09.004

J4) M. Flammini, L. Moscardelli, A. Navarra, S. Perennes
"Asymptotically Optimal Solutions for Small World Graphs". Theory of Computing Systems (TOCS), 42(4), pp. 632 - 650, 2008, doi:10.1007/s00224-007-9073-y

J5) M. Flammini, L. Moscardelli, M. Shalom, S. Zaks
"Approximating the Traffic Grooming Problem". Journal of Discrete Algorithms (2008), 6(3), September 2008, pp. 472-479.doi:10.1016/j.jda.2007.09.001

J6) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Approximating the Tra±c Grooming Problem in Tree and Star Networks". Journal of Parallel and Distributed Computing, 68(7), July 2008, pp. 939-948 .doi:10.1016/j.jpdc.2008.01.003

J7) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem". Computer Networks, 52(9), June 2008, pp. 1721-1731.doi:10.1016/j.comnet.2008.02.009

J8) A. Fanelli, M. Flammini, L. Moscardelli
"On the Convergence of Multicast Games in Directed Networks". Algorithmica, 57(2), June 2010.doi:10.1007/s00453-008- 9212-0

J9) V. Bilò, A. Fanelli, M. Flammini, G. Melideo, L. Moscardelli
"Designing Fast Converging Cost Sharing Methods for Multicast Transmissions". Theory of Computing Systems 47(2), 2010.doi:10.1007/s00224-009-9207-5

J10) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"When Ignorance helps: Graphical Multicast Cost Sharing Games". Theoretical Computer Science 411 (3) pp.660- 671 (2010).doi:10.1016/j.tcs.2009.10.007

J11) V. Bilò, M. Flammini, G. Monaco, L. Moscardelli
"On the performances of Nash equilibria in isolation games". Journal of Combinatorial optimization (22), pp. 378-397, 2011, doi:10.1007/s10878-010-9300-3

J12) A. Fanelli, M. Flammini, L. Moscardelli
"The speed of Convergence in Congestion Games under Best Response Dynamics". Accepted, Transaction on Algorithms (TALG), 2010doi: to be assigned

J13) M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, S. Zaks
"Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks". Theoretical Computer Science 411 (2010)doi:10.1016/j.tcs.2010.05.011

J14) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"Graphical Congestion Games". Algorithmica (61), pp. 274-297, 2011 doi:10.1007/s00453-010-9417-x

J15) I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, L. Moscardelli
"Tight Bounds for Selfish and Greedy Load Balancing". Algorithmica (61), pp. 606-637, 2011 doi:10.1007/s00453-010-9427-8

J16) M. Flammini, A. Marchetti-Spaccamela, G. Monaco, L. Moscardelli, S. Zaks
"On the Complexity of the Regenerator Placement Problem in Optical Networks". IEEE/ACM Transactions on Networking (19), pp. 498-511, 2011 doi:10.1109/TNET.2010.2068309

J17) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"Performances of One-Round Walks in Linear Congestion Games". Theory of Computing Systems 49(1), pp. 24-45, 2011 doi:10.1007/s00224-010-9309-0

J18) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Optimizing Regenerator Cost in Traffic Grooming". Theoretical Computer Science (412), pp. 7109-7121, 2011doi:10.1016/j.tcs.2011.09.023

J19) A. Fanelli, L. Moscardelli
"On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays". Distributed Computing (24), pp. 245-254, 2011doi:10.1007/s00446-011-0145-5

B1) T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Munoz, I. Sau, M. Shalom, S. Zaks
"Traffic Grooming: Combinatorial Results and Practical Resolutions". Koster, Arie M.C.A.; Muñoz, Xavier (Eds.) (a cura di) Graphs and Algorithms in Communication Networks Springer-Verlag, Berlino GERMANIA pp.63-94 (2009).
isbn:978-3-642-02249-4 doi:10.1007/978-3-642-02250-0_2

B2) V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, L. Moscardelli
"Game-Theoretic Approaches to Optimization Problems in Communication Networks". Koster, Arie M.C.A.; Muñoz, Xavier (Eds.) (a cura di) Graphs and Algorithms in Communication Networks Springer-Verlag, Berlino GERMANIA pp.241-263 (2009).
isbn:978-3-642-02249-4 doi:10.1007/978-3-642-02250-0_9

I1) V. Bilò, M. Flammini, L. Moscardelli
"Pareto Approximations for the Bicriteria Scheduling Problem". Proc. of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2004. doi:10.1109/IPDPS.2004.1303023

I2) V. Bilò, L. Moscardelli
"The Price of Anarchy in All-Optical Networks". Proc. of the 11th Annual International Symposium SIROCCO 2004, Lecture Notes in Computer Science 3104, Springer-Verlag, 2004. doi:10.1007/978-3-540-27796-5_2

I3) V. Bilò, M. Flammini, G. Melideo, L. Moscardelli
"On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks". Proc. of the 15th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3341, Springer-Verlag, 2004. doi:10.1007/978-3-540-30551-4_17

I4) V. Bilò, M. Flammini, L. Moscardelli
"On Nash Equilibria in Non-Cooperative All-Optical Networks". Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 3404, Springer-Verlag, 2005. doi:10.1007/978-3-540-31856-9_37

I5) M. Flammini, L. Moscardelli, A. Navarra, S. Perennes
"Asymptotically Optimal Solutions for Small World Graphs". Proc. of the 19th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science 3724, Springer-Verlag, 2005. doi:10.1007/11561927_30

I6) M. Flammini, L. Moscardelli, M. Shalom, S. Zaks
"Approximating the Traffic Grooming Problem". Proc. of the 16th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3827, Springer-Verlag, 2005. doi:10.1007/11602613_91

I7) A.Fanelli, M. Flammini, G. Melideo, L. Moscardelli, A. Navarra
"Game Theoretical Issues in Optical Networks". invited to International Conference on Transparent Optical Networks (ICTON) 2006, June 18-22, 2006 - Nottingham, United Kingdom.. doi:10.1109/ICTON.2006.248444

I8) I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, L. Moscardelli
"Tight Bounds for Selfish and Greedy Load Balancing". Proc. of the Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Lecture Notes in Computer Science 4051, Springer-Verlag, 2006, pag. 311-322.. doi:10.1007/11786986_28

I9) A.Fanelli, M. Flammini, G. Melideo, L. Moscardelli
"Multicast Transmission in Non-Cooperative Networks with a Limited Number of Selfish Moves". 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), August 28 - September 1, 2006, Lecture Notes in Computer Science 4162, Springer-Verlag, 2006, pag. 363-374.. doi:10.1007/11821069_32

I10) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Approximating the Traffic Grooming Problem in Tree and Star Networks". 32st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006 June 22-24, Bergen, Norway, Lecture Notes in Computer Science 4271, Springer-Verlag, 2006, pag. 147-158.. doi:10.1007/11917496_14

I11) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Minimizing the number of ADMs with and without traffic grooming: complexity and approximability". invited to International Conference on Transparent Optical Networks (ICTON) 2006, June 18-22, 2006 - Nottingham, United Kingdom.. doi:10.1109/ICTON.2006.248411

I12) A. Fanelli, M. Flammini, L. Moscardelli
"On the Convergence of Multicast Games in Directed Networks". 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), San Diego, CA, USA June 9 - 11, 2007.. doi:10.1145/1248377.1248433

I13) A. Fanelli, M.Flammini, D. Mango, G.Melideo, L. Moscardelli
"Experimental Evaluation of Algorithms for IP Table Minimization". 6th Workshop on Experimental Algorithms (WEA), June 6-8, 2007 Rome Italy.. doi:10.1007/978-3-540-72845-0_25

I14) I. Caragiannis, M. Flammini, L. Moscardelli
"An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem". Proc. of the Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, July 9-13, 2007 Wroclaw, Poland.. doi:10.1007/978-3-540-73420-8_40

I15) S. Di Giannantonio, M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem". Proc. of the 3rd International Workshop On Internet And Network Economics (WINE 2007), San Diego, CA, USA. December 12-14, 2007.. doi:10.1007/978-3-540-77105-0_45

I16) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"Brief Announcement: Graphical Con- gestion Games with Linear Latencies". Proc. of 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, 2008. doi:10.1145/1378533.1378571

I17) A. Fanelli, M. Flammini, L. Moscardelli
"The speed of Convergence in Congestion Games under Best Response Dynamics". Proc. of the Automata, Languages and Programming, 35th Inter- national Colloquium, ICALP 2008, July 6 - 13, Reykjavik - Iceland, Lecture Notes in Computer Science 5125, pp. 796-807, Springer-Verlag, 2008. doi:10.1007/978-3-540-70575-8_65

I18) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Approximating the Traffic Grooming Problem with respect to ADMs and OADMs". Proc. of the 14th International Euro- Par ConferenceEuropean Conference on Parallel and Distributed Computing (Euro-Par 2008), August 26-29th, 2008UAB-ULPGC, Las Palmas de Gran Canaria, Spain, Lecture Notes in Computer Science 5168, pp. 920-929, Springer-Verlag, 2008. doi:10.1007/978-3-540-85451-7_99

I19) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"When Ignorance helps: Graphical Cost Sharing Games". Proc. of MFCS 2008 - 33nd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland, Europe, Lecture Notes in Computer Science 5162, pp. 108-119, Springer-Verlag, 2008. doi:10.1007/978-3-540-85238-4_8

I20) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"Graphical Congestion Games". Proc. of the 4th International Workshop On Internet And Network Economics (WINE 2008), December 17-20, 2008, Shanghai, China. doi:10.1007/978-3-540-92185-1_16

I21) V.Auletta, L. Moscardelli, P. Penna, G. Persiano
"Interference Games in Wireless Networks". Proc. of the 4th International Workshop On Internet And Network Economics (WINE 2008), December 17-20, 2008, Shanghai, China. doi:10.1007/978-3-540-92185-1_34

I22) M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamirk, S. Zaks.
"Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks". Proc. of the 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS 2009), May 25-29, 2009, Rome, Italy. doi:10.1109/IPDPS.2009.5161017

I23) M. Flammini, A. Marchetti Spaccamela, G. Monaco, L. Moscardelli, S. Zaks.
"On the complexity of the regenerator placement problem in optical networks". Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures (SPAA 2009), August 11-13, 2009, Calgary, Canada. doi:10.1145/1583991.1584035

I24) V. Bilò, M. Flammini, G. Monaco, L. Moscardelli.
"On the Performances of Nash Equilibria in Isolation Games". Proceedings of Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009. doi:10.1007/978-3-642-02882-3_3

I25) V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli
"Performances of One-Round Walks in Linear Congestion Games". Proceedings of Algorithmic Game Theory, Second International Symposium, (SAGT 2009), Paphos, Cyprus, October 18-20, 2009. doi:10.1007/978-3-642-04645-2_28

I26) A. Fanelli, L. Moscardelli
"On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays". Proceedings of the 5th International Workshop On Internet And Network Economics (WINE 2009), December 14-18, 2009, Sapienza University of Rome, Rome, Italy.. doi:10.1007/978-3-642-10841-9_7

I27) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"Optimizing Regenerator Cost in Traffic Grooming". Proceedings of the 14th International Conference On Principles Of Distributed Systems (OPODIS 2010), December 14-17, 2010, Tozeur, Tunisia. doi:10.1007/978-3-642-17653-1_32

I28) A. Fanelli, M. Flammini, L. Moscardelli
"Stackelberg Strategies for Network Design Games". Proceedings of the 6th Workshop on Internet and network Economics (WINE 2010), December 13-17, 2010, Stanford University, Stanford, California, USA. doi:10.1007/978-3-642-17572-5_18

I29) M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks
"On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming". Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011), December 12-16, 2011, Tolouse, Francedoi:10.1007/978-3-642-25873-2_8

T1) L. Moscardelli
"Equilibri di Nash in reti ottiche non cooperative". Tesi di Laurea. Relatori: Proff. M. Flammini e V. Bilò..

T2) L. Moscardelli
"The impact of non-cooperativeness and of limited resources and social knowledge on distributed systems: performances and complexity". Tesi di Dottorato. Advisor: Prof. M. Flammini..