The following pages link to Gennaro Cordasco (Q456003):
Displaying 36 items.
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- Extending IC-scheduling via the sweep algorithm (Q666039) (← links)
- On clustering \textsc{Dag}s for task-hungry computing platforms (Q692974) (← links)
- Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
- Degree-optimal routing for P2P systems (Q841622) (← links)
- Navigable small-world networks with few random bits (Q1034617) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← 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)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Dual Domination (Q2301742) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA (Q2929638) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← 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)
- F-Chord: Improved uniform routing on Chord (Q3548733) (← links)
- Evangelism in social networks: Algorithms and complexity (Q4584867) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Space-Optimal Proportion Consensus with Population Protocols (Q5045452) (← links)
- Minimum Weight Dynamo and Fast Opinion Spreading (Q5200512) (← links)
- Structural Information and Communication Complexity (Q5315245) (← links)
- Latency-Bounded Target Set Selection in Social Networks (Q5326360) (← links)
- (Q5327004) (← links)
- Brief Announcement (Q5361967) (← links)
- How Much Independent Should Individual Contacts Be to Form a Small–World? (Q5459128) (← links)
- On Evaluating Graph Partitioning Algorithms for Distributed Agent Based Models on Networks (Q5858637) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- On Finding Small Sets that Influence Large Networks (Q6278676) (← links)
- Speeding up networks mining via neighborhood diversity (Q6487594) (← links)
