Cenny Wenner

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.

Per Austrin, Rajsekar Manokaran, Cenny Wenner

Theory Comput., 2015

2014

Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction.

Cenny Wenner

PhD thesis, 2014

Parity is Positively Useless.

Cenny Wenner

Proceedings of the Approximation, 2014

2013

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.

Cenny Wenner

Theory Comput., 2013

Complexity of Canadian traveler problem variants.

Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner

Theor. Comput. Sci., 2013

2012

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract).

Cenny Wenner

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2007

Rule-based Logical Forms Extraction.

Cenny Wenner

Proceedings of the 16th Nordic Conference of Computational Linguistics, 2007