An Algebraic Model for the Storage of Data in Parallel Memories. - Miguel Angel Fiol; Oriol Serra (AAECC, 1987)

Vosperian and superconnected Abelian Cayley digraphs. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Graphs Comb., 1991)

The Connectivity of Hierarchical Cayley Digraphs. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Discret. Appl. Math., 1992)

Updating Polygonizations. - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Ferran Hurtado; Oriol Serra; Jorge Urrutia (Comput. Graph. Forum, 1993)

On large (Delta, D)-graphs. - J. Gómez; Miguel Angel Fiol; Oriol Serra (Discret. Math., 1993)

A Unified Approach to the design and Control of Dynamic Memory Networks. - Miguel Angel Fiol; Josep Fàbrega; Oriol Serra; J. Luis A. Yebra (Parallel Process. Lett., 1993)

On Cayley line digraphs. - Josep M. Brunat; Margarida Espona; Miguel Angel Fiol; Oriol Serra (Discret. Math., 1995)

Minimum order of loop networks of given degree and girth. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Graphs Comb., 1995)

Small cutsets in quasiminimal Cayley graphs. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Discret. Math., 1996)

Hiding points in arrangements of segments. - Ferran Hurtado; Oriol Serra; Jorge Urrutia (Discret. Math., 1996)

Onion Polygonizations. - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Ferran Hurtado; Oriol Serra; Jorge Urrutia (Inf. Process. Lett., 1996)

On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts. - Yahya Ould Hamidoune; Oriol Serra (Math. Syst. Theory, 1996)

On the tree number of regular graphs. - Gerhard Ringel; Anna S. Lladó; Oriol Serra (Discret. Math., 1997)

On Subsets with Small Product in Torsion-Free Groups. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Comb., 1998)

Hidden Cayley graph structures. - Italo J. Dejter; Héctor Hevia; Oriol Serra (Discret. Math., 1998)

Cayley Digraphs Based on the de Bruijn Networks. - Margarida Espona; Oriol Serra (SIAM J. Discret. Math., 1998)

On Sets With A Small Subset Sum. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Comb. Probab. Comput., 1999)

Cayley Digraphs from Complete Generalized Cycles. - Josep M. Brunat; Margarida Espona; Miguel Angel Fiol; Oriol Serra (Eur. J. Comb., 1999)

An Isoperimetric Problem in Cayley Graphs. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Theory Comput. Syst., 1999)

A Local-Global Principle for Macaulay Posets. - Sergei L. Bezrukov; Xavier Portas; Oriol Serra (Order, 1999)

On Restricted Sums. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Comb. Probab. Comput., 2000)

Exactly k-arc Transitive Covers. - Sònia P. Mansilla; Oriol Serra (Electron. Notes Discret. Math., 2000)

On Isoperimetric Connectivity in Vertex-Transitive Graphs. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra; Ralph Tindell (SIAM J. Discret. Math., 2000)

Construction of k-arc transitive digraphs. - Sònia P. Mansilla; Oriol Serra (Discret. Math., 2001)

Preface: Volume 10. - Jaroslav Nesetril; Marc Noy; Oriol Serra (Electron. Notes Discret. Math., 2001)

A local-global principle for vertex-isoperimetric problems. - Sergei L. Bezrukov; Oriol Serra (Discret. Math., 2002)

Covering a Finite Abelian Group by Subset Sums. - Weidong Gao 001; Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (Comb., 2003)

Efficient dominating sets in Cayley graphs. - Italo J. Dejter; Oriol Serra (Discret. Appl. Math., 2003)

Foreword. - Jaroslav Nesetril; Marc Noy; Oriol Serra (Discret. Math., 2003)

Automorphism groups of k-arc transitive covers. - Sònia P. Mansilla; Oriol Serra (Discret. Math., 2004)

An isoperimetric method for the small sumset problem. - Oriol Serra (BCC, 2005)

Structural decompositions, width parameters, and graph labelings. - Jan Kratochvíl; Andrzej Proskurowski; Oriol Serra (Discret. Appl. Math., 2005)

On upper bounds and connectivity of cages. - Gabriela Araujo; Diego González-Moreno; Juan José Montellano-Ballesteros; Oriol Serra (Australas. J Comb., 2007)

Regular chromatic number and the lonely runner problem. - Javier Barajas; Oriol Serra (Electron. Notes Discret. Math., 2007)

Preface. - Alberto Márquez 001; Jarik Nesetril; Oriol Serra (Electron. Notes Discret. Math., 2007)

Some Ramsey and anti-Ramsey results in finite groups. - Oriol Serra (Electron. Notes Discret. Math., 2007)

On the critical pair theory in abelian groups: Beyond Chowla's Theorem. - Yahya Ould Hamidoune; Oriol Serra; Gilles Zémor (Comb., 2008)

The Lonely Runner with Seven Runners. - Javier Barajas; Oriol Serra (Electron. J. Comb., 2008)

Distance graphs with maximum chromatic number. - Javier Barajas; Oriol Serra (Discret. Math., 2008)

The vertex isoperimetric problem for the powers of the diamond graph. - Sergei L. Bezrukov; Miquel Rius; Oriol Serra (Discret. Math., 2008)

On s-arc transitive hypergraphs. - Sònia P. Mansilla; Oriol Serra (Eur. J. Comb., 2008)

Preface. - Jaroslav Nesetril; Oriol Serra (Eur. J. Comb., 2008)

On complete subsets of the cyclic group. - Yahya Ould Hamidoune; Anna S. Lladó; Oriol Serra (J. Comb. Theory A, 2008)

Punctured combinatorial Nullstellensätze. - Simeon Ball; Oriol Serra (Comb., 2009)

On Sums of Dilates. - Javier Cilleruelo; Yahya Ould Hamidoune; Oriol Serra (Comb. Probab. Comput., 2009)

Guest editors' foreword. - Jan Kratochvíl; Andrzej Proskurowski; Oriol Serra (Discret. Appl. Math., 2009)

On the chromatic number of circulant graphs. - Javier Barajas; Oriol Serra (Discret. Math., 2009)

Rainbow-free 3-colorings in abelian groups. - Amanda Montejano; Oriol Serra (Electron. Notes Discret. Math., 2009)

Cycle codes of graphs and MDS array codes. - Oriol Serra; Gilles Zémor (Electron. Notes Discret. Math., 2009)

Connectivity of addition Cayley graphs. - David J. Grynkiewicz; Vsevolod F. Lev; Oriol Serra (J. Comb. Theory B, 2009)

A combinatorial proof of the Removal Lemma for Groups. - Daniel Král; Oriol Serra; Lluís Vena (J. Comb. Theory A, 2009)

Properties of two-dimensional sets with small sumset. - David J. Grynkiewicz; Oriol Serra (J. Comb. Theory A, 2010)

Erratum to: Punctured Combinatorial Nullstellensätze. - Simeon Ball; Oriol Serra (Comb., 2011)

Rainbow Matchings: existence and counting. - Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2011)

On the number of monochromatic solutions of integer linear systems on Abelian groups. - Oriol Serra; Lluís Vena (Electron. Notes Discret. Math., 2011)

Random subgraphs make identification affordable. - Florent Foucaud; Guillem Perarnau; Oriol Serra (CoRR, 2013)

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. - Guillem Perarnau; Oriol Serra (Comb. Probab. Comput., 2013)

The Dicks-Ivanov problem and the Hamidoune problem. - Warren Dicks; Oriol Serra (Eur. J. Comb., 2013)

On the removal lemma for linear systems over Abelian groups. - Daniel Král'; Oriol Serra; Lluís Vena (Eur. J. Comb., 2013)

Preface. - Alain Plagne; Oriol Serra; Gilles Zémor (Eur. J. Comb., 2013)

Yahya Ould Hamidoune's mathematical journey: A critical review of his work. - Alain Plagne; Oriol Serra; Gilles Zémor (Eur. J. Comb., 2013)

A structure theorem for small sumsets in nonabelian groups. - Oriol Serra; Gilles Zémor (Eur. J. Comb., 2013)

On the tree-depth of random graphs. - Guillem Perarnau; Oriol Serra (Discret. Appl. Math., 2014)

On Sumsets and Convex Hull. - Károly J. Böröczky; Francisco Santos; Oriol Serra (Discret. Comput. Geom., 2014)

Counting patterns in colored orthogonal arrays. - Amanda Montejano; Oriol Serra (Discret. Math., 2014)

A problem of Shapozenko on Johnson graphs. - Víctor Diego; Oriol Serra (Electron. Notes Discret. Math., 2014)

An analogue of Vosper's Theorem for Extension Fields. - Christine Bachoc; Oriol Serra; Gilles Zémor (CoRR, 2015)

Preface. - Jaroslav Nesetril; Oriol Serra; Jan Arne Telle (Electron. Notes Discret. Math., 2015)

Counting configuration-free sets in groups. - Juanjo Rué; Oriol Serra; Lluís Vena (Electron. Notes Discret. Math., 2015)

Correlation Among Runners and Some Results on the Lonely Runner Conjecture. - Guillem Perarnau; Oriol Serra (Electron. J. Comb., 2016)

Rainbow perfect matchings in r-partite graph structures. - Pilar Cano; Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2016)

Preface. - Anna de Mier; Oriol Serra (Electron. Notes Discret. Math., 2016)

Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. - Pilar Cano; Guillem Perarnau; Oriol Serra (Electron. Notes Discret. Math., 2017)

Preface. - Oriol Serra; Jozef Sirán; Sanming Zhou (J. Interconnect. Networks, 2017)

Revisiting Kneser's Theorem for Field Extensions. - Christine Bachoc; Oriol Serra; Gilles Zémor (Comb., 2018)

Set systems with distinct sumsets. - Javier Cilleruelo; Oriol Serra; Maximilian Wötzel (Electron. Notes Discret. Math., 2018)

Entropy versions of additive inequalities. - Alberto Espuny Díaz; Oriol Serra (Electron. Notes Discret. Math., 2018)

Preface. - Delia Garijo; Alberto Márquez 001; Oriol Serra (Electron. Notes Discret. Math., 2018)

On a Problem by Shapozenko on Johnson Graphs. - Víctor Diego; Oriol Serra; Lluís Vena (Graphs Comb., 2018)

Memorial to Javier Cilleruelo: A Problem List. - Pablo Candela; Juanjo Rué; Oriol Serra (Integers, 2018)

Additive Volume of Sets Contained in Few Arithmetic Progressions. - Gregory A. Freiman; Oriol Serra; Christoph Spiegel 002 (Integers, 2019)

On List k-Coloring Convex Bipartite Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2020)

Triangulations and a Discrete Brunn-Minkowski Inequality in the Plane. - Károly J. Böröczky; Máté Matolcsi; Imre Z. Ruzsa; Francisco Santos; Oriol Serra (Discret. Comput. Geom., 2020)

Distance-constrained labellings of Cartesian products of graphs. - Anna Lladó; Hamid Mokhtar; Oriol Serra; Sanming Zhou (Discret. Appl. Math., 2021)

On the Homomorphism Order of Oriented Paths and Trees. - Jan Hubicka; Jaroslav Nesetril; Pablo Oviedo; Oriol Serra (CoRR, 2022)

Speeding up random walk mixing by starting from a uniform vertex. - Alberto Espuny Díaz; Patrick Morris 001; Guillem Perarnau; Oriol Serra (CoRR, 2022)

On Vertex Bisection Width of Random d-Regular Graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (CoRR, 2022)

Graph polynomials and group coloring of graphs. - Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Oriol Serra; Mariusz Zajac (Eur. J. Comb., 2022)

Deviation probabilities for arithmetic progressions and other regular discrete structures. - Gonzalo Fiz Pontiveros; Simon Griffiths; Matheus Secco; Oriol Serra (Random Struct. Algorithms, 2022)

Biodiversity, Urban Quality Life and Air Quality Indices for Hotspot Detection of Transformation Opportunities in Cities: A Case Study in Barcelona. - Danielly García; Mariona Ferrandiz-Rovira; Oriol Serra; M. Eulàlia Parés (GISTAM, 2023)

Towards $3n-4$ in groups of prime order. - Vsevolod F. Lev; Oriol Serra (Electron. J. Comb., 2023)

On the extremal families for the Kruskal-Katona theorem. - Oriol Serra; Lluís Vena (CoRR, 2023)

The Typical Approximate Structure of Sets with Bounded Sumset. - Marcelo Campos; Matthew Coulson; Oriol Serra; Maximilian Wötzel (SIAM J. Discret. Math., 2023)

The multicolored graph realization problem. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (Discret. Appl. Math., 2024)

Preface. - Jaroslav Nesetril; Guillem Perarnau; Juanjo Rué; Oriol Serra (Eur. J. Comb., 2024)

On minimum vertex bisection of random d-regular graphs. - Josep Díaz; Öznur Yasar Diner; Maria J. Serna; Oriol Serra (J. Comput. Syst. Sci., 2024)

The Lonely Runner Conjecture turns 60. - Guillem Perarnau; Oriol Serra (Comput. Sci. Rev., 2025)

Alon-Tarsi for hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo; Oriol Serra; Michal Tuczynski; Lluís Vena; Mariusz Zajac (CoRR, 2025)