Badge
| Nice Question | Question score of 10 or more. This badge can be awarded multiple times. |
Shiva Kintali earned this badge 34 times |
dec 13 at 23:27
LogDCFL-complete problems
oct 8 at 6:41
MSO properties, planar graphs and minor-free graphs
sep 3 at 20:43
Hard Problems for higher genus graphs
apr 6 '12 at 13:39
Decomposing k-connected graphs into (k+1)-connected components
mar 30 '12 at 15:26
Parallel algorithms for reachability in directed planar graphs
mar 28 '12 at 9:50
Decomposing graphs of genus one
mar 6 '12 at 8:24
Hardness of Computing Weisfeiler-Lehman labels
mar 1 '12 at 23:26
Treewidth and the NL vs L Problem
jan 18 '12 at 13:37
Separating Logspace from Polynomial time
dec 17 '11 at 8:28
Open access journals
dec 3 '11 at 14:45
Hardness of Vertex Separators
nov 22 '11 at 14:42
Forbidden minors for bounded treewidth graphs
nov 10 '11 at 15:57
P-complete problems on trees
nov 9 '11 at 6:46
Forbidden minors for bounded genus graphs
jun 25 '11 at 21:17
Proofs, Barriers and P vs NP
jun 25 '11 at 21:12
Parallel algorithms for directed st-connectivity
mar 26 '11 at 17:56
Conjectures implying Four Color Theorem
mar 21 '11 at 14:42
Cover Time of Directed Graphs
mar 14 '11 at 22:34
Minimum Flip Connectivity Problem
feb 26 '11 at 18:55
Reconstruction Conjecture and Partial 2-trees
jan 2 '11 at 2:43
Barriers and Monotone Circuit Complexity
dec 20 '10 at 5:37
Linear PRAM vs Arithmetic Linear PRAM
dec 6 '10 at 1:44
coNP certificate for Graph Isomorphism
dec 1 '10 at 4:48
Efficient logspace algorithms
nov 6 '10 at 23:19
Directed NP-hard problems on DAGs
nov 1 '10 at 5:36
SC^2 algorithms for st-connectivity
oct 20 '10 at 15:01
Hardness of approximation assuming NP != coNP
oct 13 '10 at 6:50
Alternate proofs of Immerman-Szelepcsenyi theorem
oct 11 '10 at 16:57
Optimal greedy algorithms for NP-hard problems
sep 28 '10 at 21:34
Randomized algorithms using a stack
sep 21 '10 at 15:03
Intermediate problems between L and NL
sep 16 '10 at 19:30
Logspace algorithms on graphs with bounded tree width
sep 15 '10 at 15:57
Space complexity of Coppersmith–Winograd algorithm
sep 13 '10 at 2:21
NP-hard problems on trees
