Rizzi, Romeo
 Distribuzione geografica
Continente #
NA - Nord America 4.402
AS - Asia 1.741
EU - Europa 983
SA - Sud America 178
Continente sconosciuto - Info sul continente non disponibili 61
AF - Africa 21
OC - Oceania 1
Totale 7.387
Nazione #
US - Stati Uniti d'America 4.317
SG - Singapore 675
CN - Cina 533
VN - Vietnam 245
RU - Federazione Russa 172
BR - Brasile 145
UA - Ucraina 142
FR - Francia 122
SE - Svezia 100
FI - Finlandia 78
DE - Germania 77
IT - Italia 74
GB - Regno Unito 69
KR - Corea 67
LV - Lettonia 64
HK - Hong Kong 49
CA - Canada 36
ID - Indonesia 32
JO - Giordania 24
BD - Bangladesh 22
IN - India 18
LT - Lituania 18
IQ - Iraq 15
BG - Bulgaria 14
MX - Messico 11
NL - Olanda 11
PL - Polonia 11
AR - Argentina 10
IL - Israele 9
EC - Ecuador 7
ES - Italia 7
PR - Porto Rico 7
ZA - Sudafrica 7
AM - Armenia 6
JM - Giamaica 6
MY - Malesia 6
PK - Pakistan 6
BE - Belgio 5
CL - Cile 5
CR - Costa Rica 5
TH - Thailandia 5
CO - Colombia 4
JP - Giappone 4
PH - Filippine 4
SA - Arabia Saudita 4
TT - Trinidad e Tobago 4
AT - Austria 3
BB - Barbados 3
CZ - Repubblica Ceca 3
HN - Honduras 3
PE - Perù 3
SC - Seychelles 3
UZ - Uzbekistan 3
AE - Emirati Arabi Uniti 2
CH - Svizzera 2
EG - Egitto 2
GH - Ghana 2
IE - Irlanda 2
KE - Kenya 2
MA - Marocco 2
NG - Nigeria 2
NI - Nicaragua 2
OM - Oman 2
PY - Paraguay 2
SI - Slovenia 2
SK - Slovacchia (Repubblica Slovacca) 2
SV - El Salvador 2
TR - Turchia 2
VE - Venezuela 2
AI - Anguilla 1
AL - Albania 1
AU - Australia 1
AZ - Azerbaigian 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
EU - Europa 1
GD - Grenada 1
GP - Guadalupe 1
GR - Grecia 1
GT - Guatemala 1
HU - Ungheria 1
IR - Iran 1
KG - Kirghizistan 1
KW - Kuwait 1
KZ - Kazakistan 1
NP - Nepal 1
PA - Panama 1
QA - Qatar 1
RS - Serbia 1
TW - Taiwan 1
Totale 7.328
Città #
Ashburn 413
Singapore 401
Fairfield 316
Jacksonville 302
Chandler 258
Dallas 234
San Jose 225
Beijing 182
Woodbridge 177
Columbus 172
Santa Clara 170
Seattle 154
Council Bluffs 127
Cambridge 123
Houston 121
Wilmington 106
Ho Chi Minh City 82
New York 80
Princeton 78
Ann Arbor 74
Hangzhou 71
Moscow 71
The Dalles 70
Seoul 65
Riga 64
Hanoi 63
Los Angeles 62
Lauterbourg 56
Phoenix 44
Hefei 42
Hong Kong 41
Buffalo 36
San Mateo 32
Jakarta 27
Bremen 23
São Paulo 23
Boardman 20
Da Nang 20
Helsinki 20
Turku 17
Des Moines 16
San Diego 15
Dearborn 14
London 14
Munich 14
Sofia 14
Vilnius 14
Redondo Beach 12
St Louis 12
Frankfurt am Main 10
North Charleston 10
Turin 10
Brooklyn 9
Denver 9
Montreal 9
Norwalk 9
Secaucus 9
Shenzhen 9
Warsaw 9
Amsterdam 8
Atlanta 8
Düsseldorf 8
Haiphong 8
Norfolk 8
North Bergen 8
San Francisco 8
Tianjin 8
Orem 7
Paris 7
Rio de Janeiro 7
Trento 7
Chicago 6
Guangzhou 6
Gyumri 6
Bangkok 5
Berlin 5
Brussels 5
Charlotte 5
Irvine 5
Jinan 5
Las Vegas 5
Milan 5
Milwaukee 5
Nanjing 5
Riverside 5
Rome 5
Shanghai 5
Zhengzhou 5
Agrolândia 4
Baghdad 4
Boston 4
Bến Tre 4
Changsha 4
Cleveland 4
Falls Church 4
Fort Worth 4
Guarulhos 4
Kingston 4
Kuala Lumpur 4
Kunming 4
Totale 5.108
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 434
Combinatorial Optimization - Polyhedra and efficiency: A book review 207
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 187
Some Simple Distributed Algorithms for Sparse Networks 175
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 175
Evaluation of BIC-based algorithms for audio segmentation 161
Allocating Servers in Infostations for Bounded Simultaneous Requests 158
Edge-coloring bipartite graphs 157
A short proof of Konig's matching theorem 155
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 152
A Simple Minimum T-Cut Algorithm 147
A note on range-restricted circuit covers 144
Shortest Paths in Conservative Graphs 143
Randomized greedy algorithms for the hypergraph partitioning problem 140
Cycle cover property and CPP=SCC property are not equivalent 140
A DP Algorithm for Speaker Change Detection 139
A greedy approach to compute a minimum cycle basis of a directed graph 138
Least and most colored bases 137
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 137
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 133
Indecomposable r-graphs and some other counterexamples 128
The Optimal Statistical Median of a Convex Set of Arrays 128
On 4-connected graphs without even cycle decompositions 125
Routing permutations in partitioned optical passive stars networks 125
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 120
Excluding a simple good pair approach to directed cuts 119
On the Recognition of $P_4$-Indifferent Graphs 118
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 114
Least and most colorable bases 113
Minimum T-cuts and optimal T-pairings 111
Channel Assignment with Separation on Trees and Interval Graphs 110
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 109
Packing Triangles in Bounded Degree Graphs 107
Some simple distributed algorithms for sparse networks 107
On the complexity of digraph packings 106
Indecomposable r-graphs and some other counterexamples 105
Packing Cycles in Undirected Graphs 102
Cycle Cover Property and CPP=SCC Property are not Equivalent 100
Allocating Servers in Infostations for Bounded Simultaneous Requests 100
Packing Cuts in Graphs 98
Edge­Coloring Bipartite Graphs 95
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 95
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 92
Konig's Edge Coloring Theorem without augmenting paths 91
A note on range-restricted circuit covers 90
Packing Triangles in Bounded Degree Graphs 90
On the Recognition of P4-Indifferent Graphs 86
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 82
On minimizing symmetric set functions 81
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 78
A Simple Minimum T-Cut Algorithm 78
On d-Threshold Graphs and d-Dimensional Bin Packing 77
Shortest Paths in Conservative Graphs 76
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 72
A short proof of König's matching theorem 71
Haplotyping Populations: Complexity and Approximations 71
Packing paths in digraphs 71
Impaccando T-tagli e T-giunti 68
Minimum T-cuts and optimal T-pairings 66
Excluding a Simple Good Pair Approach to Directed Cuts 64
Impaccando T-tagli e T-giunti 55
On minimizing symmetric set functions 53
König's Edge Coloring Theorem without augmenting paths 46
On 4-connected graphs without even cycle decompositions 34
null 1
Totale 7.387
Categoria #
all - tutte 28.222
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 502
Totale 28.724


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022244 0 0 0 0 30 22 10 41 12 48 14 67
2022/2023556 90 48 8 69 66 87 0 49 98 8 28 5
2023/2024305 13 19 55 16 15 63 9 15 12 34 13 41
2024/20251.096 8 11 45 249 72 155 5 30 93 173 130 125
2025/20262.215 99 55 370 264 201 181 436 41 214 225 91 38
2026/2027937 89 162 233 381 72 0 0 0 0 0 0 0
Totale 7.387