Eric J. McDermid
Impact in
- Economics and Econometrics top 5%
- Game Theory and Voting Systems
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Game Theory and Voting Systems 12
-
- Complexity and Algorithms in Graphs 3
- Advanced Graph Theory Research 2
- Co-authors
- Péter Bíró (4 shared papers)David F. Manlove (2 shared papers)Robert W. Irving (3 shared papers)Christine T. Cheng (5 shared papers)I. Suzuki (4 shared papers)Keith J. Edwards (1 shared paper)
- Journals
- Algorithmica (3 papers)Journal of Combinatorial Optimization (2 papers)Discrete Applied Mathematics (2 papers)Theoretical Computer Science (2 papers)Lecture notes in computer science (4 papers)
- Partner nations
- United KingdomUnited StatesHungary
In The Last Decade
Eric J. McDermid
17 papers receiving 262 citations
Peers
Comparison fields: 5 of 19
- Economics and Econometrics 217
- Computational Theory and Mathematics 25
- Computer Networks and Communications 16
- Software 3
- Industrial and Manufacturing Engineering 4
Countries citing papers authored by Eric J. McDermid
This map shows the geographic impact of Eric J. 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 J. 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 J. McDermid more than expected).
Fields of papers citing papers by Eric J. McDermid
This network shows the impact of papers produced by Eric J. 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 J. McDermid. The network helps show where Eric J. McDermid may publish in the future.
Co-authors
The 6 scholars most cited alongside Eric J. 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 | 2009 | 47 | |
| 2 | 2009 | 45 | |
| 3 | 2009 | 43 | |
| 4 | 2012 | 23 | |
| 5 | 2010 | 22 | |
| 6 | 2011 | 18 | |
| 7 | 2012 | 16 | |
| 8 | 2009 | 11 | |
| 9 | 2008 | 10 | |
| 10 | 2011 | 7 | |
| 11 | 2014 | 6 | |
| 12 | 2013 | 5 | |
| 13 | 2015 | 5 | |
| 14 | 2010 | 4 | |
| 15 | 2011 | 4 | |
| 16 | 2014 | 3 | |
| 17 | 2013 | 2 |
About Eric J. McDermid
Eric J. McDermid is a scholar working on Economics and Econometrics, Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Discrete Mathematics and Combinatorics and Statistical and Nonlinear Physics, having authored 17 papers that have together received 271 indexed citations. Recurring topics across this work include Game Theory and Voting Systems (12 papers), Complexity and Algorithms in Graphs (3 papers), Scheduling and Optimization Algorithms (2 papers), Advanced Graph Theory Research (2 papers), Complex Network Analysis Techniques (1 paper), Data Quality and Management (1 paper) and Advanced Combinatorial Mathematics (1 paper). The work is most often cited by research in Economics and Econometrics (217 citations), Computational Theory and Mathematics (25 citations), Computer Networks and Communications (16 citations), Software (3 citations) and Industrial and Manufacturing Engineering (4 citations). Eric J. 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 and Keith J. Edwards. Their work appears in journals such as Algorithmica, Journal of Combinatorial Optimization, Discrete Applied Mathematics, Theoretical Computer Science and Lecture notes in computer science.
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.