SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Oriol Serra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Miguel Angel Fiol, Oriol Serra
An Algebraic Model for the Storage of Data in Parallel Memories. [Citation Graph (0, 0)][DBLP]
AAECC, 1987, pp:238-246 [Conf]
Oriol Serra
An isoperimetric method for the small sumset problem. [Citation Graph (0, 0)][DBLP]
Surveys in Combinatorics, 2005, pp:119-152 [Conf]
Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia
Updating Polygonizations. [Citation Graph (0, 0)][DBLP]
Comput. Graph. Forum, 1993, v:12, n:3, pp:143-152 [Journal]
Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Covering a Finite Abelian Group by Subset Sums. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2003, v:23, n:4, pp:599-611 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Subsets with Small Product in Torsion-Free Groups. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1998, v:18, n:4, pp:529-540 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Restricted Sums. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
On Sets With A Small Subset Sum. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
Italo J. Dejter, Oriol Serra
Efficient dominating sets in Cayley graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:319-328 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
The Connectivity of Hierarchical Cayley Digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:37, n:, pp:275-280 [Journal]
Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
Structural decompositions, width parameters, and graph labelings. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2005, v:145, n:2, pp:141-142 [Journal]
Sergei L. Bezrukov, Oriol Serra
A local-global principle for vertex-isoperimetric problems. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:257, n:2-3, pp:285-309 [Journal]
Sònia P. Mansilla, Oriol Serra
Construction of k-arc transitive digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:231, n:1-3, pp:337-349 [Journal]
Jaroslav Nesetril, Marc Noy, Oriol Serra
Foreword. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2003, v:273, n:1-3, pp:1-6 [Journal]
Sònia P. Mansilla, Oriol Serra
Automorphism groups of k-arc transitive covers. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:276, n:1-3, pp:273-285 [Journal]
Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
Cayley Digraphs from Complete Generalized Cycles. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1999, v:20, n:5, pp:337-349 [Journal]
Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia
Onion Polygonizations. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:57, n:3, pp:165-173 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
An Isoperimetric Problem in Cayley Graphs. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 1999, v:32, n:5, pp:507-516 [Journal]
Yahya Ould Hamidoune, Oriol Serra
On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1996, v:29, n:4, pp:407-409 [Journal]
Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra
A Unified Approach to the design and Control of Dynamic Memory Networks. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 1993, v:3, n:, pp:445-456 [Journal]
Margarida Espona, Oriol Serra
Cayley Digraphs Based on the de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1998, v:11, n:2, pp:305-317 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell
On Isoperimetric Connectivity in Vertex-Transitive Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2000, v:13, n:1, pp:139-144 [Journal]
Italo J. Dejter, Héctor Hevia, Oriol Serra
Hidden Cayley graph structures. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:182, n:1-3, pp:69-83 [Journal]
Ferran Hurtado, Oriol Serra, Jorge Urrutia
Hiding points in arrangements of segments. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:162, n:1-3, pp:187-197 [Journal]
Gerhard Ringel, Anna S. Lladó, Oriol Serra
On the tree number of regular graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:165, n:, pp:587-595 [Journal]
J. Gómez, Miguel Angel Fiol, Oriol Serra
On large (Delta, D)-graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:114, n:1-3, pp:219-235 [Journal]
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra
Small cutsets in quasiminimal Cayley graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:159, n:1-3, pp:131-142 [Journal]
Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
On Cayley line digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:138, n:1-3, pp:147-159 [Journal]
On the critical pair theory in abelian groups: Beyond Chowla's Theorem. [Citation Graph (, )][DBLP]
On Sums of Dilates. [Citation Graph (, )][DBLP]
Guest editors' foreword. [Citation Graph (, )][DBLP]
Distance graphs with maximum chromatic number. [Citation Graph (, )][DBLP]
The vertex isoperimetric problem for the powers of the diamond graph. [Citation Graph (, )][DBLP]
On the chromatic number of circulant graphs. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
On s-arc transitive hypergraphs. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP