José Luis Andres Yebra

According to our database1, José Luis Andres Yebra authored at least 23 papers between 1983 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
On large (Δ, <i>D</i>, <i>D</i>, 1)-graphs.
Networks, 2011

2008
The Simulation Course: An Innovative Way of Teaching Computational Science in Aeronautics.
Proceedings of the Computational Science, 2008

2005
Exact Solutions for Minimax Optimization Problems.
Am. Math. Mon., 2005

2002
On spectral bounds for cutsets.
Discret. Math., 2002

New Lower Bounds for Heilbronn Numbers.
Electron. J. Comb., 2002

Laplacian Eigenvalues and the Excess of a Graph.
Ars Comb., 2002

2001
Boundary graphs: The limit case of a spectral property.
Discret. Math., 2001

2000
On Twisted Odd Graphs.
Comb. Probab. Comput., 2000

1999
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods.
Discret. Math., 1999

1998
From regular boundary graphs to antipodal distance-regular graphs.
J. Graph Theory, 1998

Boundary graphs - II The limit case of a spectral property.
Discret. Math., 1998

1997
The vulnerability of the diameter of folded n-cubes.
Discret. Math., 1997

The alternating polynomials and their relation with the spectra and conditional diameters of graphs.
Discret. Math., 1997

1996
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs.
J. Comb. Theory B, 1996

Locally Pseudo-Distance-Regular Graphs.
J. Comb. Theory, Ser. B, 1996

1993
A Unified Approach to the design and Control of Dynamic Memory Networks.
Parallel Process. Lett., 1993

1992
Graphs on Alphabets as Models for Large Interconnection Networks.
Discret. Appl. Math., 1992

1991
The (Δ, <i>d, d′</i>, Δ - 1)-problem with applications to computer networks.
Ann. Oper. Res., 1991

1990
Dense bipartite digraphs.
J. Graph Theory, 1990

1987
A Discrete Optimization Problem in Local Networks and Data Alignment.
IEEE Trans. Computers, 1987

1986
Some large graphs with given degree and diameter.
J. Graph Theory, 1986

1984
Line Digraph Iterations and the (<i>d, k</i>) Digraph Problem.
IEEE Trans. Computers, 1984

1983
Line Digraph Iterations and the (d,k) Problem for Directed Graphs
Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983


  Loading...