Theoretical Computer Science
Profile Activity
Meta user
Network profile
4,431
reputation
1
21
35

Yaroslav Bulatov

.

18
answers
25
questions
~67k
people reached

Communities (27)

Top network posts

Top tags (48)

Score 115
Posts 23
Posts % 53
Score 76
Posts 9
Score 72
Posts 6
Score 44
Posts 17
Score 25
Posts 8
Score 17
Posts 5
View all tags →

Top posts (43)

All Questions Answers
Votes Newest
65 The origin of the notion of treewidth Feb 20 '11
35 Powerful Algorithms too complex to implement Jan 23 '11
31 what is easy for minor-excluded graphs? Oct 22 '10
28 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 (57)

Gold

1

Rarest

Silver

21

Rarest

Bronze

35

Rarest

View all badges →

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.