Evimaria Terzi

Evimaria Terzi 

Associate Professor
Computer Science Department MCS 280
Boston University
111 Cummington Street
Boston, MA, 02215
http://www.cs.bu.edu/~evimaria/ (evimaria@cs.bu.edu)
Tel: 617-358-5851


At BU I am a member of the Data Management Lab@BU.

My research interests are in the area of algorithmic data mining with emphasis
on (social) network analysis, recommendation systems and urban informatics.

A long version of my CV is here (updated Feb. 2015).

Research Highlights

My Google Scholar page is here.

Awards and Funding

My research is funded by the following sources:

Microsoft Faculty Fellowship (2010)
NSF award on Entity Selection and Ranking for Data Mining Applications (2012-2016)
NSF CAREER award on On identifying collections with complex objectives (2013-2018)
NSF award on Managing and Mining Uncertain Graphs (2013-2016)
NSF award on ‘‘ Structural Matrix Completion for Data-Mining Applications", (2014-2017)

NSF Award: “ SCOPE: A smart-city Cloud-based Open Platform and Ecosystem", (2014-2017)

Gifts from Yahoo! and Google.


I am working with the following students:

Charalampos Mavroforakis (PhD student)
Sofia Nikolakaki (PhD student)

Ben Lawson (BU Undergraduate)


Behzad Golshan (PhD 2016, currently a research scientist at RIT)

Natali Ruchansky (PhD 2016, currently a postdoctoral fellow at USC)

Esther Galbrun (post-doc, now a Junior Researcher at INRIA Nancy)
Theodoros Lappas (post-doc, now an Assistant Professor at Howe School of Technology Management at Stevens Institute of Technology)

Dora Erdos (PhD student, now a post-doctoral researcher at Brown University)

George Brova (MA/BA student, now a PhD student at UIUC)

Recent papers

  • N. Ruchansky, M. Crovella, E. Terzi: ‘‘Matrix Completion with Queries". ACM SIGKDD 2015.

  • C. Mavroforakis, R. Garcia-Lebron, Y. Koutis, E. Terzi: ‘‘Spanning edge centrality: large-scale computation and applications". International World Wide Web Conference, WWW 2015.

  • D. Erdos, V. Ishakian, A. Bestavros, E. Terzi: ‘‘A Divide-and-Conquer Algorithm for Betweenness Cen- trality". SIAM Data Mining Conferece, SDM 2015.



After an amazing sabbatical year, I am back to teaching. In Fall 2016 I am teaching CS 565.

In the past I have taught Data Mining (CS 565) for six years, Combinatorial structures (CS 131) for four years and multiple seminars. The most recent seminar I taught was in Spring 2015 a seminar on ‘‘Data Analysis in Python".

For more information see: more

Recent PC Memberships

ICML 2016 (Senior PC)
ICWSM 2016 (Senior PC)
SDM 2016 (Senior PC)
VLDB 2016, WSDM 2016 (Senior PC)

WWW 2015 (Graph and Social Network trak co-chair)