Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rossella Petreschi
2010 – today
- 2013
[j42]Tiziana Calamoneri, E. Montefusco, Rossella Petreschi, Blerina Sinaimeri: Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468: 23-36 (2013)- 2012
- [c23]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri: On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM 2012: 124-135
- 2011
- [j41]Tiziana Calamoneri, Rossella Petreschi: The L(2, 1)-labeling of unigraphs. Discrete Applied Mathematics 159(12): 1196-1206 (2011)
- [j40]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi: Recognition of Unigraphs through Superposition of Graphs. J. Graph Algorithms Appl. 15(3): 323-343 (2011)
- [c22]Tiziana Calamoneri, Rossella Petreschi: L(2, 1)-Labeling of Unigraphs - (Extended Abstract). TAPAS 2011: 57-68
- [i1]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri: On relaxing the constraints in pairwise compatibility graphs. CoRR abs/1105.2171 (2011)
- 2010
- [j39]Saverio Caminiti, Rossella Petreschi: Unified parallel encoding and decoding algorithms for Dandelion-like codes. J. Parallel Distrib. Comput. 70(11): 1119-1127 (2010)
- [j38]Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi: Bijective Linear Time Coding and Decoding for k-Trees. Theory Comput. Syst. 46(2): 284-300 (2010)
- [c21]Saverio Caminiti, Rossella Petreschi: Parallel Algorithms for Encoding and Decoding Blob Code. WALCOM 2010: 167-178
2000 – 2009
- 2009
- [j37]
- [j36]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu: On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks 53(1): 27-34 (2009)
- [c20]Saverio Caminiti, Rossella Petreschi: Parallel Algorithms for Dandelion-Like Codes. ICCS (1) 2009: 611-620
- [c19]Saverio Caminiti, Irene Finocchi, Rossella Petreschi: Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS 2009: 66-70
- [c18]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi: Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM 2009: 165-176
- 2008
- [j35]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi: A General Approach to L ( h, k )-Label Interconnection Networks. J. Comput. Sci. Technol. 23(4): 652-659 (2008)
- [c17]Saverio Caminiti, Irene Finocchi, Rossella Petreschi: Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA 2008: 234-245
- [c16]Irene Finocchi, Emanuele G. Fusco, Rossella Petreschi: A Note on Algebraic Hypercube Colorings. ITNG 2008: 869-874
- 2007
- [j34]Saverio Caminiti, Irene Finocchi, Rossella Petreschi: On coding labeled trees. Theor. Comput. Sci. 382(2): 97-108 (2007)
- [c15]Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi: On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127
- [c14]Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi: A Bijective Code for k -Trees with Linear Time Encoding and Decoding. ESCAPE 2007: 408-420
- 2006
- [j33]Tiziana Calamoneri, Rossella Petreschi: lambda-Coloring matrogenic graphs. Discrete Applied Mathematics 154(17): 2445-2457 (2006)
- [j32]Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi: Labeling trees with a condition at distance two. Discrete Mathematics 306(14): 1534-1539 (2006)
- [j31]Sajal K. Das, Irene Finocchi, Rossella Petreschi: Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput. 66(11): 1431-1441 (2006)
- 2005
- [j30]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi: A general approach to L(h, k)-label interconnection networks. Electronic Notes in Discrete Mathematics 19: 211-217 (2005)
- [j29]Irene Finocchi, Rossella Petreschi: Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38(6): 687-700 (2005)
- [c13]Saverio Caminiti, Rossella Petreschi: String Coding of Trees with Locality and Heritability. COCOON 2005: 251-262
- [c12]Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi: Graph Coloring with Distance Constraints. PDPTA 2005: 131-140
- 2004
- [j28]Irene Finocchi, Rossella Petreschi: Divider-based algorithms for hierarchical tree partitioning. Discrete Applied Mathematics 136(2-3): 227-247 (2004)
- [j27]Tiziana Calamoneri, Rossella Petreschi: L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comput. 64(3): 414-426 (2004)
- [c11]Sajal K. Das, Irene Finocchi, Rossella Petreschi: Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. IPDPS 2004
- [c10]Saverio Caminiti, Irene Finocchi, Rossella Petreschi: A Unified Approach to Coding Labeled Trees. LATIN 2004: 339-348
- 2003
- [j26]Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc: Labeling trees with a condition at distance two. Electronic Notes in Discrete Mathematics 15: 55-58 (2003)
- [e3]Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (Eds.): Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings. Lecture Notes in Computer Science 2653, Springer 2003, ISBN 3-540-40176-8
- 2002
- [j25]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002)
- [j24]Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi: Foreword. Theor. Comput. Sci. 285(1): 1 (2002)
- [c9]
- [c8]
- 2001
- [j23]Tiziana Calamoneri, Rossella Petreschi: LD-Coloring of Regular Tiling (Extended Abstract). Electronic Notes in Discrete Mathematics 8: 18-21 (2001)
- [j22]Irene Finocchi, Rossella Petreschi: Tree partitioning via vertex deletion. Electronic Notes in Discrete Mathematics 8: 38-41 (2001)
- [j21]Tiziana Calamoneri, Rossella Petreschi: Edge-clique graphs and the l-coloring problem. J. Braz. Comp. Soc. 7(3): 38-47 (2001)
- [c7]Irene Finocchi, Rossella Petreschi: Hierarchical Clustering of Trees: Algorithms and Experiments. ALENEX 2001: 117-131
- [c6]Irene Finocchi, Rossella Petreschi: On the Validity of Hierarchical Decompositions. COCOON 2001: 368-374
- [c5]
- 2000
- [j20]Raymond Greenlaw, Rossella Petreschi: Computing Prüfer codes efficiently in parallel. Discrete Applied Mathematics 102(3): 205-222 (2000)
- [j19]Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi: A Simple Parallel Algorithm to Draw Cubic Graphs. IEEE Trans. Parallel Distrib. Syst. 11(10): 1009-1018 (2000)
- [j18]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi: Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000)
- [e2]Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (Eds.): Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings. Lecture Notes in Computer Science 1767, Springer 2000, ISBN 3-540-67159-5
1990 – 1999
- 1999
- [j17]Tiziana Calamoneri, Rossella Petreschi: Optimal Layout of Trivalent Cayley Interconnection Networks. Int. J. Found. Comput. Sci. 10(3): 277-288 (1999)
- [j16]Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi: Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3(2) (1999)
- [j15]Uri N. Peled, Rossella Petreschi, Andrea Sterbini: (n, e)-Graphs with maximum sum of squares of degrees. Journal of Graph Theory 31(4): 283-295 (1999)
- [c4]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36
- 1998
- [j14]Tiziana Calamoneri, Rossella Petreschi: Orthogonally Drawing Cubic Graphs in Parallel. J. Parallel Distrib. Comput. 55(1): 94-108 (1998)
- 1997
- [j13]Sergio De Agostino, Rossella Petreschi, Andrea Sterbini: An O(n³) Recognition Algorithm for Bithreshold Graphs. Algorithmica 17(4): 416-425 (1997)
- [j12]Tiziana Calamoneri, Rossella Petreschi: A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61(5): 247-252 (1997)
- 1995
- [j11]
- [j10]Rossella Petreschi, Andrea Sterbini: Recognizing Strict 2-Threshold Graphs in O(m) Time. Inf. Process. Lett. 54(4): 193-198 (1995)
- [j9]Rossella Petreschi, Andrea Sterbini: Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. Inf. Process. Lett. 56(1): 65 (1995)
- [c3]Luca Baffi, Rossella Petreschi: Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs. ASIAN 1995: 34-47
- [c2]Rossella Petreschi, Andrea Sterbini: Threshold Graphs and Synchronization Protocols. Combinatorics and Computer Science 1995: 378-395
- [c1]Tiziana Calamoneri, Rossella Petreschi: An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON 1995: 31-40
- 1994
- [e1]Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi (Eds.): Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings. Lecture Notes in Computer Science 778, Springer 1994, ISBN 3-540-57811-0
- 1992
- [j8]Sergio De Agostino, Rossella Petreschi: On PVchunk Operations and Matrogenic Graphs. Int. J. Found. Comput. Sci. 3(1): 11-20 (1992)
- 1990
- [j7]Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone: On Line 2-Satisfiability. Ann. Math. Artif. Intell. 1: 155-165 (1990)
- [j6]Sergio De Agostino, Rossella Petreschi: Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. Int. J. Found. Comput. Sci. 1(2): 123-130 (1990)
1980 – 1989
- 1989
- [j5]Gian Carlo Bongiovanni, Rossella Petreschi: Parallel-Depth Search for Acyclic Digraphs. J. Parallel Distrib. Comput. 7(2): 383-390 (1989)
- 1988
- [j4]P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone: Adamant digraphs. Discrete Mathematics 69(3): 253-261 (1988)
- [j3]Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi: Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28(2): 81-85 (1988)
- 1984
- [j2]P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone: Degree sequences of matrogenic graphs. Discrete Mathematics 51(1): 47-61 (1984)
- 1980
- [j1]Rossella Petreschi, Bruno Simeone: A Switching Algorithm for the Solution of Quadratic Boolean Equations. Inf. Process. Lett. 11(4/5): 193-198 (1980)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-28 20:44 CEST by the dblp team