Assistant Professor

Dr. Charalampos Tsourakakis received his Ph.D. from the Algorithms, Combinatorics and Optimization (ACO) program at Carnegie Mellon University, and served as a Postdoctoral Fellow in Harvard University. He holds a Diploma in Electrical and Diploma Engineering from the National  Technical University of Athens and a Master of Science from the Machine  Learning Department at Carnegie Mellon University. Before joining Boston University, he worked as a researcher in the Google Brain team.

He won a best paper award in IEEE Data Mining, has delivered three tutorials in  the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, and has designed two graph mining libraries for large-scale graph mining, one of which has been officially included in Windows Azure. His research focuses on large-scale graph mining, and machine learning.

Selected Publications

  • Scalable motif-aware graph clustering
    26th International World Wide Web Conference (WWW 2017)
    Co-authors: Michael Mitzenmacher, Jakub Pachocki
  • The k-clique Densest Subgraph Problem
    24th International World Wide Web Conference (WWW 2015)
  • Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015)
    Co-authors: Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Shen Chen Xu
  • Space and Time-Efficient Algorithms for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
    47th ACM Symposium on Theory of Computing (STOC 2015)
    Co-authors: Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai

Personal Website