Scholar
Sebastian Wiederrecht
Google Scholar ID: wtuA0-sAAAAJ
Assistant Professor, KAIST, South Korea
Graph Theory
Matching Theory
Parameterized Algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
228
H-index
9
i10-index
7
Publications
20
Co-authors
12
list available
Contact
CV
Open ↗
Publications
21 items
Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
2026
Cited
0
The Erdős-Pósa Property for Colorful Minors
2026
Cited
0
A relaxation of the Bermond-Thomassen conjecture
2026
Cited
0
A directed flat wall theorem excluding a crossrow grid
2026
Cited
0
Spanning Paths and Cycles: Structural Limitations of the Irrelevant Vertex Technique
2026
Cited
0
An Erdős-Pósa theorem for cycles and faces of distinct lengths
2026
Cited
0
Optimal Bounds for the k-Disjoint Paths Problem
2026
Cited
0
Quickly excluding an annotated planar graph
2026
Cited
0
Load more
Resume
Research Experience
Works as an Assistant Professor at the School of Computing, KAIST, Daejeon, South Korea.
Background
Assistant Professor for Theoretical Computer Science, with a main field of interest in (algorithmic) structural graph theory.
Co-authors
8 total
Dimitrios M. Thilikos
National and Kapodistrian University of Athens
Meike Hatzel
IBS DIMAG, Daejeon, Korea
Raphael Steiner
Senior assistant, ETH Zürich
Stefan Schmid
Professor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SIT
Archontia C. Giannopoulou
Associate Professor, Department of Informatics and Telecommunications, National and Kapodistrian
Stephan Kreutzer
Professor of Computer Science, Technical University Berlin
Roman Rabinovich
Technische Universität Berlin
Carolin Rehs
Technical University Dortmund