Theoretical Computer Science
Meta user
Network profile
4,319
reputation
1
20
32

Yaroslav Bulatov

.

18
answers
23
questions
~61k
people reached

Communities (27)

Top network posts

Top tags (45)

Score 111
Posts 23
Posts % 56
Score 72
Posts 9
Score 68
Posts 6
Score 44
Posts 17
Score 24
Posts 8
Score 17
Posts 5
View all tags →

Top posts (41) All Questions Answers | Votes Newest

61 The origin of the notion of treewidth Feb 20 '11
33 Powerful Algorithms too complex to implement Jan 23 '11
31 what is easy for minor-excluded graphs? Oct 22 '10
27 Which SAT problems are easy? Jan 18 '11
26 When is relaxed counting hard? Sep 22 '10
23 graphs from real-life problems Nov 30 '10
20 Examples of hardness phase transitions Nov 3 '10
15 Graph decompositions for combining “local” functions of vertex labelings Oct 31 '10
13 LP relaxation of independent set Feb 26 '11
12 Typical hardness of tree decomposition? Dec 8 '10
View all questions and answers →

Badges (53)

Gold

1

Rarest

Silver

20

Rarest

Bronze

32

Rarest

View all badges →