Luisa Gargano

Algorithmica, November, 2023

Groups Burning: Analyzing Spreading Processes in Community-Based Networks.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2023

An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Dual domination problems in graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Parameterized Complexity of Immunization in the Threshold Model.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Pervasive Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Vertex Separation in Networks.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Social Network Analysis, 2021

Speeding up Networks Mining via Neighborhood Diversity.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020

Low-weight superimposed codes and related combinatorial structures: Bounds and applications.

[BibT_eX]

[DOI]

Adele Anna Rescigno

Theor. Comput. Sci., 2020

Fast and frugal targeting with incentives.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Whom to befriend to influence people.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Iterated Type Partitions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Minimum-Entropy Couplings and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Active influence spreading in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Dual Domination.

[BibT_eX]

[DOI]

Adele Anna Rescigno

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

An Information Theoretic Approach to Probability Mass Function Truncation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Bounds on the Entropy of a Function of a Random Variable and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Evangelism in social networks: Algorithms and complexity.

[BibT_eX]

[DOI]

Networks, 2018

Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2018

Time-Bounded Influence Diffusion with Incentives.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Threshold-Bounded Dominating Set with Incentives.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Low-Weight Superimposed Codes and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Multi-level dynamo and opinion spreading.

[BibT_eX]

[DOI]

Walter Quattrociocchi

Math. Struct. Comput. Sci., 2017

Space-Optimal Proportion Consensus with Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

How to find a joint probability distribution of minimum entropy (almost) given the marginals.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

H(X) vs. H(f(X)).

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On k-Strong Conflict-Free Multicoloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

On finding small sets that influence large networks.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2016

Brief Announcement: Active Information Spread in Networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Evangelism in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximating probability distributions with short vectors, via information theoretic distance measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Active Spreading in Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015

Complexity of conflict-free colorings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Influence diffusion in social networks under time window constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Spread of influence in weighted networks under time and budget constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives.

[BibT_eX]

[DOI]

CoRR, 2015

Optimizing Spread of Influence in Social Networks via Partial Incentives.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

Influence Propagation over Large Scale Social Networks.

[BibT_eX]

[DOI]

Adele Anna Rescigno

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

Latency-bounded target set selection in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Strong Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

Algorithmica, 2014

How to go Viral: Cheaply and Quickly.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Optimal time data gathering in wireless networks with multidirectional antennas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Information theoretic measures of distances and their econometric applications.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Special Issue on Fun with Algorithms.

[BibT_eX]

[DOI]

Paolo Boldi

Theory Comput. Syst., 2012

Label propagation algorithm: a semi-synchronous approach.

[BibT_eX]

[DOI]

Int. J. Soc. Netw. Min., 2012

Minimum Weight Dynamo and Fast Opinion Spreading

[BibT_eX]

[DOI]

Walter Quattrociocchi

CoRR, 2012

Strong Conflict-Free Coloring of Intervals

[BibT_eX]

[DOI]

CoRR, 2012

Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract).

[BibT_eX]

[DOI]

Walter Quattrociocchi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Community Detection via Semi-Synchronous Label Propagation Algorithms

[BibT_eX]

[DOI]

CoRR, 2011

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

2010

Gathering with Minimum Completion Time in Sensor Tree Networks.

[BibT_eX]

[DOI]

Jean-Claude Bermond

J. Interconnect. Networks, 2010

2009

Navigable Small-World networks with few random bits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Degree-Optimal Routing for P2P Systems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

A note on submodular set cover on matroids.

[BibT_eX]

[DOI]

Mikael Hammar

Discret. Math., 2009

Collision-free path coloring with application to minimum-delay gathering in sensor networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

F-Chord: Improved uniform routing on Chord.

[BibT_eX]

[DOI]

Networks, 2008

Optimizing the finger tables in Chord-like DHTs.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2008

Gathering with Minimum Delay in Tree Sensor Networks.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Proceedings of the Structural Information and Communication Complexity, 2008

2007

Time Optimal Gathering in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Tunstall Parse Trees Optimum under Various Criteria.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Asynchronous deterministic rendezvous in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Optimally Fast Data Gathering in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

How Much Independent Should Individual Contacts Be to Form a Small-World?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Optimizing the finger table in chord-like DHTs.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

Overlay networks with class.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Degree-Optimal Deterministic Routing for P2P Systems.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 2005

2004

Spanning spiders and light-splitting switches.

[BibT_eX]

[DOI]

Discret. Math., 2004

On searching strategies, parallel questions, and delayed answers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

F-Chord: Improved Uniform Routing on Chord: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Brief announcement: degree: optimal deterministic routing for P2P systems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks.

[BibT_eX]

[DOI]

Mikael Hammar

Anna Pagh

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Non-uniform deterministic routing on F-Chord(α).

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Hot Topics in Peer-to-Peer Systems, 2004

2003

Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).

[BibT_eX]

[DOI]

Mikael Hammar

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Spanning Trees with Bounded Number of Branch Vertices.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Concurrent multicast in weighted networks.

[BibT_eX]

[DOI]

Gianluca De Marco

Theor. Comput. Sci., 2001

Efficient algorithms for chemical threshold testing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Sparse and limited wavelength conversion in all-optical tree networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Efficient communication in unknown networks.

[BibT_eX]

[DOI]

Networks, 2001

Coloring all directed paths in a symmetric tree, with an application to optical networks.

[BibT_eX]

[DOI]

Pavol Hell

Stephane Perennes

J. Graph Theory, 2001

Multicasting in Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Efficient collective communication in optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Coloring Circular Arcs with Applications.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

Optimal Approximation of Uniform Distributions with a Biased Coin.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1999

Efficient generation of fair dice with few biased coins.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1998

Communication Complexity of Fault-Tolerant Information Diffusion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Fast Gossiping by Short Messages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Fast collective communication by packets in the postal model.

[BibT_eX]

[DOI]

Networks, 1998

Minimum time broadcast in faulty star networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Optimal Sequential Gossiping by Short Messages.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Stephane Perennes

Discret. Appl. Math., 1998

Limited Wavelength Conversion in All-Optical Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Improved Algorithms for Chemical Threshold Testing Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Communication Complexity of Gossiping by Packets.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Group Testing with Unreliable Tests.

[BibT_eX]

[DOI]

Inf. Sci., 1997

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.

[BibT_eX]

[DOI]

Pavol Hell

Stephane Perennes

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Information Rate of Secret Sharing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

On the capacity of boolean graph formulæ.

[BibT_eX]

[DOI]

Graphs Comb., 1995

optimal Detection of a Counterfeit Coin with Multi-arms Balances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

A Fast Algorithm for the Unique Decipherability of Multivalued Encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Capacities: From Information Theory to Extremal Set Theory.

[BibT_eX]

J. Comb. Theory, Ser. A, 1994

Different capacities of a digraph.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Reliable broadcasting.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Fault - tolerant hypercube broadcasting via information dispersal.

[BibT_eX]

[DOI]

Networks, 1993

On the Size of Shares for Secret Sharing Schemes.

[BibT_eX]

[DOI]

J. Cryptol., 1993

Fault Tolerant Routing in the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

A. Vozella

Inf. Process. Lett., 1993

Sperner capacities.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Secret Sharing Schemes with Veto Capabilities.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

1992

On the construction of statistically synchronizable codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Tighter time bounds on fault-tolerant broadcasting and gossiping.

[BibT_eX]

[DOI]

Networks, 1992

Qualitative Independence and Sperner Problems for Directed Graphs.

[BibT_eX]

J. Comb. Theory, Ser. A, 1992

An improved algorithm for quantitative group testing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Search problems for two irregular coins with incomplete feedback: the underweight model.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

On the Information Rate of Secret Sharing Schemes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

Decoders with Initial State Invariance for Multivalued Encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Efficient q-ary immutable codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

1990

Unidirectional error-detecting codes.

[BibT_eX]

[DOI]

Gérard D. Cohen

Proceedings of the EUROCODE '90, 1990

1989

An efficient algorithm for testing immutability of variable-length codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

On the construction of minimal broadcast networks.

[BibT_eX]

[DOI]

Networks, 1989

Time Bound for Broadcasting in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

On the characterization of statistically synchronizable variable-length codes.

[BibT_eX]

[DOI]