Publications of M. Flammini
BACK TO COATI PUBLICATION INDEX
Publications of M. Flammini
-
V. Bilo,
M. Flammini,
G. Monaco,
and L. Moscardelli.
On the performances of Nash equilibria in isolation games.
Journal of Combinatorial Optimization,
22:378-391,
2011.
Note: Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference.
[WWW
] [Abstract] [bibtex-entry]
-
T. Cinkler,
D. Coudert,
M. Flammini,
G. Monaco,
L. Moscardelli,
X. Muñoz,
I. Sau,
M. Shalom,
and S. Zaks.
Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks,
volume XXVII of EATCS Texts in Theoretical Computer Science,
chapter Traffic Grooming: Combinatorial Results and Practical Resolutions,
pages 63-94.
Springer,
A. Koster and X. Muñoz edition,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
G. Monaco,
L. Moscardelli,
H. Shachnai,
M. Shalom,
T. Tamir,
and S. Zaks.
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks.
Theoretical Computer Science,
411(40-42):3553-3562,
September 2010.
[Abstract] [bibtex-entry]
-
V. Bilò,
I. Caragiannis,
A. Fanelli,
M. Flammini,
C. Kaklamanis,
G. Monaco,
and L. Moscardelli.
Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks,
volume XXVII of EATCS Texts in Theoretical Computer Science,
chapter Game-Theoretic Approaches to Optimization Problems in Communication Networks,
pages 241-264.
Springer,
A. Koster and X. Muñoz edition,
November 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Tightening the Upper Bound for the Minimum Energy Broadcasting problem.
Wireless Networks,
14(5):659--669,
October 2008.
Note: Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005).
[WWW
] [bibtex-entry]
-
M. Flammini,
L. Moscardelli,
A. Navarra,
and S. Pérennes.
Asymptotically Optimal Solutions for Small World Graphs.
Theory of Computing Systems,
42(4):632-650,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting problem.
Algorithmica,
49(4):318-336,
2007.
[WWW
] [Abstract] [bibtex-entry]
-
M. Flammini,
A. Navarra,
and S. Pérennes.
The Real Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting.
ACM Journal of Experimental Algorithmics,
11:1--13,
2006.
Note: (Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005)).
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower bounds on systolic gossip.
Information and Computation,
196(2):71--94,
2005.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols.
SIAM Journal on Discrete Mathematics,
17(4):521--540,
2004.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
M. Di Ianni,
M. Flammini,
and S. Pérennes.
Acyclic orientations for deadlock prevention in usual networks.
Discrete Applied Mathematics,
129(1):31--47,
2003.
[PDF
] [bibtex-entry]
-
M. Flammini and S. Pérennes.
On the optimality of general lower bounds for broadcasting and gossiping.
SIAM J. Discrete Math.,
14(2):267--282,
2001.
[bibtex-entry]
-
V. Bilò,
M. Flammini,
G. Monaco,
and L. Moscardelli.
On the performances of Nash Equilibria in Isolation Games.
In Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009),
volume 5609 of Lecture Notes in Computer Science,
Niagara Falls, New York, U.S.A.,
pages 17-26,
July 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
A. Marchetti-Spaccamela,
G. Monaco,
L. Moscardelli,
and 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),
Calgary, Canada,
pages 154-162,
August 2009.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
G. Monaco,
L. Moscardelli,
H. Shachnai,
M. Shalom,
T. Tamir,
and 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),
Rome, Italy,
pages 1-12,
May 2009.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
L. Moscardelli,
A. Navarra,
and S. Pérennes.
Asymptotically Optimal Solutions for Small World Graphs.
In Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005),
volume 3724 of Lecture Notes in Computer Science,
pages 414--428,
September 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
M. Flammini,
A. Navarra,
and S. Pérennes.
The Real approximation factor of the MST heuristic for the Minimum Energy Broadcasting.
In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005),
volume 3503 of Lecture Notes in Computer Science,
pages 22--31,
May 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting Problem.
In 2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALM-POMC 2004),
pages 85--91,
2004.
ACM Press.
[WWW
] [POSTSCRIPT
] [bibtex-entry]
-
J-C. Bermond,
M. Di Ianni,
M. Flammini,
and S. Pérennes.
Systolic orientations for deadlock prevention in usual networks.
In Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science,
volume 1335,
pages 52--64,
1997.
Springer verlag.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Tight Upper bound for broadcasting and gossiping.
Technical report,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower Bounds on systolic gossip..
Technical report 3612,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:44 2022
