David Witmer
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 4
- Advanced Graph Theory Research 1
-
- Machine Learning and Algorithms 2
- Co-authors
- Ryan O’Donnell (6 shared papers)Bruce Tidor (2 shared papers)Joshua F. Apgar (2 shared papers)Forest M. White (2 shared papers)Pravesh K. Kothari (1 shared paper)Ryuhei Mori (1 shared paper)Anupam Gupta (1 shared paper)Kunal Talwar (1 shared paper)
- Journals
- Molecular BioSystems (2 papers)DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) (1 paper)Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) (1 paper)arXiv (Cornell University) (2 papers)
- Partner nations
- United StatesJapanUnited Kingdom
In The Last Decade
David Witmer
10 papers receiving 235 citations
Peers
Comparison fields: 5 of 71
- Computational Theory and Mathematics 104
- Computational Mathematics 2
- Artificial Intelligence 104
- General Decision Sciences 3
- Biophysics 9
Countries citing papers authored by David Witmer
This map shows the geographic impact of David Witmer'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 David Witmer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Witmer more than expected).
Fields of papers citing papers by David Witmer
This network shows the impact of papers produced by David Witmer. 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 David Witmer. The network helps show where David Witmer may publish in the future.
Co-authors
The 21 scholars most cited alongside David Witmer, 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 | 2010 | 100 | |
| 2 | 2014 | 41 | |
| 3 | 2017 | 37 | |
| 4 | 2015 | 26 | |
| 5 | 2015 | 17 | |
| 6 | 2013 | 11 | |
| 7 | 2013 | 8 | |
| 8 | Improved small-set expansion from higher eigenvalues | 2012 | 5 |
| 9 | 2011 | 5 | |
| 10 | Continuous analogues of the Most Informative Function problem | 2015 | 1 |
About David Witmer
David Witmer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Molecular Biology and Electrical and Electronic Engineering, having authored 10 papers that have together received 251 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (4 papers), Bioinformatics and Genomic Networks (2 papers), Machine Learning and Algorithms (2 papers), Gene Regulatory Network Analysis (2 papers), Optimization and Search Problems (2 papers), Mathematical Approximation and Integration (1 paper), Advanced Graph Theory Research (1 paper) and Mental Health Research Topics (1 paper). The work is most often cited by research in Computational Theory and Mathematics (104 citations), Computational Mathematics (2 citations), Artificial Intelligence (104 citations), General Decision Sciences (3 citations) and Biophysics (9 citations). David Witmer has collaborated with scholars based in United States, Japan and United Kingdom. Frequent co-authors include Ryan O’Donnell, Bruce Tidor, Joshua F. Apgar, Forest M. White, Pravesh K. Kothari, Ryuhei Mori, Anupam Gupta, Kunal Talwar, Sarah M. Loos and Luca Trevisan. Their work appears in journals such as Molecular BioSystems, DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) and arXiv (Cornell University).
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.