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)

The Partial Line Digraph Technique in the Design of Large Interconnection Networks. - Miguel Angel Fiol; Anna S. Lladó (IEEE Trans. Computers, 1992)

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)

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)

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

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

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

Higher edge-connectivities and tree decompositions in regular graphs. - Amauri Gutiérrez; Anna S. Lladó; Susana-Clara López (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)

On the edge-residual number and the line completion number of a graph. - Amauri Gutiérrez; Anna S. Lladó (Ars Comb., 2002)

Regular packings of regular graphs. - Amauri Gutiérrez; Anna S. Lladó (Discret. Math., 2002)

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

Minimum degree and minimum number of edge-disjoint trees. - Anna M. Lladó Sanchez; Susana-Clara López Masip (Discret. Math., 2004)

Minimum tree decompositions with a given tree as a factor. - Anna Lladó; Susana-Clara López Masip (Australas. J Comb., 2005)

Edge-decompositions of Kn, n into isomorphic copies of a given tree. - Anna S. Lladó; Susana-Clara López (J. Graph Theory, 2005)

Any tree is a large subgraph of a magic tree. - Anna Lladó; Francesc A. Muntaner-Batle (Australas. J Comb., 2006)

Cycle-magic graphs. - Anna S. Lladó; Jordi Moragas (Discret. Math., 2007)

Largest cliques in connected supermagic graphs. - Anna S. Lladó (Eur. J. Comb., 2007)

On a Häggkvist's Conjecture with the Polynomial Method. - Marc Cámara; Anna S. Lladó; Jordi Moragas (Electron. Notes Discret. Math., 2007)

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

On a conjecture of Graham and Häggkvist with the polynomial method. - Marc Cámara; Anna S. Lladó; Jordi Moragas (Eur. J. Comb., 2009)

On the Sumset Partition Problem. - Anna S. Lladó; Jordi Moragas (Electron. Notes Discret. Math., 2009)

Every tree is a large subtree of a tree that decomposes Kn or Kn, n. - Anna S. Lladó; Susana-Clara López; Jordi Moragas (Discret. Math., 2010)

Almost every tree with n edges decomposes K2n, 2n. - Anna S. Lladó (Electron. Notes Discret. Math., 2011)

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. - Yahya Ould Hamidoune; Anna S. Lladó; Susana-Clara López (J. Graph Theory, 2011)

Magic and antimagic H-decompositions. - Nur Inayah; Anna S. Lladó; Jordi Moragas (Discret. Math., 2012)

On the modular sumset partition problem. - Anna S. Lladó; Jordi Moragas (Eur. J. Comb., 2012)

On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity. - Anna S. Lladó (Eur. J. Comb., 2013)

On Vosperian and Superconnected Vertex-Transitive Digraphs. - Yahya Ould Hamidoune; Anna S. Lladó; Susana-Clara López (Graphs Comb., 2013)

Almost Every Tree With m Edges Decomposes K 2m, 2m . - Michael Drmota; Anna S. Lladó (Comb. Probab. Comput., 2014)

On the ascending subgraph decomposition problem for bipartite graphs. - Josep M. Aroca; Anna S. Lladó; S. Slamin 001 (Electron. Notes Discret. Math., 2014)

On Star Forest Ascending Subgraph Decomposition. - Josep M. Aroca; Anna S. Lladó (Electron. J. Comb., 2017)

Approximate results for rainbow labelings. - Anna S. Lladó; Mirka Miller (Period. Math. Hung., 2017)

Decomposing almost complete graphs by random trees. - Anna Lladó (J. Comb. Theory A, 2018)

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

AutoScanJ: A Suite of ImageJ Scripts for Intelligent Microscopy. - Sébastien Tosi; Anna Lladó; Lídia Bardia; Elena Rebollo; Anna Godo; Petra Stockinger; Julien Colombelli (Frontiers Bioinform., 2021)