The following pages link to Aristides Gionis (Q832668):
Displayed 17 items.
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- A randomized approximation algorithm for computing bucket orders (Q976119) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- Lagrangian relaxations for multiple network alignment (Q1741341) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Ranking with submodular functions on a budget (Q2147409) (← links)
- Activity preserving graph simplification (Q2435687) (← links)
- The network-untangling problem: from interactions to activity timelines (Q2659278) (← links)
- Mining Chains of Relations (Q3113418) (← links)
- k-Anonymization with Minimal Loss of Information (Q3527233) (← links)
- Maintaining Stream Statistics over Sliding Windows (Q4785622) (← links)
- (Q4828995) (← links)