Stack Exchange

Michael Lampis

http://www.lamsade.dauphine.fr/~mlampis/

top accounts reputation activity subscriptions
Top Questions
Top Answers
15
Integer linear programming in logarithmic number of variables
cstheory.stackexchange.com

15
Does Hadwiger conjecture imply that NP = coNP?
cstheory.stackexchange.com

12
Inappoximability status of Max One in Three SAT for satisfiable instances
cstheory.stackexchange.com

10
Finding number of cycles of length $k$ in a graph
cstheory.stackexchange.com

10
Problems that are easy on unweighted graphs, but hard for weighted graphs
cstheory.stackexchange.com

10
If SAT is in PCP, for some constant q, then P = NP
cstheory.stackexchange.com

10
Is there a gadget that reduces generalized geography to undirected graphs?
cstheory.stackexchange.com

10
Generalized Geography on graphs of bounded treewidth
cstheory.stackexchange.com

10
What is known about this TSP variant?
cstheory.stackexchange.com

10
Nonstandard dual parametrization of graph problems
cstheory.stackexchange.com

8
Is there a SETH (Strong Exponential Time Hypothesis) for CSP (Constraint Satisfaction Problem)?
cstheory.stackexchange.com

7
In-approximability results in severely restricted graph classes
cstheory.stackexchange.com

7
NP-hard problems on trees
cstheory.stackexchange.com

7
Balanced Max-2-SAT NP-Hardness
cstheory.stackexchange.com

7
Is there a W[1]-hard problem that can be solved in $2^{o(n)}$ time?
cstheory.stackexchange.com

7
Hard problems for bounded vertex cover
cstheory.stackexchange.com

6
Inapproximability of $(\alpha, \beta)$ bi-criteria approximation
cstheory.stackexchange.com

6
Clique-width expressions with logarithmic depth
cstheory.stackexchange.com

6
W[1]-hard problems with FPT time approximation algorithms
cstheory.stackexchange.com

6
Is Hamiltonian cycle fixed parameter tractable with parameter clique cover?
cstheory.stackexchange.com

5
Standard Name for a vertex removal like operation
cstheory.stackexchange.com