The following pages link to Luisa Gargano (Q392207):
Displaying 17 items.
- How Much Independent Should Individual Contacts Be to Form a Small–World? (Q5459128) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492864) (← links)
- Fault-tolerant minimum broadcast networks (Q5689764) (← links)
- Optimally Fast Data Gathering in Sensor Networks (Q5756706) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- Efficient algorithms for chemical threshold testing problems (Q5941290) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← 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)
- 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)
- 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)
- Parameterized Complexity of (d,r)-Domination via Modular Decomposition (Q6759075) (← links)