Maria Serna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Maria Serna has a total of 103 co-authors. Here are the top co-authors by number of shared publications:
- Josep Díaz
Universitat Politecnica de Catalunya
33 shared publications - Xavier Molinero
Universitat Politecnica de Catalunya
19 shared publications - Fabián Riquelme
Universidad de Valparaso,Escuela de Ingeniera Informtica,Valparaso,Chile
11 shared publications - Maria Josep Blesa
Universitat Politècnica de Catalunya – BarcelonaTech
10 shared publications - Joaquim Gabarro
Universitat Politecnica de Catalunya
9 shared publications Carme Àlvarez
8 shared publications
Latest Publications
- Open Access
- 3 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 376-387
Traversal games in K-shell decomposition
- 3 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 376-387
Open AccessTraversal games in K-shell decomposition
- 15 June 2026
- Published by Universitat Politecnica de Valencia
- p. 1-8
Uncovering Stress in University Faculty: A Narrative Approach
Stress is a natural response to challenging situations, but at high levels it can negatively affect health and well-being. Uncertainty, an overload of responsibilities, and the need to adapt to new ways of working have impacted many people, and university faculty are no exception. Certain changes in our work environment seem to contribute significantly to stress. For example, increased digitization makes us struggle with technology, and the notable rise in teleworking has reduced direct communication. In addition, the administrative calendar often constrains faculty, concentrating tasks into short periods. Likewise, university objective systems for measuring teaching activity do not always reflect the actual time required. In this reflection, we aim to contribute to the analysis of stress situations and to foster discussion on their causes and effects. To this end, we present narratives that illustrate the main sources of stress in our daily lives and their repercussions on our work.
- 15 June 2026
- Published by Universitat Politecnica de Valencia
- p. 1-8
Uncovering Stress in University Faculty: A Narrative Approach
Stress is a natural response to challenging situations, but at high levels it can negatively affect health and well-being. Uncertainty, an overload of responsibilities, and the need to adapt to new ways of working have impacted many people, and university faculty are no exception. Certain changes in our work environment seem to contribute significantly to stress. For example, increased digitization makes us struggle with technology, and the notable rise in teleworking has reduced direct communication. In addition, the administrative calendar often constrains faculty, concentrating tasks into short periods. Likewise, university objective systems for measuring teaching activity do not always reflect the actual time required. In this reflection, we aim to contribute to the analysis of stress situations and to foster discussion on their causes and effects. To this end, we present narratives that illustrate the main sources of stress in our daily lives and their repercussions on our work.
- 24 January 2025
- Published by Springer Nature
- p. 207-222
Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank
- 24 January 2025
- Published by Springer Nature
- p. 207-222
Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank
- Open Access
- 21 June 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (5) , 1-2
Correction: Multidimension: a dimensionality extension of simple games
- 21 June 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (5) , 1-2
Open AccessCorrection: Multidimension: a dimensionality extension of simple games
- Open Access
- 15 May 2024
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 144
On minimum vertex bisection of random d-regular graphs
- 15 May 2024
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 144
Open AccessOn minimum vertex bisection of random d-regular graphs
- Open Access
- 13 May 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (4) , 1-2
Author Correction: Multidimension: a dimensionality extension of simple games
- 13 May 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (4) , 1-2
Open AccessAuthor Correction: Multidimension: a dimensionality extension of simple games
- 15 February 2024
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 132
Social disruption games in signed networks
- 15 February 2024
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 132
Social disruption games in signed networks
- Open Access
- 20 October 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (8) , 1-30
Multidimension: a dimensionality extension of simple games
In voting theory and social choice theory, decision systems can be represented as simple games, i.e., cooperative games defined through their players or voters and their set of winning coalitions. The weighted voting games form a well-known strict subclass of simple games, where each player has a voting weight so that a coalition wins if the sum of weights of their members exceeds a given quota. Since the number of winning coalitions can be exponential in the number of players, simple games can be represented much more compactly as intersections or unions of weighted voting games. A simple game’s dimension (codimension) is the minimum number of weighted voting games such that their intersection (union) is the given game. It is known there are voting systems with a high (co)dimension. This work introduces the multidimension as the minimum size of an expression with intersections and unions on weighted voting games necessary to obtain the considered simple game. We generalize this notion to subclasses of weighted voting games and analyze the generative properties of these subclasses. We also characterize the simple games with finite generalized multidimension over the set of weighted voting games without dummy players. We provide a comprehensive classification for simple games up to a certain number of players. These results complement similar classification results for generalized (co)dimensions. Our results show how generalized multidimension allows representing more simple games and more compactly, even for a small number of players and for subclasses.
- 20 October 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (8) , 1-30
Open AccessMultidimension: a dimensionality extension of simple games
In voting theory and social choice theory, decision systems can be represented as simple games, i.e., cooperative games defined through their players or voters and their set of winning coalitions. The weighted voting games form a well-known strict subclass of simple games, where each player has a voting weight so that a coalition wins if the sum of weights of their members exceeds a given quota. Since the number of winning coalitions can be exponential in the number of players, simple games can be represented much more compactly as intersections or unions of weighted voting games. A simple game’s dimension (codimension) is the minimum number of weighted voting games such that their intersection (union) is the given game. It is known there are voting systems with a high (co)dimension. This work introduces the multidimension as the minimum size of an expression with intersections and unions on weighted voting games necessary to obtain the considered simple game. We generalize this notion to subclasses of weighted voting games and analyze the generative properties of these subclasses. We also characterize the simple games with finite generalized multidimension over the set of weighted voting games without dummy players. We provide a comprehensive classification for simple games up to a certain number of players. These results complement similar classification results for generalized (co)dimensions. Our results show how generalized multidimension allows representing more simple games and more compactly, even for a small number of players and for subclasses.
- Open Access
On Vertex Bisection Width of Random $d$-Regular Graphs
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving upper bounds on the vertex bisection width of random $d$-regular graphs for constant values of $d$. Our approach is based on analyzing a greedy algorithm by using the Differential Equations Method. In this way, we obtain the first known upper bounds for the vertex bisection width in random regular graphs. The results are compared with experimental ones and with lower bounds obtained by Kolesnik and Wormald, (Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs, SIAM J. on Disc. Math. 28(1), 553-575, 2014).Open AccessOn Vertex Bisection Width of Random $d$-Regular Graphs
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving upper bounds on the vertex bisection width of random $d$-regular graphs for constant values of $d$. Our approach is based on analyzing a greedy algorithm by using the Differential Equations Method. In this way, we obtain the first known upper bounds for the vertex bisection width in random regular graphs. The results are compared with experimental ones and with lower bounds obtained by Kolesnik and Wormald, (Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs, SIAM J. on Disc. Math. 28(1), 553-575, 2014). - Open Access
Playing with Thresholds on the Forward Linear Threshold Rank
Social networks are the natural space for the spreading of information and influence and have become a media themselves. Several models capturing that diffusion process have been proposed, most of them based on the Independent Cascade (IC) model or on the Linear Threshold (LT) model. The IC model is probabilistic while the LT model relies on the knowledge of an actor to be convinced, reflected in an associated individual threshold. Although the LT-based models contemplate an individual threshold for each actor in the network, the existing studies so far have always considered a threshold of 0.5 equal in all actors (i.e., a simple majority activation criterion). Our main objective in this work is to start the study on how the dissemination of information on networks behaves when we consider other options for setting those thresholds and how many network actors end up being influenced by this dissemination. For doing so, we consider a recently introduced centrality measure based on the LT model, the Forward Linear Threshold Rank (FLTR). We analyze experimentally the ranking properties for several networks in which the influence resistance threshold follows different schemes. Here we consider three different schemes: (1) uniform, in which all players have the same value; (2) random, where each player is assigned a threshold u.a.r. in a prescribed interval; and (3) determined by the value of another centrality measure on the actor. Our results show that the selection has a clear impact on the ranking, even quite significant and abrupt in some cases. We conclude that the social networks ranks that provide the best assignments for the individual thresholds are PageRank and FLTR.
Open AccessPlaying with Thresholds on the Forward Linear Threshold Rank
Social networks are the natural space for the spreading of information and influence and have become a media themselves. Several models capturing that diffusion process have been proposed, most of them based on the Independent Cascade (IC) model or on the Linear Threshold (LT) model. The IC model is probabilistic while the LT model relies on the knowledge of an actor to be convinced, reflected in an associated individual threshold. Although the LT-based models contemplate an individual threshold for each actor in the network, the existing studies so far have always considered a threshold of 0.5 equal in all actors (i.e., a simple majority activation criterion). Our main objective in this work is to start the study on how the dissemination of information on networks behaves when we consider other options for setting those thresholds and how many network actors end up being influenced by this dissemination. For doing so, we consider a recently introduced centrality measure based on the LT model, the Forward Linear Threshold Rank (FLTR). We analyze experimentally the ranking properties for several networks in which the influence resistance threshold follows different schemes. Here we consider three different schemes: (1) uniform, in which all players have the same value; (2) random, where each player is assigned a threshold u.a.r. in a prescribed interval; and (3) determined by the value of another centrality measure on the actor. Our results show that the selection has a clear impact on the ranking, even quite significant and abrupt in some cases. We conclude that the social networks ranks that provide the best assignments for the individual thresholds are PageRank and FLTR.