International Journals

 

2008

  1. V. Bilò, M. Flammini, G. Melideo, L. Moscardelli: “On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks”, Wireless Networks 12:2, Springer Science, 2008, pp. 147-157, available online since October 2006.

2006

  1. V. Bilò, M. Flammini, G. Melideo, L. Moscardelli, A. Navarra: Sharing the Cost of Multicast Transmissions in Wireless Networks, Theoretical Computer Science, Elsevier, Volume 369, 2006, pp. 269-284.

  2. V. Bilò, M. Flammini, L. Moscardelli: “Pareto Approximations for the Bicriteria Scheduling Problem”, Journal of Parallel and Distributed Computing, Elsevier, Volume 66, Number 3, 2006, pp. 393-402.

2004

  1. V. Bilò, M. Flammini, R. Giovannelli: “Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem”, Journal of Parallel and Distributed Computing, Elsevier, Volume 64, Number 9, 2004, pp. 1086-1100.


 

International Conferences

 

2008

  1. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: “When Ignorance Helps: Graphical Multicast Cost Sharing Games”, Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), to appear.

  2. V. Bilò, A. Fanelli, M. Flammini, L. Moscardelli: Graphical Congestion Games with Linear Latencies”, Proc. of the 20th ACM Symposium on Parallelism on Algorithms and Architectures (SPAA), to appear.

2007

  1. V. Bilò: “On Satisfiability Games and the Power of Congestion Games”, Proc. of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lectures Notes in Computer Science 4508, Springer, 2007, pp. 231-240.

  2. V. Bilò, M. Flammini: Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria”, Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 4708, Springer, 2007, pp. 621-632.

  3. V. Bilò: The Price of Nash Equilibria in Multicast Transmissions Games, Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 4835, Springer, 2007, pp. 390-401.

2006

  1. V. Bilò: “On the Packing of Selfish Items”, Proc. of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2006.

2005

  1. 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), Lectures Notes in Computer Science 3404, Springer, 2005, pp. 448-459.

  2. V. Bilò, I. Caragiannis, C. Kaklamanis, P. Kanellopoulos: Geometric clustering to minimize the sum of cluster sizes, Proc. of the 13th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 3669, Springer, 2005, pp. 460-471.

2004

  1. V. Bilò, M. Flammini: “On the IP Routing Tables Minimization with Addresses Reassignments”, Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2004.

  2. V. Bilò, M. Flammini, L. Moscardelli: “Pareto Approximations for the Bicriteria Scheduling Problem”, Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society, 2004.

  3. V. Bilò, L. Moscardelli: “The Price of Anarchy in All-Optical Networks”, Proc. of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), Lectures Notes in Computer Science 3104, Springer, 2004, pp. 13-22.

  4. V. Bilò, C. Di Francescomarino, M. Flammini, G. Melideo: “Sharing the Cost of Multicast Transmissions in Wireless Networks”, Proc. of the 16th Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2004, pp. 180-187.

  5. V. Bilò, G. Melideo: “An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph”, Proc. of EURO-PAR 2004 Parallel Processing,  Lectures Notes in Computer Science 3149, Springer, 2004, pp. 949-956.

  6. V. Bilò, V. Goyal, R. Ravi, M. Singh: “On the Crossing Spanning Tree Problem”, Proc. of the 7th  International Workshop on Approximation Algorithms for Combinatorial Problems (APPROX), Lectures Notes in Computer Science 3122, Springer, 2004, pp. 51-60.

  7. 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), Lectures Notes in Computer Science 3341, Springer, 2004, pp. 172-183.

2003

  1. 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), IEEE Computer Society, 2003.

  2. 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), Lectures Notes in Computer Science 2647, Springer, 2003, pp. 33-46.

2002

  1. V. Bilò, M. Flammini: “On Multiprocessor Scheduling under Multiple Objectives”, Proc. of the International Conference on Operations Research (OR), 2002.


 

National Conferences

 

  1. V. Bilò, M. Flammini: “Time vs Memory Tradeoffs for Multiprocessor Scheduling”, Proc. of the 33rd Annual Conference of the Italian Operations Research Society (AIRO), 2002.


 

Ph.D. Thesis