The following pages link to Eric J. McDermid (Q428843):
Displaying 18 items.
- (Q266917) (redirect page) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Popular matchings: structure and algorithms (Q652638) (← links)
- (Q845881) (redirect page) (← links)
- Hardness results on the man-exchange stable marriage problem with short preference lists (Q845882) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples (Q975759) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (Q3012842) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- A 3/2-Approximation Algorithm for General Stable Marriage (Q3638073) (← links)
- Popular Matchings: Structure and Algorithms (Q5323098) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
