A. Erdem Sariyuce
A. Erdem Sariyuce
Assistant Professor, Computer Science & Engineering, University at Buffalo
Verified email at buffalo.edu - Homepage
Title
Cited by
Cited by
Year
Streaming algorithms for k-core decomposition
AE Saríyüce, B Gedik, G Jacques-Silva, KL Wu, ÜV Çatalyürek
Proceedings of the VLDB Endowment 6 (6), 433-444, 2013
1462013
Finding the hierarchy of dense subgraphs using nucleus decompositions
AE Sariyuce, C Seshadhri, A Pinar, UV Catalyurek
Proceedings of the 24th International Conference on World Wide Web, 927-937, 2015
1002015
Betweenness centrality on GPUs and heterogeneous architectures
AE Sariyüce, K Kaya, E Saule, ÜV Çatalyürek
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics …, 2013
812013
Shattering and compressing networks for betweenness centrality
AE Sarıyüce, E Saule, K Kaya, ÜV Çatalyürek
SIAM Data Mining Conference (SDM), 2013
60*2013
Incremental Algorithms for Closeness Centrality
AE Sariyuce, K Kaya, E Saule, UV Catalyurek
Big Data, 2013 IEEE International Conference on, 487-492, 2013
552013
Regularizing graph centrality computations
AE Sarıyüce, E Saule, K Kaya, ÜV Çatalyürek
Journal of Parallel and Distributed Computing 76, 106-119, 2015
512015
Fast hierarchy construction for dense subgraphs
AE Sariyuce, A Pinar
arXiv preprint arXiv:1610.01961, 2016
472016
Incremental k-core decomposition: algorithms and evaluation
AE Sarıyüce, B Gedik, G Jacques-Silva, KL Wu, ÜV Çatalyürek
The VLDB Journal 25 (3), 425-447, 2016
452016
Local algorithms for hierarchical dense subgraph discovery
AE Sariyuce, C Seshadhri, A Pinar
arXiv preprint arXiv:1704.00386, 2017
43*2017
Butterfly counting in bipartite networks
SV Sanei-Mehri, AE Sariyuce, S Tirthapura
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018
422018
Peeling bipartite networks for dense subgraph discovery
AE Sarıyüce, A Pinar
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
402018
Consistent regions: Guaranteed tuple processing in ibm streams
G Jacques-Silva, F Zheng, D Debrunner, KL Wu, V Dogaru, E Johnson, ...
Proceedings of the VLDB Endowment 9 (13), 1341-1352, 2016
272016
Graph manipulations for fast centrality computation
AE Sariyüce, K Kaya, E Saule, ÜV Çatalyürek
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (3), 1-25, 2017
262017
Incremental algorithms for network management and analysis based on closeness centrality
AE Sariyuce, K Kaya, E Saule, UV Catalyurek
arXiv preprint arXiv:1303.0422, 2013
232013
Nucleus decompositions for identifying hierarchy of dense subgraphs
AE Sariyüce, C Seshadhri, A Pinar, ÜV Çatalyürek
ACM Transactions on the Web (TWEB) 11 (3), 1-27, 2017
202017
Measuring and improving the core resilience of networks
R Laishram, AE Sariyüce, T Eliassi-Rad, A Pinar, S Soundarajan
Proceedings of the 2018 World Wide Web Conference, 609-618, 2018
162018
Scalable hybrid implementation of graph coloring using mpi and openmp
AE Sariyüce, E Saule, ÜV Çatalyürek
2012 IEEE 26th International Parallel and Distributed Processing Symposium …, 2012
152012
STREAMER: a distributed framework for incremental closeness centrality computation
AE Sariyüce, E Saule, K Kaya, ÜV Çatalyürek
2013 IEEE International Conference on Cluster Computing (CLUSTER), 1-8, 2013
142013
Improving graph coloring on distributed-memory parallel computers
AE Sarıyüce, E Saule, ÜV Çatalyürek
2011 18th International Conference on High Performance Computing, 1-10, 2011
142011
Hardware/software vectorization for closeness centrality on multi-/many-core architectures
AE Sariyuce, E Saule, K Kaya, ÜV Çatalyürek
2014 IEEE International Parallel & Distributed Processing Symposium …, 2014
132014
The system can't perform the operation now. Try again later.
Articles 1–20