Maria Serna
TitleCited byYear
A survey of graph layout problems
J Díaz, J Petit, M Serna
ACM Computing Surveys (CSUR) 34 (3), 313-356, 2002
6382002
Approximating layout problems on random geometric graphs
J Dıaz, MD Penrose, J Petit, M Serna
Journal of Algorithms 39 (1), 78-116, 2001
114*2001
Cutwidth I: A linear time fixed parameter algorithm
DM Thilikos, M Serna, HL Bodlaender
Journal of Algorithms 56 (1), 1-24, 2005
110*2005
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
71*2004
Cutwidth II: Algorithms for partial w-trees of bounded degree
DM Thilikos, M Serna, HL Bodlaender
Journal of Algorithms 56 (1), 25-49, 2005
69*2005
A random graph model for optical networks of sensors
J Díaz, J Petit, M Serna
IEEE Transactions on Mobile Computing 2 (3), 186-196, 2003
662003
Complexity of metric dimension on planar graphs
J Diaz, O Pottonen, M Serna, EJ van Leeuwen
Journal of Computer and System Sciences 83 (1), 132-158, 2017
63*2017
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
62*2000
Approximating linear programming is log-space complete for P
M Serna
Information Processing Letters 37 (4), 233-236, 1991
581991
Stability and non-stability of the FIFO protocol
J Díaz, D Koukopoulos, S Nikoletseas, M Serna, P Spirakis, P Spirakis, ...
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
572001
Random Geometric Problems on [0, 1]2
J Díaz, J Petit, M Serna
International Workshop on Randomization and Approximation Techniques in …, 1998
491998
Approximating fixation probabilities in the generalized Moran process
J Diaz, LA Goldberg, D Richerby, M Serna
Algorithmica 69 (1), 78-91, 2014
482014
Parallel complexity of the connected subgraph problem
LM Kirousis, M Serna, P Spirakis
SIAM Journal on Computing 22 (3), 573-586, 1993
41*1993
Counting H-colorings of partial k-trees
J Díaz, M Serna, DM Thilikos
Theoretical Computer Science 281 (1-2), 291-309, 2002
402002
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
382005
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
36*2007
Algorithms and complexity in combinatorial optimization games
X Deng, T Ibaraki, H Nagamochi
Proc. 8th ACM Symp. on Discrete Algorithms, 1997
351997
Equilibria problems on games: Complexity versus succinctness
C Àlvarez, J Gabarro, M Serna
Journal of Computer and System Sciences 77 (6), 1172-1197, 2011
34*2011
Cooperation through social influence
X Molinero, F Riquelme, M Serna
European Journal of Operational Research 242 (3), 960-974, 2015
33*2015
The approximability of non-Boolean satisfiability problems and restricted integer programming
M Serna, L Trevisan, F Xhafa
Theoretical computer science 332 (1-3), 123-139, 2005
30*2005
The system can't perform the operation now. Try again later.
Articles 1–20