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

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

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

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

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

Some classes of graphs that are not PCGs. - Baiocchi, Pierluigi; Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella (CoRR, 2017)

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

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

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

WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings (Springer, 2016)

Topology recognition with advice. - Fusco, Emanuele Guido; Pelc, Andrzej; Petreschi, Rossella (CoRR, 2016)

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

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

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

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

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

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

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

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

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

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

How to Design an Algorithm. - Petreschi, Rossella (2013)

The Power of Algorithms - Inspiration and Examples in Everyday Life (Springer, 2013)

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

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

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

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

On relaxing the constraints in pairwise compatibility graphs - Calamoneri, Tiziana; Petreschi, Rossella; Sinaimeri, Blerina (CoRR, 2011)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings (Springer, 2003)

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

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

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

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

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

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

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

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

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

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

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

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

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

Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings (Springer, 2000)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings (Springer, 1994)

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

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

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

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

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

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

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

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