Badge

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

vb le earned this badge 5 times
may 1 at 6:07
Parameterized complexity from P to NP-hard and back again
apr 22 at 14:49
Conjectures implying Four Color Theorem
feb 25 at 21:39
Is the feedback vertex set problem on planar bounded degree graphs hard?
feb 20 at 23:31
Best book on Simplex Method implementation?
jan 31 at 7:42
NP-hard problems on cographs

Others with this badge