default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdele A. Rescigno
Person information
- affiliation: University of Salerno, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j36]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An efficient algorithm for group testing with runlength constraints. Discret. Appl. Math. 360: 181-187 (2025)- 2024
- [j35]Gennaro Cordasco
, Luisa Gargano, Adele A. Rescigno:
Parameterized complexity for iterated type partitions and modular-width. Discret. Appl. Math. 350: 100-122 (2024) - [j34]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Graph Burning in Community-based Networks. J. Graph Algorithms Appl. 28(3): 11-30 (2024) - [j33]Adele A. Rescigno, Ugo Vaccaro:
Improved Algorithms and Bounds for List Union-Free Families. IEEE Trans. Inf. Theory 70(4): 2456-2463 (2024) - [c32]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
(t, r)-Broadcast Domination in Networks. ICTCS 2024: 186-199 - [e3]Adele Anna Rescigno, Ugo Vaccaro:
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings. Lecture Notes in Computer Science 14764, Springer 2024, ISBN 978-3-031-63020-0 [contents] - [i12]Luisa Gargano, Adele A. Rescigno:
Spanning Trees Minimizing Branching Costs. CoRR abs/2407.10571 (2024) - [i11]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An Efficient Algorithm for Group Testing with Runlength Constraints. CoRR abs/2409.03491 (2024) - 2023
- [j32]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Immunization in the Threshold Model: A Parameterized Complexity Study. Algorithmica 85(11): 3376-3405 (2023) - [j31]Adele A. Rescigno, Ugo Vaccaro:
Bounds and algorithms for generalized superimposed codes. Inf. Process. Lett. 182: 106365 (2023) - [c31]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. ITW 2023: 544-549 - [c30]Luisa Gargano, Adele A. Rescigno:
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width. MFCS 2023: 50:1-50:15 - [c29]Luisa Gargano, Adele A. Rescigno:
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity. SIROCCO 2023: 502-519 - [c28]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Groups Burning: Analyzing Spreading Processes in Community-Based Networks. WALCOM 2023: 330-342 - [i10]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. CoRR abs/2303.07211 (2023) - 2022
- [j30]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Dual domination problems in graphs. J. Comput. Syst. Sci. 128: 18-34 (2022) - [c27]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Pervasive Domination. ISCO 2022: 287-298 - [c26]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Parameterized Complexity of Immunization in the Threshold Model. WALCOM 2022: 275-287 - 2021
- [c25]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Speeding up Networks Mining via Neighborhood Diversity. FUN 2021: 21:1-21:12 - [c24]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Vertex Separation in Networks. SNAMS 2021: 1-8 - [i9]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
Parameterized Complexity of Immunization in the Threshold Model. CoRR abs/2102.03537 (2021) - 2020
- [j29]Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Low-weight superimposed codes and related combinatorial structures: Bounds and applications. Theor. Comput. Sci. 806: 655-672 (2020) - [j28]Gennaro Cordasco, Luisa Gargano, Manuel Lafond, Lata Narayanan, Adele A. Rescigno, Ugo Vaccaro, Kangkang Wu:
Whom to befriend to influence people. Theor. Comput. Sci. 810: 26-42 (2020) - [j27]Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Fast and frugal targeting with incentives. Theor. Comput. Sci. 812: 62-79 (2020) - [c23]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Iterated Type Partitions. IWOCA 2020: 195-210 - [e2]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020. CEUR Workshop Proceedings 2756, CEUR-WS.org 2020 [contents] - [i8]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
Iterated Type Partitions. CoRR abs/2001.08122 (2020)
2010 – 2019
- 2019
- [j26]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Active influence spreading in social networks. Theor. Comput. Sci. 764: 15-29 (2019) - [c22]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
Dual Domination. IWOCA 2019: 160-174 - 2018
- [j25]Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro:
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. Algorithmica 80(6): 1804-1833 (2018) - [j24]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Evangelism in social networks: Algorithms and complexity. Networks 71(4): 346-357 (2018) - [c21]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Low-Weight Superimposed Codes and Their Applications. FAW 2018: 197-211 - [c20]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Threshold-Bounded Dominating Set with Incentives. ICTCS 2018: 65-76 - [c19]Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. SIROCCO 2018: 280-295 - [i7]Gennaro Cordasco, Luisa Gargano, Joseph Peters, Adele Anna Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. CoRR abs/1807.06921 (2018) - 2017
- [c18]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
On k-Strong Conflict-Free Multicoloring. COCOA (2) 2017: 276-290 - 2016
- [j23]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(1): 94:1-94:20 (2016) - [c17]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Active Spreading in Networks. ICTCS 2016: 149-162 - [c16]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Evangelism in Social Networks. IWOCA 2016: 96-108 - [c15]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Brief Announcement: Active Information Spread in Networks. PODC 2016: 435-437 - [i6]Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro:
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. CoRR abs/1610.03721 (2016) - [i5]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
On Finding Small Sets that Influence Large Networks. CoRR abs/1610.04838 (2016) - [i4]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Evangelism in Social Networks: Algorithms and Complexity. CoRR abs/1610.09486 (2016) - [i3]Gennaro Cordasco, Luisa Gargano, Manuel Lafond, Lata Narayanan, Adele A. Rescigno, Ugo Vaccaro, Kangkang Wu:
Whom to befriend to influence people. CoRR abs/1611.08687 (2016) - 2015
- [j22]Luisa Gargano, Adele A. Rescigno:
Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566: 39-49 (2015) - [j21]Thomas Moscibroda, Adele A. Rescigno:
Guest Editorial: Special issue on Structural Information and Communication Complexity. Theor. Comput. Sci. 584: 1-2 (2015) - [c14]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
Influence Propagation over Large Scale Social Networks. ASONAM 2015: 1531-1538 - [c13]Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro:
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks. COCOA 2015: 193-208 - [c12]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Optimizing Spread of Influence in Social Networks via Partial Incentives. SIROCCO 2015: 119-134 - [i2]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives. CoRR abs/1512.06372 (2015) - 2014
- [j20]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. Algorithmica 70(4): 732-749 (2014) - 2013
- [j19]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal time data gathering in wireless networks with multidirectional antennas. Theor. Comput. Sci. 509: 122-139 (2013) - [e1]Thomas Moscibroda, Adele A. Rescigno:
Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8179, Springer 2013, ISBN 978-3-319-03577-2 [contents] - 2012
- [c11]Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. ISAAC 2012: 4-13 - [i1]Luisa Gargano, Adele A. Rescigno:
Strong Conflict-Free Coloring of Intervals. CoRR abs/1205.1900 (2012) - 2011
- [c10]Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO 2011: 306-317 - 2010
- [j18]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno:
Gathering with Minimum Completion Time in Sensor Tree Networks. J. Interconnect. Networks 11(1-2): 1-33 (2010)
2000 – 2009
- 2009
- [j17]Luisa Gargano, Adele A. Rescigno:
Collision-free path coloring with application to minimum-delay gathering in sensor networks. Discret. Appl. Math. 157(8): 1858-1872 (2009) - 2008
- [c9]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno:
Gathering with Minimum Delay in Tree Sensor Networks. SIROCCO 2008: 262-276 - 2006
- [c8]Luisa Gargano, Adele A. Rescigno:
Optimally Fast Data Gathering in Sensor Networks. MFCS 2006: 399-411 - 2003
- [c7]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems. IPDPS 2003: 223 - 2001
- [j16]Adele A. Rescigno:
Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security. Inf. Sci. 137(1-4): 259-276 (2001) - [j15]Adele A. Rescigno:
Optimally Balanced Spanning Tree of the Star Network. IEEE Trans. Computers 50(1): 88-91 (2001) - 2000
- [j14]Gianluca De Marco, Adele A. Rescigno:
Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults. Parallel Process. Lett. 10(1): 39-49 (2000) - [j13]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient collective communication in optical networks. Theor. Comput. Sci. 233(1-2): 165-189 (2000) - [c6]Luisa Gargano, Adele A. Rescigno:
Coloring Circular Arcs with Applications. ICALP Satellite Workshops 2000: 155-166
1990 – 1999
- 1998
- [j12]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Minimum time broadcast in faulty star networks. Discret. Appl. Math. 83(1-3): 97-119 (1998) - [j11]Luisa Gargano, Adele A. Rescigno:
Fast collective communication by packets in the postal model. Networks 31(2): 67-79 (1998) - [j10]Adele A. Rescigno, Ugo Vaccaro:
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks. Parallel Process. Lett. 8(2): 221-230 (1998) - [j9]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fast Gossiping by Short Messages. SIAM J. Comput. 27(4): 917-941 (1998) - [j8]Luisa Gargano, Adele A. Rescigno:
Communication Complexity of Fault-Tolerant Information Diffusion. Theor. Comput. Sci. 209(1-2): 195-211 (1998) - 1997
- [j7]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Communication Complexity of Gossiping by Packets. J. Parallel Distributed Comput. 45(1): 73-81 (1997) - [j6]Adele A. Rescigno:
Fault-Tolerant Parallel Communication in the Star Network. Parallel Process. Lett. 7(1): 57-68 (1997) - [j5]Adele A. Rescigno:
Optimal Polling in Communication Networks. IEEE Trans. Parallel Distributed Syst. 8(5): 449-461 (1997) - 1996
- [j4]Adele A. Rescigno:
On the Communication Complexity of Polling. Inf. Process. Lett. 59(6): 317-323 (1996) - [c5]Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro:
Efficient Collective Communication in Optical Networks. ICALP 1996: 574-585 - [c4]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Communication Complexity of Gossiping by Packets. SWAT 1996: 234-245 - 1995
- [j3]Vincenzo Auletta, Adele Anna Rescigno, Vittorio Scarano:
Embedding Graphs onto the Supercube. IEEE Trans. Computers 44(4): 593-597 (1995) - [c3]Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fast Gossiping by Short Messages. ICALP 1995: 135-146 - 1994
- [c2]Adele A. Rescigno:
Optimal polling in communication networks. SPDP 1994: 224-231 - 1993
- [j2]Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fault - tolerant hypercube broadcasting via information dispersal. Networks 23(4): 271-282 (1993) - [j1]Vincenzo Auletta, Adele Anna Rescigno, Vittorio Scarano:
Fault Tolerant Routing in the Supercube. Parallel Process. Lett. 3: 393-405 (1993) - [c1]Luisa Gargano, Adele A. Rescigno:
Communication Complexity of Fault-Tolerant Information Diffusion. SPDP 1993: 564-573
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
