E-LIB Suche - Ergebnisse für: Jaffke, Lars

1

Diverse Pairs of Matchings:

Fomin, Fedor V. ; Golovach, Petr A. ; Jaffke, Lars..
Algorithmica. 86 (2024) 6 - p. 2026-2040 , 2024

Link: https://doi.org/10.1007/..

2

On the maximum number of edges in planar graphs of bounded ..:

Jaffke, Lars ; Lima, Paloma T.
Discrete Mathematics. 346 (2023) 8 - p. 113431 , 2023

Link: https://doi.org/10.1016/..

3

Fine-grained parameterized complexity analysis of graph col..:

Jaffke, Lars ; Jansen, Bart M.P.
Discrete Applied Mathematics. 327 (2023) - p. 33-46 , 2023

Link: https://doi.org/10.1016/..

4

Classes of intersection digraphs with good algorithmic prop..:

Jaffke, Lars ; Kwon, O‐joung ; Telle, Jan Arne
Journal of Graph Theory. 106 (2023) 1 - p. 110-148 , 2023

Link: https://doi.org/10.1002/..

5

b-Coloring Parameterized by Clique-Width:

Jaffke, Lars ; Lima, Paloma T. ; Lokshtanov, Daniel
Theory of Computing Systems. , 2023

Link: https://doi.org/10.1007/..

6

Diversity of solutions: An exploration through the lens of ..:

Baste, Julien ; Fellows, Michael R. ; Jaffke, Lars...
Artificial Intelligence. 303 (2022) - p. 103644 , 2022

Link: https://doi.org/10.1016/..

7

Well-partitioned chordal graphs:

Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung.
Discrete Mathematics. 345 (2022) 10 - p. 112985 , 2022

Link: https://doi.org/10.1016/..

8

Structural Parameterizations of Clique Coloring:

Jaffke, Lars ; Lima, Paloma T. ; Philip, Geevarghese
Algorithmica. 84 (2021) 2 - p. 273-303 , 2021

Link: https://doi.org/10.1007/..

9

Typical Sequences Revisited — Computing Width Parameters of..:

Bodlaender, Hans L. ; Jaffke, Lars ; Telle, Jan Arne
Theory of Computing Systems. 67 (2021) 1 - p. 52-88 , 2021

Link: https://doi.org/10.1007/..

10

Three Problems on Well-Partitioned Chordal Graphs:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung. - p. 23-36 , 2021

Link: https://doi.org/10.1007/..

11

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoi..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung. - p. 148-160 , 2020

Link: https://doi.org/10.1007/..

12

Mim-Width I. Induced path problems:

Jaffke, Lars ; Kwon, O-joung ; Telle, Jan Arne
Discrete Applied Mathematics. 278 (2020) - p. 153-168 , 2020

Link: https://doi.org/10.1016/..

13

Hedonic Seat Arrangement Problems:

, In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems,

Bodlaender, Hans L. ; Hanaka, Tesshu ; Jaffke, Lars... - p. 1777-1779 , 2020

Link: https://dl.acm.org/doi/1..

14

A complexity dichotomy for critical values of the b-chromat..:

Jaffke, Lars ; Lima, Paloma T.
Theoretical Computer Science. 815 (2020) - p. 182-196 , 2020

Link: https://doi.org/10.1016/..

15

Mim-width III. Graph powers and generalized distance domina..:

Jaffke, Lars ; Kwon, O-joung ; Strømme, Torstein J.F..
Theoretical Computer Science. 796 (2019) - p. 216-236 , 2019

Link: https://doi.org/10.1016/..