( en | de | ru )

 

Disambiguation of "Jaffke, Lars"

Author of the publication

copydeleteadd this publication to your clipboard
b-Coloring Parameterized by Pathwidth is XNLP-complete.

, , and . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christoph Jaffke

Ingeborg Jaffke

Franz Jaffke

Bernd Larsonneur

Kirsten Kastrup Larsen

 

Other publications of authors with the same name

b-Coloring Parameterized by Clique-Width., , and . CoRR, (2020)Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees., , , and . Eur. J. Comb., (2017)Typical Sequences Revisited - Computing Width Parameters of Graphs., , and . Theory Comput. Syst., 67 (1): 52-88 (February 2023)A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs., and . CoRR, (2018)On the maximum number of edges in planar graphs of bounded degree and matching number., and . Discret. Math., 346 (8): 113431 (August 2023)On the Hardness of Generalized Domination Problems Parameterized by Mim-Width., and . IPEC, volume 249 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , and . IPEC, volume 285 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Classes of Intersection Digraphs with Good Algorithmic Properties., , and . STACS, volume 219 of LIPIcs, page 38:1-38:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Unifying Framework for Characterizing and Computing Width Measures., , , , and . ITCS, volume 215 of LIPIcs, page 63:1-63:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Mim-Width II. The Feedback Vertex Set Problem., , and . Algorithmica, 82 (1): 118-145 (2020)