6 citations · 18 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
Recent Developments in Boolean Matrix Factorization
Pauli Miettinen, Stefan Neumann
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matric…
Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, Harald Räcke +1
We consider the following online optimization problem. We are given a graph and each vertex of the graph is assigned to one of servers, where servers have capacity a…
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles
Monika Henzinger, Stefan Neumann, Andreas Wiese
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there ar…
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
Monika Henzinger, Stefan Neumann, Andreas Wiese
Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we…