Marı́a Serna

2.5k total citations · 1 hit paper
110 papers, 1.1k citations indexed

About

Marı́a Serna is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Marı́a Serna has authored 110 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 38 papers in Computer Networks and Communications and 22 papers in Management Science and Operations Research. Recurrent topics in Marı́a Serna's work include Advanced Graph Theory Research (28 papers), Complexity and Algorithms in Graphs (21 papers) and Game Theory and Applications (15 papers). Marı́a Serna is often cited by papers focused on Advanced Graph Theory Research (28 papers), Complexity and Algorithms in Graphs (21 papers) and Game Theory and Applications (15 papers). Marı́a Serna collaborates with scholars based in Spain, Greece and Chile. Marı́a Serna's co-authors include Josep Dı́az, Jordi Petit, Xavier Molinero, Fabián Riquelme, Carme Àlvarez, Dimitrios M. Thilikos, María J. Blesa, Paul G. Spirakis, Pablo González-Cantergiani and Mathew D. Penrose and has published in prestigious journals such as European Journal of Operational Research, ACM Computing Surveys and Physica A Statistical Mechanics and its Applications.

In The Last Decade

Marı́a Serna

98 papers receiving 1.0k citations

Hit Papers

A survey of graph layout problems 2002 2026 2010 2018 2002 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A survey of graph layout problems
    2002 347 citations Josep Dı́az, Marı́a Serna et al. profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Marı́a Serna Spain 15 449 437 190 155 125 110 1.1k
Zvi Lotker Israel 23 936 2.1× 369 0.8× 342 1.8× 143 0.9× 186 1.5× 97 1.3k
Sandra M. Hedetniemi United States 16 1.1k 2.4× 966 2.2× 310 1.6× 78 0.5× 144 1.2× 35 1.9k
Mukkai S. Krishnamoorthy United States 19 343 0.8× 372 0.9× 161 0.8× 181 1.2× 325 2.6× 88 1.3k
Daniel Lokshtanov Norway 22 772 1.7× 2.0k 4.7× 174 0.9× 94 0.6× 284 2.3× 159 2.4k
Adrian Vetta Canada 14 392 0.9× 504 1.2× 100 0.5× 269 1.7× 279 2.2× 48 1.4k
Roméo Rizzi Italy 19 350 0.8× 436 1.0× 210 1.1× 31 0.2× 239 1.9× 135 1.3k
Dimitrios M. Thilikos Greece 25 809 1.8× 1.6k 3.8× 117 0.6× 193 1.2× 336 2.7× 125 2.1k
Michael Jünger Germany 16 244 0.5× 530 1.2× 218 1.1× 111 0.7× 268 2.1× 30 1.4k
Harry B. Hunt United States 21 693 1.5× 1.0k 2.4× 224 1.2× 71 0.5× 559 4.5× 97 1.8k
Alan Gibbons United Kingdom 9 346 0.8× 240 0.5× 423 2.2× 62 0.4× 153 1.2× 33 1.1k

Countries citing papers authored by Marı́a Serna

Since Specialization
Citations

This map shows the geographic impact of Marı́a Serna'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 Marı́a Serna with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marı́a Serna more than expected).

Fields of papers citing papers by Marı́a Serna

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marı́a Serna. 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 Marı́a Serna. The network helps show where Marı́a Serna may publish in the future.

Co-authorship network of co-authors of Marı́a Serna

This figure shows the co-authorship network connecting the top 25 collaborators of Marı́a Serna. A scholar is included among the top collaborators of Marı́a Serna 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 Marı́a Serna. Marı́a Serna 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.
Molinero, Xavier, Fabián Riquelme, Salvador Roura, & Marı́a Serna. (2023). Multidimension: a dimensionality extension of simple games. Computational and Applied Mathematics. 42(8).
2.
Molinero, Xavier, Martin Olsen, & Marı́a Serna. (2016). On the complexity of exchanging. Information Processing Letters. 116(6). 437–441. 2 indexed citations
3.
Àlvarez, Carme, et al.. (2016). Celebrity games. Theoretical Computer Science. 648. 56–71.
4.
Dı́az, Josep, Leslie Ann Goldberg, David Richerby, & Marı́a Serna. (2014). Absorption Time of the Moran Process. 28. 642. 1 indexed citations
5.
Serna, Marı́a, et al.. (2013). Star-shaped mediation in influence games. 179–182. 3 indexed citations
6.
Spirakis, Paul G. & Marı́a Serna. (2013). Algorithms and complexity : 8th international conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).
7.
Àlvarez, Carme, María J. Blesa, & Marı́a Serna. (2011). The robustness of stability under link and node failures. Theoretical Computer Science. 412(50). 6855–6878. 8 indexed citations
8.
Gabarró, Joaquim, et al.. (2011). The complexity of game isomorphism. Theoretical Computer Science. 412(48). 6675–6695. 9 indexed citations
9.
Àlvarez, Carme, Joaquim Gabarró, & Marı́a Serna. (2011). Equilibria problems on games: Complexity versus succinctness. Journal of Computer and System Sciences. 77(6). 1172–1197. 4 indexed citations
10.
Comas‐Cufí, Marc & Marı́a Serna. (2009). Vertex fusion under distance constraints. European Journal of Combinatorics. 30(7). 1612–1623. 1 indexed citations
11.
Àlvarez, Carme, María J. Blesa, & Marı́a Serna. (2004). The impact of failure management on the stability of communication networks. 153–160. 6 indexed citations
12.
Dı́az, Josep, Marı́a Serna, & Dimitrios M. Thilikos. (2004). The restrictive H-coloring problem. Discrete Applied Mathematics. 145(2). 297–305. 10 indexed citations
13.
Dı́az, Josep, Norman Do, Marı́a Serna, & N. C. Wormald. (2003). Bounds on the max and min bisection of random cubic and random 4-regular graphs. Theoretical Computer Science. 307(3). 531–547. 11 indexed citations
14.
Dı́az, Josep, Marı́a Serna, & Dimitrios M. Thilikos. (2002). Counting H-colorings of partial k-trees. Theoretical Computer Science. 281(1-2). 291–309. 19 indexed citations
15.
Àlvarez, Carme, Josep Dı́az, & Marı́a Serna. (2001). The hardness of intervalizing four colored caterpillars. Discrete Mathematics. 235(1-3). 19–27. 10 indexed citations
16.
Serna, Marı́a & Fatos Xhafa. (2001). On the parallel approximability of a subclass of quadratic programming. Theoretical Computer Science. 259(1-2). 217–231.
17.
Thilikos, Dimitrios M., Marı́a Serna, & Hans L. Bodlaender. (2000). A Constructive linear time algorithm for small cutwidth. Data Archiving and Networked Services (DANS). 2 indexed citations
18.
19.
Luby, Michael, Andrea Roli, & Marı́a Serna. (1997). Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science. 3 indexed citations
20.
Dı́az, Josep, Alan Gibbons, Grammati Pantziou, et al.. (1997). Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science. 181(2). 267–287. 7 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

Breakdown of academic impact, for papers by Zvi Lotker Breakdown of academic impact, for papers by Sandra M. Hedetniemi Breakdown of academic impact, for papers by Mukkai S. Krishnamoorthy Breakdown of academic impact, for papers by Daniel Lokshtanov Breakdown of academic impact, for papers by Adrian Vetta Breakdown of academic impact, for papers by Roméo Rizzi Breakdown of academic impact, for papers by Dimitrios M. Thilikos Breakdown of academic impact, for papers by Michael Jünger Breakdown of academic impact, for papers by Harry B. Hunt Breakdown of academic impact, for papers by Alan Gibbons
Rankless by CCL
2026