Hi, I'm Jonas! I am a PhD student in Computer Science at Bocconi University, where I am advised by Adam Polak.
I am interested in theoretical problems related to algorithms and complexity, especially fine-grained complexity and parameterized and polynomial-time algorithms. I am motivated by understanding the relationships between problems and I enjoy playing around with interesting and challenging questions.
Feel free to reach out to me!
Papers
S. Angrick, B. Bals, T. Friedrich, H. Gawendowicz, N. Hastrich, N. Klodt, P. Lenzner, J. Schmidt, G. Skretas, A. Wells
How to Reduce Temporal Cliques to Find Sparse Spanners
ESA 2024, arXiv
D. Bilò, V. Bilò, M. Döring, P. Lenzner, L. Molitor, J. Schmidt
Schelling games with continuous types
IJCAI 2023, arXiv, ICTCS short paper
S. Angrick, B. Bals, K. Casel, S. Cohen, T. Friedrich, N. Hastrich, T. Hradilak, D. Issac, O. Kißig, J. Schmidt, L. Wendt
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover
SEA 2023, 3rd rank in the 2022 PACE Challenge, PACE Solver Description
S. Angrick, B. Bals, N. Hastrich, M. Kleissl, J. Schmidt, V. Doskoč, L. Molitor, T. Friedrich, M. Katzmann
Towards explainable real estate valuation via evolutionary algorithms
GECCO 2022, arXiv