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.
This map shows the geographic impact of Monte Zweben'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 Monte Zweben with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Monte Zweben more than expected).
This network shows the impact of papers produced by Monte Zweben. 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 Monte Zweben. The network helps show where Monte Zweben may publish in the future.
Co-authorship network of co-authors of Monte Zweben
This figure shows the co-authorship network connecting the top 25 collaborators of Monte Zweben.
A scholar is included among the top collaborators of Monte Zweben 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 Monte Zweben. Monte Zweben is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zweben, Monte, et al.. (1992). Rescheduling with iterative repair. National Conference on Artificial Intelligence.11 indexed citations
8.
Zweben, Monte, et al.. (1992). Learning to improve iterative repair scheduling. 74. 314–20.
9.
Drummond, Mark, Mark S. Fox, Austin Tate, & Monte Zweben. (1992). Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning.
Gargan, R.A., et al.. (1991). Space Shuttle processing - A case study in artificial intelligence.1 indexed citations
12.
Zweben, Monte & R.A. Gargan. (1991). The Ames-Lockheed orbiter processing scheduling system. NASA STI Repository (National Aeronautics and Space Administration).1 indexed citations
13.
Zweben, Monte, et al.. (1991). Iterative repair for scheduling and rescheduling. NASA Technical Reports Server (NASA).10 indexed citations
14.
Zweben, Monte, et al.. (1990). Learning search control for constraint-based scheduling. National Conference on Artificial Intelligence. 908–915.16 indexed citations
15.
Friedland, Peter, et al.. (1990). The 1990 progress report and future plans. NASA Technical Reports Server (NASA).1 indexed citations
16.
Zweben, Monte, et al.. (1989). Constraint satisfaction with delayed evaluation. International Joint Conference on Artificial Intelligence. 875–880.15 indexed citations
Zweben, Monte. (1988). A survey of planning and scheduling research at the NASA Ames Research Center. NASA STI Repository (National Aeronautics and Space Administration).1 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.