default search action
Stefan Neumann 0003
Person information
- affiliation: TU Wien, Vienna, Austria
- affiliation (former): KTH Royal Institute of Technology, Sweden
- affiliation (former): University of Vienna, Austria
Other persons with the same name
- Stefan Neumann
- Stefan Neumann 0001 — GNWI - Gesellschaft fuer naturwissenschaftliche Informatik mbH, Oer-Erkenschwick, Germany
- Stefan Neumann 0002 — HPI, University of Potsdam, Germany
- Stefan Neumann 0004 — University of Münster, Germany
- Stefan Neumann 0005 — University of Hannover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Charlotte Out
, Sijing Tu
The Impact of External Sources on the Friedkin-Johnsen Model. CIKM 2024: 1815-1824 - [c22]Stefan Neumann
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. WWW 2024: 2563-2571 - [c21]Tianyi Zhou
Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates. WWW 2024: 2694-2702 - [i20]Tianyi Zhou, Stefan Neumann, Kiran Garimella, Aristides Gionis:
Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates. CoRR abs/2402.10053 (2024) - [i19]Stefan Neumann, Yinhao Dong, Pan Peng:
Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model. CoRR abs/2404.16464 (2024) - 2023
- [c20]Corinna Coupette
Reducing Exposure to Harmful Content via Graph Rewiring. KDD 2023: 323-334 - [c19]Sijing Tu
Adversaries with Limited Information in the Friedkin-Johnsen Model. KDD 2023: 2201-2210 - [c18]Thibault Marette
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations. ECML/PKDD (1) 2023: 743-758 - [c17]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS 2023: 36:1-36:16 - [c16]Klaus-Tycho Foerster
Analyzing the Communication Clusters in Datacenters✱. WWW 2023: 3022-3032 - [d1]Corinna Coupette
Reducing Exposure to Harmful Content via Graph Rewiring (Paper Replication Code). Zenodo, 2023 - [i18]Monika Henzinger, Stefan Neumann
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR abs/2301.01744 (2023) - [i17]Corinna Coupette, Stefan Neumann, Aristides Gionis:
Reducing Exposure to Harmful Content via Graph Rewiring. CoRR abs/2306.07930 (2023) - [i16]Sijing Tu, Stefan Neumann, Aristides Gionis:
Adversaries with Limited Information in the Friedkin-Johnsen Model. CoRR abs/2306.10313 (2023) - [i15]Thibault Marette, Pauli Miettinen, Stefan Neumann:
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations. CoRR abs/2307.07396 (2023) - 2022
- [c15]Stefan Neumann
Sublinear-Time Clustering Oracle for Signed Graphs. ICML 2022: 16496-16528 - [c14]Riccardo Tommasini, Senjuti Basu Roy, Xuan Wang
Accepted Tutorials at The Web Conference 2022. WWW (Companion Volume) 2022: 391-399 - [c13]Sijing Tu
A Viral Marketing-Based Model For Opinion Dynamics in Online Social Networks. WWW 2022: 1570-1578 - [i14]Sijing Tu, Stefan Neumann:
A Viral Marketing-Based Model For Opinion Dynamics in Online Social Networks. CoRR abs/2202.03573 (2022) - [i13]Stefan Neumann
Sublinear-Time Clustering Oracle for Signed Graphs. CoRR abs/2206.13813 (2022) - 2021
- [c12]Monika Henzinger
Tight Bounds for Online Graph Partitioning. SODA 2021: 2799-2818 - 2020
- [j3]Stefan Neumann
Biclustering and Boolean Matrix Factorization in Data Streams. Proc. VLDB Endow. 13(10): 1709-1722 (2020) - [c11]Monika Henzinger
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. SoCG 2020: 51:1-51:14 - [c10]Pauli Miettinen
Recent Developments in Boolean Matrix Factorization. IJCAI 2020: 4922-4928 - [p1]Stefan Neumann
Beweisbar Gesetzmäßigkeiten in Daten finden und ausnutzen. Ausgezeichnete Informatikdissertationen 2020: 239-248 - [i12]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs/2002.10142 (2020) - [i11]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. CoRR abs/2003.02605 (2020) - [i10]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. CoRR abs/2011.01017 (2020) - [i9]Pauli Miettinen
Recent Developments in Boolean Matrix Factorization. CoRR abs/2012.03127 (2020) - [i8]Stefan Neumann, Pauli Miettinen
Biclustering and Boolean Matrix Factorization in Data Streams. CoRR abs/2012.03138 (2020)
2010 – 2019
- 2019
- [j2]Monika Henzinger, Stefan Neumann
Efficient Distributed Workload (Re-)Embedding. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 13:1-13:38 (2019) - [j1]Sayan Bhattacharya, Monika Henzinger
New amortized cell-probe lower bounds for dynamic problems. Theor. Comput. Sci. 779: 72-87 (2019) - [c9]Stefan Neumann:
Finding Tiny Clusters in Bipartite Graphs. GI-Jahrestagung 2019: 253-254 - [c8]Monika Henzinger
Efficient Distributed Workload (Re-)Embedding. SIGMETRICS (Abstracts) 2019: 43-44 - [i7]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New Amortized Cell-Probe Lower Bounds for Dynamic Problems. CoRR abs/1902.02304 (2019) - [i6]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. CoRR abs/1904.05474 (2019) - 2018
- [c7]Stefan Neumann
Bipartite Stochastic Block Models with Tiny Clusters. NeurIPS 2018: 3871-3881 - [c6]Stefan Neumann, Julian Ritter, Kailash Budhathoki:
Ranking the Teams in European Football Leagues with Agony. MLSA@PKDD/ECML 2018: 55-66 - 2017
- [c5]Stefan Neumann
Reductions for Frequency-Based Data Mining Problems. ICDM 2017: 997-1002 - [c4]Monika Henzinger, Andrea Lincoln
Conditional Hardness for Sensitivity Problems. ITCS 2017: 26:1-26:31 - [i5]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. CoRR abs/1703.01638 (2017) - [i4]Stefan Neumann, Pauli Miettinen
Reductions for Frequency-Based Data Mining Problems. CoRR abs/1709.00900 (2017) - 2016
- [c3]Monika Henzinger, Stefan Neumann
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. ESA 2016: 48:1-48:11 - [c2]Stefan Neumann
This House Proves That Debating is Harder Than Soccer. FUN 2016: 25:1-25:14 - [c1]Stefan Neumann
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. ICDM 2016: 380-389 - [i3]Stefan Neumann, Andreas Wiese:
This House Proves that Debating is Harder than Soccer. CoRR abs/1605.03063 (2016) - [i2]Stefan Neumann, Rainer Gemulla, Pauli Miettinen
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. CoRR abs/1609.05034 (2016) - [i1]Monika Henzinger, Stefan Neumann:
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. CoRR abs/1611.05248 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: