Countries citing papers authored by Robert Weismantel
Since
Specialization
Citations
This map shows the geographic impact of Robert Weismantel'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 Weismantel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Weismantel more than expected).
Fields of papers citing papers by Robert Weismantel
This network shows the impact of papers produced by Robert Weismantel. 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 Weismantel. The network helps show where Robert Weismantel may publish in the future.
Co-authorship network of co-authors of Robert Weismantel
This figure shows the co-authorship network connecting the top 25 collaborators of Robert Weismantel.
A scholar is included among the top collaborators of Robert Weismantel 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 Weismantel. Robert Weismantel is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Loera, Jesús A. De, Raymond Hemmecke, Shmuel Onn, Uriel G. Rothblum, & Robert Weismantel. (2009). Convex integer maximization via Graver bases. Journal of Pure and Applied Algebra. 213(8). 1569–1577.12 indexed citations
Loera, Jesús A. De, Raymond Hemmecke, Shmuel Onn, & Robert Weismantel. (2007). N-fold integer programming. Discrete Optimization. 5(2). 231–241.35 indexed citations
8.
Andersen, Kent, Quentin Louveaux, Robert Weismantel, & Laurence A. Wolsey. (2006). Cutting planes from two rows of the simplex tableau (extended version). Open Repository and Bibliography (University of Liège).1 indexed citations
Loera, Jesús A. De, Raymond Hemmecke, Shmuel Onn, Uriel G. Rothblum, & Robert Weismantel. (2006). Integer Convex Maximization. arXiv (Cornell University).2 indexed citations
Henk, Martin & Robert Weismantel. (2000). On minimal solutions of Diophantine equations.. 41(1). 49–55.3 indexed citations
16.
Weismantel, Robert, et al.. (1996). Polyhedral combinatorics: An annotated bibliography. Utrecht University Repository (Utrecht University). 9627.2 indexed citations
17.
Grötschel, Martin, Alexander Martín, & Robert Weismantel. (1996). Packing Steiner Trees: Further Facets. European Journal of Combinatorics. 17(1). 39–52.12 indexed citations
18.
Sturmfels, Bernd, Robert Weismantel, & Günter M. Ziegler. (1995). Gröbner bases of lattices, corner polyhedra, and integer programming.. 36(2). 281–298.28 indexed citations
19.
Martín, Antonio Jiménez & Robert Weismantel. (1993). Packing paths and Steiner trees: routing of electronic circuits. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 6(3). 185–204.9 indexed citations
20.
Grötschel, Martin, Alexander Martín, & Robert Weismantel. (1993). Routing in grid graphs by cutting planes.. 447–461.3 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.