A survey of graph layout problems J Díaz, J Petit, M Serna ACM Computing Surveys (CSUR) 34 (3), 313-356, 2002 | 636 | 2002 |

MALLBA: A library of skeletons for combinatorial optimisation E Alba, F Almeida, M Blesa, J Cabeza, C Cotta, M Díaz, I Dorta, J Gabarró, ... European Conference on Parallel Processing, 927-932, 2002 | 182 | 2002 |

Experiments on the minimum linear arrangement problem J Petit Journal of Experimental Algorithmics (JEA) 8, 2.3, 2003 | 120 | 2003 |

Approximating layout problems on random geometric graphs J Dıaz, MD Penrose, J Petit, M Serna Journal of Algorithms 39 (1), 78-116, 2001 | 93 | 2001 |

Efficient parallel LAN/WAN algorithms for optimization. The MALLBA project E Alba, F Almeida, M Blesa, C Cotta, M Díaz, I Dorta, J Gabarró, C León, ... Parallel Computing 32 (5-6), 415-440, 2006 | 86 | 2006 |

Jutge. org: an educational programming judge J Petit, O Giménez, S Roura Proceedings of the 43rd ACM technical symposium on Computer Science …, 2012 | 70 | 2012 |

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 | 66 | 2003 |

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 | 55 | 2000 |

Random Geometric Problems on [0, 1]^{2}J Díaz, J Petit, M Serna International Workshop on Randomization and Approximation Techniques in …, 1998 | 49 | 1998 |

Addenda to the survey of layout problems J Petit Bulletin of EATCS 3 (105), 2013 | 35 | 2013 |

Combining spectral sequencing and parallel simulated annealing for the MinLA problem J Petit Parallel Processing Letters 13 (01), 77-91, 2003 | 34 | 2003 |

Layout problems J Petit BULLETIN-EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 75, 289-292, 2001 | 28 | 2001 |

A guide to concentration bounds J Diaz, J Petit, M Serna Handbook on Randomized Computing, volume II, chapter 12, 2001 | 25 | 2001 |

A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs E Levy, G Louchard, J Petit Workshop on Combinatorial and Algorithmic aspects of networking, 63-74, 2004 | 21 | 2004 |

Faulty random geometric networks J Diaz, J Petit, M Serna Parallel Processing Letters 10 (04), 343-357, 2000 | 21 | 2000 |

A boolean rule-based approach for manufacturability-aware cell routing J Cortadella, J Petit, S Gomez, F Moll IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2014 | 18 | 2014 |

Efficient and reliable high level communication in randomly deployed wireless sensor networks C Àlvarez, J Díaz, J Petit, J Rolim, M Serna Proceedings of the second international workshop on Mobility management …, 2004 | 18 | 2004 |

Approximating layout problems on random graphs J Dı́az, J Petit, M Serna, L Trevisan Discrete Mathematics 235 (1-3), 245-253, 2001 | 16 | 2001 |

Linear orderings of random geometric graphs J Díaz, MD Penrose, J Petit, M Serna International Workshop on Graph-Theoretic Concepts in Computer Science, 291-302, 1999 | 15 | 1999 |

Approximating layout problems on random graphs J Diaz, J Petit, M Serna, L Trevisan Discrete Math, 2001 | 12 | 2001 |