Citations per year, relative to A.J.J. Talman A.J.J. Talman (= 1×)
peers
Fabio Tardella
Countries citing papers authored by A.J.J. Talman
Since
Specialization
Citations
This map shows the geographic impact of A.J.J. Talman'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 A.J.J. Talman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A.J.J. Talman more than expected).
This network shows the impact of papers produced by A.J.J. Talman. 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 A.J.J. Talman. The network helps show where A.J.J. Talman may publish in the future.
Co-authorship network of co-authors of A.J.J. Talman
This figure shows the co-authorship network connecting the top 25 collaborators of A.J.J. Talman.
A scholar is included among the top collaborators of A.J.J. Talman 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 A.J.J. Talman. A.J.J. Talman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schrijver, Alexander & A.J.J. Talman. (2004). Discrete mathematics and optimization.20 indexed citations
5.
Herings, P. Jean‐Jacques, G. van der Laan, & A.J.J. Talman. (1999). Price adjustment in a Keynesian Economy. Data Archiving and Networked Services (DANS). 27–57.1 indexed citations
6.
Talman, A.J.J., et al.. (1993). A simplicial variable dimension restart algorithm to find economic equilibria on the unit simplex using n(n+1) rays. research memorandum.1 indexed citations
7.
Talman, A.J.J., et al.. (1991). An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies. research memorandum.1 indexed citations
8.
Talman, A.J.J.. (1990). General equilibrium programming. Data Archiving and Networked Services (DANS). 8(3). 387–398.4 indexed citations
Laan, G. van der & A.J.J. Talman. (1987). Computing economic equilibria by variable dimension algorithms : state of the art. research memorandum.1 indexed citations
11.
Talman, A.J.J. & G. van der Laan. (1987). The computation and modelling of economic equilibria. Data Archiving and Networked Services (DANS).14 indexed citations
12.
Talman, A.J.J., et al.. (1986). Simplicial algorithms for solving the nonlinear complementarity problem on the simplotope. RePEc: Research Papers in Economics. 125–154.1 indexed citations
13.
Talman, A.J.J. & Y. Yamamoto. (1986). A globally convergent simplicial algorithm for stationary point problems on polytopes. research memorandum.1 indexed citations
14.
Talman, A.J.J. & G. van der Laan. (1986). Simplicial algorithms for finding stationary points, a unifying description. Journal of Optimization Theory and Applications. 50. 262–281.5 indexed citations
15.
Talman, A.J.J. & G. van der Laan. (1985). Adjustment processes for finding economic equilibria. Data Archiving and Networked Services (DANS). 85–123.10 indexed citations
16.
Laan, G. van der, A.J.J. Talman, & Ludo Van der Heyden. (1984). Variable dimension algorithms for unproper labellings. research memorandum.3 indexed citations
17.
Laan, G. van der, A.J.J. Talman, & Ludo Van der Heyden. (1984). Shortest paths for simplicial algorithms. research memorandum.1 indexed citations
18.
Talman, A.J.J., et al.. (1984). A new variable dimension simplicial algorithm to find equilibria on the product space of unit simplices. research memorandum.5 indexed citations
Talman, A.J.J. & G. van der Laan. (1982). On the computation of fixed points on the product space of unit simplices and an application to noncooperative N-person games. Data Archiving and Networked Services (DANS).2 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.