6 citations · 18 across the 14 of their papers we have counts for
17 papers
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations
Thibault Marette, Pauli Miettinen, Stefan Neumann
Finding (bi-)clusters in bipartite graphs is a popular data analysis approach. Analysts typically want to visualize the clusters, which is simple as long as the clusters are disjoi…
Reducing Exposure to Harmful Content via Graph Rewiring
Corinna Coupette, Stefan Neumann, Aristides Gionis
Most media content consumed today is provided by digital platforms that aggregate input from diverse sources, where access to information is mediated by recommendation algorithms.…
Adversaries with Limited Information in the Friedkin--Johnsen Model
Sijing Tu, Stefan Neumann, Aristides Gionis
In recent years, online social networks have been the target of adversaries who seek to introduce discord into societies, to undermine democracies and to destabilize communities. O…
Dynamic Maintenance of Monotone Dynamic Programs and Applications
Monika Henzinger, Stefan Neumann, Harald Räcke +1
Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays…
Sublinear-Time Clustering Oracle for Signed Graphs
Stefan Neumann, Pan Peng
Social networks are often modeled using signed graphs, where vertices correspond to users and edges have a sign that indicates whether an interaction between users was positive or…
Biclustering and Boolean Matrix Factorization in Data Streams
Stefan Neumann, Pauli Miettinen
We study the clustering of bipartite graphs and Boolean matrix factorization in data streams. We consider a streaming setting in which the vertices from the left side of the graph…