Sariyuce, Ahmet Erdem

1. Butterfly Counting in Bipartite Networks
   2017/12/31 by Sanei-Mehri, Seyed-Vahid, Sariyuce, Ahmet Erdem, Tirthapura, Srikanta · 2 citations
   #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
   2014/11/12 by Ahmet Erdem Sarıyüce, Ahmet Erdem Sariyuce, Sariyuce, Ahmet Erdem +8 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Management and Algorithms #FOS: Computer and information sciences #Social and Information Networks (cs.SI) #cs.SI