| Complexity of Canadian traveler problem variants D Fried, SE Shimony, A Benbassat, C Wenner Theoretical Computer Science 487, 1-16, 2013 | 40 | 2013 |
| Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four: C Wenner International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 25 | 2012 |
| On the NP-hardness of approximating ordering-constraint satisfaction problems P Austrin, R Manokaran, C Wenner Theory of Computing 11 (1), 257-283, 2015 | 9 | 2015 |
| Evaluation of pharmaceutical intervention strategies against pandemics in Sweden: A scenario‐driven multiple criteria decision analysis study A Talantsev, T Fasth, C Wenner, E Wolff, A Larsson Journal of Multi‐Criteria Decision Analysis 29 (1-2), 49-66, 2022 | 8 | 2022 |
| On the NP-hardness of approximating ordering constraint satisfaction problems P Austrin, R Manokaran, C Wenner International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 8 | 2013 |
| Hardness results for the shortest path problem under partial observability C Wenner Institutionen för datavetenskap, Lunds universitet, 2009 | 5 | 2009 |
| Parity is positively useless C Wenner APPROX/RANDOM 2014, 433-448, 2014 | 2 | 2014 |
| Rule-based logical forms extraction C Wenner Proceedings of the 16th Nordic Conference of Computational Linguistics …, 2007 | 2 | 2007 |
| Benchmark Inflation: Revealing LLM Performance Gaps Using Retro-Holdouts J Haimes, C Wenner, K Thaman, V Tashev, C Neo, E Kran, J Schreiber arXiv preprint arXiv:2410.09247, 2024 | | 2024 |
| Evaluation of pharmaceutical intervention strategies against pandemics in Sweden: a scenario-driven MCDA study A Talantsev, C Wenner, T Fasth, E Wolff, A Larsson Value in Health, 2020 | | 2020 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) I Abraham, S Chechik, K Talwar, S Ahmadian, B Behsaz, Z Friggstad, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2014 | | 2014 |
| Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction C Wenner Numerical Analysis and Computer Science (NADA), Stockholm University, 2014 | | 2014 |
| Travelling in Unknown and Changing Graphs C Wenner | | 2008 |
| DATN09-Computational Geometry Lund University C Wenner | | 2008 |
| Extracting Logical Forms and Recognising Textual Entailment C Wenner Projektarbeten 2006, 75, 2007 | | 2007 |
Amit BenbassatSapir Academic College確認したメール アドレス: mail.sapir.ac.il