Rossella Petreschi

Publication Activity (10 Years)

Years Active: 1980-2019
Publications (10 Years): 12

Top Topics

Image Recognition

Extended Abstract

Top Venues

Theor. Comput. Sci.

Publications

Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791 (2019)
Rossella Petreschi, Mohammad Kaykobad
Preface. Theor. Comput. Sci. 718 (2018)
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). IWOCA (2018)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
On dynamic threshold graphs and related classes. Theor. Comput. Sci. 718 (2018)
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Some classes of graphs that are not PCGs. CoRR (2017)
Mohammad Kaykobad, Rossella Petreschi
Guest Editors' Foreword. J. Graph Algorithms Appl. 21 (3) (2017)
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
Topology recognition with advice. Inf. Comput. 247 (2016)
Giorgio Ausiello, Rossella Petreschi
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life. Bull. EATCS 118 (2016)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM (2016)
Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
Topology recognition with advice. CoRR (2016)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW (2015)
Tiziana Calamoneri, Rossella Petreschi
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]. Theor. Comput. Sci. 602 (2015)
Tiziana Calamoneri, Rossella Petreschi
On Dilworth k Graphs and Their Pairwise Compatibility. WALCOM (2014)
Tiziana Calamoneri, Rossella Petreschi
On pairwise compatibility graphs having Dilworth number two. Theor. Comput. Sci. 524 (2014)
Tiziana Calamoneri, Rossella Petreschi
On pairwise compatibility graphs having Dilworth number k. Theor. Comput. Sci. 547 (2014)
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
Learning a Ring Cheaply and Fast. ICALP (2) (2013)
Tiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri
Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468 (2013)
Tiziana Calamoneri, Rossella Petreschi
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. Electron. Notes Discret. Math. 44 (2013)
Emanuele Guido Fusco, Andrzej Pelc, Rossella Petreschi
Use Knowledge to Learn Faster: Topology Recognition with Advice. DISC (2013)
Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. Discret. Math. Algorithms Appl. 5 (2) (2013)
Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM (2012)
Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
On relaxing the constraints in pairwise compatibility graphs CoRR (2011)
Tiziana Calamoneri, Rossella Petreschi
The L(2, 1)-labeling of unigraphs. Discret. Appl. Math. 159 (12) (2011)
Tiziana Calamoneri, Rossella Petreschi
(2, 1)-Labeling of Unigraphs - (Extended Abstract). TAPAS (2011)
Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi
Recognition of Unigraphs through Superposition of Graphs. J. Graph Algorithms Appl. 15 (3) (2011)
Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi
-Trees. Theory Comput. Syst. 46 (2) (2010)
Saverio Caminiti, Rossella Petreschi
Parallel Algorithms for Encoding and Decoding Blob Code. WALCOM (2010)
Saverio Caminiti, Rossella Petreschi
Unified parallel encoding and decoding algorithms for Dandelion-like codes. J. Parallel Distributed Comput. 70 (11) (2010)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS (2009)
Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu
)-labeling of co-comparability graphs and circular-arc graphs. Networks 53 (1) (2009)
Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM (2009)
Saverio Caminiti, Rossella Petreschi
Parallel Algorithms for Dandelion-Like Codes. ICCS (1) (2009)
Giuseppe F. Italiano, Rossella Petreschi
Preface. J. Discrete Algorithms 7 (3) (2009)
Irene Finocchi, Emanuele G. Fusco, Rossella Petreschi
A Note on Algebraic Hypercube Colorings. ITNG (2008)
Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi
)-Label Interconnection Networks. J. Comput. Sci. Technol. 23 (4) (2008)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA (2008)
Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE (2007)
Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi
-Trees with Linear Time Encoding and Decoding. ESCAPE (2007)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
On coding labeled trees. Theor. Comput. Sci. 382 (2) (2007)
Sajal K. Das, Irene Finocchi, Rossella Petreschi
Conflict-free star-access in parallel memory systems. J. Parallel Distributed Comput. 66 (11) (2006)
Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
Labeling trees with a condition at distance two. Discret. Math. 306 (14) (2006)
Tiziana Calamoneri, Rossella Petreschi
lambda-Coloring matrogenic graphs. Discret. Appl. Math. 154 (17) (2006)
Irene Finocchi, Rossella Petreschi
Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38 (6) (2005)
Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi
A general approach to L(h, k)-label interconnection networks. Electron. Notes Discret. Math. 19 (2005)
Saverio Caminiti, Rossella Petreschi
String Coding of Trees with Locality and Heritability. COCOON (2005)
Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi
Graph Coloring with Distance Constraints. PDPTA (2005)
Tiziana Calamoneri, Rossella Petreschi
L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distributed Comput. 64 (3) (2004)
Sajal K. Das, Irene Finocchi, Rossella Petreschi
Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. IPDPS (2004)
Irene Finocchi, Rossella Petreschi
Divider-based algorithms for hierarchical tree partitioning. Discret. Appl. Math. 136 (2-3) (2004)
Saverio Caminiti, Irene Finocchi, Rossella Petreschi
A Unified Approach to Coding Labeled Trees. LATIN (2004)
Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc
Labeling trees with a condition at distance two. Electron. Notes Discret. Math. 15 (2003)
Tiziana Calamoneri, Rossella Petreschi
On the Radiocoloring Problem. IWDC (2002)
Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi
Foreword. Theor. Comput. Sci. 285 (1) (2002)
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
On max cut in cubic graphs. Parallel Algorithms Appl. 17 (3) (2002)
Tiziana Calamoneri, Rossella Petreschi
L(2, 1)-Coloring Matrogenic Graphs. LATIN (2002)
Irene Finocchi, Rossella Petreschi
On the Validity of Hierarchical Decompositions. COCOON (2001)
Tiziana Calamoneri, Rossella Petreschi
LD-Coloring of Regular Tiling (Extended Abstract). Electron. Notes Discret. Math. 8 (2001)
Irene Finocchi, Rossella Petreschi
Hierarchical Clustering of Trees: Algorithms and Experiments. ALENEX (2001)
Tiziana Calamoneri, Rossella Petreschi
L(2, 1)-labeling of planar graphs. DIAL-M (2001)
Irene Finocchi, Rossella Petreschi
Tree partitioning via vertex deletion. Electron. Notes Discret. Math. 8 (2001)
Tiziana Calamoneri, Rossella Petreschi
Edge-clique graphs and the l-coloring problem. J. Braz. Comput. Soc. 7 (3) (2001)
Raymond Greenlaw, Rossella Petreschi
Computing Prüfer codes efficiently in parallel. Discret. Appl. Math. 102 (3) (2000)
Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi
A Simple Parallel Algorithm to Draw Cubic Graphs. IEEE Trans. Parallel Distributed Syst. 11 (10) (2000)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11 (2) (2000)
Uri N. Peled, Rossella Petreschi, Andrea Sterbini
(n, e)-Graphs with maximum sum of squares of degrees. J. Graph Theory 31 (4) (1999)
Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3 (2) (1999)
Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN (1999)
Tiziana Calamoneri, Rossella Petreschi
Optimal Layout of Trivalent Cayley Interconnection Networks. Int. J. Found. Comput. Sci. 10 (3) (1999)
Tiziana Calamoneri, Rossella Petreschi
Orthogonally Drawing Cubic Graphs in Parallel. J. Parallel Distributed Comput. 55 (1) (1998)
Sergio De Agostino, Rossella Petreschi, Andrea Sterbini
An O(n³) Recognition Algorithm for Bithreshold Graphs. Algorithmica 17 (4) (1997)
Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
LEONARDO: a software visualization system. WAE (1997)
Tiziana Calamoneri, Rossella Petreschi
A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61 (5) (1997)
Rossella Petreschi, Andrea Sterbini
Recognizing Strict 2-Threshold Graphs in O(m) Time. Inf. Process. Lett. 54 (4) (1995)
Raymond Greenlaw, Rossella Petreschi
Cubic Graphs. ACM Comput. Surv. 27 (4) (1995)
Rossella Petreschi, Andrea Sterbini
Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. Inf. Process. Lett. 56 (1) (1995)
Tiziana Calamoneri, Rossella Petreschi
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON (1995)
Luca Baffi, Rossella Petreschi
Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs. ASIAN (1995)
Rossella Petreschi, Andrea Sterbini
Threshold Graphs and Synchronization Protocols. Combinatorics and Computer Science (1995)
Sergio De Agostino, Rossella Petreschi
Operations and Matrogenic Graphs. Int. J. Found. Comput. Sci. 3 (1) (1992)
Sergio De Agostino, Rossella Petreschi
Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. Int. J. Found. Comput. Sci. 1 (2) (1990)
Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
On Line 2-Satisfiability. Ann. Math. Artif. Intell. 1 (1990)
Gian Carlo Bongiovanni, Rossella Petreschi
Parallel-Depth Search for Acyclic Digraphs. J. Parallel Distributed Comput. 7 (2) (1989)
Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi
Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28 (2) (1988)
P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
Adamant digraphs. Discret. Math. 69 (3) (1988)
P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
Degree sequences of matrogenic graphs. Discret. Math. 51 (1) (1984)
Rossella Petreschi, Bruno Simeone
A Switching Algorithm for the Solution of Quadratic Boolean Equations. Inf. Process. Lett. 11 (4/5) (1980)