The following pages link to Robert W. Irving (Q314432):
Displaying 50 items.
- Matching couples with Scarf's algorithm (Q314433) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- An algorithm for a super-stable roommates problem (Q650948) (← links)
- Popular matchings: structure and algorithms (Q652638) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Parametric stable marriage and minimum cuts (Q913621) (← links)
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- The college admissions problem with lower and common quotas (Q986550) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable matching problems with exchange restrictions (Q1016052) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- (Q1164066) (redirect page) (← links)
- On group partitions associated with lower bounds for symmetric Ramsey numbers (Q1164067) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- Stable marriage and indifference (Q1317047) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Database indexing for large DNA and protein sequence collections (Q1811309) (← links)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
- Generalised Ramsey numbers for small graphs (Q1845738) (← links)
- Maximal common subsequences and minimal common supersequences (Q1917072) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- The cycle roommates problem: a hard case of kidney exchange (Q2379931) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- On a bound of Graham and Spencer for a graph-colouring constant (Q2555862) (← links)
- Sorting Strings by Reversals and by Transpositions (Q2706200) (← links)
- (Q2721985) (← links)
- Magic Dice (Q2757363) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- (Q2921697) (← links)
- Rank-maximal matchings (Q2944532) (← links)
- Profile-Based Optimal Matchings in the Student/Project Allocation Problem (Q2946056) (← links)
- The Stable Roommates Problem with Ties (Q3150272) (← links)
- Popular Matchings (Q3519386) (← links)
- Popular Matchings in the Marriage and Roommates Problems (Q3562995) (← links)
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage (Q3608878) (← links)
- An efficient algorithm for the “stable roommates” problem (Q3703906) (← links)
- The Complexity of Counting Stable Marriages (Q3751000) (← links)
- (Q3995616) (← links)
- A bipartite Ramsey problem and the Zarankiewicz numbers (Q4143340) (← links)
- (Q4252038) (← links)
- Three-dimensional Statistical Data Security Problems (Q4286235) (← links)
- An upper bound for the solvability probability of a random stable roommates instance (Q4306375) (← links)
- (Q4418671) (← links)
