A. Erdem Sarıyüce

Assistant Professor

Computer Science & Engineering
University at Buffalo

erdem at buffalo dot edu
323 Davis Hall, Buffalo, NY 14260
Office Hours: Wed, 2-4 (Fall'18)

I am an assistant professor in the Department of Computer Science and Engineering at the University at Buffalo. Previously, I was the John von Neumann Post-doctoral Fellow at Sandia National Labs in Livermore, CA, working with Ali Pinar. My research is on large-scale graph mining. I develop algorithms to enable practical and insightful graph analytics for real-world data which can be large, streaming, incomplete, and noisy. 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). You can pronounce my first name like this.

I am looking for self-motivated Ph.D. and M.S. students!

Recent News

  • Aug 2018: New paper: 'Local Algorithms for Hierarchical Dense Subgraph Discovery', to appear in VLDB'19
  • June 2018: New paper: 'Local Detection of Critical Nodes in Active Graphs', to appear in ASONAM'18
  • May 2018: New paper: 'Butterfly Counting in Bipartite Networks', to appear in KDD'18
  • Jan 2018: I am teaching CSE 610: Special Topics in Network Science in Spring'18 semester
  • Dec 2017: New paper: 'Measuring and Improving the Core Resilience of Networks', to appear in WWW'18
  • Oct 2017: New paper: 'Peeling Bipartite Networks for Dense Subgraph Discovery', to appear in WSDM'18
  • Aug 2017: I joined University at Buffalo, CSE Department as an assistant professor.

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 (to appear)

  • 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

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.