Cenny Wenner

According to our database1, Cenny Wenner authored at least 7 papers between 2007 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.
Theory Comput., 2015

2014
Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction.
PhD thesis, 2014

Parity is Positively Useless.
Proceedings of the Approximation, 2014

2013
Complexity of Canadian traveler problem variants.
Theor. Comput. Sci., 2013

2012
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.
Electron. Colloquium Comput. Complex., 2012

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract).
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2007
Rule-based Logical Forms Extraction.
Proceedings of the 16th Nordic Conference of Computational Linguistics, 2007


  Loading...