publications

  1. ICWSM 2024
    Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter
    Z. An, J. Niu, J. Breuhaus, A. E. Sarıyüce, and K. Joseph
    International Conference on Web and Social Media
    PDF Code
  2. ECML/PKDD 2023
    Quantifying Node-Based Core Resilience
    J. Hossain, S. Soundarajan, and A. E. Sarıyüce
    European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    PDF Code
  3. ECML/PKDD 2023
    Skeletal Cores and Graph Resilience
    D. Honcharov, A. E. Sarıyüce, R. Laishram, and S. Soundarajan
    European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    PDF
  4. SIGKDD 2023
    Using Motif Transitions for Temporal Graph Generation
    P. Liu, and A. E. Sarıyüce
    ACM International Conference on Knowledge Discovery & Data Mining
    PDF Code
  5. CySoc 2023
    On Cohesively Polarized Communities in Signed Networks
    J. Niu, and A. E. Sarıyüce
    International Workshop on Cyber Social Threats, in conjunction with WWW
    PDF Code
  6. ICPP 2022
    Counting Induced 6-Cycles in Bipartite Graphs
    J. Niu, J. Zola, and A. E. Sarıyüce
    International Conference on Parallel Processing
    PDF Code
  7. TCBB 2022
    Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices
    V. Zheng, A. E. Sarıyüce, and J. Zola
    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    PDF
  8. SciRep 2022
    Temporal Motifs in Patent Opposition and Collaboration Networks
    P. Liu, N. Masuda, T. Kito, and A. E. Sarıyüce
    Scientific Reports
    PDF
  9. TKDE 2021
    Temporal network motifs: Models, Limitations, Evaluation
    P. Liu, V. Guarrasi, and A. E. Sarıyüce
    IEEE Transactions on Knowledge and Data Engineering
    PDF
  10. WWW 2021
    Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks
    A. E. Sarıyüce
    The Web Conference
    PDF Code
  11. CSoNET 2020
    Using Large Cliques for Hierarchical Dense Subgraph Discovery
    M. Monir, and A. E. Sarıyüce
    International Conference on Computational Data and Social Networks
    PDF Code Best Paper Runner-up
  12. BigData 2020
    Characterizing and Utilizing the Interplay Between Core and Truss Decompositions
    P. Liu, and A. E. Sarıyüce
    IEEE International Conference on Big Data
    PDF Code
  13. SDM 2020
    Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core
    R. Laishram, A. E. Sarıyüce, T. Eliassi-Rad, A. Pinar, and S. Soundarajan
    SIAM International Conference on Data Mining
    PDF Code
  14. BIOKDD 2020
    Identifying Taxonomic Units in Metagenomic DNA Streams
    V. Zheng, A. E. Sarıyüce, and J. Zola
    International Workshop on Data Mining in Bioinformatics, in conjunction with SIGKDD
    PDF
  15. CIKM 2019
    FLEET: Butterfly Estimation from a Bipartite Graph Stream
    S. Sanei-Mehri, Y. Zhang, A. E. Sarıyüce, and S. Tirthapura
    ACM International Conference on Information and Knowledge Management
    PDF Code
  16. VLDB 2019
    Local Algorithms for Hierarchical Dense Subgraph Discovery
    A. E. Sarıyüce, C. Seshadhri, and A. Pinar
    International Conference on Very Large Data Bases
    PDF Code
  17. MLG 2019
    Analysis of Core and Truss Decompositions on Real-world Networks
    P. Liu, and A. Sarıyüce
    International Workshop on Mining and Learning with Graphs, in conjunction with SIGKDD
    PDF
  18. SIGKDD 2018
    Butterfly Counting in Bipartite Networks
    S. Sanei-Mehri, A. E. Sarıyüce, and S. Tirthapura
    ACM International Conference on Knowledge Discovery & Data Mining
    PDF Code
  19. ASONAM 2018
    Local Detection of Critical Nodes in Active Graphs
    M. Özkaya, A. E. Sarıyüce, A. Pinar, and Ü. Çatalyürek
    IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
    PDF
  20. WWW 2018
    Measuring and Improving the Core Resilience of Networks
    R. Laishram, A. E. Sarıyüce, T. Eliassi-Rad, A. Pinar, and S. Soundarajan
    The Web Conference
    PDF
  21. WSDM 2018
    Peeling Bipartite Networks for Dense Subgraph Discovery
    A. E. Sarıyüce, and A. Pinar
    ACM International Conference on Web Search and Data Mining
    PDF Code
  22. VLDB 2017
    Fast Hierarchy Construction for Dense Subgraphs
    A. E. Sarıyüce, and A. Pinar
    International Conference on Very Large Data Bases
    PDF Code
  23. TWEB 2017
    Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs
    A. E. Sarıyüce, C. Seshadhri, A. Pinar, and Ü. Çatalyürek
    ACM Transactions on the Web
    PDF Code
  24. TKDD 2017
    Graph Manipulations for Fast Centrality Computation
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    ACM Transactions on Knowledge Discovery from Data
    PDF
  25. DAMI 2016
    SONIC: Streaming Overlapping Community Detection
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    Data Mining and Knowledge Discovery
    PDF
  26. VLDB 2016
    Consistent Regions: Guaranteed Tuple Processing in IBM Streams
    G. Jacques-Silva, F. Zheng, D. Debrunner, K. Wu, V. Dogaru, E. Johnson, M. Spicer, and A. E. Sarıyüce
    International Conference on Very Large Data Bases, Industrial Track
    PDF
  27. VLDBJ 2016
    Incremental k-core Decomposition: Algorithms and Evaluation
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    The VLDB Journal
    PDF Code
  28. ParCo 2015
    Incremental Closeness Centrality in Distributed Memory
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    Parallel Computing
    PDF
  29. WWW 2015
    Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
    A. E. Sarıyüce, C. Seshadhri, A. Pinar, and Ü. Çatalyürek
    International Conference on World Wide Web
    PDF Code Best Paper Runner-up
  30. JPDC 2015
    Regularizing Graph Centrality Computations
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    Journal of Parallel and Distributed Computing
    PDF
  31. MTAAP 2014
    Hardware/software Vectorization for Closeness Centrality on Multi-/many-core Architectures
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    Workshop on Multithreaded Architectures and Applications, in conjunction with IPDPS
    PDF
  32. BigData 2013
    Incremental Algorithms for Closeness Centrality
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    IEEE International Conference on Big Data
    PDF
  33. Cluster 2013
    STREAMER: A Distributed Framework for Incremental Closeness Centrality Computation
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    IEEE International Conference on Cluster Computing
    PDF
  34. VLDB 2013
    Streaming algorithms for k-core decomposition
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    International Conference on Very Large Data Bases
    PDF Code
  35. SDM 2013
    Shattering and Compressing Networks for Betweenness Centrality
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    SIAM Data Mining Conference
    PDF Code
  36. GPGPU 2013
    Betweenness Centrality on GPUs and Heterogeneous Architectures
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    Workshop on General Purpose Processor Using GPUs, in conjunction with ASPLOS
    PDF Code
  37. PCO 2012
    Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP
    A. E. Sarıyüce, E. Saule, and Ü. Çatalyürek
    Workshop on Parallel Computing and Optimization, in conjunction with IPDPS
    PDF
  38. HiPC 2011
    Improving Graph Coloring on Distributed-memory Parallel Computers
    A. E. Sarıyüce, E. Saule, and Ü. Çatalyürek
    International Conference on High Performance Computing
    PDF

thesis

  1. Dissertation 2015
    Fast Algorithms for Large-Scale Network Analytics
    A. E. Sarıyüce
    Department of Computer Science and Engineering, The Ohio State University
    PDF