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