Theoretical Computer Science
daniello's user avatar
daniello's user avatar
daniello's user avatar
daniello
  • Member for 9 years, 1 month
  • Last seen more than a month ago
Profile Activity
Stats
3,256
reputation
23k
reached
49
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.
16
silver badges
24
bronze badges
Top tags
View all tags
100
Score
17
Posts
33
Posts %
69
Score
12
Posts
24
Posts %
65
Score
15
Posts
29
Posts %
60
Score
10
Posts
20
Posts %
39
Score
10
Posts
20
Posts %
38
Score
8
Posts
16
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
18
Are there interesting graph classes where the treewidth is hard (easy) to compute?
Mar 20, 2017
answer
16
Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?
Jun 9, 2015
answer
16
For what c is division by c in AC0?
Dec 2, 2014
answer
10
k-Vertex Cover problem is in parameterized Log space
Mar 1, 2017
answer
10
Can a hereditary graph class contain almost all, but not all, n-vertex graphs?
Jul 30, 2015
question
9
Enumerating Planar Graphs of Bounded Treewidth
Nov 24, 2014
answer
9
W[1]-hard problems with FPT time approximation algorithms
Apr 29, 2018
answer
8
Isomorphism of ‘ordered’ DAGs / acyclic semiautomata
Sep 12, 2020
answer
8
Reductions between languages of different densities?
Mar 19, 2017
answer
8
Reference request: complexity of $k$-partite $k$-SAT
May 13, 2017
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.