Christian Komusiewicz's user avatar
Christian Komusiewicz's user avatar
Christian Komusiewicz's user avatar
Christian Komusiewicz
  • Member for 7 years, 5 months
  • Last seen this week
26 votes
Accepted

Has parameterized complexity led to better algorithms?

10 votes
Accepted

Known property? Maximum radius of connected induced subgraph

8 votes
Accepted

Exact algorithm or parameterized algorithm for Maximum Edge Biclique Problem?

7 votes
Accepted

Series-parallel DAG characterization

6 votes

When we say a parameter is good for a problem?

5 votes
Accepted

Nonstandard dual parametrization of graph problems

5 votes

List of NP-Complete graph problems/ properties?

5 votes
Accepted

Densest k subgraph problem for outerplanar graphs?

5 votes

Best parameterized algorithm for maximum clique

5 votes
Accepted

Proving membership in W-hierarchy when problem is not parameterized by its solution size

4 votes

Problems with Unknown Single Exponential Time Agorithms

4 votes

Is perfect matching for bipartite graph with no cycles unique?

4 votes

Hardness of $k$-Plex

4 votes
Accepted

Best approximations of Minimum Dominating Sets in chordal graphs

4 votes
Accepted

The number of clauses in an unsatisfiable CNF

3 votes
Accepted

Reducing Parameterized Problems (whose solution size can be "large") to W[i]-complete problems (for fixed i)

3 votes

FPT algorithm for Partial k-tree Isomorphism

3 votes
Accepted

Problems that are NP-Complete when restricted to graphs of treewidth 2 but polynomial on trees

3 votes

generate a graph with fixed min cut

3 votes

Number of bounded minimum vertex covers

3 votes

Fast algorithm to find a maximum connected subgraph of k vertices

3 votes

Minimum graph cut with constraints

2 votes
Accepted

Why are these two definitions of PLS equivalent?

2 votes
Accepted

Proof techniques for string algorithms?

2 votes

Major open problems on polynomial kernel (non) existence

2 votes
Accepted

Enumerating all Vertex Covers of Size at most $k$