Anna Lladó

414 total citations
32 papers, 256 citations indexed

About

Anna Lladó is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Geometry and Topology. According to data from OpenAlex, Anna Lladó has authored 32 papers receiving a total of 256 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 17 papers in Electrical and Electronic Engineering and 11 papers in Geometry and Topology. Recurrent topics in Anna Lladó's work include Graph Labeling and Dimension Problems (17 papers), Advanced Graph Theory Research (17 papers) and graph theory and CDMA systems (14 papers). Anna Lladó is often cited by papers focused on Graph Labeling and Dimension Problems (17 papers), Advanced Graph Theory Research (17 papers) and graph theory and CDMA systems (14 papers). Anna Lladó collaborates with scholars based in Spain, France and Indonesia. Anna Lladó's co-authors include Yahya Ould Hamidoune, Oriol Serra, M.A. Fiol, Gerhard Ringel, Hikoe Enomoto, Ralph Tindell, Mirka Miller, Weidong Gao, Michael Drmota and Slamin Slamin and has published in prestigious journals such as IEEE Transactions on Computers, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Anna Lladó

27 papers receiving 233 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Anna Lladó Spain 9 201 106 64 61 54 32 256
Dorota Kuziak Spain 13 439 2.2× 115 1.1× 109 1.7× 37 0.6× 30 0.6× 40 461
David Erwin United States 9 198 1.0× 55 0.5× 46 0.7× 32 0.5× 28 0.5× 16 218
Célia Picinin de Mello Brazil 10 231 1.1× 49 0.5× 51 0.8× 35 0.6× 86 1.6× 30 248
Heinz‐Jürgen Voss Germany 10 223 1.1× 108 1.0× 45 0.7× 36 0.6× 127 2.4× 22 269
Yubao Guo Germany 10 260 1.3× 148 1.4× 65 1.0× 149 2.4× 85 1.6× 52 326
Pratima Panigrahi India 10 187 0.9× 86 0.8× 105 1.6× 19 0.3× 96 1.8× 47 238
Dingjun Lou China 9 223 1.1× 25 0.2× 113 1.8× 132 2.2× 73 1.4× 56 245
Keith Edwards United Kingdom 10 295 1.5× 86 0.8× 38 0.6× 32 0.5× 103 1.9× 29 307
Futaba Okamoto United States 6 237 1.2× 50 0.5× 72 1.1× 48 0.8× 17 0.3× 16 262
Roman Soták Slovakia 12 395 2.0× 166 1.6× 57 0.9× 23 0.4× 113 2.1× 49 411

Countries citing papers authored by Anna Lladó

Since Specialization
Citations

This map shows the geographic impact of Anna Lladó's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anna Lladó with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anna Lladó more than expected).

Fields of papers citing papers by Anna Lladó

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anna Lladó. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anna Lladó. The network helps show where Anna Lladó may publish in the future.

Co-authorship network of co-authors of Anna Lladó

This figure shows the co-authorship network connecting the top 25 collaborators of Anna Lladó. A scholar is included among the top collaborators of Anna Lladó based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anna Lladó. Anna Lladó is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lladó, Anna, et al.. (2014). On the ascending subgraph decomposition problem for bipartite graphs. Electronic Notes in Discrete Mathematics. 46. 19–26. 1 indexed citations
2.
Lladó, Anna. (2013). On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity. European Journal of Combinatorics. 34(8). 1406–1410. 3 indexed citations
3.
Lladó, Anna, et al.. (2012). Magic and antimagic H-decompositions. Discrete Mathematics. 312(7). 1367–1371. 11 indexed citations
4.
Lladó, Anna, et al.. (2011). On the modular sumset partition problem. European Journal of Combinatorics. 33(4). 427–434. 2 indexed citations
5.
Hamidoune, Yahya Ould, et al.. (2011). On Vosperian and Superconnected Vertex-Transitive Digraphs. Graphs and Combinatorics. 29(2). 241–251. 1 indexed citations
6.
Hamidoune, Yahya Ould, et al.. (2011). Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. Journal of Graph Theory. 67(2). 124–138. 5 indexed citations
7.
Lladó, Anna, et al.. (2009). On a conjecture of Graham and Häggkvist with the polynomial method. European Journal of Combinatorics. 30(7). 1585–1592. 4 indexed citations
8.
Lladó, Anna, et al.. (2009). On the Sumset Partition Problem. Electronic Notes in Discrete Mathematics. 34. 15–19. 3 indexed citations
9.
Hamidoune, Yahya Ould, Anna Lladó, & Oriol Serra. (2008). On complete subsets of the cyclic group. Journal of Combinatorial Theory Series A. 115(7). 1279–1285. 12 indexed citations
10.
Lladó, Anna, et al.. (2007). Cycle-magic graphs. Discrete Mathematics. 307(23). 2925–2933. 59 indexed citations
11.
Lladó, Anna. (2007). Largest cliques in connected supermagic graphs. European Journal of Combinatorics. 28(8). 2240–2247. 1 indexed citations
12.
Gao, Weidong, Yahya Ould Hamidoune, Anna Lladó, & Oriol Serra. (2003). Covering a Finite Abelian Group by Subset Sums. COMBINATORICA. 23(4). 599–611. 6 indexed citations
13.
Lladó, Anna, et al.. (2002). On the edge-residual number and the line completion number of a graph.. Ars Combinatoria. 63. 1 indexed citations
14.
Lladó, Anna, et al.. (2000). Higher edge-connectivities and tree decompositions in regular graphs. Discrete Mathematics. 214(1-3). 245–250.
15.
Hamidoune, Yahya Ould, Anna Lladó, & Oriol Serra. (1999). On Sets with a Small Subset Sum. Combinatorics Probability Computing. 8(5). 461–466. 4 indexed citations
16.
Enomoto, Hikoe, et al.. (1998). SUPER EDGE-MAGIC GRAPHS. SUT Journal of Mathematics. 34(2). 105–109. 24 indexed citations
17.
Hamidoune, Yahya Ould, Anna Lladó, & Oriol Serra. (1998). On Subsets with Small Product in Torsion-Free Groups. COMBINATORICA. 18(4). 529–540. 11 indexed citations
18.
Ringel, Gerhard, Anna Lladó, & Oriol Serra. (1997). On the tree number of regular graphs. Discrete Mathematics. 165-166. 587–595.
19.
Hamidoune, Yahya Ould, Anna Lladó, & Oriol Serra. (1992). The connectivity of hierarchical Cayley digraphs. Discrete Applied Mathematics. 37-38. 275–280. 11 indexed citations
20.
Hamidoune, Yahya Ould, Anna Lladó, & Oriol Serra. (1991). Vosperian and superconnected Abelian Cayley digraphs. Graphs and Combinatorics. 7(2). 143–152. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026