Kratsch Stefan

Stefan Kratsch

Information about the author Stefan Kratsch will soon be added to the site.
Found 7 papers in total
On Kernelization and Approximation for the Vector Connectivity Problem
On Kernelization and Approximation for the Vector Connectivity Problem
2017
In the Vector Connectivity problem we are given an undirected graph G = ( V , E ) , a...
Approximability and parameterized complexity of multicover by c-intervals
Approximability and parameterized complexity of multicover by c-intervals
2015
A c ‐interval is the disjoint union of c intervals over ‐ N . The c...
Finding Shortest Paths Between Graph Colourings
Finding Shortest Paths Between Graph Colourings
2016
The k ‐colouring reconfiguration problem asks whether, for a given graph G ,...
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
2016
The workflow satisfiability problem ( wsp ) is a problem of practical interest that...
Parameterized Two-Player Nash Equilibrium
Parameterized Two-Player Nash Equilibrium
2013
We study the problem of computing Nash equilibria in a two‐player normal form...
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
2013
In this paper, we consider multi‐objective evolutionary algorithms for the...
Polynomial Kernelizations for MIN F+Π 1 and MAX NP
Polynomial Kernelizations for MIN F+Π 1 and MAX NP
2012
It has been observed in many places that constant‐factor approximable problems...
Papers per page: