Babis Tsourakakis received an invitation to give a talk at the International Symposium on Optimization (ISMP). ISMP has invited top academics and industrial users of mathematical optimization to convene in Pittsburgh to discuss recent advances and important challenges from both theory and practice. 

CRCS Fellow Babis Tsourakakis had a paper accepted in the 47th Symposium of Theory of Computing (STOC 2015), where he will present it in June. The main contribution of the paper is a novel algorithmic framework for large-scale dynamic graphs that is at the same time both space- and time-efficient. This paper is part of a broader project he is conducting on scalable graph mining algorithms.

CRCS Fellow Babis Tsourakakis had two single-author papers accepted at WWW 2015, the premiere venue on the World Wide Web. This year, there were 929 paper submissions and 131 paper acceptances. Both papers will be presented on the track "Social Networks and Graph Analysis".

The first paper is titled as "Provably Fast Inference of Latent Features from Networks" and the second paper as "The k-clique Densest Subgraph Problem". 

Fellows Jasper Snoek, Or Sheffet, and Raf Frongillo attended the 2014 Neural Information Processing Systems (NIPS) conference, held in Montreal. Or Sheffet gave a spotlight presentation and presented a poster, both titled "Learning Mixtures of Ranking Models."