The following pages link to Adele A. Rescigno (Q392208):
Displaying 50 items.
- Optimal time data gathering in wireless networks with multidirectional antennas (Q392209) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Low-weight superimposed codes and their applications (Q777294) (← links)
- Collision-free path coloring with application to minimum-delay gathering in sensor networks (Q1026148) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- On the communication complexity of polling (Q1350916) (← links)
- Communication complexity of gossiping by packets (Q1373799) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- (Q1602519) (redirect page) (← links)
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security (Q1602520) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- On \(k\)-strong conflict-free multicoloring (Q1708616) (← links)
- Time-bounded influence diffusion with incentives (Q1713919) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Dual domination problems in graphs (Q2136849) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Dual Domination (Q2301742) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Optimizing Spread of Influence in Social Networks via Partial Incentives (Q3460711) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- Gathering with Minimum Delay in Tree Sensor Networks (Q3511404) (← links)
- Fast Gossiping by Short Messages (Q4210076) (← links)
- Fast collective communication by packets in the postal model (Q4260013) (← links)
- Embedding graphs onto the Supercube (Q4419684) (← links)
- Optimally balanced spanning tree of the star network (Q4571316) (← links)
- Evangelism in social networks: Algorithms and complexity (Q4584867) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- (Q4818867) (← links)
- Strong Conflict-Free Coloring for Intervals (Q4909516) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Fault—tolerant hypercube broadcasting via information dispersal (Q5289370) (← links)
- Brief Announcement (Q5361967) (← links)
- Optimally Fast Data Gathering in Sensor Networks (Q5756706) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
- On Finding Small Sets that Influence Large Networks (Q6278676) (← links)
- Time-Bounded Influence Diffusion with Incentives (Q6304361) (← links)
- Parameterized Complexity of Immunization in the Threshold Model (Q6360005) (← links)
- Speeding up networks mining via neighborhood diversity (Q6487594) (← links)
- Improved algorithms and bounds for list union-free families (Q6576240) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
- Graph burning in community-based networks (Q6636996) (← links)
- An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width (Q6647683) (← links)
