July 2006: Master Degree cum Laude in Computer Science achieved at the faculty of
Mathematical Physical and Natural Science
of the University of L'Aquila.
1st November 2006 - 31st October 2009: Ph.D. Student in Computer Science at the Department
of Computer Science of the University of L'Aquila
(supervisor Prof. Michele Flammini).
I have been assigned a three year lasting fellowship.
For more information about me please refer to my CV Research
Research Interests
Design and analysis of algorithms
Approximation algorithms
Algorithmic aspects of communication networks (optical, wireless, p2p, mobile ad-hoc network, ecc.)
Algorithmic game theory
Missions
With a click on the globe, you can see some pictures of me relating to missions
Journal publications
I. Caragiannis, G. Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem.
Journal of Combinatorial Optimization. DOI: 10.1007/s10878-011-9417-z
V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco:
Improved lower bounds on the price of stability of undirected network design games.
Theory of Computing System. To appear.
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, 2011.
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, 2011.
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, 2010.
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, 2008.
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, 2008.
Book chapters
V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, L. Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks.
Chapter in Graphs and Algorithms in Communication Networks, Springer-Verlag, 2009.
T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau Valls, M. Shalom, S. Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Chapter in Graphs and Algorithms in Communication Networks, Springer-Verlag, 2009.
Conference publications
M. Flammini, V. Gallotti, G. Melideo, G. Monaco, L. Moscardelli:
Mobile Network Creation Games.
In Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012). To appear.
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
In Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011).
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Optimizing Regenerator Cost in Traffic Grooming.
In Proceedings of the 14th International Conference On Principles Of Distributed Systems (OPODIS 2010).
V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco:
Improved lower bounds on the price of stability of undirected network design games.
In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT 10).
M. Flammini, A. Marchetti Spaccamela, G. Monaco, L. Moscardelli, S. Zaks:
On the Complexity of the Regenerator Placement Problem in Optical Networks.
In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA 2009).
V. Bilò, M. Flammini, G. Monaco, L. Moscardelli:
On the performances of Nash Equilibria in Isolation Games.
In Proceedings of the 15th International Computing and Combinatorics Conference
(COCOON 2009).
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.
In Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium
(IPDPS 2009).
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
In Proceedings of the 14th International Conference on Parallel and Distributed Computing (EuroPar 2008).
I. Caragiannis, G. Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem.
In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008).
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.
In Proceedings of the 3rd International Workshop On Internet And Network Economics (WINE 2007).
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks.
In Proceedings of the 32st International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2006).
M.Flammini, G.Monaco, L.Moscardelli, M.Shalom, S.Zaks:
Minimizing the number of ADMs with and without traffic
grooming: complexity and approximability.
In Proceedings of the 8th International Conference on Transparent Optical Networks (ICTON 2006).
PhD Thesis
G.Monaco: Optimization and Non-Cooperative Issues in
Communication Networks. Supervisor Prof. Michele Flammini
Visitors
