The following pages link to Toby Walsh (Q215106):
Displaying 50 items.
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
- (Q329038) (redirect page) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- (Q429800) (redirect page) (← links)
- New algorithms for max restricted path consistency (Q429801) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- (Q481700) (redirect page) (← links)
- Multiset variable representations and constraint propagation (Q481702) (← links)
- The weighted grammar constraint (Q545550) (← links)
- (Q588824) (redirect page) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Filtering algorithms for the multiset ordering constraint (Q835808) (← links)
- Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints (Q840817) (← links)
- Tetravex is NP-complete (Q845713) (← links)
- Stochastic constraint programming: A scenario-based approach (Q850457) (← links)
- Filtering algorithms for the NValue constraint (Q857887) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
- A theory of abstraction (Q1199923) (← links)
- The inevitability of inconsistent abstract spaces (Q1311395) (← links)
- Easy problems are sometimes hard (Q1342226) (← links)
- Abstract proof checking: An example motivated by an incompleteness theorem (Q1373302) (← links)
- Calculating criticalities (Q1391896) (← links)
- The TSP phase transition (Q1391912) (← links)
- Decomposable constraints (Q1589469) (← links)
- Binary vs. non-binary constraints (Q1614859) (← links)
- Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Hybrid modelling for robust solving (Q1876527) (← links)
- A calculus for and termination of rippling (Q1915137) (← links)
- Satisfiability in the Year 2000 (Q1977747) (← links)
- Equilibria in sequential allocation (Q1990309) (← links)
- Domain filtering consistencies for non-binary constraints (Q2389637) (← links)
- Justified representation in approval-based committee voting (Q2397667) (← links)
- Three generalizations of the FOCUS constraint (Q2398512) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Propagation algorithms for lexicographic ordering constraints (Q2457611) (← links)
- Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
- The satisfiability constraint gap (Q2674178) (← links)
- A study of proxies for Shapley allocations of transport costs (Q2818236) (← links)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Q2851261) (← links)
- Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score (Q2868553) (← links)
- Modelling grammar constraints with answer set programming (Q2909137) (← links)
- Permutation Problems and Channelling Constraints (Q2996177) (← links)
- (Q2999220) (← links)
- Symmetry Breaking for Distributed Multi-Context Systems (Q3003240) (← links)
