John D. Eblen
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Parallel Computing and Optimization Techniques
Papers in
-
- Algorithms and Data Compression 1
-
- Optimization and Search Problems 1
- Interconnection Networks and Systems 1
- Co-authors
- Michael A. Langston (8 shared papers)Gary L. Rogers (4 shared papers)Charles Phillips (3 shared papers)Arnold M. Saxton (3 shared papers)Andy Perkins (3 shared papers)Mikael Benson (2 shared papers)Brynn H. Voy (2 shared papers)Yun Zhang (1 shared paper)
- Journals
- BMC Bioinformatics (2 papers)Lecture notes in computer science (2 papers)OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (1 paper)WORLD SCIENTIFIC eBooks (1 paper)
- Partner nations
- United StatesSwedenCanada
In The Last Decade
John D. Eblen
10 papers receiving 150 citations
Peers
Comparison fields: 5 of 60
- Computational Theory and Mathematics 40
- Hardware and Architecture 12
- Discrete Mathematics and Combinatorics 5
- Statistical and Nonlinear Physics 18
- Computer Networks and Communications 33
Countries citing papers authored by John D. Eblen
This map shows the geographic impact of John D. Eblen'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 John D. Eblen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John D. Eblen more than expected).
Fields of papers citing papers by John D. Eblen
This network shows the impact of papers produced by John D. Eblen. 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 John D. Eblen. The network helps show where John D. Eblen may publish in the future.
Co-authors
The 18 scholars most cited alongside John D. Eblen, 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 | 2012 | 51 | |
| 2 | 2012 | 40 | |
| 3 | 2018 | 19 | |
| 4 | 2009 | 15 | |
| 5 | 2011 | 10 | |
| 6 | 2011 | 9 | |
| 7 | Parallel vertex cover: a case study in dynamic load balancing | 2011 | 6 |
| 8 | 2009 | 6 | |
| 9 | 2011 | 4 | |
| 10 | The Maximum Clique Problem: Algorithms, Applications, and Implementations | 2010 | 1 |
About John D. Eblen
John D. Eblen is a scholar working on Artificial Intelligence, Computer Networks and Communications, Molecular Biology, Computational Theory and Mathematics and General Health Professions, having authored 10 papers that have together received 161 indexed citations. Recurring topics across this work include Bioinformatics and Genomic Networks (2 papers), Complexity and Algorithms in Graphs (2 papers), Hermeneutics and Narrative Identity (1 paper), Gene expression and cancer classification (1 paper), Parallel Computing and Optimization Techniques (1 paper), Algorithms and Data Compression (1 paper), Optimization and Search Problems (1 paper) and Interconnection Networks and Systems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (40 citations), Hardware and Architecture (12 citations), Discrete Mathematics and Combinatorics (5 citations), Statistical and Nonlinear Physics (18 citations) and Computer Networks and Communications (33 citations). John D. Eblen has collaborated with scholars based in United States, Sweden and Canada. Frequent co-authors include Michael A. Langston, Gary L. Rogers, Charles Phillips, Arnold M. Saxton, Andy Perkins, Mikael Benson, Brynn H. Voy, Yun Zhang, Jeremy J. Jay and Elissa J. Chesler. Their work appears in journals such as BMC Bioinformatics, Lecture notes in computer science, OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) and WORLD SCIENTIFIC eBooks.
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.