2026 03 09_tcs

Mihail Stoian is presenting his paper on the runtime analysis of weighted algorithmic problems compared to their unweighted counterparts (e.g. Travelling Salesman, Max-Cut, etc.) at STACS: Symposium on Theoretical Aspects of Computer Science. Check out the paper and blog post.