Sledovat
Stefan Kratsch
Stefan Kratsch
Professor at Humboldt University Berlin
E-mailová adresa ověřena na: informatik.hu-berlin.de - Domovská stránka
Název
Citace
Citace
Rok
Kernelization lower bounds by cross-composition
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 28 (1), 277-305, 2014
327*2014
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
HL Bodlaender, M Cygan, S Kratsch, J Nederlof
Information and Computation 243, 86-111, 2015
2292015
Representative sets and irrelevant vertices: New tools for kernelization
S Kratsch, M Wahlström
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 450-459, 2012
1172012
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
S Kratsch, M Wahlström
ACM Transactions on Algorithms (TALG) 10 (4), 1-15, 2014
1112014
Bin packing with fixed number of bins revisited
K Jansen, S Kratsch, D Marx, I Schlotter
Journal of Computer and System Sciences 79 (1), 39-49, 2013
1062013
Fast Hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Journal of the ACM (JACM) 65 (3), 1-46, 2018
98*2018
Recent developments in kernelization: A survey
S Kratsch
Bulletin of EATCS 2 (113), 2014
922014
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger
Journal of Computer and System Sciences 80 (7), 1430-1447, 2014
90*2014
Two edge modification problems without polynomial kernels
S Kratsch, M Wahlström
Discrete Optimization 10 (3), 193-199, 2013
90*2013
A completeness theory for polynomial (Turing) kernelization
D Hermelin, S Kratsch, K Sołtys, M Wahlström, X Wu
Algorithmica 71 (3), 702-730, 2015
75*2015
Fixed-parameter evolutionary algorithms and the vertex cover problem
S Kratsch, F Neumann
Algorithmica 65 (4), 754-771, 2013
722013
Preprocessing for treewidth: A combinatorial analysis through kernelization
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 27 (4), 2108-2142, 2013
722013
Clique cover and graph separation: New incompressibility results
M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014
542014
Data reduction for graph coloring problems
BMP Jansen, S Kratsch
Information and Computation 231, 70-88, 2013
542013
Finding shortest paths between graph colourings
M Johnson, D Kratsch, S Kratsch, V Patel, D Paulusma
Algorithmica 75 (2), 295-321, 2016
53*2016
Fixed-parameter tractability of multicut in directed acyclic graphs
S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
SIAM Journal on Discrete Mathematics 29 (1), 122-144, 2015
522015
Kernel bounds for path and cycle problems
HL Bodlaender, BMP Jansen, S Kratsch
Theoretical Computer Science 511, 117-136, 2013
472013
Parameterized complexity of vertex deletion into perfect graph classes
P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger
Theoretical Computer Science 511, 172-180, 2013
462013
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
S Kratsch
ACM Transactions on Algorithms (TALG) 10 (4), 1-16, 2014
432014
Polynomial kernelizations for MIN F+ Π1 and MAX NP
S Kratsch
Algorithmica 63 (1), 532-550, 2012
412012
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20