Theoretical Computer Science

Necromancer

 Necromancer
Answer a question more than 60 days later with score of 5 or more. This badge can be awarded multiple times.

earned this badge 4 times.
Clique-width expressions with logarithmic depth
Awarded Dec 10, 2017 at 12:27
Hard problems for bounded vertex cover
Awarded Jul 6, 2017 at 20:59
NP-hard problems on trees
Awarded Jan 6, 2017 at 13:15
In-approximability results in severely restricted graph classes
Awarded Dec 20, 2012 at 11:25

Others with this badge

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.