J. Luis A. Yebra
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
17 | EE | Ricard González-Cinca, Eduard Santamaria, J. Luis A. Yebra: The Simulation Course: An Innovative Way of Teaching Computational Science in Aeronautics. ICCS (2) 2008: 735-744 |
2002 | ||
16 | J. A. Rodríguez, J. Luis A. Yebra: Laplacian Eigenvalues and the Excess of a Graph. Ars Comb. 64: 249- (2002) | |
15 | EE | J. A. Rodríguez, A. Gutiérrez, José Luis Andres Yebra: On spectral bounds for cutsets. Discrete Mathematics 257(1): 101-109 (2002) |
14 | EE | Francesc Comellas, J. Luis A. Yebra: New Lower Bounds for Heilbronn Numbers. Electr. J. Comb. 9(1): (2002) |
2001 | ||
13 | EE | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: Boundary graphs: The limit case of a spectral property. Discrete Mathematics 226(1-3): 155-173 (2001) |
2000 | ||
12 | Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra: On Twisted Odd Graphs. Combinatorics, Probability & Computing 9(3): (2000) | |
1999 | ||
11 | EE | J. A. Rodríguez, José Luis Andres Yebra: 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 (1999) |
1998 | ||
10 | EE | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: Boundary graphs - II The limit case of a spectral property. Discrete Mathematics 182(1-3): 101-111 (1998) |
1997 | ||
9 | EE | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: The alternating polynomials and their relation with the spectra and conditional diameters of graphs. Discrete Mathematics 167-168: 297-307 (1997) |
8 | EE | Ester Simó, José Luis Andres Yebra: The vulnerability of the diameter of folded n-cubes. Discrete Mathematics 174(1-3): 317-322 (1997) |
1996 | ||
7 | EE | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. J. Comb. Theory, Ser. B 67(1): 48-61 (1996) |
6 | EE | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: Locally Pseudo-Distance-Regular Graphs. J. Comb. Theory, Ser. B 68(2): 179-205 (1996) |
1993 | ||
5 | Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra: A Unified Approach to the design and Control of Dynamic Memory Networks. Parallel Processing Letters 3: 445-456 (1993) | |
1992 | ||
4 | EE | José Gómez, Miguel Angel Fiol, J. Luis A. Yebra: Graphs on Alphabets as Models for Large Interconnection Networks. Discrete Applied Mathematics 37/38: 227-243 (1992) |
1987 | ||
3 | Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre, Mateo Valero: A Discrete Optimization Problem in Local Networks and Data Alignment. IEEE Trans. Computers 36(6): 702-713 (1987) | |
1984 | ||
2 | Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel: Line Digraph Iterations and the (d, k) Digraph Problem. IEEE Trans. Computers 33(5): 400-403 (1984) | |
1983 | ||
1 | Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra: Line Digraph Iterations and the (d,k) Problem for Directed Graphs ISCA 1983: 174-177 |
1 | Ignacio Alegre | [1] [3] |
2 | Francesc Comellas | [14] |
3 | Josep Fàbrega | [5] |
4 | Miguel Angel Fiol | [1] [2] [3] [4] [5] [6] [7] [9] [10] [12] [13] |
5 | Ernest Garriga | [6] [7] [9] [10] [12] [13] |
6 | José Gómez | [4] |
7 | Ricard González-Cinca | [17] |
8 | A. Gutiérrez | [15] |
9 | Ignacio Alegre de Miquel | [2] |
10 | J. A. Rodríguez | [11] [15] [16] |
11 | Eduard Santamaria | [17] |
12 | Oriol Serra | [5] |
13 | Ester Simó | [8] |
14 | Mateo Valero | [3] |