|Nice Answer||Answer score of 10 or more. This badge can be awarded multiple times.|
Hsien-Chih Chang 張顯之 earned this badge 17 times
jan 15 at 1:03Common false beliefs in theoretical computer science
dec 2 at 17:04Does LOGLOG = NLOGLOG?
jul 17 at 1:22Reference for (odd-hole,antihole)-free graphs?
apr 1 '12 at 21:07How do you get a “Physical Intuition” for results in TCS?
mar 11 '12 at 10:54Drawing graphs of bounded crossing number
mar 17 '11 at 11:01Lower Bounds for Data Structures
mar 7 '11 at 2:50Circle graph visualisation
feb 13 '11 at 22:02Finding a prime greater than a given bound
feb 9 '11 at 7:44Subexponentially solvable hard graph problems
feb 5 '11 at 3:00What's the approximation factor of this Max k-Cut approximation?
dec 29 '10 at 3:30Open problems on the frontiers of TCS
dec 22 '10 at 17:06Ramsey's theorem for collections of sets
dec 9 '10 at 22:59Conditions for NFA universality
dec 8 '10 at 7:07Common false beliefs in theoretical computer science
dec 2 '10 at 17:35“Overflow” in Extended Euclidean Algorithm
oct 29 '10 at 17:19what is easy for minor-excluded graphs?
oct 24 '10 at 13:45Logspace algorithms on graphs with bounded tree width