Follow
Rossella Petreschi
Rossella Petreschi
Verified email at di.uniroma1.it
Title
Cited by
Cited by
Year
Reversible execution and visualization of programs with LEONARDO
P Crescenzi, C Demetrescu, I Finocchi, R Petreschi
Journal of Visual Languages & Computing 11 (2), 125-150, 2000
912000
L (h, 1)-labeling subclasses of planar graphs
T Calamoneri, R Petreschi
Journal of Parallel and Distributed Computing 64 (3), 414-426, 2004
802004
Cubic graphs
R Greenlaw, R Petreschi
ACM Computing Surveys (CSUR) 27 (4), 471-495, 1995
581995
Labeling trees with a condition at distance two
T Calamoneri, A Pelc, R Petreschi
Discrete Mathematics 306 (14), 1534-1539, 2006
422006
On coding labeled trees
S Caminiti, I Finocchi, R Petreschi
Theoretical computer science 382 (2), 97-108, 2007
322007
Exploring pairwise compatibility graphs
T Calamoneri, E Montefusco, R Petreschi, B Sinaimeri
Theoretical Computer Science 468, 23-36, 2013
312013
Conflict-free star-access in parallel memory systems
SK Das, I Finocchi, R Petreschi
Journal of Parallel and Distributed Computing 66 (11), 1431-1441, 2006
312006
A unified approach to coding labeled trees
S Caminiti, I Finocchi, R Petreschi
Latin American Symposium on Theoretical Informatics, 339-348, 2004
302004
L(2,1)-labeling of planar graphs
T Calamoneri, R Petreschi
Proceedings of the 5th international workshop on Discrete algorithms andá…, 2001
302001
Theoretical results on at most 1-bend embeddability of graphs
刘彦佩
应用数学学报: 英文版, 188-192, 1992
301992
(n, e)‐Graphs with maximum sum of squares of degrees
UN Peled, R Petreschi, A Sterbini
Journal of Graph Theory 31 (4), 283-295, 1999
271999
LEONARDO: a software visualization system.
P Crescenzi, C Demetrescu, I Finocchi, R Petreschi
WAE, 146-155, 1997
271997
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
T Calamoneri, S Caminiti, R Petreschi, S Olariu
Networks: An International Journal 53 (1), 27-34, 2009
262009
Degree sequences of matrogenic graphs
P Marchioro, A Morgana, R Petreschi, B Simeone
Discrete mathematics 51 (1), 47-61, 1984
241984
On relaxing the constraints in pairwise compatibility graphs
T Calamoneri, R Petreschi, B Sinaimeri
International Workshop on Algorithms and Computation, 124-135, 2012
222012
An efficient orthogonal grid drawing algorithm for cubic graphs
T Calamoneri, R Petreschi
International Computing and Combinatorics Conference, 31-40, 1995
221995
String coding of trees with locality and heritability
S Caminiti, R Petreschi
International Computing and Combinatorics Conference, 251-262, 2005
212005
At most single-bend embeddings of cubic graphs
L Yanpei, P Marchioro, R Petreschi
Applied Mathematics 9 (2), 127-142, 1994
181994
A switching algorithm for the solution of quadratic boolean equations
R Petreschi, B Simeone
Information Processing Letters 11 (4-5), 193-198, 1980
171980
Recognition of unigraphs through superposition of graphs
A Borri, T Calamoneri, R Petreschi
International Workshop on Algorithms and Computation, 165-176, 2009
162009
The system can't perform the operation now. Try again later.
Articles 1–20