The following pages link to Gianlorenzo D'Angelo (Q385948):
Displaying 15 items.
- (Q4967220) (← links)
- Generalized budgeted submodular set function maximization (Q5005131) (← links)
- Fairness in Influence Maximization through Randomization (Q5076357) (← links)
- Multi-winner Election Control via Social Influence (Q5100968) (← links)
- Selecting nodes and buying links to maximize the information diffusion in a network (Q5111292) (← links)
- Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering (Q5147536) (← links)
- Engineering graph-based models for dynamic timetable information systems (Q5240129) (← links)
- Flow Problems in Multi-Interface Networks (Q5268319) (← links)
- Scheduling Real-Time Mixed-Criticality Jobs (Q5274656) (← links)
- Recoverable Robust Timetables: An Algorithmic Approach on Trees (Q5280617) (← links)
- Delay Management Problem: Complexity Results and Robust Algorithms (Q5505683) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)
- Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers (Q6490964) (← links)
- Budgeted out-tree maximization with submodular prizes (Q6602425) (← links)