Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. - Monika Henzinger; Stefan Neumann 003 (ESA, 2016)

This House Proves That Debating is Harder Than Soccer. - Stefan Neumann 003; Andreas Wiese (FUN, 2016)

What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. - Stefan Neumann 003; Rainer Gemulla; Pauli Miettinen (ICDM, 2016)

Reductions for Frequency-Based Data Mining Problems. - Stefan Neumann 003; Pauli Miettinen (ICDM, 2017)

Conditional Hardness for Sensitivity Problems. - Monika Henzinger; Andrea Lincoln; Stefan Neumann 003; Virginia Vassilevska Williams (ITCS, 2017)

Bipartite Stochastic Block Models with Tiny Clusters. - Stefan Neumann 003 (NeurIPS, 2018)

Ranking the Teams in European Football Leagues with Agony. - Stefan Neumann 003; Julian Ritter; Kailash Budhathoki (MLSA@PKDD/ECML, 2018)

Finding Tiny Clusters in Bipartite Graphs. - Stefan Neumann 003 (GI-Jahrestagung, 2019)

Efficient Distributed Workload (Re-)Embedding. - Monika Henzinger; Stefan Neumann 003; Stefan Schmid 001 (Proc. ACM Meas. Anal. Comput. Syst., 2019)

New amortized cell-probe lower bounds for dynamic problems. - Sayan Bhattacharya; Monika Henzinger; Stefan Neumann 003 (Theor. Comput. Sci., 2019)

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (SoCG, 2020)

Recent Developments in Boolean Matrix Factorization. - Pauli Miettinen; Stefan Neumann 003 (IJCAI, 2020)

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (CoRR, 2020)

Biclustering and Boolean Matrix Factorization in Data Streams. - Stefan Neumann 003; Pauli Miettinen (Proc. VLDB Endow., 2020)

Beweisbar Gesetzmäßigkeiten in Daten finden und ausnutzen. - Stefan Neumann 003 (Ausgezeichnete Informatikdissertationen, 2020)

Tight Bounds for Online Graph Partitioning. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (SODA, 2021)

Sublinear-Time Clustering Oracle for Signed Graphs. - Stefan Neumann 003; Pan Peng 001 (ICML, 2022)

Accepted Tutorials at The Web Conference 2022. - Riccardo Tommasini 001; Senjuti Basu Roy; Xuan Wang 008; Hongwei Wang; Heng Ji 001; Jiawei Han 001; Preslav Nakov; Giovanni Da San Martino; Firoj Alam; Markus Schedl; Elisabeth Lex; Akash Bharadwaj; et al. (WWW (Companion Volume), 2022)

A Viral Marketing-Based Model For Opinion Dynamics in Online Social Networks. - Sijing Tu; Stefan Neumann 003 (WWW, 2022)

Reducing Exposure to Harmful Content via Graph Rewiring. - Corinna Coupette; Stefan Neumann 003; Aristides Gionis (KDD, 2023)

Adversaries with Limited Information in the Friedkin-Johnsen Model. - Sijing Tu; Stefan Neumann 003; Aristides Gionis (KDD, 2023)

Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations. - Thibault Marette; Pauli Miettinen; Stefan Neumann 003 (ECML/PKDD (1), 2023)

Dynamic Maintenance of Monotone Dynamic Programs and Applications. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (STACS, 2023)

Analyzing the Communication Clusters in Datacenters✱. - Klaus-Tycho Foerster; Thibault Marette; Stefan Neumann 003; Claudia Plant; Ylli Sadikaj; Stefan Schmid 001; Yllka Velaj (WWW, 2023)

Reducing Exposure to Harmful Content via Graph Rewiring (Paper Replication Code). - Corinna Coupette; Stefan Neumann 003; Aristides Gionis (Zenodo, 2023)

The Impact of External Sources on the Friedkin-Johnsen Model. - Charlotte Out; Sijing Tu; Stefan Neumann 003; Ahad N. Zehmakan (CIKM, 2024)

Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. - Stefan Neumann 003; Yinhao Dong; Pan Peng 001 (WWW, 2024)

Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates. - Tianyi Zhou 010; Stefan Neumann 003; Kiran Garimella; Aristides Gionis (WWW, 2024)

Promoting Theoretical Computer Science on Social Media, A Conversation with Clément Canonne. - Stefan Neumann 003 (Bull. EATCS, 2024)

Behind the Scenes of TCS+: Talks, Research, and Community Efforts. - Stefan Neumann 003 (Bull. EATCS, 2025)

OptiRefine: Densest subgraphs and maximum cuts with k refinements. - Sijing Tu; Aleksa Stankovic; Stefan Neumann 003; Aristides Gionis (CoRR, 2025)