← Search

Nikolaj Tatti

3 accepted papers

2026

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering

ICML 2026spotlight

Correlation clustering is a classic approach for summarizing signed graphs, where the goal is to cluster the graph while minimizing positive inter-cluster edges plus negative intra-cluster edges. On complete signed graphs, correlation clustering is closely related to the bad triangle traversal (BTT)…

Cited by 0SourceScholar
2025

From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs

AAAI 2025technical

Stochastic Block Models (SBMs) are a popular approach to modeling single real-world graphs. The key idea of SBMs is to partition the vertices of the graph into blocks with similar edge densities within, as well as between different blocks. However, what if we are given not one but multiple graphs th…

Cited by 0SourcePDFScholar
2017

Balancing information exposure in social networks

NeurIPS 2017poster

Social media has brought a revolution on how people are consuming news. Beyond the undoubtedly large number of advantages brought by social-media platforms, a point of criticism has been the creation of echo chambers and filter bubbles, caused by social homophily and algorithmic personalization. In…

Cited by 74SourcePDFScholar