( en | de | ru )

 

Disambiguation of "Sariyüce, Ahmet Erdem"

Author of the publication

copydeleteadd this publication to your clipboard
Shattering and Compressing Networks for Betweenness Centrality.

, , , and . SDM, page 686-694. SIAM, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hikmet Ahmet

Hajrullah Ahmeti

Refik Erdem

Erol Erdem

Murad Erdemir

 

Other publications of authors with the same name

Incremental closeness centrality in distributed memory., , , and . Parallel Comput., (2015)FLEET: Butterfly Estimation from a Bipartite Graph Stream., , , and . CIKM, page 1201-1210. ACM, (2019)Quantifying Node-Based Core Resilience., , and . ECML/PKDD (3), volume 14171 of Lecture Notes in Computer Science, page 259-276. Springer, (2023)Characterizing and Utilizing the Interplay Between Core and Truss Decompositions., and . IEEE BigData, page 957-962. IEEE, (2020)Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter., , , , and . ICWSM, page 70-85. AAAI Press, (2024)Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (2): 1092-1103 (March 2023)Temporal Network Motifs: Models, Limitations, Evaluation., , and . IEEE Trans. Knowl. Data Eng., 35 (1): 945-957 (2023)Using Motif Transitions for Temporal Graph Generation., and . KDD, page 1501-1511. ACM, (2023)Counting Butterfies from a Large Bipartite Graph Stream., , , and . CoRR, (2018)Shattering and Compressing Networks for Betweenness Centrality., , , and . SDM, page 686-694. SIAM, (2013)