Theoretical Computer Science
daniello
  • Member for 7 years, 3 months
  • Last seen more than a month ago
Profile Activity
Stats
3,091
reputation
19k
reached
46
answers
2
questions
Communities
About

Associate Professor at the University of California Santa Barbara. I mostly do parameterized complexity and graph algorithms.

Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
24
bronze badges
Top tags
View all tags
98
Score
17
Posts
35
Posts %
64
Score
10
Posts
21
Posts %
58
Score
13
Posts
27
Posts %
56
Score
9
Posts
19
Posts %
37
Score
9
Posts
19
Posts %
36
Score
6
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
16
For what c is division by c in AC0?
Dec 2 '14
16
Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?
Jun 9 '15
16
Are there interesting graph classes where the treewidth is hard (easy) to compute?
Mar 20 '17
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
9
W[1]-hard problems with FPT time approximation algorithms
Apr 29 '18
8
Isomorphism of ‘ordered’ DAGs / acyclic semiautomata
Sep 12 '20
8
Reductions between languages of different densities?
Mar 19 '17
8
Reference request: complexity of $k$-partite $k$-SAT
May 13 '17
Top network posts
View all network posts
27
How to have productive meetings with Ph.D supervisor

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.