14 citations · 49 across the 47 of their papers we have counts for
4 papers · 1 filter
On the Complexity of Rainbow Coloring Problems
Eduard Eiben, Robert Ganian, Juho Lauri
An edge-colored graph is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, de…
Meta-Kernelization using Well-Structured Modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Kernelization investigates exact preprocessing algorithms with performance guarantees. The most prevalent type of parameters used in kernelization is the solution size for optimiza…
Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long…
Equimatchable factor-critical graphs and independence number 2
Eduard Eiben, Michal Kotrbcik
A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, a…