Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI
This map shows the geographic impact of David Avis'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 Avis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Avis more than expected).
This network shows the impact of papers produced by David Avis. 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 Avis. The network helps show where David Avis may publish in the future.
Co-authorship network of co-authors of David Avis
This figure shows the co-authorship network connecting the top 25 collaborators of David Avis.
A scholar is included among the top collaborators of David Avis based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with David Avis. David Avis is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Avis, David, Hans Raj Tiwary, & Osamu Watanabe. (2014). Polynomial size linear programs for non-bipartite matching problems and other problems in P.. arXiv (Cornell University).1 indexed citations
Avis, David, et al.. (2005). Computing Disjoint Paths on Polytopes. Les Cahiers du GERAD. 1–23.
8.
Aichholzer, Oswin, David Avis, Erik D. Demaine, et al.. (2005). Games on triangulations. Theoretical Computer Science. 343(1-2). 42–71.1 indexed citations
Avis, David, Antoine Deza, & Shmuel Onn. (2000). A Combinatorial Approach to the Solitaire Game. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(4). 656–661.
12.
Avis, David, et al.. (1998). Recovering lines with fixed linear probes. Data Archiving and Networked Services (DANS).1 indexed citations
13.
Avis, David, et al.. (1997). Primal-dual methods for vertex and facet enumeration. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 49–56.5 indexed citations
14.
Avis, David & Komei Fukuda. (1996). Reverse search for enumeration. Discrete Applied Mathematics. 65(1-3). 21–46.366 indexed citations
15.
Avis, David. (1992). Proceedings of the eighth annual symposium on Computational geometry.14 indexed citations
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.