Eric J. McDermid

Available identifiers

Publication	Date of Publication	Type
Maximum locally stable matchings	2019-03-26	Paper
Sex-equal stable matchings: complexity and exact algorithms	2017-05-17	Paper
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings	2016-04-07	Paper
Matching with sizes (or scheduling with processing set restrictions)	2015-09-22	Paper
A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP	2015-09-02	Paper
``Almost stable matchings in the roommates problem with bounded preference lists	2012-06-25	Paper
Matching with sizes (or scheduling with processing set restrictions)	2012-05-13	Paper
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs	2011-12-16	Paper
Popular matchings: structure and algorithms	2011-12-15	Paper
Center stable matchings and centers of cover graphs of distributive lattices	2011-07-06	Paper
Three-sided stable matchings with cyclic preferences	2010-10-07	Paper
Keeping partners together: Algorithmic results for the hospitals/residents problem with couples	2010-06-11	Paper
Hardness results on the man-exchange stable marriage problem with short preference lists	2010-01-29	Paper
Popular Matchings: Structure and Algorithms	2009-07-23	Paper
A 3/2-Approximation Algorithm for General Stable Marriage	2009-07-14	Paper
A unified approach to finding good stable matchings in the hospitals/residents setting	2008-06-24	Paper

This page was built for person: Eric J. McDermid