Lars Jaffke
Lars Jaffke
Verified email at - Homepage
Cited by
Cited by
Mim-width II. The feedback vertex set problem
L Jaffke, O Kwon, JA Telle
Algorithmica, 1-28, 2019
Mim-width I. Induced path problems
L Jaffke, O Kwon, JA Telle
Discrete Applied Mathematics, 2019
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
Fine-grained parameterized complexity analysis of graph coloring problems
L Jaffke, BMP Jansen
10th International Conference on Algorithms and Complexity, 345-356, 2017
Definability equals recognizability for -outerplanar graphs
L Jaffke, HL Bodlaender
10th International Symposium on Parameterized and Exact Computation (IPEC†…, 2015
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, 330-356, 2018
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
Typical Sequences Revisited---Computing Width Parameters of Graphs
HL Bodlaender, L Jaffke, JA Telle
arXiv preprint arXiv:1905.03643, 2019
Diversity in combinatorial optimization
J Baste, MR Fellows, L Jaffke, T MasařŪk, MO Oliveira, G Philip, ...
arXiv preprint arXiv:1903.07410, 2019
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree -Outerplanar Graphs
L Jaffke, HL Bodlaender
arXiv preprint arXiv:1503.01604, 2015
A complexity dichotomy for critical values of the b-chromatic number of graphs
L Jaffke, PT Lima
Theoretical Computer Science 815, 182-196, 2020
Well-partitioned chordal graphs: obstruction set and disjoint paths
J Ahn, L Jaffke, O Kwon, PT Lima
arXiv preprint arXiv:2002.10859, 2020
Hedonic Seat Arrangement Problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 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
Structural Parameterizations of Clique Coloring
L Jaffke, PT Lima, G Philip
arXiv preprint arXiv:2005.04733, 2020
b-Coloring Parameterized by Clique-Width
L Jaffke, PT Lima, D Lokshtanov
arXiv preprint arXiv:2003.04254, 2020
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
L Jaffke, MO Oliveira, HR Tiwary
arXiv preprint arXiv:2001.05583, 2020
On Weak Isomorphism of Rooted Vertex-Colored Graphs
L Jaffke, M de Oliveira Oliveira
International Workshop on Graph-Theoretic Concepts in Computer Science, 266-278, 2018
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees
L Jaffke, HL Bodlaender, P Heggernes, JA Telle
European Journal of Combinatorics 66, 191-234, 2017
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, ...
The system can't perform the operation now. Try again later.
Articles 1–20