NETWORKS AND GRAPHS

INFORMATION THEORY AND APPLICATIONS

COMBINATORIAL SEARCH

COMBINATORICS

VOLUMES EDITED

.

- ''Influence Propagation over Large Scale
Social Networks'', In: Proceedings
of the 2015 IEEE/ACM International Conference on Advances in Social
Networks Analysis and Mining (ASONAM 2015), J. Pei, F. Silvestri,
J. Tang (Eds.), p. 1531-1538, IEEE,
2015, doi: http://dx.doi.org/10.1145/2808797.2809347 (in
collaboration with
Gennaro Cordasco, Adele A. Rescigno
).
- ``Influence Diffusion in Social Networks under
Time Window Constraints'', Theoretical
Computer Science, vol. 584, 2015,
pp. 53-66, (in collaboration with
Pavol Hell, Joseph G. Peters, Ugo Vaccaro)
- ``Spread of Influence in Weighted Networks
under Time and Budget Constraints'',
Theoretical Computer Science, vol. 586, 2015, pp. 40-58, (in
collaboration with F. Cicalese, G. Cordasco,
M. Milanic; J. Peters,U.
Vaccaro).
- Multi-level dynamo and opinion
spreading, Mathematical Structures
in Comp. Sci., 2015, doi:10.1017/S0960129515000080, (in collaboration with
S. Brunetti, G. Cordasco, E.
Lodi, W. Quattrociocchi).
- ``Optimizing Spread of Influence in Social
Networks via Initial Partial Incentives", Proc. of 22nd International
Colloquium on Structural Information and Communication Complexity (SIROCCO
2015), Scheideler, Christian (Ed.), LNCS vol.
9439, ISBN 978-3-319-25258-2, pp.119-134, , (in
collaboration with G. Cordasco,
A. Rescigno, U. Vaccaro).
- ``A Fast and Effective Heuristic for
Discovering Small Target Sets in Social Networks", Proc. of 9th
International Conference on Combinatorial Optimization and
Applications, Zaixin
Lu et al. Eds, Lecture Notes in Computer Science
9486, pp.193-208, Springer, 2015, (in collaboration with
G. Cordasco, M. Mecchia,
A. Rescigno, U. Vaccaro).
- “A Fast and Efficient Heuristic for
Target Set Selection in Social Networks'', Computational Social Science,
European Conference on Complex Systems (ECCS14), 2014, (in collaboration
with A. Rescigno, . M. Mecchia,
U. Vaccaro).
- “Latency-Bounded
Target Set Selection in Social Networks”, Theoretical Computer Science, vol.
535, 2014, pp.1-15, (in
collaboration with F. Cicalese, G. Cordasco, M. Milanic, U.
Vaccaro).
- ``How
to go Viral: Cheaply and Quickly", Proceedings of FUN with
Algorithms, 2014 (FUN 2014), (in collaboration with F. Cicalese,
G. Cordasco, . M. Milanic,
J. Peters, U. Vaccaro).
- ''Influence
Diffusion in Social Networks under Time Window Constraints'', Proceedings
of 20th International Colloquium on Structural Information and Communication
Complexity, 2013, (in collaboration with Pavol
Hell, Joseph Peters and Ugo Vaccaro).
- ''Latency-Bounded
Target Set Selection in Social Networks'', Proceedings of Computability in
Europe (CiE 2013), 2013, (in collaboration with
F. Cicalese, G. Cordasco,
M. Milanic, U. Vaccaro).
- "Minimum
Weight Dynamo and Fast Opinion Spreading", Proceedings of WG 2012,
M.C. Golumbic et al. (Eds.), Lecture Notes in
Computer Science 7551, Springer Verlag,
pp.249-261, 2012, (in collaboration with S. Brunetti, G. Cordasco, E. Lodi, and W.Quattrociocchi)
- "Label
Propagation Algorithm: A Semi-Synchronous Approach", International
Journal of Social Network Mining, 2012 Vol.1, pp.3 - 26, (in collaboration
with G. Cordasco).
- ''Community
Detection via Semi-Synchronous Label Propagation Algorithms'', Proceedings
of IEEE International Workshop on Business Applications of Social Network
Analysis (BASNA-10), Bangalore, India, December 2010, (in collaboration
with G. Cordasco).

- "Complexity
of Conflict-Free Colorings of Graphs", Theoretical Computer Science, Vol.
566, 2015, pp. 39–49, (in
collaboration with A. A. Rescigno)
- "Strong
conflict-free coloring for intervals", Algorithmica,
vol. 70(4), 2014, pp. 732-749, DOI
10.1007/s00453-014-9929-x, (in collaboration with P. Cheilaris,
A. A. Rescigno, and S. Smorodinskyi)
- "Optimal
Time Data Gathering in Wireless Networks with Multidirectional
Antennas", Theoretical Computer Science, Vol. 509, 2013, Pages
122–139, DOI: 10.1016/j.tcs.2013.03.017, (in collaboration with J-C. Bermond, S. Perennes,
A. Rescigno, U. Vaccaro).
- "Strong
conflict-free coloring for intervals", Proceedings of the 23rd
International Symposium on Algorithms and Computation (ISAAC 2012), K.-M.
Chao, T.-s. Hsu, and D.-T. Lee (Eds.), LNCS 7676, pp. 4-13, Springer-Verlag, 2012, (in collaboration with P. Cheilaris, A. A. Rescigno,
and S. Smorodinskyi)
- ''Optimal
Time Data Gathering in Wireless Networks with Omni--Directional
Antennas'', Proceedings of 18th International Colloquium on Structural
Information and Communication Complexity Gdansk, Poland, June 26-29, 2011,
(in collaboration with J-C. Bermond, S. Perennes,
A. Rescigno, U. Vaccaro).
- ''Gathering
with Minimum Completion Time in Sensor Tree Networks", Journal of Interconnection
Networks, vol. 11, pp. 1-33, 2010, (in collaboration with J-C.Bermond, A.A.Rescigno).
- ''Navigable
Small-World Networks with Few Random Bits'', Theoretical Computer Science,
Vol. 410 , Issue 47-49, pp. 4975-4988, 2009, (in collaboration with G. Cordasco).
- ''Collision-Free
Path Coloring with Application to Minimum-Delay Gathering in Sensor
Networks'', Discrete Applied Mathematics, vol. 157(8), pp. 1858-1872,
2009, (in collaboration with A. Rescigno).
- "Gathering
with Minimum Delay in Sensor Networks", Proceedings of 15th
International Colloquium on Structural Information and Communication,
Complexity (SIROCCO 2008), LNCS 5058, (in collaboration with J.-C. Bermond and A. Rescigno)
- ``F-Chord:
improved uniform routing on Chord'', NETWORKS, Vol. 52 No. 4, pp. 325-332,
2008, (in collaboration with G. Cordasco, M. Hammar, A. Negro, V. Scarano)
- "Degree-Optimal
Routing for P2P Systems", Theory of Computing Systems, to appear, (in
collaboration with G. Chiola, G. Cordasco, M. Hammar, 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. (in collaboration
with G. Chiola, G. Cordasco, A. Negro, V. Scarano).
- "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.
- "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, (in collaboration with G. Cordasco).
- ''Optimally
Fast Data Gathering in Sensor Networks'', Proceedings of 31st
International Symposium on Mathematical Foundations of Computer Science
(MFCS 2006), Lecture Notes in Computer Science , Vol. 4162, pp. 399-411,
Springer Verlag, (in collaboration with A.A. Rescigno).
- "Asynchronous
deterministic rendezvous in graphs'', Theoretical Computer Science, vol.
355, pp. 315-326, 2006,

preliminary version in: Proc. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), (in collaboration with G. De Marco, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro). - ``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, (in collaboration with G. Chiola,
G. Cordasco, A. Negro, V. Scarano)
- ``Overlay
networks with class'', Proceedings of 8th International Symposium on
Parallel Architectures,Algorithms and Networks
(ISPAN 2005), IEEE, 2005, (in collaboration with G. Chiola,
G. Cordasco, A. Negro, V. Scarano)
- ``Degree--Optimal
Deterministic Routing for P2p Systems'', Proceedings of Tenth IEEE
Symposium on Computers and Communications (ISCC 2005), IEEE, (in
collaboration with G. Cordasco, M. Hammar, V. Scarano)
- ''Spanning Spiders and light-splitting switches'', Discrete Mathematics, vol. 285, Issue 1-3, pp. 83-95, 2004,

(in collaboration with M. Hammar, P. Hell, L. Stacho, and U. Vaccaro). - ``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, (in collaboration with
M. Hammar and A. Ostlin).
- ``F-Chord: improved uniform routing on Chord'', Proceedings of Sirocco 2004, June 21-23, 2004, Slovakia, (in
collaboration with G. Cordasco, 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, (in collaboration with
G. Cordasco, M. Hammar,
A. Negro, 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, (in collaboration with G. Cordasco, M. Hammar, V. Scarano)
- ''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), (in collaboration with M. Hammar).
- ``Multicasting
to Groups in Optical Networks'', Proceedings IPDPS 2003 - 3rd
International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN),
2003, (in collaboration with A. Rescigno 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, (in collaboration with P.
Hell, L. Stacho, and U. Vaccaro).
- ``Colouring All Directed Paths in a
Symmetric Tree with an Application to Optical Networks'', Journal of Graph Theory, 2001, 183--196. (in collaboration
with S. Perennes and P. Hell).
- ``Concurrent
Multicast in Weighted Networks'', Theoretical Computer Science, vol. 259, no. 1-2, pp. 359-377,
2001,

an extended abstract appeared in the proceeedings of 6-th Scandinavian Workshop on Algorithm Theory (SWAT'98), Stockholm, Sweden, July 8-10 1998, (in collaboration with G. De Marco ed U. Vaccaro). - ``Sparse and Limited Wavelenght Conversion in Tree Networks'', Theoretical Computer Science, 2001, (in collaboration with V. Auletta, I. Caragiannis, C. Kaklamanis, G. Persiano)
- "Efficient Communication in Unknown Networks", NETWORKS, vol. 38, 2001, 39-49 , (in collaboration with A. Pelc, S. Perennes and U.
Vaccaro)
- ``Efficient Collective Communication in Optical Networks'', Theoretical Computer Science, vol. 233, 2000, 119-124, (in
collaboration with J.-C. Bermond, S. Perennes, A. Rescigno, and
U. Vaccaro).
- ``Coloring
Circular Arcs with Applications to WDM Routing", Workshop on Approximation
and Randomization Algorithms in Communication Networks (ARACNE'00), July
2000, Geneva, Switzerland, (in collaboration with A. Rescigno).
- ``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. (in collaboration with U. Vaccaro).
- ``Limited Wavelength Conversion in All-Optical Tree Networks'', Proceedings of 25th International Colloquium on Automata,
Languages, and Programming (ICALP 98), Aalborg, July 1998.
- ``Colouring All Directed Paths in a
Symmetric Tree with an Application to Optical Networks'', Proceedings of 24th International Colloquium on Automata,
Languages, and Programming (ICALP 97), Bologna, Italy, July 1997, (in
collaboration with S. Perennes and P. Hell).
- ``Efficient Collective Communication in Optical Networks'', Prooceedings of 23rd International
Colloquium on Automata, Languages, and Programming (ICALP 96), Paderborn,
Germany, July 1996, (in collaboration with J.-C. Bermond,
S. Perennes, A. Rescigno,
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, (in collaboration with B. Beauquier,
J.-C. Bermond, P. Hell, S. Perennes,
and U. Vaccaro).
- ``Fast Gossiping by Short Messages'', SIAM Journal on Computing, 27 (1998), 917 - 941

an extended abstract appeared in: Prooceedings of 22nd International Colloquium on Automata, Languages, and Programming (ICALP 95), LNCS 944, pp. 135-146, (in collaboration with J.-C. Bermond, A. Rescigno, and U. Vaccaro). - ``Communication Complexity of Fault--Tolerant Information
Diffusion'', Theoretical
Computer Science, (209)1-2 (1998), 195-211, (in collaboration with A. A. Rescigno).
- ``Fast
Collective Communication by Packets in the Postal Model'', Networks, 31 (1998), 67-79, (in collaboration with A.A. Rescigno).
- ``Optimal Sequential Gossiping by Short Messages'', Discrete Applied Math., 86 (1998) pp. 145-155, (in collaboration
with J.-C. Bermond and S. Perennes).
- ``Minimum Time Broadcasting in Faulty Star Networks'', Discrete Applied Math., 82 (1998), 95-117, (in collaboration with
A.A. Rescigno and U. Vaccaro).
- ``Communication Complexity of Gossiping by Packets'', Journal of Parallel and Distributed Computing, 45 (1997), 73--81,

an extended abstract appeared in: Prooceedings of Fifth Scandinavian Workshop on Algorithm Theory (SWAT'96), Reykjavik, Iceland, July 3-5, 1996, (in collaboration with A. Rescigno and U. Vaccaro). - ``Fault-Tolerant Minimum Broadcast Networks'', NETWORKS, 27 (1996), 293--307, (in collaboration with R. Ahlswede, H.S. Haroutunian,
and L.H. Khachatrian).

*``Reliable Broadcasting''**, Discrete Applied Mathematics, vol.
53 (1994), 135-148, (in collaboration with A. Liestman,
J.G. Peters e D. Richards). *

- ``Fault
Tolerant Routing in the Star and Pancake Interconnection Networks'',
Information Processing Letters, vol. 45, (1993), 315-320, (in
collaboration with U. Vaccaro and A. Vozella).
- ``Fault-Tolerant
Hypercube Broadcasting via Information Dispersal'', NETWORKS, vol. 23,
(1993), 271-282, (in collaboration with A.A. Rescigno
and U. Vaccaro).
- ``Tighter
Time Bounds for Fault Tolerant Broadcasting and Gossiping'', NETWORKS,
vol. 22 (1992), 469-486.
- ``Minimum
Time Broadcast Networks Tolerating a Logarithmic Number of Faults'', SIAM
J. on Discrete Mathematics, vol. 5, (1992), 178-198, (in collaboration
with 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, pp. 19-33, Springer-Verlag, 1990. (in collaboration
with R. M. Capocelli and U. Vaccaro).
- ``On
the Construction of Minimal Broadcast Networks'', NETWORKS, vol. 19,
(1989), 673-689, (in collaboration with U. Vaccaro).

- ''Approximating
probability distributions with short vectors, via information theoretic
distance measures'', In:
Proceedings of the 2016 IEEE International Symposium on Information
Theory, to appear, (in collaboration with F. Cicalese,
U. Vaccaro).
- ''Information Theoretic Measures of Distances and
their Econometric Applications'' IEEE International Symposium on
Information Theory, July 2013, Istanbul, (in collaboration with F. Cicalese, U. Vaccaro).
- ''Tunstall Parse Trees Optimum under Various
Criteria'', IEEE International Symposium on Information Theory 2007, June
2007, Nice, France, (in collaboration with F. Cicalese,
U. Vaccaro).
- ``A Note on Approximation of Uniform
Distributions from Variable-to-Fixed Length Codes'', IEEE Transactions on
Information Theory, vol. 52, No. 8, pp. 3772-3777, 2006, (in collaboration
with F. Cicalese and U. Vaccaro).
- ``Optimal Approximation of Uniform Distributions with a Biased
Coin'', The 4th. International
Workshop on Randomization and Approximation Techniques in Computer Science
(RANDOM'00), July 2000, Geneva, Switzerland, (in collaboration with F. Cicalese, U. Vaccaro).
- ``Optimal Generation of Fair Dice with Minimum Number of Biased
Coins'', IEEE Transactions on
Information Theory, 45 (1999), (in collaboration with U. Vaccaro).
- ``A
Fast Algorithm for the Unique Decipherability of Multivalued Encodings'',
Theoretical Computer Science, vol. 134, (1994), 63-78, (in collaboration
with R. M. Capocelli and U. Vaccaro).
- ``On the Information Rate of Secret Sharing Schemes'', Theoretical Computer Science, 154 (1996), 283-306, (in
collaboration with C. Blundo, A. De Santis and U. Vaccaro).
- ``Secret Sharing Schemes with Veto Capabilities'', in: Proceedings of French-Israeli Workshop in Algebraic Coding,
G. Cohen, S. Litsyn, A. Lobstein,
and G. Zemor, (Eds),
Lectures Notes in Computer Science, vol. 781, pp. 82-89, 1994, Springer-Verlag. (in collaboration with C. Blundo,
A. De Santis and U. Vaccaro)
- ``On
the Sizes of Shares for Secret Sharing Schemes'', Journal of Cryptology,
vol. 6, 157-167, 1993 (in collaboration with R. M. Capocelli,
A. De Santis, and U. Vaccaro).
- ``On
the Construction of Statistically Synchronizable
Codes'', IEEE Transactions on Information Theory, vol. IT-38, (1992),
407-414, (in collaboration with R. M. Capocelli,
A. De Santis and U. Vaccaro).
- ``Decoders
with Initial State Invariance for Multivalued Encodings'', Theoretical
Computer Science, vol. 86, (1991),365-375, (in collaboration with R. M. Capocelli and U. Vaccaro).
- ``Efficient
q-ary Immutable Codes'', Discrete Applied
Mathematics, vol. 33, (1991), 25-41, (in collaboration with R. M. Capocelli and U. Vaccaro).
- ``Unidirectional
Error Detecting Codes'', in: EUROCODE '90, P. Charpin
and G. Cohen (Eds.), Lectures Notes in Computer Science, vol. 514, pp.
94-105, Springer-Verlag, 1991. (in collaboration
with G. Cohen and U. Vaccaro).
- ``An
Efficient Algorithm for Testing Immutability of Variable Length Codes'',
IEEE Transactions on Information Theory, vol. IT-35, No. 6, (1989),
1310-1314, (in collaboration with R. M. Capocelli
and U. Vaccaro).
- ``On
the Characterization of Statistically Synchronizable
Variable Length Codes'', IEEE Transactions on Information Theory, vol.
IT-34, (1988), 817-825, (in collaboration with R. M. Capocelli
and U. Vaccaro).

- ``On Searching Strategies, Parallel Questions and
Delayed Answers'', Discrete Applied Mathematics, vol. 144, Issue 3, pp.
247-262, 2004. (in collaboration
with F. Cicalese, U. Vaccaro).
- ``Improved
Algorithms for Chemical Threshold Testing Problems'', Theoretical Comp.
Science, vol. 259, no. 1-2, pp. 493-511, 2001 , (in collaboration with A.
De Bonis and U. Vaccaro).
- ``Group Testing with Unreliable Tests'' Information Sciences, 96 (1997), 1--14, (in collaboration with A.
De Bonis and U. Vaccaro).
- ``Optimal Detection of a Counterfeit Coin with Multi-Arms
Balances'',
Discrete Applied Mathematics, 61 (1995), 121--132, (in collaboration with
A. De Bonis and U. Vaccaro).
- ``Search
Problems for Two Irregular Coins with Incomplete Feedback: the Underweight
Model'', Discrete Applied Mathematics, vol. 36, (1992), 191-197, (in
collaboration with J. K\"orner and U.
Vaccaro).
- ``An
Improved Algorithm for Quantitative Group Testing'', Discrete Applied
Mathematics, vol. 36, (1992), 299-306, (in collaboration with V. Montuori, G. Setaro, and U.
Vaccaro)

- ``On the Capacity of Boolean Graph Formulae'', Graphs and Combinatorics, 11 (1995), 29-48, (in collaboration
with J. K\"orner and U. Vaccaro).
- ``On various Capacities of Digraphs'', Graphs and Combinatorics, vol. 10 (1994), (in collaboration with
A. Galluccio, J. K\"orner
e G. Simonyi).
- ``Capacities: from Information Theory to Extremal Set Theory'', J. Combinatorial Theory, Series A, vol. 68, (1994), 296-316, (in
collaboration with J. K\"orner and U.
Vaccaro).
- ``Sperner Capacities'', Graphs and Combinatorics, vol.
9, (1993), 31-46, (in collaboration with J. K\"orner
and U. Vaccaro).
- ``Qualitative
Independence and Sperner Problems for Directed
Graphs'', J. Combinatorial Theory, Series A, vol. 61, (1992), 173-192, (in
collaboration with J. K\"orner and U.
Vaccaro).

- Proceedings of Fifth International Conference on
FUN WITH ALGORITHMS (FUN 2010), LNCS vol. 6099, Springer, 2010 (in
collaboration with P. Boldi)
- Proceedings of 3rd International Workshop on
Approximation and Randomized Algorithms in Communication Networks,
Carleton Scientific, 2002 (in collaboration with A. Clementi)
- Proceedings of the 5th International Colloquium
on Structural Information and Communication Complexity, Carleton
Scientific (1999) (in collaboration with David Peleg)

*If you are looking for a paper not in the list above click **here**. *