Eric McDermid

416 total citations
13 papers, 145 citations indexed

About

Eric McDermid is a scholar working on Computational Theory and Mathematics, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Eric McDermid has authored 13 papers receiving a total of 145 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 8 papers in Economics and Econometrics and 4 papers in Computer Networks and Communications. Recurrent topics in Eric McDermid's work include Complexity and Algorithms in Graphs (9 papers), Game Theory and Voting Systems (8 papers) and Advanced Graph Theory Research (4 papers). Eric McDermid is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), Game Theory and Voting Systems (8 papers) and Advanced Graph Theory Research (4 papers). Eric McDermid collaborates with scholars based in United Kingdom, United States and Hungary. Eric McDermid's co-authors include Péter Bíró, David F. Manlove, Robert W. Irving, Christine T. Cheng, I. Suzuki, Keith Edwards and Yuan Qu and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Algorithmica.

In The Last Decade

Eric McDermid

13 papers receiving 138 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Eric McDermid United Kingdom	7	106	73	69	23	16	13	145
Gregg O’Malley United Kingdom	4	74 0.7×	68 0.9×	42 0.6×	20 0.9×	14 0.9×	7	138
Ruta Mehta United States	9	96 0.9×	111 1.5×	28 0.4×	20 0.9×	20 1.3×	32	167
Saeed Seddighin United States	7	106 1.0×	108 1.5×	50 0.7×	32 1.4×	44 2.8×	29	187
Holger Spakowski Germany	5	148 1.4×	97 1.3×	93 1.3×	17 0.7×	92 5.8×	12	193
Ildikó Schlotter Hungary	9	140 1.3×	89 1.2×	163 2.4×	38 1.7×	42 2.6×	23	260
Katarzyna Paluch Poland	6	68 0.6×	36 0.5×	55 0.8×	16 0.7×	12 0.8×	14	108
Umang Bhaskar United States	7	72 0.7×	98 1.3×	17 0.2×	27 1.2×	7 0.4×	16	126
Alexander Skopalik Germany	9	145 1.4×	199 2.7×	14 0.2×	37 1.6×	23 1.4×	26	227
Joel Oren Canada	7	56 0.5×	51 0.7×	20 0.3×	23 1.0×	46 2.9×	17	139
Argyrios Deligkas United Kingdom	7	68 0.6×	72 1.0×	37 0.5×	26 1.1×	17 1.1×	40	155

Countries citing papers authored by Eric McDermid

Since Specialization

Citations

This map shows the geographic impact of Eric McDermid's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eric McDermid with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric McDermid more than expected).

Fields of papers citing papers by Eric McDermid

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eric McDermid. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eric McDermid. The network helps show where Eric McDermid may publish in the future.

Co-authorship network of co-authors of Eric McDermid

This figure shows the co-authorship network connecting the top 25 collaborators of Eric McDermid. A scholar is included among the top collaborators of Eric McDermid based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eric McDermid. Eric McDermid is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

Cheng, Christine T., Eric McDermid, & I. Suzuki. (2015). Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. Discrete Applied Mathematics. 205. 27–34. 5 indexed citations

McDermid, Eric, et al.. (2014). Entity resolution using inferred relationships and behavior. 555–560. 4 indexed citations

Edwards, Keith & Eric McDermid. (2014). A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. Algorithmica. 72(4). 940–968. 2 indexed citations

Cheng, Christine T. & Eric McDermid. (2013). Maximum Locally Stable Matchings. Algorithms. 6(3). 383–395. 3 indexed citations

McDermid, Eric, et al.. (2013). Identifying groups of interest through temporal analysis and event response monitoring. 949. 185–190. 2 indexed citations

Bíró, Péter, David F. Manlove, & Eric McDermid. (2012). “Almost stable” matchings in the Roommates problem with bounded preference lists. Theoretical Computer Science. 432. 10–20. 12 indexed citations

McDermid, Eric & Robert W. Irving. (2012). Sex-Equal Stable Matchings: Complexity and Exact Algorithms. Algorithmica. 68(3). 545–570. 8 indexed citations

Bíró, Péter & Eric McDermid. (2011). Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics. 164. 61–67. 16 indexed citations

McDermid, Eric & Robert W. Irving. (2010). Popular matchings: structure and algorithms. Journal of Combinatorial Optimization. 22(3). 339–358. 14 indexed citations

10.

Bíró, Péter & Eric McDermid. (2010). Matching with sizes (or scheduling with processing set restrictions). Electronic Notes in Discrete Mathematics. 36. 335–342. 4 indexed citations

11.

Bíró, Péter & Eric McDermid. (2009). Three-Sided Stable Matchings with Cyclic Preferences. Algorithmica. 58(1). 5–18. 33 indexed citations

12.

McDermid, Eric & David F. Manlove. (2009). Keeping partners together: algorithmic results for the hospitals/residents problem with couples. Journal of Combinatorial Optimization. 19(3). 279–303. 33 indexed citations

13.

Cheng, Christine T., Eric McDermid, & I. Suzuki. (2008). A unified approach to finding good stable matchings in the hospitals/residents setting. Theoretical Computer Science. 400(1-3). 84–99. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact