معرفی
Jonas Blochwitz is a PhD student and member of the Algorithmics group at the Institute of Computer Science, Johannes Gutenberg University Mainz since April 2021. His research focuses on graph algorithms for NP-complete problems such as tree and treedepth decompositions, computability theory, complexity theory, and reductions.
He has extensive teaching experience, including roles as a co-organizer and teaching assistant for courses such as Formal Languages and Computability Theory, Data Structures and Efficient Algorithms, and Game Theory. His teaching spans multiple semesters from 2017 to 2023.
Contact: blochwitz@uni-mainz.de, located at Room 03-419, Staudingerweg 9, 55128 Mainz.
۰مقاله منتشرشده
