top of page

Photo 10.05.22, 13 11 22.jpg

Sebastian Wiederrecht

I'm a Post Doc working on graph theory in the Discrete Mathematics Group at IBS in Daejeon.

My main field of interest is (algorithmic) structural graph theory.

Here you can find my CV.

(last updated October 2022)

Universal Obstructions in Grpah Minors

A general structure theorem containing of both planar- and K_3,3-matching-minor-free classes of bipartite graphs.

We prove an analog of the celebrated grid-theorem for a parameter that asks for tree-decompositions where all torsos are of bounded genus after deleting a bounded size set of vertices.
This result is complemented by a sharp complexity-dichotomy for counting perfect matchings in minor-closed families of graphs.

DAGwidth Duality

Digraph Minors And Matching Theory

bottom of page