The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rossella Petreschi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Irene Finocchi, Rossella Petreschi
    Hierarchical Clustering of Trees: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:117-131 [Conf]
  2. Luca Baffi, Rossella Petreschi
    Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1995, pp:34-47 [Conf]
  3. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:27-36 [Conf]
  4. Rossella Petreschi, Andrea Sterbini
    Threshold Graphs and Synchronization Protocols. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:378-395 [Conf]
  5. Tiziana Calamoneri, Rossella Petreschi
    An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:31-40 [Conf]
  6. Saverio Caminiti, Rossella Petreschi
    String Coding of Trees with Locality and Heritability. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:251-262 [Conf]
  7. Irene Finocchi, Rossella Petreschi
    On the Validity of Hierarchical Decompositions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:368-374 [Conf]
  8. Tiziana Calamoneri, Rossella Petreschi
    L(2, 1)-labeling of planar graphs. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:28-33 [Conf]
  9. Sajal K. Das, Irene Finocchi, Rossella Petreschi
    Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  10. Tiziana Calamoneri, Rossella Petreschi
    On the Radiocoloring Problem. [Citation Graph (0, 0)][DBLP]
    IWDC, 2002, pp:118-127 [Conf]
  11. Tiziana Calamoneri, Rossella Petreschi
    L(2, 1)-Coloring Matrogenic Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:236-247 [Conf]
  12. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
    A Unified Approach to Coding Labeled Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:339-348 [Conf]
  13. Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi
    Graph Coloring with Distance Constraints. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:131-140 [Conf]
  14. Sergio De Agostino, Rossella Petreschi, Andrea Sterbini
    An O(n³) Recognition Algorithm for Bithreshold Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:416-425 [Journal]
  15. Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    On Line 2-Satisfiability. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  16. Raymond Greenlaw, Rossella Petreschi
    Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:4, pp:471-495 [Journal]
  17. Irene Finocchi, Rossella Petreschi
    Divider-based algorithms for hierarchical tree partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:227-247 [Journal]
  18. Raymond Greenlaw, Rossella Petreschi
    Computing Prüfer codes efficiently in parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:205-222 [Journal]
  19. Tiziana Calamoneri, Rossella Petreschi
    lambda-Coloring matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2445-2457 [Journal]
  20. Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
    Labeling trees with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1534-1539 [Journal]
  21. Sergio De Agostino, Rossella Petreschi
    Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:2, pp:123-130 [Journal]
  22. Sergio De Agostino, Rossella Petreschi
    On PVchunk Operations and Matrogenic Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:1, pp:11-20 [Journal]
  23. Tiziana Calamoneri, Rossella Petreschi
    Optimal Layout of Trivalent Cayley Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:277-288 [Journal]
  24. Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi
    Parallelism and the Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:2, pp:81-85 [Journal]
  25. Tiziana Calamoneri, Rossella Petreschi
    A New 3D Representation of Trivalent Cayley Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:5, pp:247-252 [Journal]
  26. Rossella Petreschi, Bruno Simeone
    A Switching Algorithm for the Solution of Quadratic Boolean Equations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:4/5, pp:193-198 [Journal]
  27. Rossella Petreschi, Andrea Sterbini
    Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:65- [Journal]
  28. Rossella Petreschi, Andrea Sterbini
    Recognizing Strict 2-Threshold Graphs in O(m) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:4, pp:193-198 [Journal]
  29. Tiziana Calamoneri, Rossella Petreschi
    Edge-clique graphs and the l-coloring problem. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:38-47 [Journal]
  30. Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi
    Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:2, pp:- [Journal]
  31. Gian Carlo Bongiovanni, Rossella Petreschi
    Parallel-Depth Search for Acyclic Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:7, n:2, pp:383-390 [Journal]
  32. Tiziana Calamoneri, Rossella Petreschi
    L(h, 1)-labeling subclasses of planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:3, pp:414-426 [Journal]
  33. Tiziana Calamoneri, Rossella Petreschi
    Orthogonally Drawing Cubic Graphs in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:55, n:1, pp:94-108 [Journal]
  34. Sajal K. Das, Irene Finocchi, Rossella Petreschi
    Conflict-free star-access in parallel memory systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1431-1441 [Journal]
  35. Irene Finocchi, Rossella Petreschi
    Structure-Preserving Hierarchical Decompositions. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:687-700 [Journal]
  36. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    On max cut in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2002, v:17, n:3, pp:165-183 [Journal]
  37. Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:1- [Journal]
  38. Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi
    A Simple Parallel Algorithm to Draw Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:10, pp:1009-1018 [Journal]
  39. Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
    Reversible Execution and Visualization of Programs with LEONARDO. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 2000, v:11, n:2, pp:125-150 [Journal]
  40. Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
    On the L(h, k)-Labeling of Co-comparability Graphs. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:116-127 [Conf]
  41. Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi
    A Bijective Code for k -Trees with Linear Time Encoding and Decoding. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:408-420 [Conf]
  42. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Degree sequences of matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:47-61 [Journal]
  43. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Adamant digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:3, pp:253-261 [Journal]
  44. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
    On coding labeled trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:97-108 [Journal]

  45. Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. [Citation Graph (, )][DBLP]


  46. Parallel Algorithms for Dandelion-Like Codes. [Citation Graph (, )][DBLP]


  47. A Note on Algebraic Hypercube Colorings. [Citation Graph (, )][DBLP]


  48. Parallel Algorithms for Encoding and Decoding Blob Code. [Citation Graph (, )][DBLP]


  49. Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002