publications

  1. Parallel Louvain Algorithms with Convergence Guarantee
    J. Niu, M. Özkaya, A. E. Sarıyüce, and Ü. Çatalyürek
    IPDPS 2026 - IEEE International Parallel and Distributed Processing Symposium
    PDF Code
  2. Robustness of Truss Decomposition and Implications for GNN-based Edge Classification
    J. Hossain, S. Soundarajan, and A. E. Sarıyüce
    GTA3 2025 - Workshop on Graph Techniques for Adversarial Activity Analytics, in conjunction with ICDM
    PDF Code
  3. Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms
    P. Liu, B. Altun, R. Acharyya, R. Tillman, S. Kimura, N. Masuda, and A. E. Sarıyüce
    ASONAM 2025 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
    PDF Code Extended
  4. Characterizing and Locating Polarized Communities in Signed Networks
    J. Niu, and A. E. Sarıyüce
    KAIS 2025 - Knowledge and Information Systems
    PDF Code
  5. A Powerful Lens for Temporal Network Analysis: Temporal Motifs
    A. E. Sarıyüce
    DiscoverData 2025 - Discover Data
    PDF
  6. Density-aware Walks for Coordinated Campaign Detection
    A. Gopalakrishnan, J. Hossain, T. Elmas, and A. E. Sarıyüce
    ECML/PKDD 2025 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    PDF Code
  7. Fast Counting and Utilizing Induced 6-Cycles in Bipartite Networks
    J. Niu, J. Zola, and A. E. Sarıyüce
    TKDE 2025 - IEEE Transactions on Knowledge and Data Engineering
    PDF Code
  8. Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends
    A. Gopalakrishnan, J. Hossain, T. Elmas, and A. E. Sarıyüce
    ICWSM 2025 - International Conference on Web and Social Media
    PDF Code Dataset
  9. Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter
    Z. An, J. Breuhaus, J. Niu, A. E. Sarıyüce, and K. Joseph
    ICWSM 2024 - International Conference on Web and Social Media
    PDF
  10. From Words to Actions: A Comprehensive Approach to Identifying Incel Behavior on Reddit
    A. Demirbas, J. Hossain, and A. E. Sarıyüce
    DCAI 2024 - International Workshop on Data-Centric AI, in conjunction with BigData
    PDF Code
  11. Retrieving Top-k Hyperedge Triplets: Models and Applications
    J. Niu, I. Amburg, S. Aksoy, and A. E. Sarıyüce
    BigData 2024 - IEEE International Conference on Big Data
    PDF Code
  12. Skeletal Cores and Graph Resilience
    D. Honcharov, A. E. Sarıyüce, R. Laishram, and S. Soundarajan
    ECML/PKDD 2023 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    PDF Code
  13. Quantifying Node-Based Core Resilience
    J. Hossain, S. Soundarajan, and A. E. Sarıyüce
    ECML/PKDD 2023 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
    PDF Code
  14. Using Motif Transitions for Temporal Graph Generation
    P. Liu, and A. E. Sarıyüce
    SIGKDD 2023 - ACM International Conference on Knowledge Discovery & Data Mining
    PDF Code
  15. On Cohesively Polarized Communities in Signed Networks
    J. Niu, and A. E. Sarıyüce
    CySoc 2023 - International Workshop on Cyber Social Threats, in conjunction with WWW
    PDF Code
  16. Counting Induced 6-Cycles in Bipartite Graphs
    J. Niu, J. Zola, and A. E. Sarıyüce
    ICPP 2022 - International Conference on Parallel Processing
    PDF Code
  17. Temporal Motifs in Patent Opposition and Collaboration Networks
    P. Liu, N. Masuda, T. Kito, and A. E. Sarıyüce
    SciRep 2022 - Scientific Reports
    PDF Extended
  18. Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices
    V. Zheng, A. E. Sarıyüce, and J. Zola
    TCBB 2022 - IEEE/ACM Transactions on Computational Biology and Bioinformatics
    PDF Code
  19. Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks
    A. E. Sarıyüce
    WWW 2021 - The Web Conference
    PDF Code
  20. Temporal Network Motifs: Models, Limitations, Evaluation
    P. Liu, V. Guarrasi, and A. E. Sarıyüce
    TKDE 2021 - IEEE Transactions on Knowledge and Data Engineering
    PDF Code
  21. Using Large Cliques for Hierarchical Dense Subgraph Discovery
    M. Monir, and A. E. Sarıyüce
    CSoNET 2020 - International Conference on Computational Data and Social Networks
    PDF Code Best Paper Runner-up
  22. Characterizing and Utilizing the Interplay Between Core and Truss Decompositions
    P. Liu, and A. E. Sarıyüce
    BigData 2020 - IEEE International Conference on Big Data
    PDF Code
  23. 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
    SDM 2020 - SIAM International Conference on Data Mining
    PDF Code
  24. Identifying Taxonomic Units in Metagenomic DNA Streams
    V. Zheng, A. E. Sarıyüce, and J. Zola
    BIOKDD 2020 - International Workshop on Data Mining in Bioinformatics, in conjunction with SIGKDD
    PDF Code
  25. FLEET: Butterfly Estimation from a Bipartite Graph Stream
    S. Sanei-Mehri, Y. Zhang, A. E. Sarıyüce, and S. Tirthapura
    CIKM 2019 - ACM International Conference on Information and Knowledge Management
    PDF Code
  26. Analysis of Core and Truss Decompositions on Real-world Networks
    P. Liu, and A. Sarıyüce
    MLG 2019 - International Workshop on Mining and Learning with Graphs, in conjunction with SIGKDD
    PDF
  27. Local Algorithms for Hierarchical Dense Subgraph Discovery
    A. E. Sarıyüce, C. Seshadhri, and A. Pinar
    VLDB 2019 - International Conference on Very Large Data Bases
    PDF Code
  28. Butterfly Counting in Bipartite Networks
    S. Sanei-Mehri, A. E. Sarıyüce, and S. Tirthapura
    SIGKDD 2018 - ACM International Conference on Knowledge Discovery & Data Mining
    PDF Code
  29. Local Detection of Critical Nodes in Active Graphs
    M. Özkaya, A. E. Sarıyüce, A. Pinar, and Ü. Çatalyürek
    ASONAM 2018 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
    PDF
  30. Measuring and Improving the Core Resilience of Networks
    R. Laishram, A. E. Sarıyüce, T. Eliassi-Rad, A. Pinar, and S. Soundarajan
    WWW 2018 - The Web Conference
    PDF
  31. Peeling Bipartite Networks for Dense Subgraph Discovery
    A. E. Sarıyüce, and A. Pinar
    WSDM 2018 - ACM International Conference on Web Search and Data Mining
    PDF Code
  32. Fast Hierarchy Construction for Dense Subgraphs
    A. E. Sarıyüce, and A. Pinar
    VLDB 2017 - International Conference on Very Large Data Bases
    PDF Code
  33. Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs
    A. E. Sarıyüce, C. Seshadhri, A. Pinar, and Ü. Çatalyürek
    TWEB 2017 - ACM Transactions on the Web
    PDF Code
  34. Graph Manipulations for Fast Centrality Computation
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    TKDD 2017 - ACM Transactions on Knowledge Discovery from Data
    PDF
  35. SONIC: Streaming Overlapping Community Detection
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    DAMI 2016 - Data Mining and Knowledge Discovery
    PDF
  36. Incremental k-core Decomposition: Algorithms and Evaluation
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    VLDBJ 2016 - The VLDB Journal
    PDF Code
  37. 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
    VLDB 2016 - International Conference on Very Large Data Bases, Industrial Track
    PDF
  38. Incremental Closeness Centrality in Distributed Memory
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    ParCo 2015 - Parallel Computing
    PDF
  39. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
    A. E. Sarıyüce, C. Seshadhri, A. Pinar, and Ü. Çatalyürek
    WWW 2015 - International Conference on World Wide Web
    PDF Code Best Paper Runner-up
  40. Regularizing Graph Centrality Computations
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    JPDC 2015 - Journal of Parallel and Distributed Computing
    PDF
  41. Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-core Architectures
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    MTAAP 2014 - Workshop on Multithreaded Architectures and Applications, in conjunction with IPDPS
    PDF
  42. Incremental Algorithms for Closeness Centrality
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    BigData 2013 - IEEE International Conference on Big Data
    PDF
  43. STREAMER: A Distributed Framework for Incremental Closeness Centrality Computation
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    Cluster 2013 - IEEE International Conference on Cluster Computing
    PDF
  44. Streaming Algorithms for k-core Decomposition
    A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. Çatalyürek
    VLDB 2013 - International Conference on Very Large Data Bases
    PDF Code
  45. Shattering and Compressing Networks for Betweenness Centrality
    A. E. Sarıyüce, E. Saule, K. Kaya, and Ü. Çatalyürek
    SDM 2013 - SIAM Data Mining Conference
    PDF Code
  46. Betweenness Centrality on GPUs and Heterogeneous Architectures
    A. E. Sarıyüce, K. Kaya, E. Saule, and Ü. Çatalyürek
    GPGPU 2013 - Workshop on General Purpose Processor Using GPUs, in conjunction with ASPLOS
    PDF Code
  47. Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP
    A. E. Sarıyüce, E. Saule, and Ü. Çatalyürek
    PCO 2012 - Workshop on Parallel Computing and Optimization, in conjunction with IPDPS
    PDF
  48. Improving Graph Coloring on Distributed-memory Parallel Computers
    A. E. Sarıyüce, E. Saule, and Ü. Çatalyürek
    HiPC 2011 - International Conference on High Performance Computing
    PDF