IRIS
Rizzi, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.571
AS - Asia 1.716
EU - Europa 919
SA - Sud America 162
AF - Africa 17
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 6.387
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.538
SG - Singapore 666
CN - Cina 531
VN - Vietnam 245
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
IT - Italia 51
HK - Hong Kong 45
ID - Indonesia 31
JO - Giordania 24
BD - Bangladesh 20
IN - India 18
IQ - Iraq 15
BG - Bulgaria 14
CA - Canada 14
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
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
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
PR - Porto Rico 1
QA - Qatar 1
RS - Serbia 1
SC - Seychelles 1
SV - El Salvador 1
Totale 6.387
Salva come PNG Salva come JPEG
Città #
Singapore 395
Fairfield 316
Jacksonville 302
Ashburn 299
Chandler 258
Dallas 232
Beijing 182
San Jose 177
Woodbridge 177
Santa Clara 157
Seattle 154
Cambridge 123
Houston 120
Columbus 118
Wilmington 105
Ho Chi Minh City 82
Princeton 78
New York 76
Ann Arbor 74
Hangzhou 71
Moscow 71
The Dalles 67
Seoul 65
Riga 64
Hanoi 63
Lauterbourg 56
Los Angeles 48
Hefei 42
Hong Kong 37
Buffalo 35
San Mateo 32
Jakarta 27
Council Bluffs 26
Bremen 23
São Paulo 22
Da Nang 20
Helsinki 20
Boardman 18
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
Turin 10
Phoenix 9
Shenzhen 9
Warsaw 9
Amsterdam 8
Denver 8
Düsseldorf 8
Haiphong 8
North Charleston 8
Norwalk 8
Tianjin 8
Orem 7
Paris 7
Guangzhou 6
Gyumri 6
Bangkok 5
Brooklyn 5
Brussels 5
Chicago 5
Jinan 5
Montreal 5
Nanjing 5
San Francisco 5
Shanghai 5
Zhengzhou 5
Atlanta 4
Baghdad 4
Boston 4
Bến Tre 4
Changsha 4
Falls Church 4
Guarulhos 4
Kingston 4
Kuala Lumpur 4
Kunming 4
Mumbai 4
Rio de Janeiro 4
Rome 4
Thái Nguyên 4
Toronto 4
Trento 4
Verona 4
Zibo 4
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
Totale 4.634
Salva come PNG Salva come JPEG
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 407
Combinatorial Optimization - Polyhedra and efficiency: A book review 193
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 162
A short proof of Konig's matching theorem 150
Allocating Servers in Infostations for Bounded Simultaneous Requests 147
Evaluation of BIC-based algorithms for audio segmentation 144
Edge-coloring bipartite graphs 142
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 141
A Simple Minimum T-Cut Algorithm 136
Shortest Paths in Conservative Graphs 135
Randomized greedy algorithms for the hypergraph partitioning problem 135
Cycle cover property and CPP=SCC property are not equivalent 131
A note on range-restricted circuit covers 129
A DP Algorithm for Speaker Change Detection 128
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 127
A greedy approach to compute a minimum cycle basis of a directed graph 125
Least and most colored bases 123
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 122
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 120
Indecomposable r-graphs and some other counterexamples 120
Routing permutations in partitioned optical passive stars networks 119
Some Simple Distributed Algorithms for Sparse Networks 116
On 4-connected graphs without even cycle decompositions 116
The Optimal Statistical Median of a Convex Set of Arrays 115
Excluding a simple good pair approach to directed cuts 113
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 111
On the Recognition of $P_4$-Indifferent Graphs 110
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 108
Minimum T-cuts and optimal T-pairings 102
Some simple distributed algorithms for sparse networks 99
On the complexity of digraph packings 97
Packing Triangles in Bounded Degree Graphs 95
Least and most colorable bases 94
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 93
Packing Cycles in Undirected Graphs 92
Channel Assignment with Separation on Trees and Interval Graphs 91
Konig's Edge Coloring Theorem without augmenting paths 86
Cycle Cover Property and CPP=SCC Property are not Equivalent 81
Packing Cuts in Graphs 81
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 79
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 78
Edge­Coloring Bipartite Graphs 75
On minimizing symmetric set functions 73
Allocating Servers in Infostations for Bounded Simultaneous Requests 72
Indecomposable r-graphs and some other counterexamples 72
A note on range-restricted circuit covers 70
On d-Threshold Graphs and d-Dimensional Bin Packing 70
Packing Triangles in Bounded Degree Graphs 69
A Simple Minimum T-Cut Algorithm 67
Impaccando T-tagli e T-giunti 66
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 65
On the Recognition of P4-Indifferent Graphs 62
A short proof of König's matching theorem 62
Packing paths in digraphs 61
Haplotyping Populations: Complexity and Approximations 58
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 56
Minimum T-cuts and optimal T-pairings 55
Shortest Paths in Conservative Graphs 54
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 52
Excluding a Simple Good Pair Approach to Directed Cuts 51
Impaccando T-tagli e T-giunti 45
On minimizing symmetric set functions 40
König's Edge Coloring Theorem without augmenting paths 37
On 4-connected graphs without even cycle decompositions 20
null 1
Totale 6.446
Salva come PNG Salva come JPEG
Categoria #
all - tutte 24.657
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 446
Totale 25.103
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202128 0 0 0 0 0 0 0 0 0 0 0 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.211 99 55 370 264 201 181 436 41 214 225 91 34
Totale 6.446