This map shows the geographic impact of Jacobo Torán'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 Jacobo Torán with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jacobo Torán more than expected).
This network shows the impact of papers produced by Jacobo Torán. 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 Jacobo Torán. The network helps show where Jacobo Torán may publish in the future.
Co-authorship network of co-authors of Jacobo Torán
This figure shows the co-authorship network connecting the top 25 collaborators of Jacobo Torán.
A scholar is included among the top collaborators of Jacobo Torán 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 Jacobo Torán. Jacobo Torán is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Torán, Jacobo, et al.. (2009). The Complexity of Planar Graph Isomorphism.. Bulletin of the European Association for Theoretical Computer Science. 97. 60–82.3 indexed citations
5.
Arvind, V. & Jacobo Torán. (2005). Isomorphism Testing: Perspective and Open Problems.. Bulletin of the European Association for Theoretical Computer Science. 86. 66–84.21 indexed citations
6.
Torán, Jacobo. (2004). Space and Width in Propositional Resolution (Column: Computational Complexity).. Bulletin of the European Association for Theoretical Computer Science. 83. 86–104.7 indexed citations
7.
Arvind, V. & Jacobo Torán. (2004). Solvable Group Isomorphism is (almost) in NP\cap coNP. Electronic colloquium on computational complexity.1 indexed citations
Esteban, Juan Luis & Jacobo Torán. (2003). A Combinatorial Characterization of Treelike Resolution Space. Electronic colloquium on computational complexity.1 indexed citations
10.
Esteban, Juan Luis, et al.. (2001). Minimally Unsatisfiable CNF Formulas.. Bulletin of the European Association for Theoretical Computer Science. 74. 190–192.8 indexed citations
11.
Esteban, Juan Luis & Jacobo Torán. (2001). Space Bounds for Resolution. Information and Computation. 171(1). 84–97.70 indexed citations
12.
Beals, Robert, Richard Chang, William Gasarch, & Jacobo Torán. (1999). On Finding the Number of Graph Automorphisms.. 1999.3 indexed citations
13.
Esteban, Juan Luis, et al.. (1999). Space Bounds for Resolution.2 indexed citations
14.
Torán, Jacobo, et al.. (1997). Optimal proof systems for Propositional Logic and complete sets. Electronic colloquium on computational complexity. 4.1 indexed citations
Torán, Jacobo, et al.. (1992). On the Nonuniform Complexity on the Graph Isomorphism Problem.. Cambridge University Press eBooks. 118–129.3 indexed citations
Köbler, Johannes, Uwe Schöning, & Jacobo Torán. (1989). On counting and approximation. Acta Informatica. 26(4). 363–379.23 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.