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.
A probabilistic multipath traffic assignment model which obviates path enumeration
Countries citing papers authored by Robert B. Dial
Since
Specialization
Citations
This map shows the geographic impact of Robert B. Dial'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 Robert B. Dial with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert B. Dial more than expected).
This network shows the impact of papers produced by Robert B. Dial. 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 Robert B. Dial. The network helps show where Robert B. Dial may publish in the future.
Co-authorship network of co-authors of Robert B. Dial
This figure shows the co-authorship network connecting the top 25 collaborators of Robert B. Dial.
A scholar is included among the top collaborators of Robert B. Dial 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 Robert B. Dial. Robert B. Dial is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ball, Michael O., Lawrence Bodin, & Robert B. Dial. (1981). Scheduling of Drivers for Mass Transit Systems Using Interactive Optimisation.2 indexed citations
10.
Ball, Michael O., et al.. (1981). EXPERIMENTATION WITH A COMPUTERIZED SYSTEM FOR SCHEDULING MASS TRANSIT VEHICLES AND CREWS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT.1 indexed citations
11.
Dial, Robert B., et al.. (1980). INTEGRATED TRANSIT-NETWORK MODEL (INET): A NEW URBAN TRANSPORTATION PLANNING SYSTEM PROGRAM. Transportation Research Record Journal of the Transportation Research Board.2 indexed citations
12.
Bodin, Lawrence & Robert B. Dial. (1980). HIERARCHICAL PROCEDURES FOR DETERMINING VEHICLE AND CREW REQUIREMENTS FOR MASS TRANSIT SYSTEMS. Transportation Research Record Journal of the Transportation Research Board.1 indexed citations
13.
Dial, Robert B.. (1971). A MULTIPATH TRAFFIC ASSIGNMENT MODEL. Highway Research Record.4 indexed citations
14.
Dial, Robert B., et al.. (1970). Factors, trends, and guidelines related to trip length. National Cooperative Highway Research Program report.15 indexed citations
15.
Dial, Robert B.. (1970). Probabilistic assignment: a multipath traffic assignment model which obviates path enumeration.14 indexed citations
Dial, Robert B., et al.. (1968). Public transit planning system. Socio-Economic Planning Sciences. 1(3). 345–362.12 indexed citations
19.
Dial, Robert B.. (1967). TRANSIT PATHFINDER ALGORITHM. Highway Research Record.70 indexed citations
20.
Dial, Robert B.. (1967). Urban Transportation Planning System: Philosophy and Function. Transportation Research Record Journal of the Transportation Research Board.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.