J. Luis A. Yebra
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j19 |      | José Gómez, Josep Fàbrega, José Luis Andres Yebra: On large (Δ, D, D, 1)-graphs. Networks 57(4): 316-327 (2011) |
| 2008 | ||
| c2 | | 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 |
| 2005 | ||
| j18 | | Francesc Comellas, José Luis Andres Yebra: Exact Solutions for Minimax Optimization Problems. The American Mathematical Monthly 112(5): 454-458 (2005) |
| 2002 | ||
| j17 |  | J. A. Rodríguez, J. Luis A. Yebra: Laplacian Eigenvalues and the Excess of a Graph. Ars Comb. 64: 249- (2002) |
| j16 | | Francesc Comellas, J. Luis A. Yebra: New Lower Bounds for Heilbronn Numbers. Electr. J. Comb. 9(1) (2002) |
| j15 | | J. A. Rodríguez, A. Gutiérrez, José Luis Andres Yebra: On spectral bounds for cutsets. Discrete Mathematics 257(1): 101-109 (2002) |
| 2001 | ||
| j14 | | 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 | ||
| j13 | | Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra: On Twisted Odd Graphs. Combinatorics, Probability & Computing 9(3): 227-240 (2000) |
| 1999 | ||
| j12 | | 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 | ||
| j11 | | 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) |
| j10 | | Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra: From regular boundary graphs to antipodal distance-regular graphs. Journal of Graph Theory 27(3): 123-140 (1998) |
| 1997 | ||
| j9 | | 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) |
| j8 | | Ester Simó, José Luis Andres Yebra: The vulnerability of the diameter of folded n-cubes. Discrete Mathematics 174(1-3): 317-322 (1997) |
| 1996 | ||
| j7 | | 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) |
| j6 | | 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 | ||
| j5 | | 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 | ||
| j4 | | 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) |
| 1990 | ||
| j3 | | Miguel Angel Fiol, José Luis Andres Yebra: Dense bipartite digraphs. Journal of Graph Theory 14(6): 687-700 (1990) |
| 1987 | ||
| j2 | | 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 | ||
| j1 | | 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 | ||
| c1 | | Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra: Line Digraph Iterations and the (d,k) Problem for Directed Graphs. ISCA 1983: 174-177 |
Colors in the list of coauthors
Last update Thu May 23 18:13:47 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page