Cenny Wenner

Publication Activity (10 Years)

Years Active: 2007-2015
Publications (10 Years): 1

Top Topics

Backtracking Search

Constraint Satisfaction Problems

Ordering Heuristics

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory Comput. 11 (2015)
Cenny Wenner
Parity is Positively Useless. APPROX-RANDOM (2014)
Cenny Wenner
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four. Theory Comput. 9 (2013)
Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. CoRR (2013)
Per Austrin, Rajsekar Manokaran, Cenny Wenner
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM (2013)
Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner
Complexity of Canadian traveler problem variants. Theor. Comput. Sci. 487 (2013)
Cenny Wenner
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract). APPROX-RANDOM (2012)
Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner
Complexity of Canadian Traveler Problem Variants CoRR (2012)
Cenny Wenner
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four. Electron. Colloquium Comput. Complex. 19 (2012)
Cenny Wenner
Rule-based Logical Forms Extraction. NODALIDA (2007)