Theoretical Computer Science
Christian Komusiewicz
  • Member for 5 years, 2 months
  • Last seen this week
Profile Activity
Stats
1,670
reputation
7k
reached
23
answers
1
question
Communities
View all
About

Researcher at Philipps-University Marburg. Interested in hard problems, fpt algorithms, algorithm engineering, computational biology, music and basketball.

Badges
View all badges
This user doesn’t have any gold badges yet.
11
silver badges
19
bronze badges
Top tags
View all tags
47
Score
11
Posts
46
Posts %
36
Score
4
Posts
17
Posts %
35
Score
4
Posts
17
Posts %
34
Score
3
Posts
12
Posts %
32
Score
8
Posts
33
Posts %
28
Score
2
Posts
8
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
26
Has parameterized complexity led to better algorithms?
Oct 2 '20
10
Known property? Maximum radius of connected induced subgraph
Jan 20 '20
9
Forbidden Subgraph Characterization for Graphs with few Maximal Cliques
Oct 9 '20
8
Exact algorithm or parameterized algorithm for Maximum Edge Biclique Problem?
Jul 19 '18
7
Series-parallel DAG characterization
Oct 2 '20
6
When we say a parameter is good for a problem?
Apr 10 '18
5
Nonstandard dual parametrization of graph problems
Dec 2 '16
5
Densest k subgraph problem for outerplanar graphs?
Apr 19 '19
5
List of NP-Complete graph problems/ properties?
Feb 12 '20
5
Best parameterized algorithm for maximum clique
Jun 5 '20
Top network posts
View all network posts
5
Complexity of Block edit distance with Swapping only

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.