Jacobo Torán
- Computational Theory and Mathematics top 0.5%
- Artificial Intelligence top 2%
- Computer Networks and Communications top 10%
- Computer Vision and Pattern Recognition top 10%
- Electrical and Electronic Engineering
- Co-authors
- Johannes KöblerUwe SchöningJuan Luis EstebanBirgit JennerJosep Dı́azV. ArvindSeinosuke TodaPierre McKenzie
- Topics
- Complexity and Algorithms in Graphs (32 papers)Advanced Graph Theory Research (19 papers)semigroups and automata theory (15 papers)
In The Last Decade
Jacobo Torán
51 papers receiving 882 citations
Peers
Comparison fields: 5 of 72
- Computational Theory and Mathematics 721
- Artificial Intelligence 516
- Computer Networks and Communications 153
- Computer Vision and Pattern Recognition 82
- Electrical and Electronic Engineering 60
Countries citing papers authored by Jacobo Torán
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).
Fields of papers citing papers by Jacobo Torán
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.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 5 | |
| 4 | The Complexity of Planar Graph Isomorphism. | 3 |
| 5 | Isomorphism Testing: Perspective and Open Problems. | 21 |
| 6 | Space and Width in Propositional Resolution (Column: Computational Complexity). | 7 |
| 7 | Solvable Group Isomorphism is (almost) in NP\cap coNP | 1 |
| 8 | 9 | |
| 9 | A Combinatorial Characterization of Treelike Resolution Space | 1 |
| 10 | Minimally Unsatisfiable CNF Formulas. | 8 |
| 11 | 70 | |
| 12 | On Finding the Number of Graph Automorphisms. | 3 |
| 13 | Space Bounds for Resolution | 2 |
| 14 | Optimal proof systems for Propositional Logic and complete sets | 1 |
| 15 | 7 | |
| 16 | 29 | |
| 17 | 36 | |
| 18 | On the Nonuniform Complexity on the Graph Isomorphism Problem. | 3 |
| 19 | 39 | |
| 20 | 23 |
About Jacobo Torán
Jacobo Torán is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software, having authored 56 papers that have together received 989 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (32 papers), Advanced Graph Theory Research (19 papers) and semigroups and automata theory (15 papers). The work is most often cited by research in Computational Theory and Mathematics (721 citations), Artificial Intelligence (516 citations) and Computer Graphics and Computer-Aided Design (34 citations). Jacobo Torán has collaborated with scholars based in Germany, Spain and India. Frequent co-authors include Johannes Köbler, Uwe Schöning, Juan Luis Esteban, Birgit Jenner, Josep Dı́az, V. Arvind, Seinosuke Toda, Pierre McKenzie, Marı́a Serna and Thomas Schwentick. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.