|Nice Question||Question score of 10 or more. This badge can be awarded multiple times.|
Vinayak Pathak earned this badge 7 times
nov 15 at 4:13Element distinctness in O(n) time?
may 2 '12 at 12:24Drawing graphs with few “sharp” vertices?
mar 30 '12 at 15:26Given a graph, decide if its edge connectivity is at least n/2 or not
mar 30 '12 at 15:26Largest common subgraph of two maximal planar graphs
may 9 '11 at 18:48Examples where insight from geometry was useful for solving something completely non-geometric
sep 2 '10 at 2:15Is the lower bound proof in this paper correct?