Rule-based Logical Forms Extraction. - Cenny Wenner (NODALIDA, 2007)

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract). - Cenny Wenner (APPROX-RANDOM, 2012)

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

Complexity of Canadian traveler problem variants. - Dror Fried; Solomon Eyal Shimony; Amit Benbassat; Cenny Wenner (Theor. Comput. Sci., 2013)

Parity is Positively Useless. - Cenny Wenner (APPROX-RANDOM, 2014)

Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction. - Cenny Wenner (2014)

On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. - Per Austrin; Rajsekar Manokaran; Cenny Wenner (Theory Comput., 2015)

Benchmark Inflation: Revealing LLM Performance Gaps Using Retro-Holdouts. - Jacob Haimes; Cenny Wenner; Kunvar Thaman; Vassil Tashev; Clement Neo; Esben Kran; Jason Schreiber (CoRR, 2024)