Catalogo dei prodotti della ricerca

PETRESCHI, Rossella
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.770
EU - Europa 1.245
AS - Asia 843
SA - Sud America 65
AF - Africa 10
OC - Oceania 3
Continente sconosciuto - Info sul continente non disponibili 1
Totale 7.937
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.735
UA - Ucraina 388
SG - Singapore 311
IN - India 276
CN - Cina 241
SE - Svezia 211
IT - Italia 176
FI - Finlandia 171
DE - Germania 80
GB - Regno Unito 80
AR - Argentina 57
RU - Federazione Russa 35
CA - Canada 32
IE - Irlanda 28
BG - Bulgaria 21
RO - Romania 21
BE - Belgio 14
BR - Brasile 7
FR - Francia 6
ID - Indonesia 6
HK - Hong Kong 5
ZA - Sudafrica 5
NL - Olanda 4
SC - Seychelles 4
AT - Austria 3
MX - Messico 3
GR - Grecia 2
NZ - Nuova Zelanda 2
TR - Turchia 2
AU - Australia 1
BD - Bangladesh 1
BY - Bielorussia 1
CL - Cile 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
ES - Italia 1
EU - Europa 1
HR - Croazia 1
LA - Repubblica Popolare Democratica del Laos 1
MU - Mauritius 1
Totale 7.937
Salva come PNG Salva come JPEG
Città #
Fairfield 750
Chandler 535
Woodbridge 509
Seattle 419
Ashburn 344
Houston 329
Wilmington 301
Ann Arbor 283
Cambridge 238
Singapore 198
Beijing 171
Princeton 160
Plano 152
Santa Clara 146
Jacksonville 145
Boston 93
San Diego 70
Dearborn 68
Rome 59
Federal 57
Lawrence 57
Millbury 56
New York 54
Des Moines 50
Andover 47
Boardman 46
San Paolo di Civitate 45
Norwalk 34
Dublin 28
Toronto 27
Southend 25
Falls Church 23
Helsinki 23
Sofia 21
Falkenstein 20
Hefei 17
Moscow 17
San Mateo 14
Bühl 13
Mannheim 13
Brussels 12
Nanjing 12
Milan 11
Indiana 8
Buffalo 7
Auburn Hills 6
Jakarta 6
Pune 6
Bari 5
Karlsruhe 5
Kunming 5
Besançon 4
Jinan 4
London 4
Montréal 4
Yellow Springs 4
Gießen 3
Grafing 3
Los Angeles 3
Mandello Del Lario 3
Nuremberg 3
Phoenix 3
Racale 3
Redmond 3
Romola 3
Vienna 3
Anagni 2
Baotou 2
Bengaluru 2
Changsha 2
Chaoyang 2
Dallas 2
Ghent 2
Islington 2
Istanbul 2
Las Vegas 2
Mexico City 2
Muizenberg 2
Nanchang 2
Padova 2
Philadelphia 2
Pisa 2
Prescot 2
Provo 2
Redwood City 2
Reggio Emilia 2
Rodgau 2
San Francisco 2
Santo André 2
Shaoxing 2
Silverton 2
Amsterdam 1
Arnsberg 1
Atlanta 1
Auckland 1
Barga 1
Birmingham 1
Brisbane 1
Chalfont 1
Chengdu 1
Totale 5.849
Salva come PNG Salva come JPEG
Nome #
Algorithms and Complexity 122
A Simple Parallel Algorithm to Draw Cubic Graphs 115
A bijective code for k-trees with linear time encoding and decoding 110
On dynamic threshold graphs and related classes 101
Algorithms and Complexity 99
A general approach to L(h,k)-label interconnection networks 97
On PVchunk operations and matrogenic graphs 96
(n,e)-graphs with maximum sum of squares of degrees 95
Algorithms and Complexity 94
Experimental comparison of 2-satisfiability algorithms 91
Algorithms and Complexity 91
At most single-bend embeddings of cubic graphs 89
On relaxing the constraints in pairwise compatibility graphs 88
Edge-Clique Graphs and the lambda-Coloring Problem 86
A Note on Algebraic Hypercube Colorings 86
(n,e)-graphs with maximum sum of squares of degrees 86
Computing Prüfer codes efficiently in parallel 85
On PVchunk operations and matrogenic graphs 82
The L(2,1)-labeling of unigraphs 81
A switching algorithm for the solution of quadratic boolean equations 81
A general Approach to L(h,k)- Label Interconnection Networks 80
Parallel Algorithms for Dandelion-Like Codes 79
A unified approach to coding labeled trees 79
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs 78
Graphs that are not pairwise compatible: A new proof technique (extended abstract) 77
Learning a ring cheaply and fast 75
On the L(h,k)-Labeling Co-Comparability Graphs and Circular-Arc Graphs 74
Topology recognition with advice 74
On line 2- satisfiability 73
Threshold Graphs and Synchronization Protocols 73
On the validity of hierarchical decompositions 72
Adamant digraphs 71
On the L(h, k)-labeling of co-comparability graphs 71
A parallel on-line algorithm for deriving all logical conclusions implied by a set of binary relations 70
Tree Partitioning via Vertex Deletion 70
Reversible execution and visualization of programs with LEONARDO 70
String Coding of Trees with Locality and Heritability 69
Recognition of Unigraphs through Superposition of Graphs 69
On pairwise compatibility graphs having Dilworth number k 68
An efficient orthogonal grid drawing algorithm for cubic graphs 67
Orthogonally drawing cubic graphs in parallel 66
Exploring pairwise compatibility graphs 66
STAR-COLORING OF GRAPHS FOR CONFLICT-FREE ACCESS IN PARALLEL MEMORY SYSTEMS 66
L(2,1)-Coloring Matrogenic Graphs (Extended Abstract) 64
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs 64
Threshold graphs and synchronization protocols 64
Some classes of graphs that are not PCGs 64
Labeling trees with a condition at distance two 63
Optimal layout of trivalent Cayley interconnection networks 63
The Power of Algorithms: Inspiration and Examples in Everyday Life 63
A parallel algorithm for orthogonal grid drawings of cubic graphs 62
Recognition of unigraphs through superposition of graphs 62
Unified parallel encoding and decoding algorithms for Dandelion-like codes 62
On the Pairwise Compatibility Property of Some Superclasses of Threshold Graphs 61
Graph Coloring with Distance Constraints 61
Cubic graphs 59
On Matrogenic Graphs and PV-chunk Operations 58
Experimental comparison of graph drawing algorithms for cubic graphs 58
Walcom:algorithms and computation 58
On max-cut in cubic graphs 58
Bijective Linear Time Coding and Decoding for k-Trees 58
Labeling trees with a condition at distance two 58
On Dilworth k Graphs and Their Pairwise Compatibility 57
Parallel maximal matching on minimal vertex series parallel digraphs 57
Theoretical results on at most 1-bend embeddability of graphs 57
A new 3-D representation of trivalent Cayley interconnection networks 56
Conflict-free star-access in parallel memory systems 56
LEONARDO: a software visualization system 55
An O(n3) recognition algorithm for bithreshold graphs 55
On pairwise compatibility graphs having Dilworth number two 55
Parallelism and the Feedback Vertex Set Problem 55
Computing Prüfer Codes Efficiently in Parallel 54
Parallel Algorithms for Encoding and Decoding Blob Code 54
An on line parallel algorithm for path retrieval dags 54
Use knowledge to learn faster: Topology recognition with advice 53
Divider-based algorithms for hierarchical tree partitioning 53
L'informatica invisibile. Come gli algoritmi regolano la nostra vita...e tutto il resto 52
Degree sequences of matrogenic graphs 52
Recognizing Strict 2-Threshold Graphs in O(m) Time 52
Algorithmic aspects of bijective tree encoding: a survey 52
On computing Prüfer Codes and their corresponding trees optimally 51
L(h, 1)-labeling subclasses of planar graphs 51
Hierarchical Clustering of trees: Algorithms and Experiments 51
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings 50
Some classes of graphs that are not pairwise compatibility graphs (communication) 50
lambda-Labeling of Regular Tiling 49
On node searching and starlike graphs 48
Lambda - Labeling of Regular Tiling 47
The L(2, 1)-Labeling of Planar Graphs 45
null 45
Un algoritmo per la allocazione automatica dei quadrati 44
Pairwise Compatibility Graphs (Invited Talk) 44
Engineering Tree Labeling Schemes: a Case Study on Least Common Ancestor 44
Proceeding of the 4° Italian conference on Algorithms and complexity 43
L(2,1)-Labeling of Unigraphs (Extended Abstract) 43
An O(n3) on line algorithm for 2-satisfiability 42
Taglio massimo su grafi cubici 42
5th italian conference on Algorithms and Complexity 42
On PVchunk Operations and Matrogenic Graphs 42
Structure-preserving hierarchical decompositions 42
Totale 6.586
Salva come PNG Salva come JPEG
Categoria #
all - tutte 23.620
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 1.494
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 25.114
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.016 0 0 0 0 0 0 195 200 167 323 94 37
2020/2021706 75 88 17 50 11 52 16 184 65 99 41 8
2021/20221.522 10 98 123 54 198 35 31 134 117 132 259 331
2022/20231.382 291 207 44 195 206 157 12 94 117 15 39 5
2023/2024513 30 94 13 49 24 79 12 5 0 77 69 61
2024/2025461 96 28 73 43 133 88 0 0 0 0 0 0
Totale 8.002