1 full paper and 4 workshop papers accepted to SIGCOMM 2018 ...
Watch our talks at the DIMACS seminar on data center algorithms ...
"Non-redundant K-means Clusterings in Optimal Subspaces" by Dominik Mautz, Wei Ye, Claudia Plant and Christian Böhm accepted as full paper at KDD 2018...
Hear Michael Gleicher talk about "What Shakespeare Taught Us About Data Science and Visualization"
On May 2nd, Juho Hirvonen gives a talk on the topic "Towards a complexity theory for distributed graph algorithms"
The paper "High-Quality Shared-Memory Graph Partitioning" by Yaroslav Akhremtsev, Peter Sanders and Christian Schulz has been accepted at Euro-Par...