Adele A. Rescigno

IEEE Trans. Inf. Theory, April, 2024

2023

Immunization in the Threshold Model: A Parameterized Complexity Study.

[BibT_eX]

[DOI]

Algorithmica, November, 2023

Bounds and algorithms for generalized superimposed codes.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 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

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 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]

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

Active influence spreading in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Dual Domination.

[BibT_eX]

[DOI]

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

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

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

Active Spreading in Networks.

[BibT_eX]

[DOI]

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

2015

Guest Editorial: Special issue on Structural Information and Communication Complexity.

[BibT_eX]

[DOI]

Thomas Moscibroda

Theor. Comput. Sci., 2015

Complexity of conflict-free colorings of graphs.

[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]

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

2014

Strong Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Optimal time data gathering in wireless networks with multidirectional antennas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Strong Conflict-Free Coloring of Intervals

[BibT_eX]

[DOI]

CoRR, 2012

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

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Gathering with Minimum Delay in Tree Sensor Networks.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Proceedings of the Structural Information and Communication Complexity, 2008

2006

Optimally Fast Data Gathering in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

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

2001

Optimally Balanced Spanning Tree of the Star Network.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2001

Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security.

[BibT_eX]

[DOI]

Inf. Sci., 2001

2000

Efficient collective communication in optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults.

[BibT_eX]

[DOI]

Gianluca De Marco

Parallel Process. Lett., 2000

Coloring Circular Arcs with Applications.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

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

Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 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

1997

Optimal Polling in Communication Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1997

Fault-Tolerant Parallel Communication in the Star Network.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1997

Communication Complexity of Gossiping by Packets.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

1996

On the Communication Complexity of Polling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

1995

Embedding Graphs onto the Supercube.

[BibT_eX]

[DOI]

Vincenzo Auletta

Vittorio Scarano

IEEE Trans. Computers, 1995

1993

Fault Tolerant Routing in the Supercube.

[BibT_eX]

[DOI]

Vincenzo Auletta

Vittorio Scarano

Parallel Process. Lett., 1993

Fault - tolerant hypercube broadcasting via information dispersal.

[BibT_eX]

[DOI]