default search action
Eric McDermid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j12]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. Discret. Appl. Math. 205: 27-34 (2016) - [r1]Eric McDermid:
Maximum Cardinality Stable Matchings. Encyclopedia of Algorithms 2016: 1227-1230 - 2015
- [j11]Keith Edwards, Eric McDermid:
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. Algorithmica 72(4): 940-968 (2015) - 2014
- [j10]Eric McDermid, Robert W. Irving:
Sex-Equal Stable Matchings: Complexity and Exact Algorithms. Algorithmica 68(3): 545-570 (2014) - [j9]Péter Biró, Eric McDermid:
Matching with sizes (or scheduling with processing set restrictions). Discret. Appl. Math. 164: 61-67 (2014) - [c6]Jonathan Mugan, Ranga Chari, Laura Hitt, Eric McDermid, Marsha Sowell, Yuan Qu, Thayne Coffman:
Entity resolution using inferred relationships and behavior. IEEE BigData 2014: 555-560 - 2013
- [j8]Christine T. Cheng, Eric McDermid:
Maximum Locally Stable Matchings. Algorithms 6(3): 383-395 (2013) - [c5]Jonathan Mugan, Eric McDermid, Abbey McGrew, Laura Hitt:
Identifying groups of interest through temporal analysis and event response monitoring. ISI 2013: 185-190 - 2012
- [j7]Péter Biró, David F. Manlove
, Eric McDermid:
"Almost stable" matchings in the Roommates problem with bounded preference lists. Theor. Comput. Sci. 432: 10-20 (2012) - 2011
- [b1]Eric McDermid:
A structural approach to matching problems with preferences. University of Glasgow, UK, 2011 - [j6]Eric McDermid, Robert W. Irving:
Popular matchings: structure and algorithms. J. Comb. Optim. 22(3): 339-358 (2011) - [c4]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices. ICALP (1) 2011: 678-689 - [c3]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. WG 2011: 107-118 - 2010
- [j5]Péter Biró, Eric McDermid:
Three-Sided Stable Matchings with Cyclic Preferences. Algorithmica 58(1): 5-18 (2010) - [j4]Péter Biró, Eric McDermid:
Matching with sizes (or scheduling with processing set restrictions). Electron. Notes Discret. Math. 36: 335-342 (2010) - [j3]Eric McDermid, David F. Manlove
Keeping partners together: algorithmic results for the hospitals/residents problem with couples. J. Comb. Optim. 19(3): 279-303 (2010)
2000 – 2009
- 2009
- [c2]Eric McDermid, Robert W. Irving:
Popular Matchings: Structure and Algorithms. COCOON 2009: 506-515 - [c1]Eric McDermid:
A 3/2-Approximation Algorithm for General Stable Marriage. ICALP (1) 2009: 689-700 - 2008
- [j2]Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
A unified approach to finding good stable matchings in the hospitals/residents setting. Theor. Comput. Sci. 400(1-3): 84-99 (2008) - 2007
- [j1]Eric McDermid, Christine T. Cheng, Ichiro Suzuki:
Hardness results on the man-exchange stable marriage problem with short preference lists. Inf. Process. Lett. 101(1): 13-19 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: