| 2026 | MFCS | Upper Clique Transversal on Interval Graphs and Beyond. | Lars Jaffke, Paloma Thom de Lima, Amir Nikabadi |
| 2025 | ESA | On Algorithmic Applications of ℱ-Branchwidth. | Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima |
| 2025 | WG | A Parameterized Complexity Analysis of Bounded Height Depth-First Search Trees. | Lars Jaffke, Paloma Thom de Lima, Wojciech Nadara, Emmanuel Sam |
| 2023 | ISAAC | Structural Parameterizations of b-Coloring. | Lars Jaffke, Paloma T. Lima, Roohani Sharma |
| 2023 | SODA | A logic-based algorithmic meta-theorem for mim-width. | Benjamin Bergougnoux, Jan Dreier, Lars Jaffke |
| 2023 | SODA | Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. | Meike Hatzel, Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2023 | SODA | A tight quasi-polynomial bound for Global Label Min-Cut. | Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Uverton S. Souza |
| 2022 | ESA | Taming Graphs with No Large Creatures and Skinny Ladders. | Jakub Gajarsk, Lars Jaffke, Paloma T. Lima, Jana Novotn, Marcin Pilipczuk, Pawel Rzazewski, Uverton S. Souza |
| 2022 | STACS | Classes of Intersection Digraphs with Good Algorithmic Properties. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2021 | CIAC | Three Problems on Well-Partitioned Chordal Graphs. | Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2021 | STACS | b-Coloring Parameterized by Clique-Width. | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2020 | ISAAC | Diverse Pairs of Matchings. | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | MFCS | Structural Parameterizations of Clique Coloring. | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
| 2020 | MFCS | Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. | Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary |
| 2020 | STACS | Typical Sequences Revisited - Computing Width Parameters of Graphs. | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
| 2020 | WG | Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. | Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2019 | MFCS | A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. | Lars Jaffke, Paloma T. Lima |
| 2018 | STACS | A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2018 | WG | On Weak Isomorphism of Rooted Vertex-Colored Graphs. | Lars Jaffke, Mateus de Oliveira Oliveira |
| 2017 | CIAC | Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. | Lars Jaffke, Bart M. P. Jansen |