Lars Jaffke
Lars Jaffke
Verified email at - Homepage
Cited by
Cited by
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
J Baste, MR Fellows, L Jaffke, T Masarık, M de Oliveira Oliveira, G Philip, ...
IJCAI 2020, 1119--1125, 2020
Mim-width III. Graph powers and generalized distance domination problems
L Jaffke, O Kwon, TJF Strømme, JA Telle
Theoretical Computer Science 796, 216-236, 2019
Mim-width II. The feedback vertex set problem
L Jaffke, O Kwon, JA Telle
Algorithmica 82 (1), 118-145, 2019
Mim-width I. Induced path problems
L Jaffke, O Kwon, JA Telle
Discrete Applied Mathematics 278, 153-168, 2019
Fine-grained parameterized complexity analysis of graph coloring problems
L Jaffke, BMP Jansen
Discrete Applied Mathematics 327, 33-46, 2023
What is known about vertex cover kernelization?
MR Fellows, L Jaffke, AI Király, FA Rosamond, M Weller
Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to …, 2018
Diverse pairs of matchings
FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov
arXiv preprint arXiv:2009.04567, 2020
FPT algorithms for diverse collections of hitting sets
J Baste, L Jaffke, T Masařík, G Philip, G Rote
Algorithms 12 (12), 254, 2019
A logic-based algorithmic meta-theorem for mim-width
B Bergougnoux, J Dreier, L Jaffke
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
A unifying framework for characterizing and computing width measures
E Eiben, R Ganian, T Hamm, L Jaffke, O Kwon
arXiv preprint arXiv:2109.14610, 2021
Hedonic seat arrangement problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
Typical Sequences Revisited—Computing Width Parameters of Graphs
HL Bodlaender, L Jaffke, JA Telle
Theory of Computing Systems 67 (1), 52-88, 2023
b-Coloring Parameterized by Clique-Width
L Jaffke, PT Lima, D Lokshtanov
Theory of Computing Systems, 1-33, 2023
Well-partitioned chordal graphs
J Ahn, L Jaffke, O Kwon, PT Lima
Discrete Mathematics 345 (10), 112985, 2022
XNLP-completeness for parameterized problems on graphs with a linear structure
HL Bodlaender, C Groenland, H Jacob, L Jaffke, PT Lima
arXiv preprint arXiv:2201.13119, 2022
Classes of intersection digraphs with good algorithmic properties
L Jaffke, O Kwon, JA Telle
arXiv preprint arXiv:2105.01413, 2021
Bounded Width Graph Classes in Parameterized Algorithms
L Jaffke
University of Bergen, Norway, 2020
Well-partitioned chordal graphs: obstruction set and disjoint paths
J Ahn, L Jaffke, O Kwon, PT Lima
Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020
A note on the complexity of feedback vertex set parameterized by mim-width
L Jaffke, O Kwon, JA Telle
arXiv preprint arXiv:1711.05157, 2017
Definability equals recognizability for -outerplanar graphs
L Jaffke, HL Bodlaender
10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015
The system can't perform the operation now. Try again later.
Articles 1–20