| 2018 | IWOCA | Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). | Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2016 | WALCOM | Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. | Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2014 | WALCOM | On Dilworth k Graphs and Their Pairwise Compatibility. | Tiziana Calamoneri, Rossella Petreschi |
| 2013 | ICALP | Learning a Ring Cheaply and Fast. | Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi |
| 2012 | WALCOM | On Relaxing the Constraints in Pairwise Compatibility Graphs. | Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri |
| 2010 | WALCOM | Parallel Algorithms for Encoding and Decoding Blob Code. | Saverio Caminiti, Rossella Petreschi |
| 2009 | ICCS | Parallel Algorithms for Dandelion-Like Codes. | Saverio Caminiti, Rossella Petreschi |
| 2009 | WALCOM | Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). | Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi |
| 2008 | ESA | Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
| 2005 | COCOON | String Coding of Trees with Locality and Heritability. | Saverio Caminiti, Rossella Petreschi |
| 2005 | PDPTA | Graph Coloring with Distance Constraints. | Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi |
| 2004 | LATIN | A Unified Approach to Coding Labeled Trees. | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
| 2002 | LATIN | L(2, 1)-Coloring Matrogenic Graphs. | Tiziana Calamoneri, Rossella Petreschi |
| 2001 | ALENEX | Hierarchical Clustering of Trees: Algorithms and Experiments. | Irene Finocchi, Rossella Petreschi |
| 2001 | COCOON | On the Validity of Hierarchical Decompositions. | Irene Finocchi, Rossella Petreschi |
| 1995 | COCOON | An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. | Tiziana Calamoneri, Rossella Petreschi |