Reversible execution and visualization of programs with LEONARDO P Crescenzi, C Demetrescu, I Finocchi, R Petreschi Journal of Visual Languages & Computing 11 (2), 125-150, 2000 | 96 | 2000 |

L (h, 1)-labeling subclasses of planar graphs T Calamoneri, R Petreschi Journal of Parallel and Distributed Computing 64 (3), 414-426, 2004 | 84 | 2004 |

Cubic graphs R Greenlaw, R Petreschi ACM Computing Surveys (CSUR) 27 (4), 471-495, 1995 | 62 | 1995 |

Labeling trees with a condition at distance two T Calamoneri, A Pelc, R Petreschi Discrete Mathematics 306 (14), 1534-1539, 2006 | 43 | 2006 |

On coding labeled trees S Caminiti, I Finocchi, R Petreschi Theoretical computer science 382 (2), 97-108, 2007 | 40 | 2007 |

Conflict-free star-access in parallel memory systems SK Das, I Finocchi, R Petreschi Journal of Parallel and Distributed Computing 66 (11), 1431-1441, 2006 | 36 | 2006 |

On the *L*(*h*, *k*)‐labeling of co‐comparability graphs and circular‐arc graphsT Calamoneri, S Caminiti, R Petreschi, S Olariu Networks: An International Journal 53 (1), 27-34, 2009 | 34 | 2009 |

(n, e)‐Graphs with maximum sum of squares of degrees UN Peled, R Petreschi, A Sterbini Journal of Graph Theory 31 (4), 283-295, 1999 | 34 | 1999 |

Exploring pairwise compatibility graphs T Calamoneri, E Montefusco, R Petreschi, B Sinaimeri Theoretical Computer Science 468, 23-36, 2013 | 31 | 2013 |

A unified approach to coding labeled trees S Caminiti, I Finocchi, R Petreschi Latin American Symposium on Theoretical Informatics, 339-348, 2004 | 31 | 2004 |

*L(2,1)*-labeling of planar graphsT Calamoneri, R Petreschi Proceedings of the 5th international workshop on Discrete algorithms and …, 2001 | 30 | 2001 |

Degree sequences of matrogenic graphs P Marchioro, A Morgana, R Petreschi, B Simeone Discrete mathematics 51 (1), 47-61, 1984 | 30 | 1984 |

Theoretical results on at most 1-bend embeddability of graphs Y Liu, P Marchioro, R Petreschi, B Simeone Acta Mathematicae Applicatae Sinica 8, 188-192, 1992 | 29 | 1992 |

LEONARDO: a software visualization system. P Crescenzi, C Demetrescu, I Finocchi, R Petreschi WAE, 146-155, 1997 | 26 | 1997 |

On relaxing the constraints in pairwise compatibility graphs T Calamoneri, R Petreschi, B Sinaimeri WALCOM: Algorithms and Computation: 6th International Workshop, WALCOM 2012 …, 2012 | 22 | 2012 |

String coding of trees with locality and heritability S Caminiti, R Petreschi International Computing and Combinatorics Conference, 251-262, 2005 | 22 | 2005 |

An efficient orthogonal grid drawing algorithm for cubic graphs T Calamoneri, R Petreschi Computing and Combinatorics: First Annual International Conference, COCOON …, 1995 | 22 | 1995 |

Power of Algorithms G Ausiello, R Petreschi Springer-Verlag Berlin An, 2016 | 18 | 2016 |

Topology recognition with advice EG Fusco, A Pelc, R Petreschi Information and Computation 247, 254-265, 2016 | 17 | 2016 |

At most single-bend embeddings of cubic graphs YP Liu, P Marchioro, R Petreschi APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B 9 (2), 127-142, 1994 | 17 | 1994 |