Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Shiva Kintali
San Jose, CA, United States
http://shivakintali.org
Visit http://shivakintali.org
top
accounts
reputation
activity
subscriptions
Top Questions
58
votes
Open access journals
soft-question
conferences
journals
asked Dec 16, 2011 at 22:44
cstheory.stackexchange.com
51
votes
NP-hard problems on trees
cc.complexity-theory
np-hardness
tree
asked Sep 12, 2010 at 23:01
cstheory.stackexchange.com
39
votes
Optimal greedy algorithms for NP-hard problems
cc.complexity-theory
lower-bounds
approximation-algorithms
greedy-algorithms
approximation-hardness
asked Sep 13, 2010 at 2:01
cstheory.stackexchange.com
38
votes
Conjectures implying Four Color Theorem
graph-theory
co.combinatorics
big-list
graph-colouring
asked Mar 26, 2011 at 0:49
cstheory.stackexchange.com
32
votes
Hardness of approximation assuming NP != coNP
approximation-hardness
conditional-results
asked Oct 20, 2010 at 4:06
cstheory.stackexchange.com
31
votes
coNP certificate for Graph Isomorphism
cc.complexity-theory
graph-isomorphism
asked Nov 16, 2010 at 20:12
cstheory.stackexchange.com
31
votes
Treewidth and the NL vs L Problem
cc.complexity-theory
graph-theory
space-bounded
treewidth
logspace
asked Mar 1, 2012 at 20:49
cstheory.stackexchange.com
31
votes
New relation symbol
symbols
relation-symbols
asked Apr 17, 2013 at 21:35
tex.stackexchange.com
26
votes
Intermediate problems between L and NL
cc.complexity-theory
space-bounded
asked Sep 21, 2010 at 5:02
cstheory.stackexchange.com
26
votes
Proofs, Barriers and P vs NP
cc.complexity-theory
proofs
barriers
p-vs-np
asked Sep 16, 2010 at 23:50
cstheory.stackexchange.com
1
2
3
4
5
next
Top Answers
26
About properties of adjacency matrix when a graph is planar
cstheory.stackexchange.com
21
What are the recent TCS books whose drafts are available online?
cstheory.stackexchange.com
20
When should you say what you know?
cstheory.stackexchange.com
18
What is an algorithm to find a minimum vertex cover on a bipartite graph with weighted vertices?
cstheory.stackexchange.com
15
Why are these two definitions of PPAD equivalent?
cstheory.stackexchange.com
15
Introduction to spectral graph theory
cstheory.stackexchange.com
14
Graph problems with good characterization but not known to be in $P$
cstheory.stackexchange.com
14
Formal representation of rings in computations
cstheory.stackexchange.com
12
Semantic distance between excerpts of text.
cstheory.stackexchange.com
11
Approximation algorithms for problems in P
cstheory.stackexchange.com
11
Is the backup problem NP-complete?
cstheory.stackexchange.com
9
Minimum length walk from s to t covering a subset of vertices
cstheory.stackexchange.com
9
Is Clique completion for intersection models hard?
cstheory.stackexchange.com
8
graphs from real-life problems
cstheory.stackexchange.com
7
Complexity of finding a second solution given a correct solution to an NP-complete problem
cstheory.stackexchange.com
7
Keyword selection problem in search engine marketing auction
cstheory.stackexchange.com
6
Are variables in RHS of Chomsky Normal Form productions distinct?
cstheory.stackexchange.com
6
Minimum cut through vertices/nodes - not edges
cstheory.stackexchange.com
5
Optimal algorithm for finding the girth of a sparse graph?
cstheory.stackexchange.com
5
Consequences of existence of a strongly polynomial algorithm for linear programming?
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
tex.stackexchange.com