Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,672
reputation
10
19

Christian Komusiewicz

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

23
answers
1
question
~6k
people reached

Communities (7)

Top network posts

Top tags (32)

Score 47
Posts 11
Posts % 46
Score 36
Posts 4
Score 35
Posts 4
Score 34
Posts 3
Score 32
Posts 8
Score 28
Posts 2
View all tags →

Top posts (24)

All Questions Answers
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
View all questions and answers →

Badges (29)

Gold

—

Silver

10

Rarest

Bronze

19

Rarest

View all badges →

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.