Danai Koutra

I am a Ph.D. Candidate in the Computer Science Department at Carnegie Mellon University advised by Professor Christos Faloutsos. My work focuses on developing scalable algorithms and models for understanding large graphs. To that end, I pursue two approaches: (a) comparison and (b) summarization and pattern mining.

I received my diploma in Electrical and Computer Engineering at the National Technical University of Athens in 2010. During my senior year, I was advised by Professor Timos Sellis and co-advised by Thanasis Vergoulis and Dr. Theodore Dalamagas.

Research Interests: large-scale graph mining, graph similarity, graph matching, graph summarization, graph anomaly and event detection, machine learning


Selected publications