معرفی
Stefan Kratsch is a Professor of Theoretical Computer Science at the Institute of Computer Science, Humboldt University of Berlin. He holds this position since September 2017 and has previously held academic roles at the University of Bonn (2015–2017) and Technical University Berlin (2012–2014). His research focuses on parameterized complexity, efficient preprocessing, and computational complexity, with a strong emphasis on theoretical foundations and algorithm design.
- University: Humboldt University of Berlin
- Department: Institute of Computer Science (Algorithm Engineering group)
- Academic Rank: Professor
- Email: stefan.kratsch@hu-berlin.de, kratsch@informatik.hu-berlin.de
Kratsch’s recent publications highlight his work on advanced algorithmic techniques for graph problems. Key areas include kernelization methods, flow-augmentation for connectivity problems, and tight complexity bounds for classical problems parameterized by structural measures like clique-width and cutwidth. His theoretical contributions aim to bridge preprocessing efficiency with computational hardness.
Stefan actively engages in academic service, including organizing workshops and serving on program committees for leading conferences such as IPEC, LATIN, and SWAT. He has reviewed for numerous journals and grant panels, including the European Research Council and German Research Foundation.
Advising: He supervised PhD candidate Michael Piechotta, whose defense is scheduled for September 2025.