| 2026 | ESA | Tight Bounds for Clique-Packing Parameterized by Clique-Width. | Narek Bojikian, Stefan Kratsch |
| 2026 | ESA | A Faster Polynomial-Space Algorithm for Hamiltonian Cycle Parameterized by Treedepth. | Stefan Kratsch |
| 2026 | ICALP | Tight Bounds for Feedback Vertex Set Parameterized by Clique-Width. | Narek Bojikian, Stefan Kratsch |
| 2026 | WG | Tight Bounds for Some W[1]-Hard Problems Parameterized by Multi-Clique-Width. | Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch |
| 2025 | ESA | Tight Bounds for Some Classical Problems Parameterized by Cutwidth. | Narek Bojikian, Vera Chekan, Stefan Kratsch |
| 2025 | WG | Boundaried Kernelization. | Leonid Antipov, Stefan Kratsch |
| 2025 | WG | Efficient Parameterized Approximation. | Stefan Kratsch, Pascal Kunz |
| 2024 | ICALP | A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width. | Narek Bojikian, Stefan Kratsch |
| 2024 | WG | On Polynomial Kernelization for Stable Cutset. | Stefan Kratsch, Van Bang Le |
| 2023 | ESA | Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. | Falko Hegerfeld, Stefan Kratsch |
| 2023 | MFCS | Tight Algorithmic Applications of Clique-Width Generalizations. | Vera Chekan, Stefan Kratsch |
| 2023 | SODA | Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2023 | STACS | Tight Bounds for Connectivity Problems Parameterized by Cutwidth. | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
| 2023 | WG | Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. | Falko Hegerfeld, Stefan Kratsch |
| 2022 | STOC | Directed flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2021 | SODA | Solving hard cut problems via flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2021 | SODA | Optimal Discretization is Fixed-parameter Tractable. | Stefan Kratsch, Toms Masark, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2020 | ESA | Approximate Turing Kernelization for Problems Parameterized by Treewidth. | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
| 2020 | STACS | Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. | Falko Hegerfeld, Stefan Kratsch |
| 2020 | STACS | Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
| 2020 | STACS | Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. | Stefan Kratsch, Florian Nelles |
| 2019 | ESA | Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. | Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese |
| 2019 | ICALP | On Adaptive Algorithms for Maximum Matching. | Falko Hegerfeld, Stefan Kratsch |
| 2019 | STACS | On Kernelization for Edge Dominating Set under Structural Parameters. | Eva-Maria C. Hols, Stefan Kratsch |
| 2018 | COCOON | Bipartite Graphs of Small Readability. | Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma |
| 2018 | ESA | Efficient and Adaptive Parameterized Algorithms on Modular Decompositions. | Stefan Kratsch, Florian Nelles |
| 2017 | CIAC | Assessing the Computational Complexity of Multi-layer Subgraph Detection. | Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge |
| 2017 | ICALP | Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. | Toni Bhnlein, Stefan Kratsch, Oliver Schaudt |
| 2017 | STACS | The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. | Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson |
| 2017 | STACS | Robust and Adaptive Search. | Yann Disser, Stefan Kratsch |
| 2016 | AAIM | Parameterized Complexity of Team Formation in Social Networks. | Robert Bredereck, Jiehua Chen, Falk Hffner, Stefan Kratsch |
| 2016 | ESA | A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. | Stefan Kratsch |
| 2016 | MFCS | Preprocessing Under Uncertainty: Matroid Intersection. | Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen |
| 2016 | STACS | Preprocessing Under Uncertainty. | Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen |
| 2016 | STACS | A Randomized Polynomial Kernel for Subset Feedback Vertex Set. | Eva-Maria C. Hols, Stefan Kratsch |
| 2015 | ESA | A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. | Bart M. P. Jansen, Stefan Kratsch |
| 2015 | MFCS | Polynomial Kernels for Weighted Problems. | Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Rglin |
| 2015 | MFCS | A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time. | Stefan Fafianie, Stefan Kratsch |
| 2014 | MFCS | Streaming Kernelization. | Stefan Fafianie, Stefan Kratsch |
| 2014 | SODA | Point Line Cover: The Easy Kernel is Essentially Tight. | Stefan Kratsch, Geevarghese Philip, Saurabh Ray |
| 2014 | WAOA | The Minimum Feasible Tileset Problem. | Yann Disser, Stefan Kratsch, Manuel Sorge |
| 2013 | ESA | On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility. | Stefan Kratsch |
| 2013 | ICALP | Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
| 2013 | STOC | Fast hamiltonicity checking via bases of perfect matchings. | Marek Cygan, Stefan Kratsch, Jesper Nederlof |
| 2013 | STACS | Tight bounds for Parameterized Complexity of Cluster Editing. | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
| 2013 | STACS | On Polynomial Kernels for Sparse Integer Linear Programs. | Stefan Kratsch |
| 2013 | WG | Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
| 2012 | AAAI | A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Such, Stefan Kratsch |
| 2012 | FOCS | Representative Sets and Irrelevant Vertices: New Tools for Kernelization. | Stefan Kratsch, Magnus Wahlstrm |
| 2012 | ICALP | Clique Cover and Graph Separation: New Incompressibility Results. | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | ICALP | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | SODA | Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. | Stefan Kratsch |
| 2012 | SODA | Compression via matroids: a randomized polynomial kernel for odd cycle transversal. | Stefan Kratsch, Magnus Wahlstrm |
| 2012 | WG | Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. | Stefan Kratsch, Pascal Schweitzer |
| 2011 | FCT | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | FCT | Data Reduction for Graph Coloring Problems. | Bart M. P. Jansen, Stefan Kratsch |
| 2011 | ICALP | Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | STACS | Cross-Composition: A New Technique for Kernelization Lower Bounds. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | WG | Parameterized Two-Player Nash Equilibrium. | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlstrm |
| 2010 | ICALP | Preprocessing of Min Ones Problems: A Dichotomy. | Stefan Kratsch, Magnus Wahlstrm |
| 2010 | MFCS | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. | Stefan Kratsch, Dniel Marx, Magnus Wahlstrm |
| 2010 | PPSN | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. | Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto |
| 2009 | GECCO | Fixed-parameter evolutionary algorithms and the vertex cover problem. | Stefan Kratsch, Frank Neumann |
| 2009 | STACS | Polynomial Kernelizations for MIN F | Stefan Kratsch |