activity
20152025
most citedFPT Algorithms for Diverse Collections of Hitting Sets

13 citations · 26 across the 10 of their papers we have counts for

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2022

Taming graphs with no large creatures and skinny ladders

Jakub Gajarský, Lars Jaffke, Paloma T. Lima +4

We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class there exists a constant such that no member of $\mathcal{G}…

math.CO2021

Classes of intersection digraphs with good algorithmic properties

Lars Jaffke, O-joung Kwon, Jan Arne Telle

An intersection digraph is a digraph where every vertex is represented by an ordered pair of sets such that there is an edge from to if and only if a…

math.CO2020

Well-partitioned chordal graphs: obstruction set and disjoint paths

Jungho Ahn, Lars Jaffke, O-joung Kwon +1

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the ve…