Skip to main content
Theoretical Computer Science
Stefan Kratsch's user avatar
Stefan Kratsch's user avatar
Stefan Kratsch's user avatar
Stefan Kratsch
  • Member for 13 years, 7 months
  • Last seen more than 12 years ago
Profile Activity
Stats
409
reputation
4k
reached
4
answers
0
questions
Communities
About

I'm a postdoc at Technical University Berlin, with main interest in parameterized complexity. As of November 23, 2012, I have two open PhD positions at TU Berlin.

Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
5
bronze badges
Top tags
View all tags
20
Score
2
Posts
50
Posts %
20
Score
2
Posts
50
Posts %
16
Score
1
Posts
25
Posts %
16
Score
1
Posts
25
Posts %
13
Score
2
Posts
50
Posts %
9
Score
1
Posts
25
Posts %
Top posts
answer
16
Is the feedback vertex set problem on planar bounded degree graphs hard?
Mar 30, 2012
answer
9
Is there a list of forbidden subgraphs for comparability graphs?
Aug 9, 2011
answer
8
Any results on binary boolean CSP beyond the fixed-parameter tractability of almost 2SAT problem?
Jul 19, 2011
answer
4
What is the complexity of chordalization?
Jun 19, 2012