Definability Equals Recognizability for k-Outerplanar Graphs. - Lars Jaffke; Hans L. Bodlaender (IPEC, 2015)

MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. - Lars Jaffke; Hans L. Bodlaender (CoRR, 2015)

Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (IPEC, 2017)

A note on the complexity of Feedback Vertex Set parameterized by mim-width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (CoRR, 2017)

Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. - Lars Jaffke; Hans L. Bodlaender; Pinar Heggernes; Jan Arne Telle (Eur. J. Comb., 2017)

What Is Known About Vertex Cover Kernelization? - Michael R. Fellows; Lars Jaffke; Aliz Izabella Király; Frances A. Rosamond; Mathias Weller (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. - Lars Jaffke; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (IPEC, 2018)

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (STACS, 2018)

On Weak Isomorphism of Rooted Vertex-Colored Graphs. - Lars Jaffke; Mateus de Oliveira Oliveira (WG, 2018)

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. - Lars Jaffke; Paloma T. Lima (MFCS, 2019)

FPT Algorithms for Diverse Collections of Hitting Sets. - Julien Baste; Lars Jaffke; Tomás Masarík; Geevarghese Philip; Günter Rote (Algorithms, 2019)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. - Hans L. Bodlaender; Lars Jaffke; Jan Arne Telle (CoRR, 2019)

Mim-width III. Graph powers and generalized distance domination problems. - Lars Jaffke; O-joung Kwon; Torstein J. F. Strømme; Jan Arne Telle (Theor. Comput. Sci., 2019)

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. - Lars Jaffke; Mateus de Oliveira Oliveira; Hans Raj Tiwary (MFCS, 2020)

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (WG, 2020)

Mim-Width II. The Feedback Vertex Set Problem. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (Algorithmica, 2020)

Mim-Width I. Induced path problems. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (Discret. Appl. Math., 2020)

A complexity dichotomy for critical values of the b-chromatic number of graphs. - Lars Jaffke; Paloma T. Lima (Theor. Comput. Sci., 2020)

Three Problems on Well-Partitioned Chordal Graphs. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (CIAC, 2021)

A Unifying Framework for Characterizing and Computing Width Measures. - Eduard Eiben; Robert Ganian; Thekla Hamm; Lars Jaffke; O-joung Kwon (ITCS, 2022)

On the Hardness of Generalized Domination Problems Parameterized by Mim-Width. - Brage I. K. Bakkane; Lars Jaffke (IPEC, 2022)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

Structural Parameterizations of Clique Coloring. - Lars Jaffke; Paloma T. Lima; Geevarghese Philip (Algorithmica, 2022)

b-Coloring Parameterized by Pathwidth is XNLP-complete. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (CoRR, 2022)

Well-partitioned chordal graphs. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (Discret. Math., 2022)

Structural Parameterizations of b-Coloring. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (ISAAC, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Dynamic Programming on Bipartite Tree Decompositions. - Lars Jaffke; Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2023)

A logic-based algorithmic meta-theorem for mim-width. - Benjamin Bergougnoux; Jan Dreier; Lars Jaffke (SODA, 2023)

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; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

A tight quasi-polynomial bound for Global Label Min-Cut. - Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Uéverton S. Souza (SODA, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Fine-grained parameterized complexity analysis of graph coloring problems. - Lars Jaffke; Bart M. P. Jansen (Discret. Appl. Math., 2023)

Typical Sequences Revisited - Computing Width Parameters of Graphs. - Hans L. Bodlaender; Lars Jaffke; Jan Arne Telle (Theory Comput. Syst., 2023)

On the maximum number of edges in planar graphs of bounded degree and matching number. - Lars Jaffke; Paloma T. Lima (Discret. Math., 2023)

Classes of intersection digraphs with good algorithmic properties. - Lars Jaffke; O-joung Kwon; Jan Arne Telle (J. Graph Theory, 2024)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Masaríková; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (SIAM J. Discret. Math., 2024)

Diverse Pairs of Matchings. - Fedor V. Fomin; Petr A. Golovach; Lars Jaffke; Geevarghese Philip; Danil Sagunov (Algorithmica, 2024)

b-Coloring Parameterized by Clique-Width. - Lars Jaffke; Paloma T. Lima; Daniel Lokshtanov (Theory Comput. Syst., 2024)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees. - Lars Jaffke; Paloma T. Lima; Wojciech Nadara; Emmanuel Sam (CoRR, 2025)

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001; Lars Jaffke; Paloma T. Lima (Algorithmica, 2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard. - Benjamin Bergougnoux; Lars Jaffke (CoRR, 2025)

Hedonic seat arrangement problems. - Hans L. Bodlaender; Tesshu Hanaka; Lars Jaffke; Hirotaka Ono 001; Yota Otachi; Tom C. van der Zanden (Auton. Agents Multi Agent Syst., 2025)