APIN PUBBLICATIONS


  1. G. Cordasco, L. Gargano,
    Navigable Small-World Networks with Few Random Bits,
    Theoretical Computer Science, to appear.

  2. L. Gargano, A. Rescigno,
    Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks,
    Discrete Applied Mathematics, to appear.

  3. J.-C. Bermond, L. Gargano, A. Rescigno,
    Gathering with Minimum Delay in Sensor Networks,
    Proceedings of 15th International Colloquium on Structural Information and Communication, Complexity (SIROCCO 2008), LNCS 5058.

  4. G. De Marco,
    Distributed Broadcast in Unknown Radio Networks,
    19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California, USA, January 2008.

  5. G. Cordasco, M. Hammar, L. Gargano, A. Negro, V. Scarano,
    F-Chord: improved uniform routing on Chord,
    NETWORKS, Vol. 52 No. 4, pp. 325-332, 2008.

  6. G. Chiola, G. Cordasco, M. Hammar, L. Gargano, A. Negro, V. Scarano,
    Degree-Optimal Routing for P2P Systems,
    Theory of Computing Systems vol. 45, pp. 43--63, 2009,

  7. G. Chiola, G. Cordasco, L. Gargano, A. Negro, V. Scarano,
    Optimizing the finger table in Chord-like DHTs,
    Concurrency and Computation: Practice and Experience , Vol. 20, issue 6, 2008, pp. 643-657.

  8. L. Gargano,
    Time Optimal Gathering in Sensor Networks, Keynote Talk,
    Proceedings of Structural Information and Communication, Complexity 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, LNCS 4474, Springer Verlag.

  9. G. De Marco, M. Pellegrini and G. Sburlati,
    Faster Deterministic Wakeup in Multiple Access Channels,
    Discrete Applied Mathematics, vol. 155 (8), pp. 898-903, 2007.

  10. G. Cordasco, L. Gargano,
    How Much Independent Should Individual Contacts be to Form a Small-World?,
    Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006), T. Asano (Ed.), Springer-Verlag LNCS 4288, pp. 328-338, 2006.

  11. G. De Marco, A. Pelc,
    ``Randomized Algorithms for Determining the Majority on Graphs'',
    Combinatorics Probability & Computing, vol. 15 (6), pp. 823-834, 2006.

  12. G. Chiola, G. Cordasco, L. Gargano, A. Negro, V. Scarano,
    ``Optimizing the finger table in Chord-like DHTs'',
    Third International Workshop on Hot Topics in Peer-to-Peer Systems, in conjunction with IPDPS'06, Rhodes Island, Greece, April 2006.

  13. G. De Marco, M. Leoncini, M. Montangero,
    ''Distributed Algorithm for a Color Assignment on Asynchronous Rings,
    20th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2006).

  14. G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro,
    ''Asynchronous deterministic rendezvous in graphs'',
    Theoretical Computer Science , vol. 355, pp. 315-326, 2006.

  15. G. Chiola, G. Cordasco, L. Gargano, A. Negro, V. Scarano,
    ``Overlay networks with class'',
    Proceedings of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2005), IEEE Computer Society Press, 2005.

  16. G. Cordasco, L. Gargano, M. Hammar, V. Scarano,
    ``Degree--Optimal Deterministic Routing for P2p Systems'', Proceedings of
    Tenth IEEE Symposium on Computers and Communications (ISCC 2005), IEEE Computer Society Press, 2005.

  17. M. Aigner, G. De Marco, M. Montangero,
    ``The Plurality Problem with Three Colors and More'',
    Theoretical Computer Science. vol. 337, pp. 319-330, 2005.

  18. L. Gargano, M. Hammar, P. Hell, L. Stacho, and U. Vaccaro,
    ''Spanning Spiders and light-splitting switches'',
    Discrete Mathematics, vol. 285, Issue 1-3, pp. 83-95, 2004

  19. L. Gargano, M. Hammar, A. Ostlin, ``Limiting Flooding Expenses in On-demand Source-Initiated Protocols for
    Mobile Wireless Networks", Proceedings of IPDPS 2004 - 4th International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), 2004.

  20. B. Codenotti, De Marco, M. Leoncini, M. Montangero, M. Santini,
    ''Approximation Algorithms for a Hierachically Structured Bin Packing Problem'',
    Information Processing Letters, vol. 5, pp. 215-221 ISSN: 0020-0190.

  21. G. Cordasco, L. Gargano, M. Hammar, A. Negro, V. Scarano,
    ``F-Chord: improved uniform routing on Chord''    , Proceedings of
    Sirocco 2004, June 21-23, 2004, Slovakia.

  22. G. Cordasco, L. Gargano, M. Hammar, A. Negro, V. Scarano,
    ``Non-uniform deterministic routing on F-Chord'',
    Proceedings of International Workshop on Hot Topics in Peer-to-Peer Systems, IEEE Press.

  23. G. Cordasco, L. Gargano, M. Hammar, V. Scarano,
    ``Brief Announcement: Degree--Optimal Deterministic Routing for P2p Systems'',
    Proceedings of PODC 2004, Brief Announcment , July 25-28, 2004, St John's, Canada,

  24. L. Gargano, M. Hammar,
    ''There are Spanning Spiders in Dense Graphs (and we know how to find them)'', Proceedings of 30th International Colloquium on Automata, Languages, and Programming (ICALP' 2003).

  25. G. De Marco, A. Pelc, "Randomized Algorithms for Determining the Majority on Graphs'',
    Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), Bratislava, Slovak Republic, LNCS 2747, 368-377.

  26. G. De Marco, A. Pelc, " Deterministic broadcasting time with partial knowledge of the network'',
    Theoretical Computer Science, vol. 290, no. 3, pp. 2009-2020, 2003.

  27. L. Gargano, A. Rescigno and U. Vaccaro, ``Multicasting to Groups in Optical Networks'',
    Proceedings IPDPS 2003 - 3rd International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), 2003.

  28. L. Gargano, P. Hell, L. Stacho, and U. Vaccaro,
    ``Spanning Trees with Bounded Number of Branch Vertices'',

    Proceedings of ICALP' 2002, P. Widmayer et al. (Eds.), Lectures Notes in Computer Science, vol. 2380, pp. 355-365, Springer-Verlag, 2002.

  29. L.Gargano, A. Pelc, S. Perennes and U. Vaccaro, "Efficient Communication in Unknown Networks",
    NETWORKS, vol. 38, 2001, 39-49

  30. B. Codenotti, G. De Marco, M. Leoncini, M. Montangero, "Distributed Algorithms for Certain Key Assignment Problems,
    Proc. 5th International Conference On Principles Of DIstributed Systems (OPODIS 2001), Manzanillo, Mexico, December 2001.

  31. L. Gargano and A. Rescigno,
    ``Coloring Circular Arcs with Applications to WDM Routing",

    Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE'00), July 2000, Geneva, Switzerland,

  32. A. Rescigno
    "Optimally Balanced Spanning Tree of the Star Network"
    IEEE Transactions on Computers, 50 (1), 2001.

  33. V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, G. Persiano
    ``Sparse and Limited Wavelenght Conversion in Tree Networks''
    Theoretical Computer Science, to appear

  34. G. De Marco and A. Rescigno,
    "Tighter Bounds on Broadcasting in Torus Networks in presence of Dynamic Faults"
    Parallel Processing Letters, 10 (1), pp. 39-50, 2000.

  35. A. Rescigno
    "Vertex-Disjoint Spanning Trees on the Star Network with Applications to Fault-Tolerance and Security"
    Information Sciences: An International Journal, to appear.

  36. G. De Marco and A. Pelc,
    ``Deterministic broadcasting time with partial knowledge of the network'',
    7th Annual International Symposium on Algorithms And Computation (ISAAC '00), Taipei, Taiwan, R.O.C., December 2000,

  37. L. Gargano and U. Vaccaro,
    ``Routing in All--Optical Networks: Algorithmic and Graph--Theoretic Problems'',
    tutorial, in: Numbers, Information and Complexity, I. Althofer et al. (Eds.), Kluwer Academic Publisher, pp. 555-578, Feb. 2000.

  38. J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro,
    ``Fast Gossiping by Short Messages''
    SIAM Journal on Computing, vol. 27, 917 - 941, 1998
    An extended abstract appeared in: ICALP '95, Z. Fülöp and F. Gécseg (Eds.), Lectures Notes in Computer Science, vol. 944, pp. 135--146, Springer-Verlag, 1995.

  39. J.-C. Bermond, L. Gargano, S. Perennes, A. Rescigno, and U. Vaccaro,
    ``Efficient Collective Communication in Optical Networks'',
    Theoretical Computer Science.

  40. G. De Marco, L. Gargano and U. Vaccaro,
    ``Concurrent Multicast in Weighted Networks'',
    Theoretical Computer Science, vol. 259, no. 1-2, pp. 359-377, 2001

  41. A. Rescigno, "Optimally Balanced Spanning Tree of the Star Network",
    IEEE Transactions on Computers, 50 (1), 2001.

  42. J.-C. Bermond, L. Gargano and S. Perennes,
    ``Optimal Sequential Gossiping by Short Messages'',
    Discrete Applied Math., vol. 86, 145-155, 1998.

  43. G. De Marco and A. Rescigno,
    ``Tight Bounds on Broadcasting with Dynamic Faults'',
    Parallel Processing Letters, 10 (1), pp. 39-50, 2000.

  44. G. De Marco and U. Vaccaro,
    ``Broadcasting in Hypercubes and Star Graphs with Dynamic Faults'',
    Information Processing Letters , vol. 67, 57-64, 1998.

  45. L. Gargano,
    ``Limited Wavelength Conversion in All-Optical Tree Networks'',
    in: Proceedings of 25th International Colloquium on Automata, Languages, and Programming (ICALP 98), Aalborg, July 1998.

  46. L. Gargano and A. Rescigno,
    ``Communication Complexity of Fault--Tolerant Information Diffusion'',
    Theoretical Computer Science, vol. 209 no. 1-2, 195-211, 1998.
    a preliminary version was published in Proceedings of Fifth IEEE Symposium on Parallel and Distributed Processing (SPDP '93) , pp. 564-572, 1993.

  47. L. Gargano and A. Rescigno,
    ``Fast Collective Communication by Packets in the Postal Model'',
    NETWORKS , vol. 31, 67-79, 1998.

  48. L. Gargano, A. Rescigno, and U. Vaccaro,
    ``Minimum Time Broadcasting in Faulty Star Networks'',
    Discrete Applied Math., vol. 82, 95-117, 1998.

  49. A. Rescigno, and U. Vaccaro,
    ``Highly Fault Tolerant Routing in the Star and Hypercube Interconnection Networks'',
    Parallel Processing Letters, vol. 8, No. 2, 221-230, 1998.

  50. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro
    ``Graph Problems Arising from Wavelength--Routing in All--Optical Networks'',
    2nd Workshop on Optics and Computer Science (WOCS 97) , Geneve, Switzerland, April 1997.

  51. L. Gargano, A. A. Rescigno, and U. Vaccaro
    ``Communication Complexity of Gossiping by Packets'',
    Journal of Parallel and Distributed Computing , vol. 45, 73-81, 1997.
    An extended abstract appeared in: Algorithm Theory--SWAT '96, Rolf Karlsson and Andrzej Lingas (Eds.), Lectures Notes in Computer Science, vol. 1097, pp. 234--245, Springer-Verlag, 1996.

  52. L. Gargano, P. Hell and S. Perennes,
    ``Colouring All Directed Paths in a Symmetric Tree with Applications to WDM Routing'',
    Proceedings of 24th International Colloquium on Automata, Languages, and Programming (ICALP 97), Bologna, Italy, July 1997.

  53. A. Rescigno,
    ``Optimal Polling in Communication Networks'',
    IEEE Transactions on Parallel and Distributed Systems , vol. 8, No. 5, 449-461, 1997.
    A preliminary version was published in Proceedings of Sixth IEEE Symposium on Parallel and Distributee Processing (SPDP '94), 224-231, 1994.

  54. A. Rescigno,
    ``Fault-Tolerant Parallel Communication in the Star Network'',
    Parallel Processing Letters, vol. 7, No. 1, 57-68, 1997.

  55. R. Ahlswede, L. Gargano, H.S. Haroutunian, and L.H. Khachatrian,
    ``Fault-Tolerant Minimum Broadcast Networks'',
    NETWORKS, vol. 27, 293-307, 1996.

  56. A. Rescigno,
    ``On the Communication Complexity of Polling'',
    Information Processing Letters , vol. 59, No. 6, 317-323, 1996.

  57. V. Auletta, A. Rescigno, and V. Scarano,
    ``Embedding Graphs onto the Supercube'',
    IEEE Transactions on Computers, vol. 44, No. 4, pp. 593-597, 1995.

  58. L. Gargano, A. Liestman, J.G. Peters e D. Richards,
    ``Reliable Broadcasting'',
    Discrete Applied Mathematics, vol. 53, 135-148, 1994.

  59. V. Auletta, A. Rescigno and V. Scarano,
    ``Fault Tolerant Routing in the Supercube'',
    Parallel Processing Letters, vol. 3, No.4, 393-405, 1993.

  60. L. Gargano, A.A. Rescigno and U. Vaccaro,
    ``Fault-Tolerant Hypercube Broadcasting via Information Dispersal'',
    NETWORKS, vol. 23, 271-282, 1993.

  61. L. Gargano, U. Vaccaro and A. Vozella,
    ``Fault Tolerant Routing in the Star and Pancake Interconnection Networks'',
    Information Processing Letters, vol. 45, 315-320, 1993.

  62. L. Gargano, A.A. Rescigno and U. Vaccaro,
    ``Fault-Tolerance Properties of the Star Interconnection Network'',
    Proceedings of CODIGRAF '93, pp. 101-112, 1993.

  63. L. Gargano,
    ``Tighter Time Bounds for Fault Tolerant Broadcasting and Gossiping'',
    NETWORKS, vol. 22, 469-486, 1992.

  64. L. Gargano and U. Vaccaro,
    ``Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults'',
    SIAM J. on Discrete Mathematics, vol. 5, 178-198, 1992.

  65. V. Auletta, A. Rescigno and V. Scarano,
    ``On the Fault Tolerance and Computational Capabilities of the Supercube'',
    Proceedings of IV Italian Conference on Theoretical Computer Science , A. Marchetti Spaccamela, P. Mentrasti and M. Venturini Zilli (Eds.), World Scientific, L'Aquila, Ottobre 1992, 38 - 52.

  66. R. M. Capocelli, L. Gargano and U. Vaccaro,
    ``Time Bounds for Broadcasting in Bounded Degree Graphs'',
    in: Graph-Theoretic Concepts in Computer Science, M. Nagl (Ed.), Lectures Notes in Computer Science, vol. 411, 19-33, Springer-Verlag, 1990.

  67. L. Gargano and U. Vaccaro,
    ``On the Construction of Minimal Broadcast Networks'',
    NETWORKS, vol. 19, 673-689, 1989.