Stefan Neumann | DeepAI

AI Chat

Featured Co-authors

Stefan Schmid
88 publications
Monika Henzinger
71 publications
Aristides Gionis
38 publications
Thomas Vogel
33 publications
Pan Peng
26 publications
Andreas Wiese
23 publications
Sayan Bhattacharya
22 publications
Holger Giese
19 publications
Corinna Coupette
11 publications
Pauli Miettinen
9 publications
Harald Räcke
8 publications

∙ 07/14/2023

Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations

Finding (bi-)clusters in bipartite graphs is a popular data analysis app...

0 Thibault Marette, et al. ∙

∙ 06/17/2023

Adversaries with Limited Information in the Friedkin–Johnsen Model

In recent years, online social networks have been the target of adversar...

0 Sijing Tu, et al. ∙

∙ 06/05/2023

Reducing Exposure to Harmful Content via Graph Rewiring

Most media content consumed today is provided by digital platforms that ...

0 Corinna Coupette, et al. ∙

∙ 01/04/2023

Dynamic Maintenance of Monotone Dynamic Programs and Applications

Dynamic programming (DP) is one of the fundamental paradigms in algorith...

0 Monika Henzinger, et al. ∙

∙ 06/28/2022

Sublinear-Time Clustering Oracle for Signed Graphs

Social networks are often modeled using signed graphs, where vertices co...

0 Stefan Neumann, et al. ∙

∙ 12/05/2020

Biclustering and Boolean Matrix Factorization in Data Streams

We study the clustering of bipartite graphs and Boolean matrix factoriza...

0 Stefan Neumann, et al. ∙

∙ 12/05/2020

Recent Developments in Boolean Matrix Factorization

The goal of Boolean Matrix Factorization (BMF) is to approximate a given...

0 Pauli Miettinen, et al. ∙

∙ 11/02/2020

Tight Bounds for Online Graph Partitioning

We consider the following online optimization problem. We are given a gr...

0 Monika Henzinger, et al. ∙

∙ 03/05/2020

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

Independent set is a fundamental problem in combinatorial optimization. ...

0 Monika Henzinger, et al. ∙

∙ 02/24/2020

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Graph coloring is a fundamental problem in computer science. We study th...

0 Monika Henzinger, et al. ∙

∙ 04/10/2019

Efficient Distributed Workload (Re-)Embedding

Modern networked systems are increasingly reconfigurable, enabling deman...

0 Monika Henzinger, et al. ∙

∙ 02/06/2019

New Amortized Cell-Probe Lower Bounds for Dynamic Problems

We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (F...

0 Sayan Bhattacharya, et al. ∙

∙ 05/17/2018

Model-Driven Architectural Monitoring and Adaptation for Autonomic Systems

Architectural monitoring and adaptation allows self-management capabilit...

0 Thomas Vogel, et al. ∙

∙ 09/04/2017

Reductions for Frequency-Based Data Mining Problems

Studying the computational complexity of problems is one of the - if not...

0 Stefan Neumann, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world