![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
José Luis Andres Yebra
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j21]José Gómez, Josep Fàbrega
, José Luis Andres Yebra:
On large (Δ, D, D, 1)-graphs. Networks 57(4): 316-327 (2011)
2000 – 2009
- 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
- [j20]Francesc Comellas, José Luis Andres Yebra:
Exact Solutions for Minimax Optimization Problems. Am. Math. Mon. 112(5): 454-458 (2005) - 2002
- [j19]Juan A. Rodríguez-Velázáuez, J. Luis A. Yebra:
Laplacian Eigenvalues and the Excess of a Graph. Ars Comb. 64: 249- (2002) - [j18]Francesc Comellas, J. Luis A. Yebra:
New Lower Bounds for Heilbronn Numbers. Electron. J. Comb. 9(1) (2002) - [j17]Juan A. Rodríguez-Velázáuez, Amauri Gutiérrez, José Luis Andres Yebra:
On spectral bounds for cutsets. Discret. Math. 257(1): 101-109 (2002) - 2001
- [j16]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs: The limit case of a spectral property. Discret. Math. 226(1-3): 155-173 (2001) - 2000
- [j15]Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra:
On Twisted Odd Graphs. Comb. Probab. Comput. 9(3): 227-240 (2000)
1990 – 1999
- 1999
- [j14]Juan A. Rodríguez-Velázáuez, José Luis Andres Yebra:
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. Discret. Math. 196(1-3): 267-275 (1999) - 1998
- [j13]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs - II The limit case of a spectral property. Discret. Math. 182(1-3): 101-111 (1998) - [j12]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
From regular boundary graphs to antipodal distance-regular graphs. J. Graph Theory 27(3): 123-140 (1998) - 1997
- [j11]Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
The alternating polynomials and their relation with the spectra and conditional diameters of graphs. Discret. Math. 167-168: 297-307 (1997) - [j10]Ester Simó, José Luis Andres Yebra:
The vulnerability of the diameter of folded n-cubes. Discret. Math. 174(1-3): 317-322 (1997) - 1996
- [j9]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 B 67(1): 48-61 (1996) - [j8]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
- [j7]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 Process. Lett. 3: 445-456 (1993) - 1992
- [j6]José Gómez, Miguel Angel Fiol, J. Luis A. Yebra:
Graphs on Alphabets as Models for Large Interconnection Networks. Discret. Appl. Math. 37/38: 227-243 (1992) - 1991
- [j5]J. Luis A. Yebra, Victor J. Rayward-Smith, A. P. Revitt:
The (Δ, d, d′, Δ - 1)-problem with applications to computer networks. Ann. Oper. Res. 33(2): 113-124 (1991) - 1990
- [j4]Miguel Angel Fiol, José Luis Andres Yebra:
Dense bipartite digraphs. J. Graph Theory 14(6): 687-700 (1990)
1980 – 1989
- 1987
- [j3]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) - 1986
- [j2]Ignacio Alegre, Miguel Angel Fiol, J. Luis A. Yebra:
Some large graphs with given degree and diameter. J. Graph Theory 10(2): 219-224 (1986) - 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
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint