Rossella Petreschi

According to our database1, Rossella Petreschi authored at least 82 papers between 1980 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Some classes of graphs that are not PCGs.
Theor. Comput. Sci., 2019

2018
Preface.
Theor. Comput. Sci., 2018

On dynamic threshold graphs and related classes.
Theor. Comput. Sci., 2018

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2017

2016
Topology recognition with advice.
Inf. Comput., 2016

Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life.
Bulletin of the EATCS, 2016

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

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

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
On pairwise compatibility graphs having Dilworth number k.
Theor. Comput. Sci., 2014

On pairwise compatibility graphs having Dilworth number two.
Theor. Comput. Sci., 2014

On Dilworth k Graphs and Their Pairwise Compatibility.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013
Exploring pairwise compatibility graphs.
Theor. Comput. Sci., 2013

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs.
Electron. Notes Discret. Math., 2013

On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs.
Discrete Math., Alg. and Appl., 2013

Use Knowledge to Learn Faster: Topology Recognition with Advice.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Learning a Ring Cheaply and Fast.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

How to Design an Algorithm.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
On Relaxing the Constraints in Pairwise Compatibility Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011
Recognition of Unigraphs through Superposition of Graphs.
J. Graph Algorithms Appl., 2011

The L(2, 1)-labeling of unigraphs.
Discret. Appl. Math., 2011

L(2, 1)-Labeling of Unigraphs - (Extended Abstract).
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010
Bijective Linear Time Coding and Decoding for k-Trees.
Theory Comput. Syst., 2010

Unified parallel encoding and decoding algorithms for Dandelion-like codes.
J. Parallel Distributed Comput., 2010

Parallel Algorithms for Encoding and Decoding Blob Code.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009
On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs.
Networks, 2009

Preface.
J. Discrete Algorithms, 2009

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Informative Labeling Schemes for the Least Common Ancestor Problem.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Parallel Algorithms for Dandelion-Like Codes.
Proceedings of the Computational Science, 2009

2008
A General Approach to L ( h, k )-Label Interconnection Networks.
J. Comput. Sci. Technol., 2008

A Note on Algebraic Hypercube Colorings.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.
Proceedings of the Algorithms, 2008

2007
On coding labeled trees.
Theor. Comput. Sci., 2007

A Bijective Code for k -Trees with Linear Time Encoding and Decoding.
Proceedings of the Combinatorics, 2007

On the L(h, k)-Labeling of Co-comparability Graphs.
Proceedings of the Combinatorics, 2007

2006
Conflict-free star-access in parallel memory systems.
J. Parallel Distributed Comput., 2006

lambda-Coloring matrogenic graphs.
Discret. Appl. Math., 2006

2005
Structure-Preserving Hierarchical Decompositions.
Theory Comput. Syst., 2005

A general approach to L(h, k)-label interconnection networks.
Electron. Notes Discret. Math., 2005

Graph Coloring with Distance Constraints.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

String Coding of Trees with Locality and Heritability.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
L(h, 1)-labeling subclasses of planar graphs.
J. Parallel Distributed Comput., 2004

Divider-based algorithms for hierarchical tree partitioning.
Discret. Appl. Math., 2004

A Unified Approach to Coding Labeled Trees.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Labeling trees with a condition at distance two.
Electron. Notes Discret. Math., 2003

2002
Foreword.
Theor. Comput. Sci., 2002

On max cut in cubic graphs.
Parallel Algorithms Appl., 2002

L(2, 1)-Coloring Matrogenic Graphs.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Radiocoloring Problem.
Proceedings of the Distributed Computing, 2002

2001
Edge-clique graphs and the l-coloring problem.
J. Braz. Comp. Soc., 2001

Tree partitioning via vertex deletion.
Electron. Notes Discret. Math., 2001

LD-Coloring of Regular Tiling (Extended Abstract).
Electron. Notes Discret. Math., 2001

L(2, 1)-labeling of planar graphs.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

On the Validity of Hierarchical Decompositions.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Hierarchical Clustering of Trees: Algorithms and Experiments.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput., 2000

A Simple Parallel Algorithm to Draw Cubic Graphs.
IEEE Trans. Parallel Distrib. Syst., 2000

Computing Prüfer codes efficiently in parallel.
Discret. Appl. Math., 2000

1999
(n, e)-Graphs with maximum sum of squares of degrees.
Journal of Graph Theory, 1999

Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs.
J. Graph Algorithms Appl., 1999

Optimal Layout of Trivalent Cayley Interconnection Networks.
Int. J. Found. Comput. Sci., 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
Proceedings of the Advances in Computing Science, 1999

1998
Orthogonally Drawing Cubic Graphs in Parallel.
J. Parallel Distributed Comput., 1998

1997
A New 3D Representation of Trivalent Cayley Networks.
Inf. Process. Lett., 1997

An O(n³) Recognition Algorithm for Bithreshold Graphs.
Algorithmica, 1997

1995
Recognizing Strict 2-Threshold Graphs in O(m) Time.
Inf. Process. Lett., 1995

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

Cubic Graphs.
ACM Comput. Surv., 1995

An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Threshold Graphs and Synchronization Protocols.
Proceedings of the Combinatorics and Computer Science, 1995

Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs.
Proceedings of the Algorithms, 1995

1992
On PVchunk Operations and Matrogenic Graphs.
Int. J. Found. Comput. Sci., 1992

1990
Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods.
Int. J. Found. Comput. Sci., 1990

On Line 2-Satisfiability.
Ann. Math. Artif. Intell., 1990

1989
Parallel-Depth Search for Acyclic Digraphs.
J. Parallel Distributed Comput., 1989

1988
Parallelism and the Feedback Vertex Set Problem.
Inf. Process. Lett., 1988

Adamant digraphs.
Discret. Math., 1988

1984
Degree sequences of matrogenic graphs.
Discret. Math., 1984

1980
A Switching Algorithm for the Solution of Quadratic Boolean Equations.
Inf. Process. Lett., 1980


  Loading...