Michele Flammini

Full Professor

Blocco Zero, Room
michele.flammini@univaq.it

.:Studies

  • 1990: Laurea cum Laude in Computer Science at the University of L'Aquila.
  • 1995: PhD degree in Computer Science at the University of Rome ``La Sapienza".

.:Professional experiences

  • 1987-1989: system programmer on IBM mainframes with operative systems VM, MVS, DOS, and applications CICS-DLI.
  • January 1993 and January 1994 - June 1994: visitor at the Columbia University of New York and the ``T.J.Watson" IBM Research Center in Yorktown Heights (New York State) for an overall period of seven months.
  • January-March 1995 and March 1996: research fellow at the C.N.R.S.-I3S Laboratory of Sophia Antipolis (France) for an overall period of four months.
  • April 1995 - February 1996: full-time research activity with a C.N.R. fellowship at the ``Dipartimento di Informatica e Sistemistica" of the University of Rome ``La Sapienza" (supervisor Prof. Alberto Marchetti-Spaccamela).
  • March 1996 - October 2000: permanent position as assistant professor at the Department of Mathematics of the University of L'Aquila (Italy). 
    September 1996 - August 1997: visitor on leave at the I.N.R.I.A / C.N.R.S.-I3S Laboratory of Sophia Antipolis (France) supported also by an EC TMR individual grant.
  • November 2000 - February 2005: permanent position as associate professor at the Department of Computer Science of the University of L'Aquila (Italy).
  • January 2005 - January 2008: director of the PhD studies in Computer Science at the University of L'Aquila.
  • March 2005 -                           : permanent position as full professor at the Department of Information Engineering, Computer Science, and Mathematics of the University of L'Aquila (Italy).
  • December 2007 - October 2012: director of the Computer Science degrees at the University of L'Aquila.
Teaching web pages:
Skype contact:
Office hours:
Thursday 11:00 - 13:00
Courses:

[J1] M.Flammini: "km-DNF Formulae are Learnable under Product Distribution", Information Processing Letters, 52(3):167-173, 1994. 

[J2] M.Flammini, G.Gambosi, S.Salomone: "Interval Routing Schemes", Algorithmica, 16(6):549-568, Springer Verlag, 1996. 

[J3] M.Flammini: "On the Hardness of Devising Interval Routing Schemes", Parallel Processing Letters, 7(1):39-47, World Scientific, 1997. 

[J4] M.Flammini, G.Gambosi: "On Devising Boolean Routing Schemes", Theoretical Computer Science, 186(1-2):171-198, Elsevier, 1997. 

[J5] M.Flammini, A.Marchetti Spaccamela, J.van Leeuwen: "The Complexity of Interval Routing on Random Graphs", The Computer Journal 41(1):16-25, Oxford University Press, 1998. 

[J6] M.Flammini, G.Gambosi, U.Nanni, R.B.Tan: "Multi-dimensional Interval Routing Schemes", Theoretical Computer Science, 205(1-2):115-133, Elsevier, 1998. 

[J7] T.Eilam, M.Flammini, S.Zaks: "A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load", Parallel Processing Letters, 8(2):207-220, World Scientific, 1998. 

[J8] M.Flammini, C.Scheideler: "Simple, Efficient Routing Schemes for All-Optical Networks", Theory of Computing Systems (formerly Mathematical Systems Theory), 32(3):387-420, Springer Verlag, 1999. 

[J9] M.Flammini: "Deadlock-Free Interval Routing Schemes", Networks, 34(1):47-60, Wiley, 1999. 

[J10] C.Arbib, M.Flammini, E.Nardelli: "How to Survive while Visiting a Graph", Discrete Applied Mathematics, Special Issue associated to the 5th Twente Workshop on Graphs and Combinatorial Optimization, 99(1-3):279-293, Elsevier, 2000. 

[J11] S.Cicerone, G.Di Stefano, M.Flammini: "Low-Congested Interval Routing Schemes for Hypercube-Like Networks", Networks, 36(3):191-201, Wiley, 2000. 

[J12] S.Cicerone, G.Di Stefano, M.Flammini: "Compact-Port Routing Models and Applications to Distance-Hereditary Graphs", Journal of Parallel and Distributed Computing, 61(10):1472-1488, Academic Press, 2001. 

[J13] M.Flammini, E.Nardelli, G.Proietti: "ATM Layouts with Bounded Hop Count and Congestion", Distributed Computing, 14(2):65-73, Springer Verlag, 2001. 

[J14] M.Flammini, G.Gambosi, U.Nanni, R.B.Tan: "Characterization Results of All Shortest Paths Interval Routing Schemes", Networks, 37(4):225-232, Wiley, 2001. 

[J15] M.Flammini, S.Perennes: "On the Optimality of General Lower Bounds for Broadcasting and Gossiping", SIAM Journal on Discrete Mathematics, 14(2):267-282, SIAM, 2001. 

[J16] C.Arbib, M.Flammini: "On the Upper Chromatic Number of (v_3,b_2)-Configurations", Discrete Applied Mathematics, Special Issue associated to the 6th Twente Workshop on Graphs and Combinatorial Optimization, 120(1-3):3-12, Elsevier, 2002. 

[J17] S.Cicerone, G.Di Stefano, M.Flammini: "Static and Dynamic Low-Congested Interval Routing Schemes", Theoretical Computer Science, 276(1-2):315-354, Elsevier, 2002. 

[J18] J.C.Bermond, M.Di Ianni, M.Flammini, S.Perennes: "Deadlock Prevention by Acyclic Orientations", Discrete Applied Mathematics, Special Issue on "Algorithmic Aspects of Communication", 129(1):31-47, Elsevier, 2003. 

[J19] M.Flammini, S.Perennes: "Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols", SIAM Journal on Discrete Mathematics, 17(4):521-540, SIAM, 2004. 

[J20] V.Bilò, M.Flammini, R.Giovannelli: "Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem", Journal of Parallel and Distributed Computing, 64(9):1086-1100, Academic Press, 2004. 

[J21] M.Flammini, S.Perennes: "Lower Bounds on Systolic Gossiping", Information and Computation, 196(2):71-94, Elsevier, 2005. 

[J22] M.Flammini, G.Gambosi, A.Navarra: "Wireless ATM Layouts for Chain Networks", ACM/Kluwer Journal on Special Topics in Mobile Networks and Applications (MONET), Special Issue on "Algorithmic Solutions for Wireless, Mobile, Ad Hoc and Sensor Networks", 10(1-2):35-45, Kluwer Academic, 2005. 

[J23] M.Flammini, A.Navarra, A.Proskurowski: "On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles", Theoretical Computer Science, Special Issue associated to the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 333(3):401-413, Elsevier, 2005. 

[J24] M.Flammini, A.Navarra, G.Nicosia: "Efficient Online Algorithms for the Bicriteria k-Server Problem and Online Applications", Journal of Discrete Algorithms, Special Issue in honor of Giorgio Ausiello, 4(3):414-432, Elsevier, 2006. 

[J25] M.Flammini, G.Nicosia: "Competitive Algorithms for the Bicriteria k-Server Problem", Discrete Applied Mathematics, Special Issue associated to the International Symposium on Combinatorial Optimization 2002 (CO), 154(15): 2117-2127, Elsevier, 2006. 

[J26] V.Bilò, M.Flammini, L.Moscardelli: "Pareto Approximations for the Bicriteria Scheduling Problem", Journal of Parallel and Distributed Computing, 66(3):393-402, Elsevier, 2006. 

[J27] M.Flammini, A.Navarra, S.Perennes: "The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting", in ACM Journal of Experimental Algorithmics (JEA), Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005), 11, 2006. 

[J28] V.Bilò, M.Flammini, G.Melideo, L.Moscardelli, A.Navarra: "Sharing the Cost of Multicast Transmissions in Wireless Networks", Theoretical Computer Science, 369(1-3):269-284, Elsevier, 2006. 

[J29] M.Flammini, R.Klasing, A.Navarra, S.Perennes: "Improved Approximation Results for the Minimum Energy Broadcasting Problem", Algorithmica, Special Issue associated to the ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2004), 49(4):318-336, DOI 10.1007/s00453-007-9077-7, Springer, 2007. 

[J30] M.Flammini, M.Shalom, S.Zaks: "On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing", Journal of Parallel and Distributed Computing, 67(4):448-455, Elsevier, 2007. 

[J31] V.Bilò, M.Flammini, G.Melideo, L. Moscardelli: "On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks", Wireless Networks, 14(2):147-157, DOI 10.1007/s11276-006-8817-y, Springer, 2008. 

[J32] M.Flammini, L.Moscardelli, A.Navarra, S.Perennes: "Asymptotically Optimal Solutions for Small World Graphs", Theory of Computing Systems (formerly Mathematical Systems Theory), 42(4):632-650, DOI 10.1007/s00224-007-9073-y, Springer, 2008. 

[J33] M.Flammini, R.Klasing, A.Navarra, S.Perennes: "Tightening the Upper Bound for the Minimum Energy Broadcasting", Wireless Networks, Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005), 14(5):659-669, DOI 10.1007/s11276-006-0007-4, Springer, 2008. 

[J34] M.Flammini, L.Moscardelli, M.Shalom, S.Zaks: "Approximating the Traffic Grooming Problem", Journal of Discrete Algorithms, 6(3):472-479, DOI 10.1016/j.jda.2007.09.001, Elsevier, 2008. 

[J35] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks: "Approximating the Traffic Grooming Problem in Tree and Star Networks", Journal of Parallel and Distributed Computing, 68(7):939-948, Elsevier, 2008. 

[J36] 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):1721ñ1731, Elsevier, 2008. 

[J37] M.Flammini, A.Navarra: "Layouts for Mobility Management in Wireless ATM Networks", Discrete Applied Mathematics, 157(1):98-111, DOI 10.1016/j.dam.2008.04.025, Elsevier, 2009. 

[J38] M.Flammini, M.Shalom, S.Zaks: "On Minimizing the Number of ADMs in a General Topology Optical Network", Discrete Applied Mathematics, 157(12):2701-2717, DOI 10.1016/j.dam.2008.08.014, Elsevier, 2009. 

[J39] M.Flammini, G.Nicosia: "On the bicriteria k-server problem", ACM Transactions on Algorithms, 7(1):6, DOI 10.1145/1868237.1868244, ACM Press, 2010. 

[J40] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "When ignorance helps: Graphical multicast cost sharing games", Theoretical Computer Science, 411(3):660-671, DOI 10.1016/j.tcs.2009.10.007, Elsevier, 2010. 

[J41] A.Fanelli, M.Flammini, L.Moscardelli: "On the Convergence of Multicast Games in Directed Networks", Algorithmica, 57(2):301-324, DOI 10.1007/s00453-008-9212-0, Springer, 2010. 

[J42] 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):507-530, DOI 10.1007/s00224-009-9207-5, Springer, 2010. 

[J43] 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(40-42):3553-3562, DOI 10.1016/j.tcs.2010.05.011, Elsevier, 2010. 

[J44] V.Bilò, M.Flammini, G.Monaco, L.Moscardelli: "On the performances of Nash equilibria in isolation games", Journal of Combinatorial Optimization, 22(3):378-391, DOI 10.1007/s10878-010-9300-3, 2011. 

[J45] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "Performance of One-Round Walks in Linear Congestion Games", Theory of Computing Systems, 49(1):24-45, DOI 10.1007/s00224-010-9309-0, Springer, 2011. 

[J46] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "Graphical Congestion Games", Algorithmica, 61(2):274-297, DOI 10.1007/s00453-010-9417-x, Springer, 2011. 

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

[J48] 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(2):498-511, DOI 10.1109/TNET.2010.2068309, 2011. 

[J49] V.Bilò, M.Flammini: "Extending the notion of rationality of selfish agents: Second Order Nash equilibria", Theoretical Computer Science, 412(22):2296-2311, DOI 10.1016/j.tcs.2011.01.008, Elsevier, 2011. 

[J50] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks: "Optimizing regenerator cost in traffic grooming", Theoretical Computer Science, 412(52):7109-7121, DOI 10.1016/j.tcs.2011.09.023, Elsevier, 2011. 

[J51] A.Fanelli, M.Flammini, D.Mango, G.Melideo, L.Moscardelli: "Experimental Evaluations of Algorithms for IP Table Minimization", Journal of Interconnection Networks 12(4):299-318, DOI 10.1142/S0219265911003015, World Scientific, 2011. 

[J52] A.Fanelli, M.Flammini, L.Moscardelli: "The speed of Convergence in Congestion Games under Best Response Dynamics", ACM Transaction on Algorithms, 8(3):25, DOI 10.1145/2229163.22291692012, ACM Press, 2012. 

[J53] A.Fanelli, M.Flammini, L.Moscardelli: "Stackelberg Strategies for Network Design Games", to appear in Internet Matemathics, doi:10.1080/15427951.2012.727772. 

[J54] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks: "On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming", Algorithmica, online first, 2012. doi:10.1007/s00453-012-9693-8. 

[J55] I.Caragiannis, M.Flammini, L.Moscardelli: "An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem", to appear in IEEE/ACM Transactions on Networking, doi:10.1109/TNET.2012.2223483. 

::International Conferences



[I1] M.Flammini, A.Marchetti Spaccamela, L.Kucera: "Learning DNF formulae under classes of probability distribution", Proc. of the 5th ACM Workshop on Computational Learning Theory (COLT), Pittsburgh, Pennsylvania, USA, ACM Press, 1992. 

[I2] M.Flammini, G.Gambosi, S.Salomone: "Boolean Routing", Proc. of the 7th Int. Workshop on Distributed Algorithms (WDAG), Les Diablerets, Switzerland, Lecture Notes in Computer Science 725, Springer-Verlag, 1993. 

[I3] M.Flammini, G.Gambosi, S.Salomone: "Interval Routing Schemes for Chordal Rings", Proc. of the Colloquium on Structural Information and Communication Complexity (SICC), Ottawa, Ontario, Canada, Carleton University Press, 1994. 

[I4] M.Flammini, G.Gambosi, S.Salomone: "Interval Routing Schemes", Proc. of the 12th Symposium of Theoretical Aspects of Computer Science (STACS), Munich, Germany, Lecture Notes in Computer Science 900, 1995. 

[I5] M.Flammini, G.Gambosi, S.Salomone: "On Devising Boolean Routing Schemes", Proc. of the 21st Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Aachen, Germany, Lecture Notes in Computer Science 1017, Springer-Verlag, 1995. 

[I6] M.Di Ianni, M.Flammini, R.Flammini, S.Salomone: "Systolic Acyclic Orientations for Deadlock Prevention", Proc. of the 2nd Colloquium on Structural Information and Communication Complexity (SIROCCO), Olympia, Greece, Carleton University Press, 1995. 

[I7] M.Flammini, A.Marchetti Spaccamela, J.van Leeuwen: "The Complexity of Interval Routing on Random Graphs", Invited Paper, Proc. of the 20th Symposium on Mathematical Foundations of Computer Science (MFCS), Prague, Czech Repubblic, Lecture Notes in Computer Science 969, Springer-Verlag, 1995. 

[I8] M.Flammini, G.Gambosi, U.Nanni, R.B.Tan: "Multi-dimensional Interval Routing Schemes", Proc. of the 9th Int. Workshop on Distributed Algorithms (WDAG), Le Mont-Saint-Michel, France, Lecture Notes in Computer Science 972, Springer-Verlag, 1995. 

[I9] M.Flammini: "Deadlock-Free Interval Routing Schemes", Proc. of the 14th Symposium of Theoretical Aspects of Computer Science (STACS), Lubeck, Germany, Lecture Notes in Computer Science 1200, Springer-Verlag, 1997. 

[I10] M.Flammini, S.Perennes: "Lower Bounds on Systolic Gossiping", Proc. of the 11th IEEE International Parallel Processing Symposium (IPPS), Geneva, Switzerland, IEEE Press, Piscataway, New Jersey, USA, 1997. 

[I11] C.Arbib, M.Flammini, E.Nardelli: "Graph d-Visitability", Proc. of the Twente Workshop on Graphs and Combinatorial Optimization, Twente, The Netherlands, 1997. 

[I12] J.C.Bermond, M.Di Ianni, M.Flammini, S.Perennes: "Acyclic Orientations for Deadlock Prevention in Usual Networks", Proc. of the 23rd Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Germany, Lecture Notes in Computer Science 1335, Springer-Verlag, 1997. 

[I13] M.Flammini, C.Scheideler: "Simple, Efficient Routing Schemes for All-Optical Networks", Proc. of the 9th ACM Annual Symposium on Parallel Algorithms and Architectures (SPAA), Newport, Rhode Island, USA, ACM Press, 1997. 

[I14] T.Eilam, M.Flammini, S.Zaks: "A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load", Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP), Bologna, Italy, Lecture Notes in Computer Science 1256, Springer-Verlag, 1997. 

[I15] M.Flammini, E.Nardelli, G.Proietti: "ATM Layouts with Bounded Hop Count and Congestion", Proc. of the 11th Int. Workshop on Distributed Algorithms (WDAG), Saarbrucken, Germany, Lecture Notes in Computer Science 1320, Springer-Verlag, 1997. 

[I16] S.Cicerone, G.Di Stefano, M.Flammini: "Static and Dynamic Low-Congested Interval Routing Schemes", Proc. of the 25th International Colloquium on Automata, Languages and Programming (ICALP), Aalborg, Denmark, Lecture Notes in Computer Science 1443, Springer-Verlag, 1998. 

[I17] M.Flammini, G.Gambosi, U.Nanni, R.B.Tan: "Characterization Results of All Shortest Paths Interval Routing Schemes", Proc. of the 5th Colloquium on Structural Information and Communication Complexity (SIROCCO), Amalfi, Italy, Carleton University Press, 1998. 

[I18] S.Cicerone, G.Di Stefano, M.Flammini: "Compact-Port Routing Models and Applications to Distance-Hereditary Graphs", Proc. of the 6th Colloquium on Structural Information and Communication Complexity (SIROCCO), Lacanau, France, Carleton University Press, 1999. 

[I19] M.Flammini, G.Nicosia: "On On-line Multicriteria Problems", Proc. of the 8th Annual European Symposium on Algorithms (ESA), Saarbrucken, Germany, Lecture Notes in Computer Science 1879, Springer-Verlag, 2000. 

[I20] M.Flammini, G.Nicosia: "Competitive Algorithms for the Bicriteria k-Server Problem", Proc. of the International Symposium on Combinatorial Optimization (CO), Paris, France, 2002. 

[I21] A. Di Pasquale, M.Flammini, E.Nardelli: "Allocation Problems in Scalable Distributed Data Structures", Proc. of the Workshop on Distributed Data & Structures (WDAS), Paris, France, Carleton University Press, 2002. 

[I22] V.Bilò, M.Flammini: "On Multiprocessor Scheduling under Multiple Objectives", Proc. of the International Conference on Operations Research (OR), Klangefurt, Austria, 2002. 

[I23] M.Flammini, G.Gambosi, A.Navarra: "Wireless ATM Layouts for Chain Networks", Proc. of the IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), Nice, France, IEEE Press, 2003. 

[I24] V.Bilò, A.Di Pasquale, F.Fioravanti, M.Flammini, L.Forlizzi, F.Lo Presti, G.Melideo, E.Nardelli, A.Navarra, G.Proietti: "Quality of Service in Wireless Networks", Proc. of the IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), Nice, France, IEEE Press, 2003. 

[I25] V.Bilò, M.Flammini, R.Giovannelli: "Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem", Proc. of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA), Ascona, Switzerland, Lectures Notes in Computer Science 2647, Springer-Verlag, 2003. 

[I26] C.Arbib, M.Flammini, F.Marinelli: "Minimum Flow Time Graph Ordering", Proc. of the 29th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Utrecht, The Netherlands, Lecture Notes in Computer Science 2880, Springer-Verlag, 2003. 

[I27] M.Flammini, A.Navarra, A.Proskurowski: "On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles", Proc. of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO), Umea, Sweden, Carleton University Press, 2003. 

[I28] M.Flammini, P.Inverardi, D.Mango, M.Nesi: "On the Complexity of Deciding the Derivation Length in Term Rewriting Systems", Proc. of the 6th International Workshop on Termination (WST), Valencia, Spain, 2003. 

[I29] M.Flammini, G.Gambosi, A.Gasparini, A.Navarra: "Dynamic layouts for Wireless ATM", Proc. of the 9th International Conference on Parallel and Distributed Computing (EUROPAR), Klangefurt, Austria, Lecture Notes in Computer Science 2790, Springer-Verlag, 2003. 

[I30] V.Bilò, M.Flammini: "On the IP Routing Tables Minimization with Addresses Reassignments", Proc. of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE Press, 2004. 

[I31] 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), IEEE Press, 2004. 

[I32] V.Bilò, C.Di Francescomarino, M.Flammini, G.Melideo: "Sharing the Cost of Multicast Transmissions in Wireless Networks", Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2004. 

[I33] M.Flammini, R.Klasing, A.Navarra, S.Perennes: "Improved Approximation Results for the Minimum Energy Broadcasting Problem", Proc. of the ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), ACM Press, 2004. 

[I34] 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), HKUST, Hong Kong, Lecture Notes in Computer Science 3341, Springer-Verlag, 2004. 

[I35] 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), Stockyard, Germany, Lecture Notes in Computer Science 3404, Springer-Verlag, 2005. 

[I36] M.Flammini, A.Navarra, S.Perennes: "The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting", Proc. of the 4th International Workshop on Experimental and Efficient Algorithms (WEA), Santorini, Greece, Lectures Notes in Computer Science 3503, Springer-Verlag, 2005. 

[I37] 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), Cracow, Poland, Lecture Notes in Computer Science 3724, Springer-Verlag, 2005. 

[I38] M. Flammini, L. Moscardelli, M. Shalom, S. Zaks: "Approximating the Traffic Grooming Problem", Proc. of the 16th International Symposium on Algorithms and Computation (ISAAC), Sanya, Hainan, China, Lecture Notes in Computer Science 3827, Springer-Verlag, 2005. 

[I39] I.Caragiannis, M.Flammini, C.Kaklamanis, P.Kanellopoulos and L.Moscardelli: "Tight Bounds for Selfish and Greedy Load Balancing", Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP), S.Servolo, Venice, Italy, Lecture Notes in Computer Science 4051, Springer-Verlag, 2006. 

[I40] M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, S. Zaks: "Approximating the Traffic Grooming Problem in Tree and Star Networks", Proc. of the 32nd Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Bergen, Norvey, Lecture Notes in Computer Science 4271, Springer-Verlag, 2006. 

[I41] M. Flammini, M. Shalom, S. Zaks: "On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing", Proc. of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), Chester, United Kingdom, Lecture Notes in Computer Science 4235, Springer-Verlag, 2006. 

[I42] A.Fanelli, M.Flammini, G. Melideo, L. Moscardelli: "Multicast Transmissions in Non-Cooperative Networks with a Limited Number of Selfish Moves", Proc. of the 31st Symposium on Mathematical Foundations of Computer Science (MFCS), Star`a Lesn`a, Slovacchia, Lecture Notes in Computer Science 4162, Springer-Verlag, 2006. 

[I43] A.Fanelli, M.Flammini, G. Melideo, L. Moscardelli: "Game Theoretical Issues in Optical Networks", Invited Paper, Proc. of the 8th International Conference on Transparent Optical Networks (ICTON), Nottingham, United Kingdom, 2006. 

[I44] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom and S.Zaks: "Minimizing the number of ADMs with and without traffic grooming: complexity and approximability", Invited Paper, Proc. of the 8th International Conference on Transparent Optical Networks (ICTON), Nottingham, United Kingdom, 2006. 

[I45] M.Flammini, M.Shalom, S.Zaks: "On Minimizing the Number of ADMs in a General Topology Optical Network", Proc. of the 20th International Symposium on Distributed Computing (DISC), Stockholm, Sweden, Lecture Notes in Computer Science 4167, Springer-Verlag, 2006. 

[I46] M.Autili, M.Flammini, A.Navarra, P.Inverardi, M.Tivoli: "Synthesis of decentralized adaptors for concurrent and distributed component-based systems", Proc. of the 3rd European Workshop on Software Architecture - Languages, Styles, Models, Tools, and Applications (EWSA), Nantes, France, Lecture Notes in Computer Science 4344, Springer-Verlag, 2006. 

[I47] A.Fanelli, M.Flammini, L.Moscardelli: "On the Convergence of Multicast Games in Directed Networks", Proc. of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2007. 

[I48] A.Fanelli, M.Flammini, D.Mango, G.Melideo, L.Moscardelli: "Experimental Evaluation of Algorithms for IP Table Minimization", Proc. of the 6th International Workshop on Experimental and Efficient Algorithms (WEA), Rome, Italy, Lectures Notes in Computer Science 4525, Springer-Verlag, 2007. 

[I49] I.Caragiannis, M.Flammini, L.Moscardelli: "An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks", Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), Wroclav, Poland, Lecture Notes in Computer Science 4596, Springer-Verlag, 2007. 

[I50] V.Bilò, M.Flammini: "Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria", Proc. of the 32nd Symposium on Mathematical Foundations of Computer Science (MFCS), Cesky Krumlov, Czech Repubblic, Lecture Notes in Computer Science 4708, Springer-Verlag, 2007. 

[I51] S.Di Giannantonio, M.Flammini, G.Monaco, L.Moscardelli, M.Shalom and 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), San Diego, CA, USA, Lectures Notes in Computer Science 4858, Springer-Verlag, 2007. 

[I52] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "Graphical Congestion Games with Linear Latencies", Proc. of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2008. 

[I53] A.Fanelli, M.Flammini, L.Moscardelli: "The Speed of Convergence in Congestion Games under Best-Response Dynamics", Proc. of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science 5125, Springer-Verlag, 2008. 

[I54] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "When Ignorance Helps: Graphical Multicast Cost Sharing Games", Proc. of the 33rd Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 5162, Springer-Verlag, Berlino, 2008. 

[I55] 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 Conference on Parallel and Distributed Computing (EUROPAR), Lecture Notes in Computer Science 5168, Springer-Verlag, 2008. 

[I56] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "Graphical Congestion Games", Proc. of the 4th International Workshop on Internet and Network Economics (WINE), Lectures Notes in Computer Science 5385, Springer-Verlag, 2008. 

[I57] 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", Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE Press, 2009. 

[I58] V.Bilò, M.Flammini, G.Monaco, L.Moscardelli: "On the Performances of Nash Equilibria in Isolation Games", Proc. of the 15th International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 5609, Springer-Verlag, 2009. 

[I59] V.Bilò, A.Fanelli, M.Flammini, L.Moscardelli: "Performances of One-Round Walks in Linear Congestion Games", Proc. of the 2nd International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science 5814, Springer-Verlag, 2009. 

[I60] M.Flammini, A.Marchetti-Spaccamela, G.Monaco, L.Moscardelli, S.Zaks: "On the Complexity of the Regenerator Placement Problem in Optical Networks", Proc. of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2009. 

[I61] A.Fanelli, M.Flammini, L.Moscardelli: "Stackelberg Strategies for Network Design Games", Proc. of the 6th International Workshop on Internet and Network Economics (WINE), Lectures Notes in Computer Science 6484, Springer, 2010.

[I62] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks: "Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract)", Proc. of the 14th International Conference on Principles of Distributed Systems (OPODIS), Lecture Notes in Computer Science 6490, Springer, 2010. 

[I63] V.Bilò, A.Celi, M.Flammini, V.Gallotti: "Social Context Congestion Games", Proc. of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 6796, Springer, 2011. 

[I64] M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks: "On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming", Proc. of the 15th International Conference on Principles of Distributed Systems (OPODIS), Lecture Notes in Computer Science 7109, Springer, 2011. 

[I65] G.Amati, A.Celi, C.Di Nicola, M.Flammini, D.Pavone: "Improved Stable Retrieval in Noisy Collections", Proc. of the 3rd International Conference on Advances in Information Retrieval Theory (ICTIR), Lecture Notes in Computer Science 6931, Springer, 2011. 

[I66] V.Bilò, M.Flammini, V.Gallotti: "On Bidimensional Congestion Games", Proc. of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 7355, Springer, 2012. 

[I67] M.Flammini, V.Gallotti, G.Melideo, G.Monaco, L.Moscardelli: "Mobile Network Creation Games", Proc. of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science 7355, Springer, 2012 

[I68] V.Bilò, M.Flammini, G.Monaco, L.Moscardelli: "Some Anomalies of Farsighted Strategic Behavior", Proc. of the 10th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science 7846, Springer, 2012. 

[I69] A.Angelucci, V.Bilò, M.Flammini, L.Moscardelli: "On the Sequential Price of Anarchy of Isolation Games", Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 7936, Springer, 2013. 

[I70] V.Bilò, M.Flammini, L.Moscardelli: "On Homogenization and the Constant Price of Stability of Undirected Broadcast Games with Fair Cost Allocations", Proc. of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, 2013.