Lars Jaffke

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Classes of intersection digraphs with good algorithmic properties	2024-04-23	Paper
Classes of intersection digraphs with good algorithmic properties	2024-03-25	Paper
Diverse Pairs of Matchings	2023-11-14	Paper
What Is Known About Vertex Cover Kernelization?	2023-06-30	Paper
On the maximum number of edges in planar graphs of bounded degree and matching number	2023-05-31	Paper
Typical sequences revisited -- computing width parameters of graphs	2023-04-27	Paper
Three problems on well-partitioned chordal graphs	2023-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5874334	2023-02-07	Paper
Treewidth is NP-Complete on Cubic Graphs (and related results)	2023-01-24	Paper
Fine-grained parameterized complexity analysis of graph coloring problems	2023-01-11	Paper
Well-partitioned chordal graphs: obstruction set and disjoint paths	2022-12-21	Paper
A complexity dichotomy for critical values of the b-chromatic number of graphs	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089217	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089218	2022-07-18	Paper
Well-partitioned chordal graphs	2022-06-14	Paper
Taming graphs with no large creatures and skinny ladders	2022-05-02	Paper
Structural parameterizations of clique coloring	2022-03-25	Paper
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory	2022-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q5009468	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q3304141	2020-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5111880	2020-05-27	Paper
Structural Parameterizations of Clique Coloring	2020-05-10	Paper
Mim-width. I. Induced path problems	2020-04-21	Paper
A complexity dichotomy for critical values of the $b$-chromatic number of graphs	2020-04-06	Paper
Well-partitioned chordal graphs: obstruction set and disjoint paths	2020-02-25	Paper
Mim-width. II. The feedback vertex set problem	2020-01-16	Paper
Mim-width. III. Graph powers and generalized distance domination problems	2019-11-13	Paper
Typical Sequences Revisited --- Computing Width Parameters of Graphs	2019-05-09	Paper
On weak isomorphism of rooted vertex-colored graphs	2018-11-22	Paper
Generalized distance domination problems and their complexity on graphs of bounded mim-width	2018-03-09	Paper
Definability Equals Recognizability for $k$-Outerplanar Graphs	2017-09-29	Paper
Definability equals recognizability for $k$-outerplanar graphs and $l$-chordal partial $k$-trees	2017-09-11	Paper
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems	2017-07-21	Paper
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs	2015-03-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Lars Jaffke