2026W

• Fundamentals of Digital Systems / 192.134 / VU

• Towards Trustworthy Recommendation Systems for Online Social Networks
  2023 – 2031 / Vienna Science and Technology Fund (WWTF)
  Publications: 223695 / 223701 / 223658 / 230129 / 230092 / 230075 / 230091

• Near-Optimal Four-Cycle Counting in Graph Streams / Lüderssen, S. J., Neumann, S., & Peng, P. (2026). Near-Optimal Four-Cycle Counting in Graph Streams. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 4285–4326). https://doi.org/10.1137/1.9781611978971.158
  Project: VRG-TOSN (2023–2031)
• Four-Cycle Counting in Low-Degeneracy Graph Streams / Lüderssen, S., Neumann, S., & Peng, P. (2026). Four-Cycle Counting in Low-Degeneracy Graph Streams. In KDD ’26: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1 (pp. 983–994). Association for Computing Machinery (ACM). https://doi.org/10.1145/3770854.3780199
  Project: VRG-TOSN (2023–2031)
• Instance-Specific Approximation Ratios for Correlation Clustering and Max-Cut / Lüderssen, S. J., Bercea, I.-O., & Neumann, S. (2026). Instance-Specific Approximation Ratios for Correlation Clustering and Max-Cut. In Forty-third International Conference on Machine Learning : ICML 2026. Forty-Third International Conference on Machine Learning (ICML 2026), Seoul, Korea (the Republic of).
  Project: VRG-TOSN (2023–2031)
• Efficient Minimization of Peakless Functions on Bounded-degree Graphs / Sandrock, C., Lüderssen, S. J., Thiessen, M., & Gärtner, T. (2025, September 15). Efficient Minimization of Peakless Functions on Bounded-degree Graphs [Presentation]. 22nd International Workshop on Mining and Learning with Graphs, Porto, Portugal. http://hdl.handle.net/20.500.12708/225752