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!
- Dec 2017: New paper: 'Measuring and Improving the Core Resilience of Networks', to appear in WWW'18
- Oct 2017: New blog post: 'Trip Report: SC'17'
- Oct 2017: New paper: 'Peeling Bipartite Networks for Dense Subgraph Discovery', to appear in WSDM'18
- Aug 2017: I am teaching a seminar class CSE 701: Large-Scale Graph Mining in Fall'17 semester
- Aug 2017: I joined University at Buffalo, CSE Department as an assistant professor.
- Mar 2017: New work: 'Parallel Local Algorithms for Core, Truss, and Nucleus
Decompositions', on arXiv
- Nov 2016: New work: 'Peeling Bipartite Networks for Dense Subgraph Discovery', on arXiv
- Nov 2016: New paper: 'Graph Manipulations for Fast Centrality Computation', to appear in TKDD
- Aug 2016: New paper: 'Fast Hierarchy Construction for Dense Subgraphs', to appear in VLDB'17
- Sep 2015: Started working at Sandia National Labs as the John von Neumann post-doc fellow.
- May 2015: WWW'15 paper won
the best paper runnner-up award.