
Biclustering and Boolean Matrix Factorization in Data Streams
We study the clustering of bipartite graphs and Boolean matrix factoriza...
read it

Recent Developments in Boolean Matrix Factorization
The goal of Boolean Matrix Factorization (BMF) is to approximate a given...
read it

Tight Bounds for Online Graph Partitioning
We consider the following online optimization problem. We are given a gr...
read it

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles
Independent set is a fundamental problem in combinatorial optimization. ...
read it

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
Graph coloring is a fundamental problem in computer science. We study th...
read it

Efficient Distributed Workload (Re)Embedding
Modern networked systems are increasingly reconfigurable, enabling deman...
read it

New Amortized CellProbe Lower Bounds for Dynamic Problems
We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (F...
read it

ModelDriven Architectural Monitoring and Adaptation for Autonomic Systems
Architectural monitoring and adaptation allows selfmanagement capabilit...
read it

Reductions for FrequencyBased Data Mining Problems
Studying the computational complexity of problems is one of the  if not...
read it
Stefan Neumann
is this you? claim profile