| Generalized nogoods in CSPs G Katsirelos, F Bacchus PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE 20 (1), 390, 2005 | 127 | 2005 |
| Complexity of and algorithms for Borda manipulation J Davies, G Katsirelos, N Narodytska, T Walsh Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011 | 91 | 2011 |
| A compression algorithm for large arity extensional constraints G Katsirelos, T Walsh Principles and Practice of Constraint Programming–CP 2007, 379-393, 2007 | 85 | 2007 |
| Circuit complexity and decompositions of global constraints C Bessiere, G Katsirelos, N Narodytska, T Walsh 21st Int. Joint Conf. on AI, 2009 | 71 | 2009 |
| A restriction of extended resolution for clause learning SAT solvers G Audemard, G Katsirelos, L Simon Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 2010 | 67 | 2010 |
| Computational protein design as an optimization problem D Allouche, I André, S Barbe, J Davies, S de Givry, G Katsirelos, ... Artificial Intelligence 212, 59-79, 2014 | 63 | 2014 |
| Unrestricted nogood recording in CSP search G Katsirelos, F Bacchus International Conference on Principles and Practice of Constraint …, 2003 | 63 | 2003 |
| A new framework for computational protein design through cost function network optimization S Traoré, D Allouche, I André, S De Givry, G Katsirelos, T Schiex, S Barbe Bioinformatics 29 (17), 2129-2136, 2013 | 62 | 2013 |
| Constraint acquisition via partial queries C Bessiere, R Coletta, E Hebrard, G Katsirelos, N Lazaar, N Narodytska, ... IJCAI: International Joint Conference on Artificial Intelligence, 475-481, 2013 | 59 | 2013 |
| Multi-language evaluation of exact solvers in graphical model discrete optimization B Hurley, B O’Sullivan, D Allouche, G Katsirelos, T Schiex, M Zytnicki, ... Constraints 21 (3), 413-434, 2016 | 48 | 2016 |
| Decompositions of all different, global cardinality and related constraints C Bessiere, G Katsirelos, N Narodytska, CG Quimper, T Walsh 21st Int. Joint Conf. on AI, 2009 | 45 | 2009 |
| Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers G Katsirelos, A Sabharwal, H Samulowitz, L Simon | 40 | 2013 |
| Anytime hybrid best-first search with tree decomposition for weighted CSP D Allouche, S De Givry, G Katsirelos, T Schiex, M Zytnicki International Conference on Principles and Practice of Constraint …, 2015 | 38 | 2015 |
| Relaxation search: A simple way of managing optional clauses F Bacchus, J Davies, M Tsimpoukelli, G Katsirelos Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014 | 37 | 2014 |
| Nogood processing in CSPs G Katsirelos University of Toronto, 2008 | 36 | 2008 |
| On the complexity and completeness of static constraints for breaking row and column symmetry G Katsirelos, N Narodytska, T Walsh Principles and Practice of Constraint Programming–CP 2010, 305-320, 2010 | 29 | 2010 |
| Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules J Davies, G Katsirelos, N Narodytska, T Walsh, L Xia Artificial Intelligence 217, 20-42, 2014 | 27 | 2014 |
| Eigenvector centrality in industrial SAT instances G Katsirelos, L Simon International Conference on Principles and Practice of Constraint …, 2012 | 27 | 2012 |
| Decomposition of the NValue Constraint C Bessiere, G Katsirelos, N Narodytska, CG Quimper, T Walsh International Conference on Principles and Practice of Constraint …, 2010 | 24 | 2010 |
| Using minimal correction sets to more efficiently compute minimal unsatisfiable sets F Bacchus, G Katsirelos International Conference on Computer Aided Verification, 70-86, 2015 | 23 | 2015 |
Toby WalshProfessor, UNSW and Data61Verified email at cse.unsw.edu.au
