Stefan Neumann

Orcid: 0000-0002-3981-1500

Affiliations:
  • TU Wien, Vienna, Austria
  • KTH Royal Institute of Technology, Sweden (former)
  • University of Vienna, Austria (former)


According to our database1, Stefan Neumann authored at least 28 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates.
Proceedings of the ACM on Web Conference 2024, 2024

Sublinear-Time Opinion Estimation in the Friedkin-Johnsen Model.
Proceedings of the ACM on Web Conference 2024, 2024

The Impact of External Sources on the Friedkin-Johnsen Model.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
Reducing Exposure to Harmful Content via Graph Rewiring (Paper Replication Code).
Dataset, August, 2023

Analyzing the Communication Clusters in Datacenters✱.
Proceedings of the ACM Web Conference 2023, 2023

Dynamic Maintenance of Monotone Dynamic Programs and Applications.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Adversaries with Limited Information in the Friedkin-Johnsen Model.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Reducing Exposure to Harmful Content via Graph Rewiring.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
A Viral Marketing-Based Model For Opinion Dynamics in Online Social Networks.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022


Sublinear-Time Clustering Oracle for Signed Graphs.
Proceedings of the International Conference on Machine Learning, 2022

2021
Tight Bounds for Online Graph Partitioning.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Beweisbar Gesetzmäßigkeiten in Daten finden und ausnutzen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2020., 2020

Biclustering and Boolean Matrix Factorization in Data Streams.
Proc. VLDB Endow., 2020

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity.
CoRR, 2020

Recent Developments in Boolean Matrix Factorization.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
New amortized cell-probe lower bounds for dynamic problems.
Theor. Comput. Sci., 2019

Efficient Distributed Workload (Re-)Embedding.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Finding Tiny Clusters in Bipartite Graphs.
Proceedings of the 49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik, 2019

2018
Ranking the Teams in European Football Leagues with Agony.
Proceedings of the 5th Workshop on Machine Learning and Data Mining for Sports Analytics co-located with 2018 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2018), 2018

Bipartite Stochastic Block Models with Tiny Clusters.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Conditional Hardness for Sensitivity Problems.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Reductions for Frequency-Based Data Mining Problems.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

This House Proves That Debating is Harder Than Soccer.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016


  Loading...