default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna S. Lladó
Person information
- affiliation: Universitat Politecnica de Catalunya, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j40]Anna Lladó, Hamid Mokhtar, Oriol Serra, Sanming Zhou
:
Distance-constrained labellings of Cartesian products of graphs. Discret. Appl. Math. 304: 375-383 (2021)- [j39]Sébastien Tosi, Anna Lladó, Lídia Bardia, Elena Rebollo, Anna Godo, Petra Stockinger, Julien Colombelli:
AutoScanJ: A Suite of ImageJ Scripts for Intelligent Microscopy. Frontiers Bioinform. 1 (2021)
2010 – 2019
- 2018
- [j38]Anna Lladó:
Decomposing almost complete graphs by random trees. J. Comb. Theory A 154: 406-421 (2018) - 2017
- [j37]Josep M. Aroca, Anna S. Lladó:
On Star Forest Ascending Subgraph Decomposition. Electron. J. Comb. 24(1): 1 (2017) - [j36]Anna S. Lladó, Mirka Miller:
Approximate results for rainbow labelings. Period. Math. Hung. 74(1): 11-21 (2017) - 2014
- [j35]Michael Drmota, Anna S. Lladó:
Almost Every Tree With m Edges Decomposes K 2m, 2m . Comb. Probab. Comput. 23(1): 50-65 (2014) - [j34]Josep M. Aroca, Anna S. Lladó, S. Slamin:
On the ascending subgraph decomposition problem for bipartite graphs. Electron. Notes Discret. Math. 46: 19-26 (2014) - [j33]Anna S. Lladó:
Decomposing almost complete graphs by random trees. Electron. Notes Discret. Math. 46: 177-183 (2014) - 2013
- [j32]Anna S. Lladó:
On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity. Eur. J. Comb. 34(8): 1406-1410 (2013) - [j31]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
On Vosperian and Superconnected Vertex-Transitive Digraphs. Graphs Comb. 29(2): 241-251 (2013) - 2012
- [j30]Nur Inayah, Anna S. Lladó, Jordi Moragas:
Magic and antimagic H-decompositions. Discret. Math. 312(7): 1367-1371 (2012) - [j29]Anna S. Lladó, Jordi Moragas:
On the modular sumset partition problem. Eur. J. Comb. 33(4): 427-434 (2012) - 2011
- [j28]Anna S. Lladó:
Almost every tree with n edges decomposes K2n, 2n. Electron. Notes Discret. Math. 38: 571-574 (2011) - [j27]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67(2): 124-138 (2011) - 2010
- [j26]Anna S. Lladó, Susana-Clara López, Jordi Moragas:
Every tree is a large subtree of a tree that decomposes Kn or Kn, n. Discret. Math. 310(4): 838-842 (2010)
2000 – 2009
- 2009
- [j25]Marc Cámara, Anna S. Lladó, Jordi Moragas:
On a conjecture of Graham and Häggkvist with the polynomial method. Eur. J. Comb. 30(7): 1585-1592 (2009) - [j24]Anna S. Lladó, Jordi Moragas:
On the Sumset Partition Problem. Electron. Notes Discret. Math. 34: 15-19 (2009) - 2008
- [j23]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On complete subsets of the cyclic group. J. Comb. Theory A 115(7): 1279-1285 (2008) - 2007
- [j22]Anna S. Lladó, Jordi Moragas:
Cycle-magic graphs. Discret. Math. 307(23): 2925-2933 (2007) - [j21]Anna S. Lladó:
Largest cliques in connected supermagic graphs. Eur. J. Comb. 28(8): 2240-2247 (2007) - [j20]Marc Cámara, Anna S. Lladó, Jordi Moragas:
On a Häggkvist's Conjecture with the Polynomial Method. Electron. Notes Discret. Math. 29: 559-563 (2007) - 2006
- [j19]Anna Lladó, Francesc A. Muntaner-Batle:
Any tree is a large subgraph of a magic tree. Australas. J Comb. 35: 291-298 (2006) - 2005
- [j18]Anna Lladó, Susana-Clara López Masip:
Minimum tree decompositions with a given tree as a factor. Australas. J Comb. 31: 47-60 (2005) - [j17]Anna S. Lladó, Susana-Clara López:
Edge-decompositions of Kn, n into isomorphic copies of a given tree. J. Graph Theory 48(1): 1-18 (2005) - 2004
- [j16]Anna M. Lladó Sanchez, Susana-Clara López Masip:
Minimum degree and minimum number of edge-disjoint trees. Discret. Math. 275(1-3): 195-205 (2004) - 2003
- [j15]Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Covering a Finite Abelian Group by Subset Sums. Comb. 23(4): 599-611 (2003) - 2002
- [j14]Amauri Gutiérrez, Anna S. Lladó:
On the edge-residual number and the line completion number of a graph. Ars Comb. 63 (2002) - [j13]Amauri Gutiérrez, Anna S. Lladó:
Regular packings of regular graphs. Discret. Math. 244(1-3): 83-94 (2002) - 2000
- [j12]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Restricted Sums. Comb. Probab. Comput. 9(6): 513-518 (2000) - [j11]Amauri Gutiérrez, Anna S. Lladó, Susana-Clara López:
Higher edge-connectivities and tree decompositions in regular graphs. Discret. Math. 214(1-3): 245-250 (2000) - [j10]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs. SIAM J. Discret. Math. 13(1): 139-144 (2000)
1990 – 1999
- 1999
- [j9]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Sets With A Small Subset Sum. Comb. Probab. Comput. 8(5): 461-466 (1999) - [j8]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
An Isoperimetric Problem in Cayley Graphs. Theory Comput. Syst. 32(5): 507-516 (1999) - 1998
- [j7]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Subsets with Small Product in Torsion-Free Groups. Comb. 18(4): 529-540 (1998) - 1997
- [j6]Gerhard Ringel, Anna S. Lladó, Oriol Serra:
On the tree number of regular graphs. Discret. Math. 165-166: 587-595 (1997) - 1996
- [j5]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Small cutsets in quasiminimal Cayley graphs. Discret. Math. 159(1-3): 131-142 (1996) - 1995
- [j4]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Minimum order of loop networks of given degree and girth. Graphs Comb. 11(2): 131-138 (1995) - 1992
- [j3]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
The Connectivity of Hierarchical Cayley Digraphs. Discret. Appl. Math. 37/38: 275-280 (1992) - [j2]Miguel Angel Fiol, Anna S. Lladó:
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. IEEE Trans. Computers 41(7): 848-857 (1992) - 1991
- [j1]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Vosperian and superconnected Abelian Cayley digraphs. Graphs Comb. 7(2): 143-152 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
