Eric McDermid

According to our database, Eric McDermid authored at least 18 papers between 2007 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Maximum Cardinality Stable Matchings.

Eric McDermid

Encyclopedia of Algorithms, 2016

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings.

Christine T. Cheng, Eric McDermid, Ichiro Suzuki

Discret. Appl. Math., 2016

2015

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP.

Keith Edwards, Eric McDermid

Algorithmica, 2015

2014

Matching with sizes (or scheduling with processing set restrictions).

Péter Biró, Eric McDermid

Discret. Appl. Math., 2014

Sex-Equal Stable Matchings: Complexity and Exact Algorithms.

Eric McDermid, Robert W. Irving

Algorithmica, 2014

Entity resolution using inferred relationships and behavior.

Jonathan Mugan, Ranga Chari, Laura Hitt, Eric McDermid, Marsha Sowell, Yuan Qu, Thayne Coffman

Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013

Maximum Locally Stable Matchings.

Christine T. Cheng, Eric McDermid

Algorithms, 2013

Identifying groups of interest through temporal analysis and event response monitoring.

Jonathan Mugan, Eric McDermid, Abbey McGrew, Laura Hitt

Proceedings of the 2013 IEEE International Conference on Intelligence and Security Informatics, 2013

2012

"Almost stable" matchings in the Roommates problem with bounded preference lists.

Péter Biró, David F. Manlove, Eric McDermid

Theor. Comput. Sci., 2012

2011

A structural approach to matching problems with preferences.

Eric McDermid

PhD thesis, 2011

Popular matchings: structure and algorithms.

Eric McDermid, Robert W. Irving

J. Comb. Optim., 2011

Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs.

Christine T. Cheng, Eric McDermid, Ichiro Suzuki

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices.

Christine T. Cheng, Eric McDermid, Ichiro Suzuki

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Keeping partners together: algorithmic results for the hospitals/residents problem with couples.

Eric McDermid, David F. Manlove

J. Comb. Optim., 2010

Three-Sided Stable Matchings with Cyclic Preferences.

Péter Biró, Eric McDermid

Algorithmica, 2010

2009

A 3/2-Approximation Algorithm for General Stable Marriage.

Eric McDermid

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

A unified approach to finding good stable matchings in the hospitals/residents setting.

Christine T. Cheng, Eric McDermid, Ichiro Suzuki

Theor. Comput. Sci., 2008

2007

Hardness results on the man-exchange stable marriage problem with short preference lists.

Eric McDermid, Christine T. Cheng, Ichiro Suzuki

Inf. Process. Lett., 2007