IRIS
Rizzi, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.430
AS - Asia 1.702
EU - Europa 909
SA - Sud America 162
AF - Africa 17
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 6.222
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.401
SG - Singapore 663
CN - Cina 530
VN - Vietnam 243
RU - Federazione Russa 164
UA - Ucraina 142
BR - Brasile 134
FR - Francia 121
SE - Svezia 99
FI - Finlandia 78
DE - Germania 74
KR - Corea 67
LV - Lettonia 64
GB - Regno Unito 58
HK - Hong Kong 43
IT - Italia 41
ID - Indonesia 31
JO - Giordania 24
IN - India 18
IQ - Iraq 15
BD - Bangladesh 14
BG - Bulgaria 14
CA - Canada 13
PL - Polonia 11
AR - Argentina 10
NL - Olanda 10
MX - Messico 8
ZA - Sudafrica 7
AM - Armenia 6
MY - Malesia 6
PK - Pakistan 6
BE - Belgio 5
CL - Cile 5
EC - Ecuador 5
ES - Italia 5
TH - Thailandia 5
JM - Giamaica 4
JP - Giappone 4
LT - Lituania 4
PH - Filippine 4
SA - Arabia Saudita 4
AT - Austria 3
CZ - Repubblica Ceca 3
IL - Israele 3
PE - Perù 3
UZ - Uzbekistan 3
AE - Emirati Arabi Uniti 2
CH - Svizzera 2
EG - Egitto 2
IE - Irlanda 2
MA - Marocco 2
NG - Nigeria 2
OM - Oman 2
PY - Paraguay 2
SI - Slovenia 2
SK - Slovacchia (Repubblica Slovacca) 2
TR - Turchia 2
VE - Venezuela 2
AL - Albania 1
AU - Australia 1
AZ - Azerbaigian 1
CO - Colombia 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
EU - Europa 1
GH - Ghana 1
GR - Grecia 1
HN - Honduras 1
HU - Ungheria 1
IR - Iran 1
KE - Kenya 1
KG - Kirghizistan 1
KW - Kuwait 1
KZ - Kazakistan 1
NP - Nepal 1
PA - Panama 1
QA - Qatar 1
RS - Serbia 1
SC - Seychelles 1
TT - Trinidad e Tobago 1
Totale 6.222
Salva come PNG Salva come JPEG
Città #
Singapore 392
Fairfield 316
Jacksonville 302
Ashburn 296
Chandler 258
Dallas 230
Beijing 182
Woodbridge 177
Seattle 153
Santa Clara 145
San Jose 141
Cambridge 123
Houston 119
Columbus 118
Wilmington 105
Ho Chi Minh City 82
Princeton 78
Ann Arbor 74
New York 72
Hangzhou 71
Moscow 71
Seoul 65
Riga 64
The Dalles 63
Hanoi 61
Lauterbourg 56
Los Angeles 47
Hefei 42
Hong Kong 35
Buffalo 33
San Mateo 32
Jakarta 27
Bremen 23
São Paulo 22
Da Nang 20
Helsinki 20
Turku 17
Des Moines 15
Boardman 14
Dearborn 14
Munich 14
San Diego 14
Sofia 14
Council Bluffs 12
London 12
Redondo Beach 12
St Louis 11
Frankfurt am Main 10
Turin 10
Shenzhen 9
Warsaw 9
Amsterdam 8
Düsseldorf 8
Haiphong 8
North Charleston 8
Norwalk 8
Phoenix 8
Tianjin 8
Denver 7
Orem 7
Paris 7
Guangzhou 6
Gyumri 6
Bangkok 5
Brooklyn 5
Brussels 5
Jinan 5
Montreal 5
Nanjing 5
Shanghai 5
Zhengzhou 5
Baghdad 4
Boston 4
Bến Tre 4
Changsha 4
Chicago 4
Falls Church 4
Guarulhos 4
Kingston 4
Kuala Lumpur 4
Kunming 4
Mumbai 4
Rio de Janeiro 4
Thái Nguyên 4
Toronto 4
Trento 4
Verona 4
Zibo 4
Atlanta 3
Belo Horizonte 3
Brasília 3
Bảo Lộc 3
Bắc Ninh 3
Cheyenne 3
Johannesburg 3
Manchester 3
New Bedfont 3
Nha Trang 3
Phủ Từ Sơn 3
Pilsen 3
Totale 4.535
Salva come PNG Salva come JPEG
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 388
Combinatorial Optimization - Polyhedra and efficiency: A book review 188
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 161
A short proof of Konig's matching theorem 147
Allocating Servers in Infostations for Bounded Simultaneous Requests 147
Evaluation of BIC-based algorithms for audio segmentation 143
Edge-coloring bipartite graphs 141
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 139
A Simple Minimum T-Cut Algorithm 136
Shortest Paths in Conservative Graphs 133
Randomized greedy algorithms for the hypergraph partitioning problem 133
Cycle cover property and CPP=SCC property are not equivalent 130
A DP Algorithm for Speaker Change Detection 128
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 126
A note on range-restricted circuit covers 126
A greedy approach to compute a minimum cycle basis of a directed graph 123
Least and most colored bases 121
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 119
Indecomposable r-graphs and some other counterexamples 117
Routing permutations in partitioned optical passive stars networks 117
On 4-connected graphs without even cycle decompositions 116
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 114
Excluding a simple good pair approach to directed cuts 112
The Optimal Statistical Median of a Convex Set of Arrays 111
On the Recognition of $P_4$-Indifferent Graphs 110
Some Simple Distributed Algorithms for Sparse Networks 109
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 109
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 107
Minimum T-cuts and optimal T-pairings 102
Some simple distributed algorithms for sparse networks 98
On the complexity of digraph packings 96
Least and most colorable bases 93
Packing Cycles in Undirected Graphs 91
Packing Triangles in Bounded Degree Graphs 90
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 89
Channel Assignment with Separation on Trees and Interval Graphs 88
Konig's Edge Coloring Theorem without augmenting paths 85
Cycle Cover Property and CPP=SCC Property are not Equivalent 79
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 79
Packing Cuts in Graphs 75
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 74
On minimizing symmetric set functions 72
On d-Threshold Graphs and d-Dimensional Bin Packing 70
Allocating Servers in Infostations for Bounded Simultaneous Requests 69
A note on range-restricted circuit covers 68
Indecomposable r-graphs and some other counterexamples 67
Packing Triangles in Bounded Degree Graphs 66
Edge­Coloring Bipartite Graphs 65
Impaccando T-tagli e T-giunti 65
A Simple Minimum T-Cut Algorithm 64
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 63
Packing paths in digraphs 61
On the Recognition of P4-Indifferent Graphs 57
A short proof of König's matching theorem 57
Minimum T-cuts and optimal T-pairings 54
Haplotyping Populations: Complexity and Approximations 54
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 51
Shortest Paths in Conservative Graphs 51
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 50
Excluding a Simple Good Pair Approach to Directed Cuts 48
Impaccando T-tagli e T-giunti 44
On minimizing symmetric set functions 38
König's Edge Coloring Theorem without augmenting paths 37
On 4-connected graphs without even cycle decompositions 19
null 1
Totale 6.281
Salva come PNG Salva come JPEG
Categoria #
all - tutte 23.163
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 425
Totale 23.588
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021107 0 0 0 0 0 0 0 0 0 26 53 28
2021/2022297 2 37 0 14 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.046 99 55 370 264 201 181 436 41 214 185 0 0
Totale 6.281