Maria Serna
Cited by
Cited by
A survey of graph layout problems
J Díaz, J Petit, M Serna
ACM Computing Surveys (CSUR) 34 (3), 313-356, 2002
Cutwidth I: A linear time fixed parameter algorithm
DM Thilikos, M Serna, HL Bodlaender
Journal of Algorithms 56 (1), 1-24, 2005
Approximating layout problems on random geometric graphs
J Dıaz, MD Penrose, J Petit, M Serna
Journal of Algorithms 39 (1), 78-116, 2001
Complexity of metric dimension on planar graphs
J Díaz, O Pottonen, M Serna, EJ van Leeuwen
Journal of Computer and System Sciences 83 (1), 132-158, 2017
Cutwidth II: Algorithms for partial w-trees of bounded degree
DM Thilikos, M Serna, HL Bodlaender
Journal of Algorithms 56 (1), 25-49, 2005
Centrality measure in social networks based on linear threshold model
F Riquelme, P Gonzalez-Cantergiani, X Molinero, M Serna
Knowledge-Based Systems 140, 92-102, 2018
Counting H-colorings of partial k-trees
J Díaz, M Serna, DM Thilikos
Theoretical Computer Science 281 (1-2), 291-309, 2002
A characterization of universal stability in the adversarial queuing model
C Àlvarez, M Blesa, M Serna
SIAM Journal on Computing 34 (1), 41-66, 2004
A random graph model for optical networks of sensors
J Diaz, J Petit, M Serna
IEEE Transactions on Mobile Computing 2 (3), 186-196, 2003
Approximating fixation probabilities in the generalized Moran process
J Diaz, LA Goldberg, D Richerby, M Serna
Algorithmica 69 (1), 78-91, 2014
Convergence theorems for some layout measures on random lattice and random geometric graphs
J Díaz, MD Penrose, J Petit, M Serna
Combinatorics, Probability and Computing 9 (6), 489-511, 2000
Approximating linear programming is log-space complete for P
M Serna
Information Processing Letters 37 (4), 233-236, 1991
Cooperation through social influence
X Molinero, F Riquelme, M Serna
European Journal of Operational Research 242 (3), 960-974, 2015
Stability and non-stability of the FIFO protocol
J Diaz, D Koukopoulos, S Nikoletseas, M Serna, P Spirakis, DM Thilikos
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
Bounds on the bisection width for random d-regular graphs
J Díaz, MJ Serna, NC Wormald
Theoretical Computer Science 382 (2), 120-130, 2007
Random Geometric Problems on [0, 1]2
J Díaz, J Petit, M Serna
International Workshop on Randomization and Approximation Techniques in …, 1998
The complexity of game isomorphism
J Gabarró, A García, M Serna
Theoretical Computer Science 412 (48), 6675-6695, 2011
Adversarial models for priority‐based networks
C Àlvarez, M Blesa, J Díaz, M Serna, A Fernández
Networks: An International Journal 45 (1), 23-35, 2005
Equilibria problems on games: Complexity versus succinctness
C Àlvarez, J Gabarro, M Serna
Journal of Computer and System Sciences 77 (6), 1172-1197, 2011
Bounds on the max and min bisection of random cubic and random 4-regular graphs
J Dıaz, N Do, MJ Serna, NC Wormald
Theoretical computer science 307 (3), 531-547, 2003
The system can't perform the operation now. Try again later.
Articles 1–20