Seyed-Vahid Sanei-Mehri

According to our database, Seyed-Vahid Sanei-Mehri authored at least 7 papers between 2018 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Mining Largest Maximal Quasi-Cliques.

Seyed-Vahid Sanei-Mehri, Apurba Das, Hooman Hashemi, Srikanta Tirthapura

ACM Trans. Knowl. Discov. Data, 2021

2020

Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs.

Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura

ACM Trans. Parallel Comput., 2020

2019

FLEET: Butterfly Estimation from a Bipartite Graph Stream.

Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Counting Butterfies from a Large Bipartite Graph Stream.

Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura

CoRR, 2018

Butterfly Counting in Bipartite Networks.

Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Shared-Memory Parallel Maximal Clique Enumeration.

Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura

Proceedings of the 25th IEEE International Conference on High Performance Computing, 2018

Enumerating Top-k Quasi-Cliques.

Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018