2009 |
41 | EE | David J. Grynkiewicz,
Vsevolod F. Lev,
Oriol Serra:
Connectivity of addition Cayley graphs.
J. Comb. Theory, Ser. B 99(1): 202-217 (2009) |
2008 |
40 | EE | Yahya Ould Hamidoune,
Oriol Serra,
Gilles Zémor:
On the critical pair theory in abelian groups: Beyond Chowla's Theorem.
Combinatorica 28(4): 441-467 (2008) |
39 | EE | Sergei L. Bezrukov,
Miquel Rius,
Oriol Serra:
The vertex isoperimetric problem for the powers of the diamond graph.
Discrete Mathematics 308(11): 2067-2074 (2008) |
38 | EE | Javier Barajas,
Oriol Serra:
Distance graphs with maximum chromatic number.
Discrete Mathematics 308(8): 1355-1365 (2008) |
37 | EE | Sònia P. Mansilla,
Oriol Serra:
On s-arc transitive hypergraphs.
Eur. J. Comb. 29(4): 1003-1011 (2008) |
36 | EE | Jaroslav Nesetril,
Oriol Serra:
Preface.
Eur. J. Comb. 29(4): 793-795 (2008) |
35 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
On complete subsets of the cyclic group.
J. Comb. Theory, Ser. A 115(7): 1279-1285 (2008) |
2007 |
34 | EE | Gabriela Araujo-Pardo,
Diego González,
Juan José Montellano-Ballesteros,
Oriol Serra:
On upper bounds and connectivity of cages.
Electronic Notes in Discrete Mathematics 28: 137-140 (2007) |
33 | EE | Oriol Serra:
Some Ramsey and anti-Ramsey results in finite groups.
Electronic Notes in Discrete Mathematics 28: 437-444 (2007) |
32 | EE | Alberto Márquez,
Jarik Nesetril,
Oriol Serra:
Preface.
Electronic Notes in Discrete Mathematics 29: 1-2 (2007) |
31 | EE | David J. Grynkiewicz,
Vsevolod F. Lev,
Oriol Serra:
The Connectivity of addition Cayley graphs.
Electronic Notes in Discrete Mathematics 29: 135-139 (2007) |
30 | EE | Javier Barajas,
Oriol Serra:
Regular chromatic number and the lonely runner problem.
Electronic Notes in Discrete Mathematics 29: 479-483 (2007) |
2005 |
29 | | Oriol Serra:
An isoperimetric method for the small sumset problem.
Surveys in Combinatorics 2005: 119-152 |
28 | EE | Jan Kratochvíl,
Andrzej Proskurowski,
Oriol Serra:
Structural decompositions, width parameters, and graph labelings.
Discrete Applied Mathematics 145(2): 141-142 (2005) |
2004 |
27 | EE | Sònia P. Mansilla,
Oriol Serra:
Automorphism groups of k-arc transitive covers.
Discrete Mathematics 276(1-3): 273-285 (2004) |
2003 |
26 | EE | Weidong Gao,
Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
Covering a Finite Abelian Group by Subset Sums.
Combinatorica 23(4): 599-611 (2003) |
25 | EE | Italo J. Dejter,
Oriol Serra:
Efficient dominating sets in Cayley graphs.
Discrete Applied Mathematics 129(2-3): 319-328 (2003) |
24 | EE | Jaroslav Nesetril,
Marc Noy,
Oriol Serra:
Foreword.
Discrete Mathematics 273(1-3): 1-6 (2003) |
2002 |
23 | EE | Sergei L. Bezrukov,
Oriol Serra:
A local-global principle for vertex-isoperimetric problems.
Discrete Mathematics 257(2-3): 285-309 (2002) |
2001 |
22 | EE | Sònia P. Mansilla,
Oriol Serra:
Construction of k-arc transitive digraphs.
Discrete Mathematics 231(1-3): 337-349 (2001) |
21 | EE | Jaroslav Nesetril,
Marc Noy,
Oriol Serra:
Preface: Volume 10.
Electronic Notes in Discrete Mathematics 10: 1 (2001) |
2000 |
20 | | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
On Restricted Sums.
Combinatorics, Probability & Computing 9(6): (2000) |
19 | EE | Sònia P. Mansilla,
Oriol Serra:
Exactly k-arc Transitive Covers.
Electronic Notes in Discrete Mathematics 5: 321 (2000) |
18 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra,
Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs.
SIAM J. Discrete Math. 13(1): 139-144 (2000) |
1999 |
17 | | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
On Sets With A Small Subset Sum.
Combinatorics, Probability & Computing 8(5): (1999) |
16 | EE | Josep M. Brunat,
Margarida Espona,
Miguel Angel Fiol,
Oriol Serra:
Cayley Digraphs from Complete Generalized Cycles.
Eur. J. Comb. 20(5): 337-349 (1999) |
15 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
An Isoperimetric Problem in Cayley Graphs.
Theory Comput. Syst. 32(5): 507-516 (1999) |
1998 |
14 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
On Subsets with Small Product in Torsion-Free Groups.
Combinatorica 18(4): 529-540 (1998) |
13 | EE | Italo J. Dejter,
Héctor Hevia,
Oriol Serra:
Hidden Cayley graph structures.
Discrete Mathematics 182(1-3): 69-83 (1998) |
12 | EE | Margarida Espona,
Oriol Serra:
Cayley Digraphs Based on the de Bruijn Networks.
SIAM J. Discrete Math. 11(2): 305-317 (1998) |
1997 |
11 | EE | Gerhard Ringel,
Anna S. Lladó,
Oriol Serra:
On the tree number of regular graphs.
Discrete Mathematics 165-166: 587-595 (1997) |
1996 |
10 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
Small cutsets in quasiminimal Cayley graphs.
Discrete Mathematics 159(1-3): 131-142 (1996) |
9 | EE | Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Hiding points in arrangements of segments.
Discrete Mathematics 162(1-3): 187-197 (1996) |
8 | EE | Manuel Abellanas,
Jesus Garcia-Lopez,
Gregorio Hernández-Peñalver,
Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Onion Polygonizations.
Inf. Process. Lett. 57(3): 165-173 (1996) |
7 | | Yahya Ould Hamidoune,
Oriol Serra:
On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts.
Mathematical Systems Theory 29(4): 407-409 (1996) |
1995 |
6 | EE | Josep M. Brunat,
Margarida Espona,
Miguel Angel Fiol,
Oriol Serra:
On Cayley line digraphs.
Discrete Mathematics 138(1-3): 147-159 (1995) |
1993 |
5 | | Manuel Abellanas,
Jesus Garcia-Lopez,
Gregorio Hernández-Peñalver,
Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Updating Polygonizations.
Comput. Graph. Forum 12(3): 143-152 (1993) |
4 | EE | J. Gómez,
Miguel Angel Fiol,
Oriol Serra:
On large (Delta, D)-graphs.
Discrete Mathematics 114(1-3): 219-235 (1993) |
3 | | 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 |
2 | EE | Yahya Ould Hamidoune,
Anna S. Lladó,
Oriol Serra:
The Connectivity of Hierarchical Cayley Digraphs.
Discrete Applied Mathematics 37/38: 275-280 (1992) |
1987 |
1 | | Miguel Angel Fiol,
Oriol Serra:
An Algebraic Model for the Storage of Data in Parallel Memories.
AAECC 1987: 238-246 |