The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luca Moscardelli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
    Tight Bounds for Selfish and Greedy Load Balancing. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:311-322 [Conf]
  2. Vittorio Bilò, Michele Flammini, Luca Moscardelli
    Pareto Approximations for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  3. 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]
  4. Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:915-924 [Conf]
  5. Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
    Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:363-374 [Conf]
  6. Vittorio Bilò, Luca Moscardelli
    The Price of Anarchy in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:13-22 [Conf]
  7. 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]
  8. Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
    Asymptotically Optimal Solutions for Small World Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:414-428 [Conf]
  9. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:147-158 [Conf]
  10. 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]
  11. 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]
  12. Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
    An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:447-458 [Conf]
  13. Angelo Fanelli, Michele Flammini, Luca Moscardelli
    On the convergence of multicast games in directed networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:330-338 [Conf]
  14. Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
    Experimental Evaluations of Algorithms for IP Table Minimization. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:324-337 [Conf]

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


  16. Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP]


  17. The Speed of Convergence in Congestion Games under Best-Response Dynamics. [Citation Graph (, )][DBLP]


  18. Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]


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


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


  21. On the complexity of the regenerator placement problem in optical networks. [Citation Graph (, )][DBLP]


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


  23. Interference Games in Wireless Networks. [Citation Graph (, )][DBLP]


  24. Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP]


  25. On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays. [Citation Graph (, )][DBLP]


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


  27. On the Convergence of Multicast Games in Directed Networks. [Citation Graph (, )][DBLP]


  28. Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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