J.L.A. Yebra

478 total citations
24 papers, 320 citations indexed

About

J.L.A. Yebra is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, J.L.A. Yebra has authored 24 papers receiving a total of 320 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Geometry and Topology, 12 papers in Computational Theory and Mathematics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in J.L.A. Yebra's work include Graph theory and applications (12 papers), Interconnection Networks and Systems (8 papers) and Advanced Graph Theory Research (8 papers). J.L.A. Yebra is often cited by papers focused on Graph theory and applications (12 papers), Interconnection Networks and Systems (8 papers) and Advanced Graph Theory Research (8 papers). J.L.A. Yebra collaborates with scholars based in Spain and United Kingdom. J.L.A. Yebra's co-authors include M.A. Fiol, E. Garriga, J.A. Rodrı́guez, J. Fàbrega, J. Gómez, Francesc Comellas, V. J. Rayward‐Smith and Oriol Serra and has published in prestigious journals such as Annals of Operations Research, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

J.L.A. Yebra

23 papers receiving 291 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
J.L.A. Yebra Spain	11	185	182	141	124	113	24	320
Yoshimi Egawa Japan	13	172 0.9×	448 2.5×	279 2.0×	138 1.1×	176 1.6×	89	531
K.M. Koh Singapore	13	204 1.1×	456 2.5×	180 1.3×	78 0.6×	154 1.4×	71	542
Tomáš Kaiser Czechia	12	109 0.6×	348 1.9×	194 1.4×	59 0.5×	73 0.6×	60	404
Francesco Barioli Canada	11	231 1.2×	330 1.8×	70 0.5×	48 0.4×	71 0.6×	18	380
Norbert Seifter Austria	10	134 0.7×	163 0.9×	149 1.1×	34 0.3×	78 0.7×	35	281
Mohamed H. El-Zahar Canada	10	120 0.6×	237 1.3×	154 1.1×	24 0.2×	68 0.6×	23	329
Saul Stahl United States	9	87 0.5×	208 1.1×	134 1.0×	28 0.2×	39 0.3×	14	277
A. Nilli Israel	4	106 0.6×	86 0.5×	97 0.7×	31 0.3×	32 0.3×	7	211
Michael Stiebitz Germany	14	150 0.8×	504 2.8×	366 2.6×	40 0.3×	79 0.7×	51	555
Martin Kochol Slovakia	13	87 0.5×	395 2.2×	225 1.6×	74 0.6×	115 1.0×	55	448

Countries citing papers authored by J.L.A. Yebra

Since Specialization

Citations

This map shows the geographic impact of J.L.A. Yebra'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 J.L.A. Yebra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.L.A. Yebra more than expected).

Fields of papers citing papers by J.L.A. Yebra

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J.L.A. Yebra. 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 J.L.A. Yebra. The network helps show where J.L.A. Yebra may publish in the future.

Co-authorship network of co-authors of J.L.A. Yebra

This figure shows the co-authorship network connecting the top 25 collaborators of J.L.A. Yebra. A scholar is included among the top collaborators of J.L.A. Yebra 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 J.L.A. Yebra. J.L.A. Yebra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fiol, M.A., J. Fàbrega, & J.L.A. Yebra. (2003). The design and control of dynamic memory networks. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 1. 175–179.

Yebra, J.L.A., et al.. (2002). Laplacian Eigenvalues and the Excess of a Graph.. Ars Combinatoria. 64. 249. 1 indexed citations

Rodrı́guez, J.A., et al.. (2002). On spectral bounds for cutsets. Discrete Mathematics. 257(1). 101–109. 2 indexed citations

Comellas, Francesc & J.L.A. Yebra. (2002). New Lower Bounds for Heilbronn Numbers. The Electronic Journal of Combinatorics. 9(1). 3 indexed citations

Fiol, M.A., E. Garriga, & J.L.A. Yebra. (2001). Boundary graphs: The limit case of a spectral property. Discrete Mathematics. 226(1-3). 155–173. 20 indexed citations

Rodrı́guez, J.A. & J.L.A. Yebra. (1999). Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. Discrete Mathematics. 196(1-3). 267–275. 9 indexed citations

Fiol, M.A., E. Garriga, & J.L.A. Yebra. (1998). Boundary graphs — II The limit case of a spectral property. Discrete Mathematics. 182(1-3). 101–111. 3 indexed citations

Fiol, M.A., E. Garriga, & J.L.A. Yebra. (1997). The alternating polynomials and their relation with the spectra and conditional diameters of graphs. Discrete Mathematics. 167-168. 297–307. 10 indexed citations

Fiol, M.A., E. Garriga, & J.L.A. Yebra. (1996). Locally Pseudo-Distance-Regular Graphs. Journal of Combinatorial Theory Series B. 68(2). 179–205. 55 indexed citations

10.

Fiol, M.A., E. Garriga, & J.L.A. Yebra. (1996). On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. Journal of Combinatorial Theory Series B. 67(1). 48–61. 29 indexed citations

11.

Fiol, M.A., J. Fàbrega, Oriol Serra, & J.L.A. Yebra. (1993). A UNIFIED APPROACH TO THE DESIGN AND CONTROL OF DYNAMIC MEMORY NETWORKS. Parallel Processing Letters. 3(4). 445–456. 4 indexed citations

12.

Yebra, J.L.A., et al.. (1992). When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph. Ars Combinatoria. 34. 65–73. 4 indexed citations

13.

Gómez, J., M.A. Fiol, & J.L.A. Yebra. (1992). Graphs on alphabets as models for large interconnection networks. Discrete Applied Mathematics. 37-38. 227–243. 9 indexed citations

14.

Yebra, J.L.A., et al.. (1991). The (Δ,d, d′, Δ − 1)-problem with applications to computer networks. Annals of Operations Research. 33(2). 113–124. 2 indexed citations

15.

Fiol, M.A. & J.L.A. Yebra. (1990). Dense bipartite digraphs. Journal of Graph Theory. 14(6). 687–700. 29 indexed citations

16.

Fiol, M.A., et al.. (1986). Some large graphs with given degree and diameter. Journal of Graph Theory. 10(2). 219–224. 11 indexed citations

17.

Fiol, M.A., et al.. (1985). Digraphs with walks of equal length between vertices. John Wiley & Sons, Inc. eBooks. 313–322. 10 indexed citations

18.

Yebra, J.L.A., et al.. (1985). The Diameter of undirected graphs associated to plane tessellations. Ars Combinatoria. 159–171. 50 indexed citations

19.

Fiol, M.A., et al.. (1983). Line digraph iterations and the (d,k) problem for directed graphs. ACM SIGARCH Computer Architecture News. 11(3). 174–177. 12 indexed citations

20.

Fiol, M.A., et al.. (1983). Line digraph iterations and the (d,k) problem for directed graphs. 174–177. 27 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.

Explore authors with similar magnitude of impact