I am an assistant professor in the Department of Computer Science and Engineering at the University at Buffalo. My research is on large-scale graph mining and management. I develop algorithms to enable practical and insightful graph analytics for the real-world data which can be large, streaming, incomplete, and noisy.

Recent News

• 03/2023: New promotion: I got tenure! I'm promoted to Associate Professor effective of Sep 2023. Thanks to all involved!
• 03/2023: New grant: 'CAREER: Temporal Network Analysis: Models, Algorithms, and Applications', thanks to NSF!
• 09/2022: New paper: 'Counting Induced 6-Cycles in Bipartite Graphs', to appear in ICPP'22
• 09/2021: New grant: 'Fast Tools for Complex Event Detection over Bipartite Graph Streams', thanks to NSF!
• 05/2021: New paper: 'Temporal Network Motifs: Models, Limitations, Evaluation', to appear in TKDE (arXiv version)
• 01/2021: New paper: 'Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks', to appear in WWW'21
• 01/2021: New award: University at Buffalo SEAS Early Career Researcher of the Year, 2020
• 09/2020: New pre-print: 'Temporal Network Motifs: Models, Limitations, Evaluation', on arXiv.
• 08/2020: New award: Distinguished Review Board Member at PVLDB 2020

Selected Publications (full list)

• 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


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


• 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


• 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


• 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


• 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]

Ph.D. students

• Penghang Liu
• Jason Niu
• Md. Jakir Hossain

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.