Regular biography
Sebastian Wiederrecht is an Assistant Professor for Theoretical Computer Science at the School of Computing, KAIST, in Daejeon, South Korea. His main field of interest is (algorithmic) structural graph theory. He is affiliated with the CS department at KAIST and can be contacted via email at wiederrecht@kaist.ac.kr. His personal website is https://www.wiederrecht.com/, where his CV is available, last updated in November 2023.
Scholar-generated biography
Sebastian Wiederrecht is an Assistant Professor at KAIST, South Korea, specializing in Graph Theory, Matching Theory, and Parameterized Algorithms. His research explores fundamental problems in graph structure and algorithmic complexity, with a focus on matching theory, treewidth, and parameterized algorithms for directed graphs. He investigates topics such as congestion-free rerouting, directed treewidth, and the grid theorem for perfect matching width. His work also addresses graph minors, induced subgraphs, and the Erdös-Pósa duality for minors. Wiederrecht's contributions span both theoretical and algorithmic aspects of graph theory, with applications in network design and computational complexity.