- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
- SIAM J. Discrete Math.
- 2012

We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently… (More)

- Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
- ICALP
- 2013

It is well known that many local graph problems, like Vertex Cover?and Dominating Set, can be solved in time 2 O ( tw ) | V | O ( 1 ) for graphs G = ( V , E ) with a given tree decomposition of width… (More)

- Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
- STACS
- 2010

We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with… (More)

- Stefan Kratsch, Magnus Wahlström
- IEEE 53rd Annual Symposium on Foundations of…
- 2011

The existence of a polynomial kernel for Odd Cycle Transversal was a notorious open problem in parameterized complexity. Recently, this was settled by the present authors (Kratsch and Wahlstrom, SODA… (More)

- Stefan Kratsch, Magnus Wahlström
- IWPEC
- 2009

Given a graph G and an integer k, the ? Edge Completion/Editing/Deletion problem asks whether it is possible to add, edit, or delete at most k edges in G such that one obtains a graph that fulfills… (More)

- Stefan Kratsch, Magnus Wahlström
- ACM Trans. Algorithms
- 2011

The Odd Cycle Transversal problem (OCT) asks whether a given undirected graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result, Reed, Smith, and Vetta (Operations… (More)

- Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
- Inf. Comput.
- 2015

- Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
- J. Comput. Syst. Sci.
- 2013

As Bin Packing is NP-hard already for k=2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially… (More)

- Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
- ICALP
- 2011

The notion of treewidth plays an important role in theoretical and practical studies of graph problems. It has been recognized that, especially in practical environments, when computing the treewidth… (More)

- Stefan Kratsch, Pascal Schweitzer
- Discrete Applied Mathematics
- 2017

Abstract We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two… (More)