Rossella Petreschi

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