John D. Eblen
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Advanced Data Storage Technologies 1
-
- Machine Learning and Algorithms 1
- Co-authors
- Michael A. Langston (5 shared papers)Gary L. Rogers (3 shared papers)Charles Phillips (2 shared papers)Andy Perkins (2 shared papers)Yun Zhang (1 shared paper)Brynn H. Voy (1 shared paper)Arnold M. Saxton (1 shared paper)Jeremy J. Jay (1 shared paper)
- Journals
- BMC Bioinformatics (2 papers)OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (1 paper)
- Partner nations
- United StatesCanadaLebanon
In The Last Decade
John D. Eblen
7 papers receiving 105 citations
Peers
Comparison fields: 5 of 55
- Computational Theory and Mathematics 24
- Discrete Mathematics and Combinatorics 4
- Hardware and Architecture 7
- Signal Processing 11
- Statistical and Nonlinear Physics 10
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 16 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 | 49 | |
| 2 | 2012 | 34 | |
| 3 | 2018 | 14 | |
| 4 | 2011 | 7 | |
| 5 | 2009 | 5 | |
| 6 | Parallel vertex cover: a case study in dynamic load balancing | 2011 | 3 |
| 7 | The Maximum Clique Problem: Algorithms, Applications, and Implementations | 2010 | 1 |
About John D. Eblen
John D. Eblen is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Molecular Biology and General Health Professions, having authored 7 papers that have together received 113 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (2 papers), Hermeneutics and Narrative Identity (1 paper), Machine Learning and Algorithms (1 paper), Health, Medicine and Society (1 paper), graph theory and CDMA systems (1 paper), Aging, Elder Care, and Social Issues (1 paper), Parallel Computing and Optimization Techniques (1 paper) and Advanced Data Storage Technologies (1 paper). The work is most often cited by research in Computational Theory and Mathematics (24 citations), Discrete Mathematics and Combinatorics (4 citations), Hardware and Architecture (7 citations), Signal Processing (11 citations) and Statistical and Nonlinear Physics (10 citations). John D. Eblen has collaborated with scholars based in United States, Canada and Lebanon. Frequent co-authors include Michael A. Langston, Gary L. Rogers, Charles Phillips, Andy Perkins, Yun Zhang, Brynn H. Voy, Arnold M. Saxton, Jeremy J. Jay, Elissa J. Chesler and Mikael Benson. Their work appears in journals such as BMC Bioinformatics and OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information).
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.