Ass.-Prof. Dr. techn. Dipl.-Ing. B.Sc.

Sebastian Forster

Sebastian Forster

Member of the Young Academy since 2021

Contact:

Orcid-ID:

0000-0002-2191-3381

Research Areas:

  • Computer Sciences
  • Theoretical computer science

Profile:

CV/Website

Publications:

Website

Selected Prizes:

  • ERC Starting Grant
  • Heinz Zemanek Preis
  • Award of Excellence

Selected Publications:

  • Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, and Richard Peng. “On Fully Dynamic Graph Sparsifiers”. In: Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), New Brunswick, NJ, USA, October 9–11. 2016..
  • Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization”. In: SIAM Journal on Computing 45.3 (2016). FOCS 2013 Special Issue, pp. 947–1006..
  • Ruben Becker, Sebastian Forster, Andreas Karrenbauer, and Christoph Lenzen. “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models”. In: SIAM Journal on Computing 50.3 (2021), 815–856..
  • Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths”. In: SIAM Journal on Computing. STOC 2016 Special Issue. Accepted..
  • Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time”. In: Journal of the ACM 65.6 (2018), 36:1–36:40..