Spremljaj
Stefan Kratsch
Stefan Kratsch
Professor at Humboldt University Berlin
Preverjeni e-poštni naslov na informatik.hu-berlin.de - Domača stran
Naslov
Navedeno
Navedeno
Leto
Kernelization lower bounds by cross-composition
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 28 (1), 277-305, 2014
363*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
3022015
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
1462013
Fast hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Journal of the ACM (JACM) 65 (3), 1-46, 2018
1382018
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
1322014
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
1322012
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
106*2014
Recent developments in kernelization: A survey
S Kratsch
Bulletin of EATCS 2 (113), 2014
1012014
Two edge modification problems without polynomial kernels
S Kratsch, M Wahlström
Discrete Optimization 10 (3), 193-199, 2013
97*2013
Fixed-parameter evolutionary algorithms and the vertex cover problem
S Kratsch, F Neumann
Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009
942009
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
90*2015
Preprocessing for treewidth: A combinatorial analysis through kernelization
HL Bodlaender, BMP Jansen, S Kratsch
SIAM Journal on Discrete Mathematics 27 (4), 2108-2142, 2013
812013
Data reduction for graph coloring problems
BMP Jansen, S Kratsch
Information and Computation 231, 70-88, 2013
702013
Representative sets and irrelevant vertices: New tools for kernelization
S Kratsch, M Wahlström
Journal of the ACM (JACM) 67 (3), 1-50, 2020
682020
Finding shortest paths between graph colourings
M Johnson, D Kratsch, S Kratsch, V Patel, D Paulusma
Algorithmica 75 (2), 295-321, 2016
612016
Point line cover: The easy kernel is essentially tight
S Kratsch, G Philip, S Ray
ACM Transactions On Algorithms (TALG) 12 (3), 1-16, 2016
572016
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
572014
Kernel bounds for path and cycle problems
HL Bodlaender, BMP Jansen, S Kratsch
Theoretical Computer Science 511, 117-136, 2013
562013
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
552013
Polynomial kernels for weighted problems
M Etscheid, S Kratsch, M Mnich, H Röglin
Journal of Computer and System Sciences 84, 1-10, 2017
522017
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20