Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Daniel Marx
cs.bme.hu/~dmarx
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
No questions with score of 5 or more
Top Answers
17
Small steps for better TCS conferences?
cstheory.stackexchange.com
16
If you could rename dynamic programming…
cstheory.stackexchange.com
16
What does 'gadget' mean in NP-hard reduction?
cstheory.stackexchange.com
12
Existence of $opt^c$-approximation of Dominating Set with $c < 1$?
cstheory.stackexchange.com
10
“Directed” problems that are easier than their “undirected” variant.
cstheory.stackexchange.com
9
Algebraic formulation for packing problem
cstheory.stackexchange.com
9
Parametrized Complexity of Counting Bicliques
cstheory.stackexchange.com
9
Deciding graph homomorphism
cstheory.stackexchange.com
8
Is there any problem in $\mathsf{\Sigma^P_2}$ which is solvable in bounded tree width graphs?
cstheory.stackexchange.com
8
Complexity of finding a graph separator with a given property
cstheory.stackexchange.com
7
Instance of FPT-reductions that is not a polynomial-time reduction
cstheory.stackexchange.com
7
Decomposing k-connected graphs into (k+1)-connected components
cstheory.stackexchange.com
5
Graph problems with good characterization but not known to be in $P$
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
