By Scientia Professor Toby Walsh

Preprints

Grandi U; Loreggia A; Rossi F; Venable KB; Walsh T, 2013, Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency, http://dx.doi.org/10.4204/eptcs.112.6

Katsirelos G; Narodytska N; Walsh T, 2012, The SeqBin Constraint Revisited, http://dx.doi.org/10.48550/arxiv.1207.1811

Davies J; Narodytska N; Walsh T, 2012, Eliminating the Weakest Link: Making Manipulation Intractable?, http://dx.doi.org/10.48550/arxiv.1204.3918

Narodytska N; Walsh T; Xia L, 2012, Combining Voting Rules Together, http://dx.doi.org/10.48550/arxiv.1203.3051

de Haan R; Narodytska N; Walsh T, 2012, The RegularGcc Matrix Constraint, http://dx.doi.org/10.48550/arxiv.1201.0564

Hnich B; Smith BM; Walsh T, 2011, Dual Modelling of Permutation and Injection Problems, http://dx.doi.org/10.48550/arxiv.1107.0038

Conitzer V; Walsh T; Xia L, 2011, Dominating Manipulations in Voting with Partial Information, http://dx.doi.org/10.48550/arxiv.1106.5448

Narodytska N; Walsh T; Xia L, 2011, Manipulation of Nanson's and Baldwin's Rules, http://dx.doi.org/10.48550/arxiv.1106.5312

Davies J; Katsirelos G; Narodytska N; Walsh T, 2011, Complexity of and Algorithms for Borda Manipulation, http://dx.doi.org/10.48550/arxiv.1105.5667

Drescher C; Eiter T; Fink M; Krennwallner T; Walsh T, 2011, Symmetry Breaking for Distributed Multi-Context Systems, http://dx.doi.org/10.48550/arxiv.1104.3931

Bessiere C; Narodytska N; Quimper C-G; Walsh T, 2011, The AllDifferent Constraint with Precedences, http://dx.doi.org/10.48550/arxiv.1103.3745

Walsh T, 2010, Parameterized Complexity Results in Symmetry Breaking, http://dx.doi.org/10.48550/arxiv.1009.1174

Balafoutis T; Paparrizou A; Stergiou K; Walsh T, 2010, Improving the Performance of maxRPC, http://dx.doi.org/10.48550/arxiv.1008.5189

Drescher C; Tifrea O; Walsh T, 2010, Symmetry-breaking Answer Set Solving, http://dx.doi.org/10.48550/arxiv.1008.1809

Davies J; Katsirelos G; Narodystka N; Walsh T, 2010, An Empirical Study of Borda Manipulation, http://dx.doi.org/10.48550/arxiv.1007.5104

Pini MS; Rossi F; Venable B; Walsh T, 2010, Stable marriage problems with quantitative preferences, http://dx.doi.org/10.48550/arxiv.1007.5120

Gelain M; Pini MS; Rossi F; Venable KB; Walsh T, 2010, Local search for stable marriage problems, http://dx.doi.org/10.48550/arxiv.1007.0859

Bessiere C; Katsirelos G; Narodytska N; Quimper C-G; Walsh T, 2010, Decomposition of the NVALUE constraint, http://dx.doi.org/10.48550/arxiv.1007.0603

Gelain M; Pini MS; RossI F; Venable KB; Walsh T, 2010, Local search for stable marriage problems with ties and incomplete lists, http://dx.doi.org/10.48550/arxiv.1007.0637

Katsirelos G; Narodytska N; Walsh T, 2010, On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry, http://dx.doi.org/10.48550/arxiv.1007.0602

Katsirelos G; Walsh T, 2010, Symmetries of Symmetry Breaking Constraints, http://dx.doi.org/10.48550/arxiv.1005.5270

Bessiere C; Katsirelos G; Narodytska N; Quimper C-G; Walsh T, 2010, Propagating Conjunctions of AllDifferent Constraints, http://dx.doi.org/10.48550/arxiv.1004.2626

Heule M; Walsh T, 2010, Symmetry within Solutions, http://dx.doi.org/10.48550/arxiv.1004.2624

Russell T; Walsh T, 2009, Manipulating Tournaments in Cup and Round Robin Competitions, http://dx.doi.org/10.48550/arxiv.0911.1582

Katsirelos G; Narodytska N; Walsh T, 2009, Breaking Generator Symmetry, http://dx.doi.org/10.48550/arxiv.0909.5099

Pini M; Rossi F; Venable B; Walsh T, 2009, Dealing with incomplete agents' preferences and an uncertain agenda in group decision making via sequential majority voting, http://dx.doi.org/10.48550/arxiv.0909.4441

Gelain M; Pini M; Rossi F; Venable B; Walsh T, 2009, Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies, http://dx.doi.org/10.48550/arxiv.0909.4446

Maher MJ; Narodytska N; Quimper C-G; Walsh T, 2009, Flow-Based Propagators for the SEQUENCE and Related Global Constraints, http://dx.doi.org/10.48550/arxiv.0909.4452

Pini M; Rossi F; Venable B; Walsh T, 2009, Manipulation and gender neutrality in stable marriage procedures, http://dx.doi.org/10.48550/arxiv.0909.4437

Katsirelos G; Narodytska N; Walsh T, 2009, The Weighted CFG Constraint, http://dx.doi.org/10.48550/arxiv.0909.4456

Bessiere C; Katsirelos G; Narodytska N; Quimper C-G; Walsh T, 2009, Decomposition of the NVALUE constraint, http://dx.doi.org/10.48550/arxiv.0909.3273

Katsirelos G; Walsh T, 2009, Symmetries of Symmetry Breaking Constraints, http://dx.doi.org/10.48550/arxiv.0909.3276

Katsirelos G; Maneth S; Narodytska N; Walsh T, 2009, Restricted Global Grammar Constraints, http://dx.doi.org/10.48550/arxiv.0906.5233

Bessiere C; Katsirelos G; Narodytska N; Walsh T, 2009, Circuit Complexity and Decompositions of Global Constraints, http://dx.doi.org/10.48550/arxiv.0905.3757

Bessiere C; Katsirelos G; Narodytska N; Quimper C-G; Walsh T, 2009, Decompositions of All Different, Global Cardinality and Related Constraints, http://dx.doi.org/10.48550/arxiv.0905.3755

Frisch AM; Miguel I; Kiziltan Z; Hnich B; Walsh T, 2009, Multiset Ordering Constraints, http://dx.doi.org/10.48550/arxiv.0905.3769

Domshlak C; Rossi F; Venable KB; Walsh T, 2009, Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques, http://dx.doi.org/10.48550/arxiv.0905.3766

Tarim SA; Manandhar S; Walsh T, 2009, Stochastic Constraint Programming: A Scenario-Based Approach, http://dx.doi.org/10.48550/arxiv.0903.1150

Bessiere C; Hebrard E; Hnich B; Walsh T, 2009, The Complexity of Reasoning with Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.1139

Katsirelos G; Narodytska N; Walsh T, 2009, Combining Symmetry Breaking and Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.0479

Quimper C-G; Walsh T, 2009, Decompositions of Grammar Constraints, http://dx.doi.org/10.48550/arxiv.0903.0470

Frisch A; Hnich B; Kiziltan Z; Miguel I; Walsh T, 2009, Filtering Algorithms for the Multiset Ordering Constraint, http://dx.doi.org/10.48550/arxiv.0903.0460

Katsirelos G; Narodytska N; Walsh T, 2009, Reformulating Global Grammar Constraints, http://dx.doi.org/10.48550/arxiv.0903.0475

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2009, SLIDE: A Useful Special Case of the CARDPATH Constraint, http://dx.doi.org/10.48550/arxiv.0903.0471

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2009, The Parameterized Complexity of Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.0467

Bessiere C; Hebrard E; Hnich B; Kiziltan Z; Walsh T, 2009, Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints, http://dx.doi.org/10.48550/arxiv.0903.0211

Back to profile page