Papers

  1. Quantifying Node-based Core Resilience
    Jakir Hossain, Sucheta Soundarajan, A. Erdem Sarıyüce
     ECML/PKDD 2023 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases

  2. Skeletal Cores and Graph Resilience
    Danylo Honcharov, A. Erdem Sariyuce, Ricky Laishram, Sucheta Soundarajan
     ECML/PKDD 2023 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases

  3. Using Motif Transitions for Temporal Graph Generation
    Penghang Liu, A. Erdem Sarıyüce
     SIGKDD 2023 - ACM SIGKDD Conference on Knowledge Discovery and Data Mining

  4. On Cohesively Polarized Communities in Signed Networks [pdf] [code]
    Jason Niu, A. Erdem Sarıyüce
     CySoC 2023 - International Workshop on Cyber Social Threats, in conjunction with the Web Conference

  5. Counting Induced 6-cycles in Bipartite Networks [pdf]
    Jason Niu, Jaroslaw Zola, A. Erdem Sarıyüce
     ICPP 2022 - International Conference on Parallel Processing

  6. Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices [pdf]
    Vicky Zheng, A. Erdem Sarıyüce, Jaroslaw Zola
     TCBB 2022 - IEEE/ACM Transactions on Computational Biology and Bioinformatics

  7. Temporal Motifs in Patent Opposition and Collaboration Networks [pdf]
    Penghang Liu, Naoki Masuda, Tomomi Kito, A. Erdem Sarıyüce
     SciRep 2022 - Scientific Reports, 12, 1917

  8. Temporal Network Motifs: Models, Limitations, Evaluation [pdf]
    Penghang Liu, Valerio Guarrasi, A. Erdem Sarıyüce
     TKDE 2021 - IEEE Transactions on Knowledge and Data Engineering

  9. Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks [pdf] [code] [slides] [talk]
    A. Erdem Sarıyüce
     WWW 2021 - The Web Conference

  10. Characterizing and Utilizing the Interplay Between Core and Truss Decompositions [pdf]
    Penghang Liu, A. Erdem Sarıyüce
     BigData 2020 - IEEE International Conference on Big Data

  11. Using Large Cliques for Hierarchical Dense Subgraph Discovery [pdf]
    Moniruzzaman Monir, A. Erdem Sarıyüce,
    CSoNET 2020 - International Conference on Computational Data and Social Networks

  12. Identifying Taxonomic Units in Metagenomic DNA Streams [pdf]
    Vicky Zheng, A. Erdem Sarıyüce, Jaroslaw Zola
     BIOKDD 2020 - Workshop on Data Mining and Bioinformatics, in conjunction with SIGKDD

  13. Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core [pdf]
    Ricky Laishram, A. Erdem Sarıyüce, Tina Eliassi-Rad, Ali Pınar, Sucheta Soundarajan
     SDM 2020 - SIAM International Conference on Data Mining

  14. FLEET: Butterfly Estimation from a Bipartite Graph Stream [pdf] [code]
    Seyed-Vahid Sanei-Mehri, Yu Zhang, A. Erdem Sarıyüce, Srikanta Tirthapura
     CIKM 2019 - ACM International Conference on Information and Knowledge Management

  15. Local Algorithms for Hierarchical Dense Subgraph Discovery [pdf] [code]
    A. Erdem Sarıyüce, C. Seshadhri, Ali Pınar
     VLDB 2019 - International Conference on Very Large Data Bases

  16. Analysis of Core and Truss Decompositions on Real-World Networks
    Penghang Liu, A. Erdem Sarıyüce
     MLG 2019 - Workshop on Mining and Learning with Graphs, in conjunction with SIGKDD

  17. Local Detection of Critical Nodes in Active Graphs [pdf]
    M. Yusuf Özkaya, A. Erdem Sarıyüce, Ali Pınar, Ümit V. Çatalyürek
     ASONAM 2018 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

  18. Butterfly Counting in Bipartite Networks [pdf]
    Seyed-Vahid Sanei-Mehri, A. Erdem Sarıyüce, Srikanta Tirthapura
     SIGKDD 2018 - ACM SIGKDD Conference on Knowledge Discovery and Data Mining

  19. Measuring and Improving the Core Resilience of Networks [pdf]
    Ricky Laishram, A. Erdem Sarıyüce, Tina Eliassi-Rad, Ali Pınar, Sucheta Soundarajan
     WWW 2018 - The Web Conference

  20. Peeling Bipartite Networks for Dense Subgraph Discovery [pdf] [code]
    A. Erdem Sarıyüce, Ali Pınar
     WSDM 2018 - ACM International Conference on Web Search and Data Mining

  21. Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs [pdf]
    A. Erdem Sarıyüce, C. Seshadhri, Ali Pınar, Ümit V. Çatalyürek
     TWEB 2017 - ACM Transactions on the Web, 11(3), 16:1--16:27

  22. Graph Manipulations for Fast Centrality Computation [pdf]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
     TKDD 2017 - ACM Transactions on Knowledge Discovery from Data, 11(3), 26:1--26:25

  23. Fast Hierarchy Construction for Dense Subgraphs [pdf]
    A. Erdem Sarıyüce, Ali Pınar
     VLDB 2017 - International Conference on Very Large Data Bases

  24. Consistent Regions: Guaranteed Tuple Processing in IBM Streams [pdf]
    Gabriela Jacques-Silva, Fang Zheng, Daniel Debrunner, Kun-Lung Wu, Victor Dogaru, Eric Johnson, Michael Spicer, A. Erdem Sarıyüce
     VLDB 2016 - International Conference on Very Large Data Bases, Industrial Track

  25. Incremental k-core Decomposition: Algorithms and Evaluation [pdf] [code]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
     VLDBJ 2016 - Very Large Data Bases Journal, 25(3), 425-447

  26. SONIC: Streaming Overlapping Community Detection [pdf]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
     DAMI 2016 - Data Mining and Knowledge Discovery, 30(4), 819-847

  27. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions [pdf] [code]
    A. Erdem Sarıyüce, C. Seshadhri, Ali Pınar, Ümit V. Çatalyürek
     WWW 2015 - International World Wide Web Conference [Best Paper Runner-up Award]

  28. Incremental Closeness Centrality in Distributed Memory [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
     ParCo 2015 - Parallel Computing, 47, 3-18

  29. Regularizing Graph Centrality Computations [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
     JPDC 2015 - Journal of Parallel and Distributed Computing, 76, 106-119

  30. Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
     MTAAP 2014 - Workshop on Multithreaded Architectures and Applications, in conjunction with IPDPS

  31. Incremental Algorithms for Closeness Centrality [pdf]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
     BigData 2013 - IEEE International Conference on Big Data

  32. STREAMER: A Distributed Framework for Incremental Closeness Centrality Computation [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
     Cluster 2013 - IEEE Cluster Conference

  33. Streaming Algorithms for k-core Decomposition [pdf] [code]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
     VLDB 2013 - International Conference on Very Large Data Bases

  34. Betweenness Centrality on GPUs and Heterogeneous Architectures [pdf] [code]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
     GPGPU 2013 - Workshop on General Purpose Processing Using GPUs, in conjunction with ASPLOS

  35. Shattering and Compressing Networks for Betweenness Centrality [pdf] [code]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
     SDM 2013 - SIAM International Conference on Data Mining

  36. Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP [pdf]
    A. Erdem Sarıyüce, Erik Saule, Ümit V. Çatalyürek
     PCO 2012 - Workshop on Parallel Computing and Optimization, in conjunction with IPDPS

  37. Improving Graph Coloring on Distributed Memory Parallel Computers [pdf]
    A. Erdem Sarıyüce, Erik Saule, Ümit V. Çatalyürek
     HiPC 2011 - International Conference on High Performance Computing

    Ph.D. Thesis

  1. Fast Algorithms for Large-Scale Network Analytics [pdf]
    A. Erdem Sarıyüce
     Ph.D. Dissertation 2015 - Department of Computer Science and Engineering, The Ohio State University

COPYRIGHT: Materials are copyrighted by the corresponding publishers (e.g., ACM, IEEE, Springer, Elsevier, Wiley). You should download them only if you accept and obey the terms and restrictions defined by the respective publishers, including only use the downloaded materials for personal or educational purpose.