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 survey of graph layout problems
2002347 citationsJosep Dı́az, Marı́a Serna et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Josep Dı́az'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 Josep Dı́az with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Josep Dı́az more than expected).
This network shows the impact of papers produced by Josep Dı́az. 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 Josep Dı́az. The network helps show where Josep Dı́az may publish in the future.
Co-authorship network of co-authors of Josep Dı́az
This figure shows the co-authorship network connecting the top 25 collaborators of Josep Dı́az.
A scholar is included among the top collaborators of Josep Dı́az 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 Josep Dı́az. Josep Dı́az is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Dı́az, Josep, Dieter Mitsche, Guillem Perarnau, & Xavier Pérez‐Giménez. (2016). . RECERCAT (Consorci de Serveis Universitaris de Catalunya).13 indexed citations
Dı́az, Josep, Dieter Mitsche, & Xavier Pérez‐Giménez. (2008). On the connectivity of dynamic random geometric graphs. Symposium on Discrete Algorithms. 601–610.17 indexed citations
7.
Dı́az, Josep, Klaus Jansen, Andrea Roli, & Uri Zwick. (2006). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial ... (Lecture Notes in Computer Science). Springer eBooks.1 indexed citations
8.
Bartal, Yair, Stefano Leonardi, René Sitters, et al.. (2006). On the value of preemption in scheduling. TU/e Research Portal (Eindhoven University of Technology). 39–48.6 indexed citations
Balcázar, José L., Josep Dı́az, & Joaquim Gabarró. (1984). Some results about Logspace complexity measures.. Bulletin of the European Association for Theoretical Computer Science. 22. 8.1 indexed citations
19.
Dı́az, Josep. (1983). Proceedings of the 10th Colloquium on Automata, Languages and Programming. International Colloquium on Automata, Languages and Programming.18 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.