BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Latvia
1 × Switzerland
1 × USA
1 × United Kingdom
Collaborated with:
M.Wahlström M.Cygan H.L.Bodlaender J.Nederlof M.Pilipczuk M.Pilipczuk B.M.P.Jansen
Talks about:
preprocess (2) treewidth (2) problem (2) graph (2) determinist (1) combinatori (1) incompress (1) parameter (1) exponenti (1) dichotomi (1)

Person: Stefan Kratsch

DBLP DBLP: Kratsch:Stefan

Contributed to:

ICALP (1) 20132013
STOC 20132013
ICALP (1) 20122012
ICALP (1) 20112011
ICALP (1) 20102010

Wrote 6 papers:

ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
STOC-2013-CyganKN #performance
Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
ICALP-v1-2012-CyganKPPW #clique #graph
Clique Cover and Graph Separation: New Incompressibility Results (MC, SK, MP, MP, MW), pp. 254–265.
ICALP-v1-2012-KratschPPW #graph #multi #parametricity
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs (SK, MP, MP, MW), pp. 581–593.
ICALP-v1-2011-BodlaenderJK #analysis #combinator #kernel #preprocessor
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (HLB, BMPJ, SK), pp. 437–448.
ICALP-v1-2010-KratschW #preprocessor #problem
Preprocessing of Min Ones Problems: A Dichotomy (SK, MW), pp. 653–665.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.