Ahmet Erdem Sarıyüce

Author

Also Known As

A. Erdem Sarıyüce, A. Sariyuce, Ahmet Erdem Sariyuce, Ahmet Erdem Sariyüce, Ahmet Erdem Saríyüce, Ahmet Erdem Sarıyüce, Ahmet Sariyuce, Masuda, Naoki, Sariyuce, A. Erdem, Sariyuce, Ahmet Erdem

Publications

1.2K

Citations

H-Index

Concepts

All Affiliations

The Ohio State University University at Buffalo, State University of New York Sandia National Laboratories California University of North Carolina at Charlotte Bilkent University

About

Ahmet Erdem Sarıyüce is an author at The Ohio State University specializing in engineering, computer science, and data science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	15	20	1K
2	Business	11	11	796
3	Education	2	2	47
4	Computer Engineering	2	2	25
5	Communication	1	1	13

Ahmet Erdem Sarıyüce

Publications

1.1K

Citations

H-Index

Page 1

	Year	Citations
Streaming algorithms for k-core decomposition Ahmet Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Proceedings of the VLDB Endowment Cluster ComputingEngineeringCommunity MiningNetwork AnalysisStreaming Algorithm	2013	183
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions Ahmet Erdem Sarıyüce, C. Seshadhri, Ümit V. Çatalyürek Cluster ComputingEngineeringNetwork AnalysisComputational ComplexityGraph Processing	2015	135
Peeling Bipartite Networks for Dense Subgraph Discovery Ahmet Erdem Sarıyüce, Ali Pinar EngineeringCommunity MiningNetwork AnalysisSemantic WebLink Prediction	2018	105
Incremental k-core decomposition: algorithms and evaluation Ahmet Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, The VLDB Journal EngineeringComplexity ReductionIncremental K-core DecompositionComputational ComplexityAtomic Decomposition	2016	95
Betweenness centrality on GPUs and heterogeneous architectures Ahmet Erdem Sarıyüce, Kamer Kaya, Érik Saule, Cluster ComputingHeterogeneous ComputingEngineeringDistributed AlgorithmsComputer Architecture	2013	79
Fast hierarchy construction for dense subgraphs Ahmet Erdem Sarıyüce Proceedings of the VLDB Endowment Cluster ComputingEngineeringNetwork AnalysisGraph MiningSmaller Dense Subgraphs	2016	76
Incremental algorithms for closeness centrality Ahmet Erdem Sarıyüce, Kamer Kaya, Érik Saule, Cluster ComputingEngineeringCommunity MiningNetwork AnalysisCentrality Metrics	2013	60
Regularizing graph centrality computations Ahmet Erdem Sarıyüce, Érik Saule, Kamer Kaya, Journal of Parallel and Distributed Computing Cluster ComputingNetwork ScienceGraph TheoryData ScienceEngineering	2014	46
Shattering and Compressing Networks for Betweenness Centrality Ahmet Erdem Sarıyüce, Érik Saule, Kamer Kaya,	2013	40
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs Ahmet Erdem Sarıyüce, C. Seshadhri, Ümit V. Çatalyürek ACM Transactions on the Web Cluster ComputingEngineeringNetwork AnalysisEducationComplexity	2017	34

Page 1