Sebastian Forster
forster@mathstodon.xyz
<p>Professor at the Department of Computer Science, University of Salzburg, Austria, working on graph algorithms</p><p>I support the initiative "Theoretical Computer Scientists for Future" (<a href="https://tcs4f.org/" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="">tcs4f.org/</span><span class="invisible"></span></a>).</p>
Posts
-
Post #1910479
I have an open position for a predoctoral university assistant (&quot;PhD student&quot;) in efficient graph algorithms. Our group has expertise in dynamic, distributed, and parallel algorithms. The position comes with a mild teaching load (&quot;TAing&quot;). Please find the official job description and the link to apply here: https://karriere.plus.ac.at/en/jobs/6e6aa798-0429-01e8-cabb-69c12151a2bd (Note that the gross salary listed there is for a hypothetical fulltime position,...
-
Post #1910475
There&#39;s quite a discussion around #Signal and the recent phishing attacks in Germany. Let me highlight two of Signal&#39;s design choices that challenge a bit the gospel that victims of such attacks are just &quot;too stupid&quot;. 1. Signal does send system information from time to time, for example to inform about new features. This looks like a standard message in a separate communication channel (i.e., a text message sent by &quot;Signal&quot;). I find it quite p...
-
Post #1910473
Our paper Incremental (k, z)-Clustering on Graphs got accepted to ICALP. This is joint work with Emilio Cruciani (who is now an assistant professor at the European University of Rome) and my former PhD student Antonis Skarlatos (who is a postdoc in Warwick now). Our group is working a lot on clustering algorithms tailored to graphs right now - mainly in the dynamic setting, but not exclusively. Here&#39;s a link to the arXiv version: https://arxiv.org/abs/2602.08542