01
Structural Graph Theory
Graph Minor Structure Theory in (un)directed graphs, with a view toward solving hard algorithmic problems.
Senior Researcher · IBS-DIMAG · Daejeon
Computer Scientist · Mathematician
Research on the structure of graphs.
I am a senior researcher in Sang-il Oum’s DIMAG group at the Institute for Basic Science in Daejeon, South Korea. Before this, I completed my PhD with Stephan Kreutzer at TU Berlin.
Research focus
Structure as a route to algorithms.
02
Matching Theory
Structural matching theory of bipartite graphs, forcing numbers, and connections to Hamiltonicity.
03
Parameterized Algorithms
The interaction between model checking, graph structure, and parameterized complexity.
2026Adjunct Professor · KAIST
2025IBS Researcher of the Year
2024PhD · TU Berlin · summa cum laude
Selected work
Publications
2026Optimal Bounds for the k-Disjoint Paths ProblemDario Cavallaro, Maximilian Gorsky, Stephan Kreutzer, Dimitrios Thilikos & Sebastian WiederrechtFOCS 20262026Quickly Excluding an Annotated Planar GraphMaximilian Gorsky, Evangelos Protopapas & Sebastian WiederrechtICALP 20262026The Price of Homogeneity Is PolynomialMaximilian Gorsky, Michał Seweryn & Sebastian WiederrechtICALP 20262026Odd-Cycle-Packing-treewidth: On the Maximum Independent Set Problem in Odd-Minor-Free Graph ClassesMujin Choi, Maximilian Gorsky, Gunwoo Kim, Caleb McFarland & Sebastian WiederrechtICALP 20262026Triangulated Spheres with Holes in Triangulated SurfacesKatie Clinch, Sean Dewar, Niloufar Fuladi, Maximilian Gorsky, Tony Huynh, Eleftherios Kastis, Atsuhiro Nakamoto, Anthony Nixon & Brigitte ServatiusDiscrete & Computational Geometry2026Catching Rats in H-minor-free GraphsMaximilian Gorsky, Giannos Stamoulis, Dimitrios Thilikos & Sebastian WiederrechtSODA 20262025Polynomial Bounds for the Graph Minor Structure TheoremMaximilian Gorsky, Michał Seweryn & Sebastian WiederrechtFOCS 20252025Computing the Forcing Spectrum of Outerplanar Graphs in Polynomial TimeMaximilian Gorsky & Fabian KreßinDiscrete Applied Mathematics2025A Note on the 2-Factor Hamiltonicity ConjectureMaximilian Gorsky, Theresa Johanni & Sebastian WiederrechtDiscrete Mathematics2024Packing Even Directed Circuits Quarter-IntegrallyMaximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer & Sebastian WiederrechtSTOC 20242023Matching Theory and Barnette’s ConjectureMaximilian Gorsky, Raphael Steiner & Sebastian WiederrechtDiscrete Mathematics2022Differential Games, Locality, and Model Checking for FO Logic of GraphsJakub Gajarský, Maximilian Gorsky & Stephan KreutzerCSL 20222021Strongly Pfaffian GraphsMaximilian Gorsky, Raphael Steiner & Sebastian WiederrechtEuroComb 2021
In progress
Preprints & manuscripts
An Erdős–Pósa Theorem for Cycles and Faces of Distinct Lengthswith J. Pascal Gollin, Meike Hatzel, Kevin Hendrey et al.The Erdős–Pósa Property for Prime-Length Cycles Fails (and Beyond)with Kevin Hendrey and Tony HuynhOn Non-Planar, Cycle-Conformal Graphswith Clemens KuskePosets with k-outerplanar Cover Graphs Have Bounded Dimensionwith Michał Seweryn
Contact