36 citations · 79 across the 15 of their papers we have counts for
18 papers
On Vertex Bisection Width of Random -Regular Graphs
Josep Díaz, Öznur Yaşar Diner, Maria Serna +1
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…
The Multicolored Graph Realization Problem
Josep Díaz, Öznur Yaşar Diner, Maria Serna +1
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph , i.e., a graph together with a coloring on its vertices. We can…
On List k-Coloring Convex Bipartite Graphs
Josep Díaz, Öznur Yaşar Diner, Maria Serna +1
List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k…
Data-compression for Parametrized Counting Problems on Sparse graphs
Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos
We study the concept of \emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function and a pa…
Uncertainty Analysis of Simple Macroeconomic Models Using Angel-Daemon Games
Joaquim Gabarro, Maria Serna
We propose the use of an angel-daemon framework to perform an uncertainty analysis of short-term macroeconomic models with exogenous components. An uncertainty profile …
Measuring satisfaction in societies with opinion leaders and mediators
Xavier Molinero, Fabián Riquelme, Maria Serna
An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered: "opinion leaders", "followers"…