Eric McDermid
Impact in
-
- Auction Theory and Applications
- Game Theory and Applications
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 9
- Advanced Graph Theory Research 4
-
- Game Theory and Voting Systems 8
- Co-authors
- Péter BíróDavid F. ManloveRobert W. IrvingChristine T. ChengI. SuzukiYuan QuKeith Edwards
- Journals
- Algorithmica (3 papers)Discrete Applied Mathematics (2 papers)Theoretical Computer Science (2 papers)Journal of Combinatorial Optimization (2 papers)Algorithms (1 paper)
- Partner nations
- United KingdomUnited StatesHungary
In The Last Decade
Eric McDermid
13 papers receiving 138 citations
Peers
Comparison fields: 5 of 41
- Management Science and Operations Research 73
- Computational Theory and Mathematics 69
- Economics and Econometrics 106
- Computer Networks and Communications 23
- Transplantation 2
Countries citing papers authored by Eric McDermid
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
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
The 7 scholars most cited alongside Eric McDermid, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2015 | 5 | |
| 2 | 2014 | 2 | |
| 3 | 2014 | 4 | |
| 4 | 2013 | 2 | |
| 5 | 2013 | 3 | |
| 6 | 2012 | 12 | |
| 7 | 2012 | 8 | |
| 8 | 2011 | 16 | |
| 9 | 2010 | 14 | |
| 10 | 2010 | 4 | |
| 11 | 2009 | 33 | |
| 12 | 2009 | 33 | |
| 13 | 2008 | 9 |
About Eric McDermid
Eric McDermid is a scholar working on Computational Theory and Mathematics, Economics and Econometrics, Management Science and Operations Research, Computer Networks and Communications and Industrial and Manufacturing Engineering, having authored 13 papers that have together received 145 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (9 papers), Game Theory and Voting Systems (8 papers), Advanced Graph Theory Research (4 papers), Optimization and Search Problems (2 papers), Logic, Reasoning, and Knowledge (2 papers), Interconnection Networks and Systems (1 paper), Game Theory and Applications (1 paper) and Scheduling and Optimization Algorithms (1 paper). The work is most often cited by research in Management Science and Operations Research (73 citations), Computational Theory and Mathematics (69 citations), Economics and Econometrics (106 citations), Computer Networks and Communications (23 citations) and Transplantation (2 citations). Eric McDermid has collaborated with scholars based in United Kingdom, United States and Hungary. Frequent co-authors include Péter Bíró, David F. Manlove, Robert W. Irving, Christine T. Cheng, I. Suzuki, Yuan Qu and Keith Edwards. Their work appears in journals such as Algorithmica, Discrete Applied Mathematics, Theoretical Computer Science, Journal of Combinatorial Optimization and Algorithms.
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.