Skip to main content
daniello's user avatar
daniello's user avatar
daniello's user avatar
daniello
  • Member for 9 years, 6 months
  • Last seen more than a month ago
5 votes
Accepted

Question about algorithm for enumerating minimal AB-separators

2 votes
Accepted

Parameterized complexity of Hitting Set with slightly bigger parameter

2 votes
Accepted

Nontrivial Algorithms for Coloring (Parameterized by Pathwidth)

6 votes
Accepted

Something-Treewidth Property

5 votes

Extending cographs with product operation

4 votes
Accepted

Separating DAGs using separators consisting of lists of nodes and all ancestors

5 votes

Is the reduction from a parametrized proplem to the problem kernel just a kind of Karp reduction (polynomial-time reduction)?

5 votes
Accepted

Upperbound for max degree of k-tree completion

3 votes

Decomposing Single Crossing Minor Free graphs

8 votes
Accepted

Isomorphism of ‘ordered’ DAGs / acyclic semiautomata

6 votes

Pulling a graph across a partition

9 votes
Accepted

W[1]-hard problems with FPT time approximation algorithms

2 votes

Beating naive dynamic programming: examples similar to integer partitions?

3 votes
Accepted

Hardness of exact binomial tail bounds

6 votes

Hard problems for bounded vertex cover

2 votes

Lower bound on the largest restrained cubic subset

3 votes
Accepted

Limits of variants of Independent Set?

2 votes

Funny TCS-related papers etc?

8 votes
Accepted

Hadwiger number under matching contraction

8 votes
Accepted

Reference request: complexity of $k$-partite $k$-SAT

3 votes

Maximal non-reducible vertex cover of a graph

5 votes

Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs

18 votes

Are there interesting graph classes where the treewidth is hard (easy) to compute?

7 votes

Can we fast generate perfectly uniformly mod 3 or solve NP problem?

8 votes
Accepted

Reductions between languages of different densities?

10 votes

k-Vertex Cover problem is in parameterized Log space

4 votes
Accepted

Hardness of Subgraph isomorphism problem for sparse pattern graph

2 votes

A subset grouping problem

6 votes
Accepted

Number of local maxima in MAX-2-SAT

6 votes
Accepted

The relationship between degree of vertex and size of dominating set