Sozio, Mauro
A distributed algorithm for large-scale generalized matching
2013 Manshadi, F. M.; Awerbuch, B.; Gemulla, R.; Khandekar, R.; Mestre, J.; Sozio, Mauro
AutoML: state of the art with a focus on anomaly detection, challenges, and research directions
2022 Bahri, Maroua; Salutari, Flavia; Putina, Andrian; Sozio, Mauro
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier
2021 Sozio, Mauro; Hubert Chan, T. -H.; Sun:, Bintao
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier
2019 Hubert Chan, T. -H.; Sozio, Mauro; Sun, B.
Efficient Densest Subgraph Computation in Evolving Graphs
2015 Epasto, A.; Lattanzi, S.; Sozio, Mauro
Efficient Streaming Algorithms for Graphlet Sampling
2024 Bourreau, Yann; Bressan, Marco; Hubert Chan, T. (-)H.; Kuang, Qipeng; Sozio, Mauro
Fast primal-dual distributed algorithms for scheduling and matching problems
2010 Panconesi, Alessandro; Sozio, Mauro
Finding events in temporal networks: segmentation meets densest subgraph discovery
2020 Rozenshtein, Polina; Bonchi, Francesco; Gionis, Aristides; Sozio, Mauro; Tatti, Nikolaj
Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery
2018 Rozenshtein, Polina; Bonchi, Francesco; Gionis, Aristides; Sozio, Mauro; Tatti, Nikolaj
Finding Heaviest k-Subgraphs and Events in Social Media
2016 Letsios, Matthaios; Balalau, Oana Denisa; Danisch, Maximilien; Orsini, Emmanuel; Sozio, Mauro
Finding Subgraphs with Maximum Total Density and Limited Overlap
2015 Balalau, Oana Denisa; Bonchi, Francesco; Chan, T-H. Hubert; Gullo, Francesco; Sozio, Mauro
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs
2024 Balalau, Oana; Bonchi, Francesco; Hubert Chan, T. (-)H.; Gullo, Francesco; Sozio, Mauro; Xie, Hao
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs
2020 Sun, Bintao; Hubert Chan, T. -H.; Sozio, Mauro
Fully Dynamic k-Center Clustering With Improved Memory Efficiency
2022 Hubert Chan, T. (-)H.; Guerquin, Arnaud; Hu, Shuguang; Sozio, Mauro
Fully Dynamic k-Center Clustering with Outliers
2024 Hubert Chan, T. (-)H.; Lattanzi, Silvio; Sozio, Mauro; Wang, Bo
Fully Dynamic k-Center Clustering with Outliers
2022 Hubert Chan, T. (-)H.; Lattanzi, Silvio; Sozio, Mauro; Wang, Bo
Fully Dynamick-Center Clustering
2018 Chan, T-H. Hubert; Guerqin, Arnaud; Sozio, Mauro
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
2024 Bressan, Marco; Sozio, Mauro
Fully-Dynamic Decision Trees
2023 Bressan, Marco; Damay, Gabriel; Sozio, Mauro
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
2020 Su, Bintao; Danisch, Maximilien; Hubert Chan, T. -H.; Sozio, Mauro
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A distributed algorithm for large-scale generalized matching | 2013 | Manshadi, F. M.; Awerbuch, B.; Gemulla, R.; Khandekar, R.; Mestre, J.; Sozio, Mauro | |
| AutoML: state of the art with a focus on anomaly detection, challenges, and research directions | 2022 | Bahri, Maroua; Salutari, Flavia; Putina, Andrian; Sozio, Mauro | |
| Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier | 2021 | Sozio, Mauro; Hubert Chan, T. -H.; Sun:, Bintao | |
| Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier | 2019 | Hubert Chan, T. -H.; Sozio, Mauro; Sun, B. | |
| Efficient Densest Subgraph Computation in Evolving Graphs | 2015 | Epasto, A.; Lattanzi, S.; Sozio, Mauro | |
| Efficient Streaming Algorithms for Graphlet Sampling | 2024 | Bourreau, Yann; Bressan, Marco; Hubert Chan, T. (-)H.; Kuang, Qipeng; Sozio, Mauro | |
| Fast primal-dual distributed algorithms for scheduling and matching problems | 2010 | Panconesi, Alessandro; Sozio, Mauro | |
| Finding events in temporal networks: segmentation meets densest subgraph discovery | 2020 | Rozenshtein, Polina; Bonchi, Francesco; Gionis, Aristides; Sozio, Mauro; Tatti, Nikolaj | |
| Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery | 2018 | Rozenshtein, Polina; Bonchi, Francesco; Gionis, Aristides; Sozio, Mauro; Tatti, Nikolaj | |
| Finding Heaviest k-Subgraphs and Events in Social Media | 2016 | Letsios, Matthaios; Balalau, Oana Denisa; Danisch, Maximilien; Orsini, Emmanuel; Sozio, Mauro | |
| Finding Subgraphs with Maximum Total Density and Limited Overlap | 2015 | Balalau, Oana Denisa; Bonchi, Francesco; Chan, T-H. Hubert; Gullo, Francesco; Sozio, Mauro | |
| Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs | 2024 | Balalau, Oana; Bonchi, Francesco; Hubert Chan, T. (-)H.; Gullo, Francesco; Sozio, Mauro; Xie, Hao | |
| Fully Dynamic Approximate k-Core Decomposition in Hypergraphs | 2020 | Sun, Bintao; Hubert Chan, T. -H.; Sozio, Mauro | |
| Fully Dynamic k-Center Clustering With Improved Memory Efficiency | 2022 | Hubert Chan, T. (-)H.; Guerquin, Arnaud; Hu, Shuguang; Sozio, Mauro | |
| Fully Dynamic k-Center Clustering with Outliers | 2024 | Hubert Chan, T. (-)H.; Lattanzi, Silvio; Sozio, Mauro; Wang, Bo | |
| Fully Dynamic k-Center Clustering with Outliers | 2022 | Hubert Chan, T. (-)H.; Lattanzi, Silvio; Sozio, Mauro; Wang, Bo | |
| Fully Dynamick-Center Clustering | 2018 | Chan, T-H. Hubert; Guerqin, Arnaud; Sozio, Mauro | |
| Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees | 2024 | Bressan, Marco; Sozio, Mauro | |
| Fully-Dynamic Decision Trees | 2023 | Bressan, Marco; Damay, Gabriel; Sozio, Mauro | |
| KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | Su, Bintao; Danisch, Maximilien; Hubert Chan, T. -H.; Sozio, Mauro |