Anna S. Lladó

Orcid: 0000-0002-0993-6556

Affiliations:
  • Universitat Politecnica de Catalunya, Barcelona, Spain


According to our database1, Anna S. Lladó authored at least 39 papers between 1991 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
AutoScanJ: A Suite of ImageJ Scripts for Intelligent Microscopy.
Frontiers Bioinform., 2021

Distance-constrained labellings of Cartesian products of graphs.
Discret. Appl. Math., 2021

2018
Decomposing almost complete graphs by random trees.
J. Comb. Theory A, 2018

2017
Approximate results for rainbow labelings.
Period. Math. Hung., 2017

On Star Forest Ascending Subgraph Decomposition.
Electron. J. Comb., 2017

2014
On the ascending subgraph decomposition problem for bipartite graphs.
Electron. Notes Discret. Math., 2014

Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i> <sub>2<i>m</i>, 2<i>m</i> </sub>.
Comb. Probab. Comput., 2014

2013
On Vosperian and Superconnected Vertex-Transitive Digraphs.
Graphs Comb., 2013

On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity.
Eur. J. Comb., 2013

2012
On the modular sumset partition problem.
Eur. J. Comb., 2012

Magic and antimagic H-decompositions.
Discret. Math., 2012

2011
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.
J. Graph Theory, 2011

Almost every tree with n edges decomposes K2n, 2n.
Electron. Notes Discret. Math., 2011

2010
Every tree is a large subtree of a tree that decomposes K<sub>n</sub> or K<sub>n, n</sub>.
Discret. Math., 2010

2009
On the Sumset Partition Problem.
Electron. Notes Discret. Math., 2009

On a conjecture of Graham and Häggkvist with the polynomial method.
Eur. J. Comb., 2009

2008
On complete subsets of the cyclic group.
J. Comb. Theory A, 2008

2007
On a Häggkvist's Conjecture with the Polynomial Method.
Electron. Notes Discret. Math., 2007

Largest cliques in connected supermagic graphs.
Eur. J. Comb., 2007

Cycle-magic graphs.
Discret. Math., 2007

2006
Any tree is a large subgraph of a magic tree.
Australas. J Comb., 2006

2005
Edge-decompositions of <i>Kn, <sub>n</sub></i> into isomorphic copies of a given tree.
J. Graph Theory, 2005

Minimum tree decompositions with a given tree as a factor.
Australas. J Comb., 2005

2004
Minimum degree and minimum number of edge-disjoint trees.
Discret. Math., 2004

2003
Covering a Finite Abelian Group by Subset Sums.
Comb., 2003

2002
Regular packings of regular graphs.
Discret. Math., 2002

On the edge-residual number and the line completion number of a graph.
Ars Comb., 2002

2000
On Isoperimetric Connectivity in Vertex-Transitive Graphs.
SIAM J. Discret. Math., 2000

Higher edge-connectivities and tree decompositions in regular graphs.
Discret. Math., 2000

On Restricted Sums.
Comb. Probab. Comput., 2000

1999
An Isoperimetric Problem in Cayley Graphs.
Theory Comput. Syst., 1999

On Sets With A Small Subset Sum.
Comb. Probab. Comput., 1999

1998
On Subsets with Small Product in Torsion-Free Groups.
Comb., 1998

1997
On the tree number of regular graphs.
Discret. Math., 1997

1996
Small cutsets in quasiminimal Cayley graphs.
Discret. Math., 1996

1995
Minimum order of loop networks of given degree and girth.
Graphs Comb., 1995

1992
The Partial Line Digraph Technique in the Design of Large Interconnection Networks.
IEEE Trans. Computers, 1992

The Connectivity of Hierarchical Cayley Digraphs.
Discret. Appl. Math., 1992

1991
Vosperian and superconnected Abelian Cayley digraphs.
Graphs Comb., 1991


  Loading...