VLDB 2026 Research / reviewers in the wild / expert
José Luis Andres Yebra
dblp:y/JLAYebra · also J. Luis A. Yebra
· DBLP profile ↗
5ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3Computer networks · 1Software engineering, systems software and programming languages · 1Theory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Interconnection networks and networks-on-chip · 56% Processor architecture and microarchitecture · 20% Memory systems · 20% | |
| Theoretical computer science
2 papers |
Mathematical optimization · 64% Graph algorithms and graph theory · 18% Combinatorics and discrete mathematics · 18% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
network topology |
0.0 | 3 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 Line Digraph Iterations and the (d, k) Digraph Problem · IEEE Trans. Computers 1984 Line Digraph Iterations and the (d,k) Problem for Directed Graphs · ISCA 1983 |
Memory systems › data layout optimization
data alignment |
0.0 | 1 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 |
Interconnection networks and networks-on-chip › network topology › loop networks
double-loop network |
0.0 | 1 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 |
Processor architecture and microarchitecture › SIMD
SIMD processor |
0.0 | 1 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 |
Mathematical optimization
combinatorial optimization |
0.0 | 1 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 |
Mathematical optimization
discrete optimization |
0.0 | 1 | 1987 | A Discrete Optimization Problem in Local Networks and Data Alignment · IEEE Trans. Computers 1987 |
Combinatorics and discrete mathematics › extremal combinatorics › extremal graph theory
moore bound |
0.0 | 1 | 1983 | Line Digraph Iterations and the (d,k) Problem for Directed Graphs · ISCA 1983 |
Electronic design automation › physical design
routing |
0.0 | 1 | 1984 | Line Digraph Iterations and the (d, k) Digraph Problem · IEEE Trans. Computers 1984 |
Methods — techniques the papers use, named apart from their topics
line digraph iteration · 0.0discrete optimization · 0.0local routing algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | On large (Δ, D, D, 1)-graphsabstractConcern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ≤ s ≤ Δ − 1, where Δ is the maximum degree of the graph. Graphs of maximum degree Δ, diameter ≤ D and such that the graphs obtained by deletion of up to s vertices have diameter ≤ D′ are known as (Δ, D, D′, s)-graphs. This article considers the case s = 1 and D = D′. In other words, it deals with the search for large graphs whose diameter does not increase after deleting one vertex. The article also contains an updated table of the largest known (Δ, D, D, 1)-graphs, in which most of the entries correspond to the constructions put forward in this article. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(4), 316–327 2011 Josep Fàbrega, José Luis Andres Yebra |
Networks | 3 |
| 1992 | Graphs on Alphabets as Models for Large Interconnection Networks
Miguel Angel Fiol, José Luis Andres Yebra |
Discret. Appl. Math. | 3 |
| 1987 | A Discrete Optimization Problem in Local Networks and Data AlignmentabstractThis paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors. Miguel Angel Fiol, José Luis Andres Yebra, Ignacio Alegre, Mateo Valero |
IEEE Trans. Computers | 2 |
| 1984 | Line Digraph Iterations and the (d, k) Digraph ProblemabstractThis paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of vertices in a digraph of maximum out-degree d and diameter k. By line digraph iterations it is possible to construct digraphs with a number of vertices larger than (d2- l)/d2times the (nonattainable) Moore bound. In particular, this solves the (d, k) digraph problem for k = 2. Also, the line digraph technique provides us with a simple local routing algorithm for the corresponding networks. Miguel Angel Fiol, José Luis Andres Yebra, Ignacio Alegre de Miquel |
IEEE Trans. Computers | 2 |
| 1983 | Line Digraph Iterations and the (d,k) Problem for Directed GraphsabstractWe consider in this paper the (d,k) problem for directed graphs: to maximize the number of vertices in a digraph of degree d and diameter k. For any values of d and k, we construct a graph with a number of vertices larger than (d 2-1)/d2 times the (non-attainable) Moore bound. In particular, this solves the (d,k) digraph problem for k=2. We also show that these graphs can be obtained as line digraph iterations and that this technique provides us with a simple local routing algorithm for the corresponding networks. Miguel Angel Fiol, Ignacio Alegre, José Luis Andres Yebra |
ISCA | 3 |