29 citations · 63 across the 22 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm +2
Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specifi…
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…