Rizzi, Romeo
 Distribuzione geografica
Continente #
NA - Nord America 3.132
AS - Asia 1.221
EU - Europa 747
SA - Sud America 146
AF - Africa 13
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 5.261
Nazione #
US - Stati Uniti d'America 3.112
SG - Singapore 580
CN - Cina 487
RU - Federazione Russa 164
UA - Ucraina 141
BR - Brasile 126
SE - Svezia 97
FI - Finlandia 75
DE - Germania 67
LV - Lettonia 64
GB - Regno Unito 45
VN - Vietnam 43
IT - Italia 29
ID - Indonesia 28
JO - Giordania 23
BG - Bulgaria 14
FR - Francia 12
HK - Hong Kong 12
IN - India 10
BD - Bangladesh 9
PL - Polonia 9
AR - Argentina 8
NL - Olanda 8
MX - Messico 7
AM - Armenia 6
CA - Canada 6
ZA - Sudafrica 6
BE - Belgio 5
EC - Ecuador 5
IQ - Iraq 4
JM - Giamaica 4
CL - Cile 3
CZ - Repubblica Ceca 3
IL - Israele 3
LT - Lituania 3
PK - Pakistan 3
AE - Emirati Arabi Uniti 2
AT - Austria 2
CH - Svizzera 2
EG - Egitto 2
IE - Irlanda 2
KR - Corea 2
PE - Perù 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
UZ - Uzbekistan 2
AL - Albania 1
AU - Australia 1
CO - Colombia 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
EU - Europa 1
GH - Ghana 1
HN - Honduras 1
HU - Ungheria 1
IR - Iran 1
JP - Giappone 1
KE - Kenya 1
KZ - Kazakistan 1
MA - Marocco 1
NG - Nigeria 1
OM - Oman 1
PA - Panama 1
PH - Filippine 1
PY - Paraguay 1
RS - Serbia 1
Totale 5.261
Città #
Singapore 351
Fairfield 316
Jacksonville 302
Ashburn 268
Chandler 258
Dallas 230
Beijing 181
Woodbridge 177
Seattle 153
Santa Clara 143
Cambridge 123
Houston 119
Columbus 117
Wilmington 105
Princeton 78
Ann Arbor 73
Hangzhou 71
Moscow 71
New York 66
Riga 64
Hefei 42
Los Angeles 34
San Mateo 32
Buffalo 31
The Dalles 29
Jakarta 24
Bremen 23
Ho Chi Minh City 22
São Paulo 19
Helsinki 18
Turku 17
Boardman 14
Dearborn 14
Des Moines 14
Munich 14
San Diego 14
Sofia 14
Redondo Beach 12
Hong Kong 9
Shenzhen 9
Turin 9
Council Bluffs 8
Düsseldorf 8
Hanoi 8
London 8
Norwalk 8
Warsaw 8
North Charleston 7
Tianjin 7
Amsterdam 6
Guangzhou 6
Gyumri 6
Phoenix 6
Brussels 5
Frankfurt am Main 5
Jinan 5
Nanjing 5
Shanghai 5
Zhengzhou 5
Brooklyn 4
Chicago 4
Denver 4
Falls Church 4
Guarulhos 4
Kingston 4
Kunming 4
Rio de Janeiro 4
Toronto 4
Trento 4
Verona 4
Zibo 4
Belo Horizonte 3
Boston 3
Brasília 3
Changsha 3
Da Nang 3
Mumbai 3
New Bedfont 3
Orem 3
Pilsen 3
Porto Alegre 3
Rome 3
Salvador 3
San Francisco 3
Xi'an 3
Andover 2
Barbacena 2
Berlin 2
Bratislava 2
Burzaco 2
Cairo 2
Campinas 2
Canoas 2
Cape Town 2
Capivari 2
Chongqing 2
Dublin 2
Erbil 2
Itapevi 2
Johannesburg 2
Totale 3.916
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 358
Combinatorial Optimization - Polyhedra and efficiency: A book review 177
Evaluation of BIC-based algorithms for audio segmentation 138
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 138
Edge-coloring bipartite graphs 134
Allocating Servers in Infostations for Bounded Simultaneous Requests 130
A Simple Minimum T-Cut Algorithm 126
A short proof of Konig's matching theorem 121
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 119
A note on range-restricted circuit covers 119
Cycle cover property and CPP=SCC property are not equivalent 118
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 117
Least and most colored bases 114
A greedy approach to compute a minimum cycle basis of a directed graph 113
Routing permutations in partitioned optical passive stars networks 109
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 108
On 4-connected graphs without even cycle decompositions 107
On the Recognition of $P_4$-Indifferent Graphs 106
Excluding a simple good pair approach to directed cuts 106
Indecomposable r-graphs and some other counterexamples 105
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 101
Shortest Paths in Conservative Graphs 100
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 98
A DP Algorithm for Speaker Change Detection 98
Minimum T-cuts and optimal T-pairings 96
Randomized greedy algorithms for the hypergraph partitioning problem 93
Some simple distributed algorithms for sparse networks 91
The Optimal Statistical Median of a Convex Set of Arrays 91
On the complexity of digraph packings 90
Packing Cycles in Undirected Graphs 86
Packing Triangles in Bounded Degree Graphs 83
Some Simple Distributed Algorithms for Sparse Networks 80
Least and most colorable bases 79
Konig's Edge Coloring Theorem without augmenting paths 77
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 75
Packing Cuts in Graphs 70
On minimizing symmetric set functions 68
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 65
On d-Threshold Graphs and d-Dimensional Bin Packing 63
Packing paths in digraphs 58
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 56
Impaccando T-tagli e T-giunti 56
Cycle Cover Property and CPP=SCC Property are not Equivalent 55
A note on range-restricted circuit covers 54
A Simple Minimum T-Cut Algorithm 51
Allocating Servers in Infostations for Bounded Simultaneous Requests 50
Channel Assignment with Separation on Trees and Interval Graphs 49
A short proof of König's matching theorem 48
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 48
Indecomposable r-graphs and some other counterexamples 47
On the Recognition of P4-Indifferent Graphs 46
Edge­Coloring Bipartite Graphs 42
Haplotyping Populations: Complexity and Approximations 42
Shortest Paths in Conservative Graphs 39
Minimum T-cuts and optimal T-pairings 36
Excluding a Simple Good Pair Approach to Directed Cuts 36
Packing Triangles in Bounded Degree Graphs 36
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 35
Impaccando T-tagli e T-giunti 34
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 32
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 31
König's Edge Coloring Theorem without augmenting paths 30
On minimizing symmetric set functions 28
On 4-connected graphs without even cycle decompositions 13
null 1
Totale 5.320
Categoria #
all - tutte 21.567
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 407
Totale 21.974


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021255 0 0 0 0 0 33 40 31 44 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/20261.085 99 55 370 264 201 96 0 0 0 0 0 0
Totale 5.320