The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vittorio Bilò: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh
    On the Crossing Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:51-60 [Conf]
  2. Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Geometric Clustering to Minimize the Sum of Cluster Sizes. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:460-471 [Conf]
  3. Vittorio Bilò, Giovanna Melideo
    An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:949-956 [Conf]
  4. Vittorio Bilò, Michele Flammini
    On the IP Routing Tables Minimization with Addresses Reassignment. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  5. Vittorio Bilò, Michele Flammini, Luca Moscardelli
    Pareto Approximations for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  6. Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti
    Quality of Service in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:224- [Conf]
  7. Vittorio Bilò
    On the packing of selfish items. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  8. Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
    On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:172-183 [Conf]
  9. Vittorio Bilò, Luca Moscardelli
    The Price of Anarchy in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:13-22 [Conf]
  10. Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo
    Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:180-187 [Conf]
  11. Vittorio Bilò, Michele Flammini, Luca Moscardelli
    On Nash Equilibria in Non-cooperative All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:448-459 [Conf]
  12. Vittorio Bilò, Michele Flammini, Roberto Giovannelli
    Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:33-46 [Conf]
  13. Vittorio Bilò, Michele Flammini, Roberto Giovannelli
    Experimental analysis of online algorithms for the bicriteria scheduling problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:9, pp:1086-1100 [Journal]
  14. Vittorio Bilò, Michele Flammini, Luca Moscardelli
    Pareto approximations for the bicriteria scheduling problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:3, pp:393-402 [Journal]
  15. Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra
    Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:269-284 [Journal]
  16. Vittorio Bilò
    On Satisfiability Games and the Power of Congestion Games. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:231-240 [Conf]
  17. Vittorio Bilò, Michele Flammini
    Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:621-632 [Conf]

  18. Computing Exact and Approximate Nash Equilibria in 2-Player Games. [Citation Graph (, )][DBLP]


  19. On the Performances of Nash Equilibria in Isolation Games. [Citation Graph (, )][DBLP]


  20. The Price of Nash Equilibria in Multicast Transmissions Games. [Citation Graph (, )][DBLP]


  21. When Ignorance Helps: Graphical Multicast Cost Sharing Games. [Citation Graph (, )][DBLP]


  22. Graphical congestion games with linear latencies. [Citation Graph (, )][DBLP]


  23. Graphical Congestion Games. [Citation Graph (, )][DBLP]


  24. Performances of One-Round Walks in Linear Congestion Games. [Citation Graph (, )][DBLP]


Search in 0.212secs, Finished in 0.213secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002