A. Erdem Sarıyüce*

Assistant Professor
Department of Computer Science & Engineering
University at Buffalo

erdem at buffalo dot edu
323 Davis Hall, Buffalo, NY 14260
Office Hours (Fall 2020): W 12:00-2:00pm over Zoom (UB students only)

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.

Previously, I was the John von Neumann Post-doctoral Fellow at Sandia National Labs in Livermore, CA. I got my Ph.D. from the Computer Science and Engineering Department at the Ohio State University under the supervision of Ümit V. Çatalyürek (now at Georgia Tech).

Recent News

  • 08/2020: Selected as Distinguished Review Board Member at PVLDB 2020
  • 03/2020: New grant: JP Morgan Chase and Company, Faculty Research Award
  • 12/2019: New paper: 'Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core', to appear in SDM'20.
  • 09/2019: New grant: 'Resilience Analysis for Core Decomposition in Real-World Networks', thanks to NSF!
  • 08/2019: New paper: 'FLEET: Butterfly Estimation from a Bipartite Graph Stream', to appear in CIKM'19.
  • 06/2019: New paper with my student Penghang Liu: 'Analysis of Core and Truss Decomposition on Real-World Networks', to appear in MLG workshop (in conj. with SIGKDD'19).
  • 08/2018: New paper: 'Local Algorithms for Hierarchical Dense Subgraph Discovery', to appear in VLDB'19.
  • 06/2018: New paper: 'Local Detection of Critical Nodes in Active Graphs', to appear in ASONAM'18.
  • 05/2018: New paper: 'Butterfly Counting in Bipartite Networks', to appear in SIGKDD'18.

Selected Publications (full list)

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

  • 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

  • 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

Ph.D. students

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.