I am an Assistant Professor at the Department of Computer Science at Aarhus University.

My research focuses on graph exploration, which lays on the broad areas of database, data mining, and machine learning. In particular, I enjoy working and understanding graphs with or without labels interactively, understanding phenomena and users in a principled way.

News!  I have an open PhD position, in collaboration with Emmanuel Müller from Bonn University. If you are interested read this.

If you are interested in internships, please look here.

Previosly, I was a Research Associate at the Center for Geoscience (GFZ) in Potsdam and a Postdoctoral Researcher at the Hasso Plattner Institute, in the group of Knowledge Discovery and Data Mining working with Emmanuel Müller. I got a PhD in Computer Science at the dbTrento group in the University of Trento under the supervision of Themis Palpanas and Yannis Velegrakis. During my PhD, I visited Yahoo! Labs, Barcelona and Microsoft Research Asia, Beijing.

Selected projects

The increasing interest in social networks, knowledge graphs, protein-interaction, and many other types of networks has raised the question how users can explore such large and complex graph structures easily. In this regard, graph exploration has emerged as a complementary toolbox for graph management, graph mining, or graph visualization in which the user is a first class citizen. Graph exploration combines and expands database, data mining, and machine learning approaches with the user eye on one side and the system perspective on the other.
Search engines are continuously employing advanced techniques that aim to capture user intentions and provide results that go beyond the data that simply satisfy the query conditions. Examples include the personalized results, related searches, similarity search, popular and relaxed queries. In this work we introduce a novel query paradigm that considers a user query as an example of the data in which the user is interested. We call these queries «exemplar queries», and claim that they can play an important role in dealing with the information deluge. We provide a formal specification of the semantics of such queries and show that they are fundamentally different from notions like queries by example, approximate and related queries.
Graphs elegantly model a plethora of phenomena, from social interactions, to biological and chemical processes. Without any prior information comparing two graphs can only be done through notion of similarity. However, designing the right similarity for a certain task is a convolotued process which requires domain expertise and graph expertise. We propose self-learned similarity measures which scale to large graphs and are automatically harvested from the graph itself. Such measures can outperform traditional measures in different tasks, such as predicting future connections among users, understanding the effect of drugs, and detecting malicious users.