World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
3703
World Ranking
13262
National Ranking
638

Best Publications

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Hans L. Bodlaender;Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • Kernelization lower bounds by cross-composition

    HL Hans Bodlaender;Bmp Bart Jansen;Stefan Kratsch

  • Cross-Composition: A New Technique for Kernelization Lower Bounds

    HL Hans Bodlaender;Bmp Bart Jansen;Stefan Kratsch

  • Representative Sets and Irrelevant Vertices: New Tools for Kernelization

    Stefan Kratsch;Magnus WahlströM

  • Bin packing with fixed number of bins revisited

    Klaus Jansen;Stefan Kratsch;DáNiel Marx;Ildikó Schlotter

  • Representative Sets and Irrelevant Vertices: New Tools for Kernelization

    Stefan Kratsch;Magnus Wahlstrom

  • Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal

    Stefan Kratsch;Magnus Wahlström

  • Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

    Stefan Kratsch;Frank Neumann

  • Fast Hamiltonicity Checking Via Bases of Perfect Matchings

    Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • Two Edge Modification Problems without Polynomial Kernels

    Stefan Kratsch;Magnus Wahlström

  • Recent developments in kernelization: A survey

    Stefan Kratsch

  • A Completeness Theory for Polynomial (Turing) Kernelization

    Danny Hermelin;Stefan Kratsch;Karolina Sołtys;Magnus Wahlström

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Unknown

  • Data reduction for graph coloring problems

    Bart M. P. Jansen;Stefan Kratsch

  • Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

    Hans L. Bodlaender;Bart M. P. Jansen;Stefan Kratsch

  • Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters

    Fedor V. Fomin;Stefan Kratsch;Marcin Pilipczuk;Michał Pilipczuk

  • Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs

    Stefan Kratsch;Marcin Pilipczuk;MichaŁ Pilipczuk;Magnus Wahlström

  • Kernel bounds for path and cycle problems

    Hans L. Bodlaender;Bart M. P. Jansen;Stefan Kratsch

  • Isomorphism for graphs of bounded feedback vertex set number

    Stefan Kratsch;Pascal Schweitzer

  • Clique Cover and Graph Separation: New Incompressibility Results

    Marek Cygan;Stefan Kratsch;Marcin Pilipczuk;Michał Pilipczuk

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Recently Published Articles