IRIS
Rizzi, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.792
AS - Asia 1.726
EU - Europa 928
SA - Sud America 166
Continente sconosciuto - Info sul continente non disponibili 60
AF - Africa 17
OC - Oceania 1
Totale 6.690
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.742
SG - Singapore 673
CN - Cina 531
VN - Vietnam 245
RU - Federazione Russa 164
UA - Ucraina 142
BR - Brasile 138
FR - Francia 121
SE - Svezia 99
FI - Finlandia 78
DE - Germania 74
KR - Corea 67
LV - Lettonia 64
IT - Italia 60
GB - Regno Unito 58
HK - Hong Kong 47
ID - Indonesia 31
JO - Giordania 24
BD - Bangladesh 21
CA - Canada 19
IN - India 18
IQ - Iraq 15
BG - Bulgaria 14
MX - Messico 11
PL - Polonia 11
AR - Argentina 10
NL - Olanda 10
ZA - Sudafrica 7
AM - Armenia 6
JM - Giamaica 6
MY - Malesia 6
PK - Pakistan 6
BE - Belgio 5
CL - Cile 5
EC - Ecuador 5
ES - Italia 5
TH - Thailandia 5
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
BB - Barbados 2
CH - Svizzera 2
EG - Egitto 2
IE - Irlanda 2
MA - Marocco 2
NG - Nigeria 2
NI - Nicaragua 2
OM - Oman 2
PR - Porto Rico 2
PY - Paraguay 2
SI - Slovenia 2
SK - Slovacchia (Repubblica Slovacca) 2
SV - El Salvador 2
TR - Turchia 2
TT - Trinidad e Tobago 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
GT - Guatemala 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
Totale 6.631
Salva come PNG Salva come JPEG
Città #
Singapore 400
Fairfield 316
Ashburn 314
Jacksonville 302
Chandler 258
Dallas 232
Beijing 182
San Jose 179
Woodbridge 177
Columbus 171
Santa Clara 160
Seattle 154
Cambridge 123
Houston 121
Wilmington 105
Ho Chi Minh City 82
Princeton 78
New York 76
Ann Arbor 74
Council Bluffs 71
Hangzhou 71
Moscow 71
The Dalles 70
Seoul 65
Riga 64
Hanoi 63
Lauterbourg 56
Los Angeles 49
Hefei 42
Hong Kong 39
Buffalo 35
San Mateo 32
Jakarta 27
Bremen 23
São Paulo 22
Boardman 20
Da Nang 20
Helsinki 20
Turku 17
Des Moines 15
Dearborn 14
Munich 14
San Diego 14
Sofia 14
London 13
Redondo Beach 12
St Louis 11
Frankfurt am Main 10
Phoenix 10
Turin 10
North Charleston 9
Shenzhen 9
Warsaw 9
Amsterdam 8
Denver 8
Düsseldorf 8
Haiphong 8
Norwalk 8
Tianjin 8
Montreal 7
Orem 7
Paris 7
Trento 7
Guangzhou 6
Gyumri 6
Atlanta 5
Bangkok 5
Brooklyn 5
Brussels 5
Chicago 5
Jinan 5
Nanjing 5
Rio de Janeiro 5
Rome 5
San Francisco 5
Shanghai 5
Zhengzhou 5
Baghdad 4
Boston 4
Bến Tre 4
Changsha 4
Falls Church 4
Guarulhos 4
Kingston 4
Kuala Lumpur 4
Kunming 4
Las Vegas 4
Mexico City 4
Mumbai 4
Spanaway 4
Thái Nguyên 4
Toronto 4
Verona 4
Zibo 4
Belo Horizonte 3
Brasília 3
Bảo Lộc 3
Bắc Ninh 3
Calgary 3
Cheyenne 3
Totale 4.779
Salva come PNG Salva come JPEG
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 415
Combinatorial Optimization - Polyhedra and efficiency: A book review 195
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 179
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 164
A short proof of Konig's matching theorem 151
Evaluation of BIC-based algorithms for audio segmentation 150
Allocating Servers in Infostations for Bounded Simultaneous Requests 149
Edge-coloring bipartite graphs 146
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 144
A Simple Minimum T-Cut Algorithm 139
Some Simple Distributed Algorithms for Sparse Networks 137
Shortest Paths in Conservative Graphs 137
Randomized greedy algorithms for the hypergraph partitioning problem 137
A note on range-restricted circuit covers 134
Cycle cover property and CPP=SCC property are not equivalent 133
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 129
A DP Algorithm for Speaker Change Detection 129
A greedy approach to compute a minimum cycle basis of a directed graph 127
Least and most colored bases 125
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 122
Indecomposable r-graphs and some other counterexamples 121
Routing permutations in partitioned optical passive stars networks 120
On 4-connected graphs without even cycle decompositions 118
The Optimal Statistical Median of a Convex Set of Arrays 117
Excluding a simple good pair approach to directed cuts 114
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 113
On the Recognition of $P_4$-Indifferent Graphs 112
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 110
Minimum T-cuts and optimal T-pairings 106
Some simple distributed algorithms for sparse networks 102
On the complexity of digraph packings 100
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 98
Least and most colorable bases 98
Packing Triangles in Bounded Degree Graphs 97
Packing Cycles in Undirected Graphs 95
Channel Assignment with Separation on Trees and Interval Graphs 92
Konig's Edge Coloring Theorem without augmenting paths 87
Packing Cuts in Graphs 84
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 84
Cycle Cover Property and CPP=SCC Property are not Equivalent 83
Edge­Coloring Bipartite Graphs 81
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 79
Indecomposable r-graphs and some other counterexamples 79
On minimizing symmetric set functions 77
Allocating Servers in Infostations for Bounded Simultaneous Requests 76
A note on range-restricted circuit covers 75
Packing Triangles in Bounded Degree Graphs 73
On d-Threshold Graphs and d-Dimensional Bin Packing 72
A Simple Minimum T-Cut Algorithm 70
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 70
Impaccando T-tagli e T-giunti 66
A short proof of König's matching theorem 64
On the Recognition of P4-Indifferent Graphs 63
Packing paths in digraphs 63
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 61
Haplotyping Populations: Complexity and Approximations 60
Minimum T-cuts and optimal T-pairings 58
Shortest Paths in Conservative Graphs 55
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 54
Excluding a Simple Good Pair Approach to Directed Cuts 54
Impaccando T-tagli e T-giunti 46
On minimizing symmetric set functions 41
König's Edge Coloring Theorem without augmenting paths 38
On 4-connected graphs without even cycle decompositions 21
null 1
Totale 6.690
Salva come PNG Salva come JPEG
Categoria #
all - tutte 25.976
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 465
Totale 26.441
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022295 0 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.215 99 55 370 264 201 181 436 41 214 225 91 38
2026/2027240 89 151 0 0 0 0 0 0 0 0 0 0
Totale 6.690