A Switching Algorithm for the Solution of Quadratic Boolean Equations. - Rossella Petreschi; Bruno Simeone (Inf. Process. Lett., 1980)

Degree sequences of matrogenic graphs. - P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Discret. Math., 1984)

Adamant digraphs. - P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Discret. Math., 1988)

Parallelism and the Feedback Vertex Set Problem. - Daniel P. Bovet; Sergio De Agostino; Rossella Petreschi (Inf. Process. Lett., 1988)

Parallel-Depth Search for Acyclic Digraphs. - Gian Carlo Bongiovanni; Rossella Petreschi (J. Parallel Distributed Comput., 1989)

On Line 2-Satisfiability. - Brigitte Jaumard; P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Ann. Math. Artif. Intell., 1990)

Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. - Sergio De Agostino; Rossella Petreschi (Int. J. Found. Comput. Sci., 1990)

On PVchunk Operations and Matrogenic Graphs. - Sergio De Agostino; Rossella Petreschi (Int. J. Found. Comput. Sci., 1992)

Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs. - Luca Baffi; Rossella Petreschi (ASIAN, 1995)

Threshold Graphs and Synchronization Protocols. - Rossella Petreschi; Andrea Sterbini (Combinatorics and Computer Science, 1995)

An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. - Tiziana Calamoneri; Rossella Petreschi (COCOON, 1995)

Cubic Graphs. - Raymond Greenlaw; Rossella Petreschi (ACM Comput. Surv., 1995)

Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. - Rossella Petreschi; Andrea Sterbini (Inf. Process. Lett., 1995)

Recognizing Strict 2-Threshold Graphs in O(m) Time. - Rossella Petreschi; Andrea Sterbini (Inf. Process. Lett., 1995)

LEONARDO: a software visualization system. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (WAE, 1997)

An O(n³) Recognition Algorithm for Bithreshold Graphs. - Sergio De Agostino; Rossella Petreschi; Andrea Sterbini (Algorithmica, 1997)

A New 3D Representation of Trivalent Cayley Networks. - Tiziana Calamoneri; Rossella Petreschi (Inf. Process. Lett., 1997)

Orthogonally Drawing Cubic Graphs in Parallel. - Tiziana Calamoneri; Rossella Petreschi (J. Parallel Distributed Comput., 1998)

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. - Tiziana Calamoneri; Irene Finocchi; Yannis Manoussakis; Rossella Petreschi (ASIAN, 1999)

Optimal Layout of Trivalent Cayley Interconnection Networks. - Tiziana Calamoneri; Rossella Petreschi (Int. J. Found. Comput. Sci., 1999)

Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. - Tiziana Calamoneri; Simone Jannelli; Rossella Petreschi (J. Graph Algorithms Appl., 1999)

(n, e)-Graphs with maximum sum of squares of degrees. - Uri N. Peled; Rossella Petreschi; Andrea Sterbini (J. Graph Theory, 1999)

Computing Prüfer codes efficiently in parallel. - Raymond Greenlaw; Rossella Petreschi (Discret. Appl. Math., 2000)

A Simple Parallel Algorithm to Draw Cubic Graphs. - Tiziana Calamoneri; Stephan Olariu; Rossella Petreschi (IEEE Trans. Parallel Distributed Syst., 2000)

Reversible Execution and Visualization of Programs with LEONARDO. - Pierluigi Crescenzi; Camil Demetrescu; Irene Finocchi; Rossella Petreschi (J. Vis. Lang. Comput., 2000)

Hierarchical Clustering of Trees: Algorithms and Experiments. - Irene Finocchi; Rossella Petreschi (ALENEX, 2001)

On the Validity of Hierarchical Decompositions. - Irene Finocchi; Rossella Petreschi (COCOON, 2001)

L(2, 1)-labeling of planar graphs. - Tiziana Calamoneri; Rossella Petreschi (DIAL-M, 2001)

LD-Coloring of Regular Tiling (Extended Abstract). - Tiziana Calamoneri; Rossella Petreschi (Electron. Notes Discret. Math., 2001)

Tree partitioning via vertex deletion. - Irene Finocchi; Rossella Petreschi (Electron. Notes Discret. Math., 2001)

Edge-clique graphs and the l-coloring problem. - Tiziana Calamoneri; Rossella Petreschi (J. Braz. Comput. Soc., 2001)

On the Radiocoloring Problem. - Tiziana Calamoneri; Rossella Petreschi (IWDC, 2002)

L(2, 1)-Coloring Matrogenic Graphs. - Tiziana Calamoneri; Rossella Petreschi (LATIN, 2002)

On max cut in cubic graphs. - Tiziana Calamoneri; Irene Finocchi; Yannis Manoussakis; Rossella Petreschi (Parallel Algorithms Appl., 2002)

Foreword. - Gian Carlo Bongiovanni; Giorgio Gambosi; Rossella Petreschi (Theor. Comput. Sci., 2002)

Labeling trees with a condition at distance two. - Tiziana Calamoneri; Rossella Petreschi; Andrzej Pelc (Electron. Notes Discret. Math., 2003)

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. - Sajal K. Das 001; Irene Finocchi; Rossella Petreschi (IPDPS, 2004)

A Unified Approach to Coding Labeled Trees. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (LATIN, 2004)

Divider-based algorithms for hierarchical tree partitioning. - Irene Finocchi; Rossella Petreschi (Discret. Appl. Math., 2004)

L(h, 1)-labeling subclasses of planar graphs. - Tiziana Calamoneri; Rossella Petreschi (J. Parallel Distributed Comput., 2004)

String Coding of Trees with Locality and Heritability. - Saverio Caminiti; Rossella Petreschi (COCOON, 2005)

Graph Coloring with Distance Constraints. - Tiziana Calamoneri; Irene Finocchi; Rossella Petreschi (PDPTA, 2005)

A general approach to L(h, k)-label interconnection networks. - Tiziana Calamoneri; Saverio Caminiti; Rossella Petreschi (Electron. Notes Discret. Math., 2005)

Structure-Preserving Hierarchical Decompositions. - Irene Finocchi; Rossella Petreschi (Theory Comput. Syst., 2005)

lambda-Coloring matrogenic graphs. - Tiziana Calamoneri; Rossella Petreschi (Discret. Appl. Math., 2006)

Conflict-free star-access in parallel memory systems. - Sajal K. Das 001; Irene Finocchi; Rossella Petreschi (J. Parallel Distributed Comput., 2006)

On the L(h, k)-Labeling of Co-comparability Graphs. - Tiziana Calamoneri; Saverio Caminiti; Stephan Olariu; Rossella Petreschi (ESCAPE, 2007)

A Bijective Code for k -Trees with Linear Time Encoding and Decoding. - Saverio Caminiti; Emanuele G. Fusco; Rossella Petreschi (ESCAPE, 2007)

On coding labeled trees. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (Theor. Comput. Sci., 2007)

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (ESA, 2008)

A Note on Algebraic Hypercube Colorings. - Irene Finocchi; Emanuele G. Fusco; Rossella Petreschi (ITNG, 2008)

A General Approach to L ( h, k )-Label Interconnection Networks. - Tiziana Calamoneri; Saverio Caminiti; Rossella Petreschi (J. Comput. Sci. Technol., 2008)

Parallel Algorithms for Dandelion-Like Codes. - Saverio Caminiti; Rossella Petreschi (ICCS (1), 2009)

Informative Labeling Schemes for the Least Common Ancestor Problem. - Saverio Caminiti; Irene Finocchi; Rossella Petreschi (ICTCS, 2009)

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). - Alessandro Borri; Tiziana Calamoneri; Rossella Petreschi (WALCOM, 2009)

Preface. - Giuseppe F. Italiano; Rossella Petreschi (J. Discrete Algorithms, 2009)

On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. - Tiziana Calamoneri; Saverio Caminiti; Rossella Petreschi; Stephan Olariu (Networks, 2009)

Parallel Algorithms for Encoding and Decoding Blob Code. - Saverio Caminiti; Rossella Petreschi (WALCOM, 2010)

Unified parallel encoding and decoding algorithms for Dandelion-like codes. - Saverio Caminiti; Rossella Petreschi (J. Parallel Distributed Comput., 2010)

Bijective Linear Time Coding and Decoding for k-Trees. - Saverio Caminiti; Emanuele G. Fusco; Rossella Petreschi (Theory Comput. Syst., 2010)

L(2, 1)-Labeling of Unigraphs - (Extended Abstract). - Tiziana Calamoneri; Rossella Petreschi (TAPAS, 2011)

The L(2, 1)-labeling of unigraphs. - Tiziana Calamoneri; Rossella Petreschi (Discret. Appl. Math., 2011)

Recognition of Unigraphs through Superposition of Graphs. - Alessandro Borri; Tiziana Calamoneri; Rossella Petreschi (J. Graph Algorithms Appl., 2011)

On Relaxing the Constraints in Pairwise Compatibility Graphs. - Tiziana Calamoneri; Rossella Petreschi; Blerina Sinaimeri (WALCOM, 2012)

How to Design an Algorithm. - Rossella Petreschi (The Power of Algorithms, 2013)

Learning a Ring Cheaply and Fast. - Emanuele G. Fusco; Andrzej Pelc; Rossella Petreschi (ICALP (2), 2013)

Use Knowledge to Learn Faster: Topology Recognition with Advice. - Emanuele Guido Fusco; Andrzej Pelc; Rossella Petreschi (DISC, 2013)

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. - Tiziana Calamoneri; Rossella Petreschi; Blerina Sinaimeri (Discret. Math. Algorithms Appl., 2013)

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. - Tiziana Calamoneri; Rossella Petreschi (Electron. Notes Discret. Math., 2013)

Exploring pairwise compatibility graphs. - Tiziana Calamoneri; Eugenio Montefusco; Rossella Petreschi; Blerina Sinaimeri (Theor. Comput. Sci., 2013)

On Dilworth k Graphs and Their Pairwise Compatibility. - Tiziana Calamoneri; Rossella Petreschi (WALCOM, 2014)

On pairwise compatibility graphs having Dilworth number two. - Tiziana Calamoneri; Rossella Petreschi (Theor. Comput. Sci., 2014)

On pairwise compatibility graphs having Dilworth number k. - Tiziana Calamoneri; Rossella Petreschi (Theor. Comput. Sci., 2014)

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (CTW, 2015)

Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]. - Tiziana Calamoneri; Rossella Petreschi (Theor. Comput. Sci., 2015)

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (WALCOM, 2016)

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life. - Giorgio Ausiello; Rossella Petreschi (Bull. EATCS, 2016)

Topology recognition with advice. - Emanuele G. Fusco; Andrzej Pelc; Rossella Petreschi (Inf. Comput., 2016)

Guest Editors' Foreword. - Mohammad Kaykobad; Rossella Petreschi (J. Graph Algorithms Appl., 2017)

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). - Pierluigi Baiocchi; Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (IWOCA, 2018)

On dynamic threshold graphs and related classes. - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (Theor. Comput. Sci., 2018)

Preface. - Rossella Petreschi; Mohammad Kaykobad (Theor. Comput. Sci., 2018)

Some classes of graphs that are not PCGs. - Pierluigi Baiocchi; Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (Theor. Comput. Sci., 2019)