24 citations · 124 across the 75 of their papers we have counts for
6 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…
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A centra…
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions
Robert Ganian, Martin Kalany, Stefan Szeider +1
We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements…
Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler +1
Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimi…