The following pages link to Craig A. Tovey (Q201777):
Displaying 50 items.
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- A finite exact algorithm for epsilon-core membership in two dimensions (Q607258) (← links)
- On the uniqueness of the yolk (Q682471) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- (Q689962) (redirect page) (← links)
- Erratum to: Local optimization on graphs (Q689964) (← links)
- The probability of majority rule instability in the 2D Euclidean model with an even number of voters (Q708885) (← links)
- A simplified NP-complete satisfiability problem (Q790612) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting (Q836934) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Asymmetric probabilistic prospects of Stackelberg players (Q911489) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Networks and chain coverings in partial orders and their products (Q1059648) (← links)
- (Q1120431) (redirect page) (← links)
- Voting schemes for which it can be difficult to tell who won the election (Q1120433) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Recognizing majority-rule equilibrium in spatial voting games (Q1178172) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Limiting median lines do not suffice to determine the yolk (Q1184953) (← links)
- The probability of an undominated central voter in 2-dimensional spatial majority voting (Q1184955) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- How hard is it to control an election? (Q1200886) (← links)
- Probability and convergence for supra-majority rule with Euclidean preferences (Q1200887) (← links)
- (Q1306470) (redirect page) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- Planar Ramsey numbers (Q1322038) (← links)
- Probabilities of preferences and cycles with super majority rules (Q1368872) (← links)
- Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479) (← links)
- The computational difficulty of manipulating an election (Q1824524) (← links)
- Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms (Q1857339) (← links)
- Dominance in spatial voting with imprecise ideals (Q2058847) (← links)
- Path-length analysis for grid-based path planning (Q2060684) (← links)
- The instability of instability of centered distributions (Q2270335) (← links)
- The almost surely shrinking yolk (Q2270336) (← links)
- A critique of distributional analysis in the spatial model (Q2270337) (← links)
- Approximation of the yolk by the LP yolk (Q2270338) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- (Q2743976) (← links)
- Optimal Selection of the Most Probable Multinomial Alternative (Q2934411) (← links)
- The Slippage Configuration Is Always the Least Favorable Configuration for Two Alternatives (Q2934412) (← links)
- A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling (Q3197298) (← links)
- A Near-Tight Approximation Algorithm for the Robot Localization Problem (Q3558011) (← links)
- A near-tight approximation lower bound and algorithm for the kidnapped robot problem (Q3581575) (← links)
- Hill Climbing with Multiple Local Optima (Q3690218) (← links)
- (Q3691743) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- Layered Augmenting Path Algorithms (Q3734185) (← links)
- Rescheduling to minimize makespan on a changing number of identical processors (Q3767116) (← links)
- Minimum Spillage Sequencing (Q3780747) (← links)
