Gossip-based partitioning and replication for Online Social Networks. - Muhammad Anis Uddin Nasir; Fatemeh Rahimian; Sarunas Girdzijauskas (ASONAM, 2014)

The power of both choices: Practical load balancing for distributed stream processing engines. - Muhammad Anis Uddin Nasir; Gianmarco De Francisci Morales; David García-Soriano; Nicolas Kourtellis; Marco Serafini (ICDE, 2015)

Socially-aware distributed hash tables for decentralized online social networks. - Muhammad Anis Uddin Nasir; Sarunas Girdzijauskas; Nicolas Kourtellis (P2P, 2015)

Partial Key Grouping: Load-Balanced Partitioning of Distributed Streams. - Muhammad Anis Uddin Nasir; Gianmarco De Francisci Morales; David García-Soriano; Nicolas Kourtellis; Marco Serafini (CoRR, 2015)

When two choices are not enough: Balancing at scale in Distributed Stream Processing. - Muhammad Anis Uddin Nasir; Gianmarco De Francisci Morales; Nicolas Kourtellis; Marco Serafini (ICDE, 2016)

Top-k densest subgraphs in sliding-window graph streams. - Muhammad Anis Uddin Nasir; Aristides Gionis; Gianmarco De Francisci Morales; Sarunas Girdzijauskas (CoRR, 2016)

Fully Dynamic Algorithm for Top-k Densest Subgraphs. - Muhammad Anis Uddin Nasir; Aristides Gionis; Gianmarco De Francisci Morales; Sarunas Girdzijauskas (CIKM, 2017)

Load Balancing for Skewed Streams on Heterogeneous Cluster. - Muhammad Anis Uddin Nasir; Hiroshi Horii; Marco Serafini; Nicolas Kourtellis; Rudy Raymond; Sarunas Girdzijauskas; Takayuki Osogami (CoRR, 2017)

Mining Frequent Patterns in Evolving Graphs. - Çigdem Aslay; Muhammad Anis Uddin Nasir; Gianmarco De Francisci Morales; Aristides Gionis (CIKM, 2018)

Mining Big and Fast Data: Algorithms and Optimizations for Real-Time Data Processing. - Muhammad Anis Uddin Nasir (2018)

TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs. - Muhammad Anis Uddin Nasir; Çigdem Aslay; Gianmarco De Francisci Morales; Matteo Riondato (ACM Trans. Knowl. Discov. Data, 2021)