Theoretical Computer Science
Meta user
Network profile
2,676
reputation
12
24

daniello

Professor at the University of Bergen. I mostly do parameterized complexity and graph algorithms.

40
answers
2
questions
~14k
people reached
  • Bergen, Norway
  • ii.uib.no/~daniello
  • Member for 5 years, 3 months
  • 343 profile views
  • Last seen Jan 6 at 5:22

Communities (3)

Top network posts

Top tags (48)

Score 78
Posts 13
Posts % 31
Score 56
Posts 9
Score 49
Posts 8
Score 45
Posts 11
Score 36
Posts 6
Score 31
Posts 8
View all tags →

Top posts (42) All Questions Answers | Votes Newest

16 For what c is division by c in AC0? Dec 2 '14
16 Are there interesting graph classes where the treewidth is hard (easy) to compute? Mar 20 '17
15 Does treewidth $k$ imply the existence of a $K_{1,k}$ minor? Jun 9 '15
10 k-Vertex Cover problem is in parameterized Log space Mar 1 '17
10 Can a hereditary graph class contain almost all, but not all, n-vertex graphs? Jul 30 '15
9 Enumerating Planar Graphs of Bounded Treewidth Nov 24 '14
8 Reductions between languages of different densities? Mar 19 '17
8 Reference request: complexity of $k$-partite $k$-SAT May 13 '17
7 Hadwiger number under matching contraction May 18 '17
7 Can we fast generate perfectly uniformly mod 3 or solve NP problem? Mar 20 '17
View all questions and answers →

Badges (36)

Gold

—

Silver

12

Rarest

Bronze

24

Rarest

View all badges →