Rizzi, Romeo
 Distribuzione geografica
Continente #
NA - Nord America 2.448
AS - Asia 537
EU - Europa 462
AF - Africa 3
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.451
Nazione #
US - Stati Uniti d'America 2.443
CN - Cina 283
SG - Singapore 197
UA - Ucraina 139
SE - Svezia 97
FI - Finlandia 58
DE - Germania 50
GB - Regno Unito 36
IT - Italia 26
ID - Indonesia 24
JO - Giordania 22
BG - Bulgaria 14
FR - Francia 10
RU - Federazione Russa 9
AM - Armenia 6
BE - Belgio 5
NL - Olanda 5
CA - Canada 4
CZ - Repubblica Ceca 3
IN - India 3
LT - Lituania 3
EG - Egitto 2
IE - Irlanda 2
AL - Albania 1
CH - Svizzera 1
EU - Europa 1
HU - Ungheria 1
KR - Corea 1
LV - Lettonia 1
MA - Marocco 1
MX - Messico 1
PL - Polonia 1
VN - Vietnam 1
Totale 3.451
Città #
Fairfield 316
Jacksonville 302
Chandler 258
Ashburn 184
Woodbridge 177
Singapore 164
Beijing 162
Seattle 153
Cambridge 123
Houston 119
Columbus 116
Wilmington 105
Princeton 78
Ann Arbor 73
Hangzhou 68
New York 59
San Mateo 32
Jakarta 24
Bremen 23
Helsinki 18
Los Angeles 15
Dearborn 14
San Diego 14
Santa Clara 14
Sofia 14
Boardman 10
Turin 9
Düsseldorf 8
Norwalk 8
Shenzhen 8
Gyumri 6
Brussels 5
London 5
Council Bluffs 4
Dallas 4
Des Moines 4
Falls Church 4
Kunming 4
Moscow 4
Nanjing 4
Toronto 4
Trento 4
Verona 4
Zibo 4
Amsterdam 3
Frankfurt am Main 3
Jinan 3
New Bedfont 3
Phoenix 3
Pilsen 3
Andover 2
Berlin 2
Cairo 2
Dublin 2
Hefei 2
Kilburn 2
Lawrence 2
Nanchang 2
North Bergen 2
Rome 2
San Francisco 2
Tomsk 2
Zhengzhou 2
Bologna 1
Budapest 1
Castel Bolognese 1
Chengdu 1
Chiswick 1
Chongqing 1
Clifton 1
Denver 1
Edinburgh 1
Fayetteville 1
Fuzhou 1
Geneve 1
Guadalajara 1
Guangzhou 1
Hyderabad 1
Lanzhou 1
Le Havre 1
Milan 1
Nuremberg 1
Palermo 1
Paris 1
Prineville 1
Pune 1
Redmond 1
Riga 1
Seoul 1
Shanghai 1
Tappahannock 1
Wageningen 1
Wandsworth 1
Warsaw 1
Wuhan 1
Xian 1
Totale 2.805
Nome #
A mixed-integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 295
Combinatorial Optimization - Polyhedra and efficiency: A book review 107
Evaluation of BIC-based algorithms for audio segmentation 100
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 100
Edge-coloring bipartite graphs 99
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 95
Indecomposable r-graphs and some other counterexamples 95
A short proof of Konig's matching theorem 95
A Simple Minimum T-Cut Algorithm 95
Least and most colored bases 91
On 4-connected graphs without even cycle decompositions 90
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 90
Allocating Servers in Infostations for Bounded Simultaneous Requests 89
A note on range-restricted circuit covers 88
On the Recognition of $P_4$-Indifferent Graphs 85
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 84
Excluding a simple good pair approach to directed cuts 82
Cycle cover property and CPP=SCC property are not equivalent 82
A greedy approach to compute a minimum cycle basis of a directed graph 81
Routing permutations in partitioned optical passive stars networks 79
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the Iterated 1-Steiner Heuristic 78
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 76
Randomized greedy algorithms for the hypergraph partitioning problem 76
Minimum T-cuts and optimal T-pairings 74
Shortest Paths in Conservative Graphs 72
Some simple distributed algorithms for sparse networks 72
Packing Cycles in Undirected Graphs 71
On the complexity of digraph packings 70
The Optimal Statistical Median of a Convex Set of Arrays 67
Packing Triangles in Bounded Degree Graphs 66
A DP Algorithm for Speaker Change Detection 58
Konig's Edge Coloring Theorem without augmenting paths 56
Least and most colorable bases 50
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 48
Special Issue on Computational Molecular Biology/Bioinformatics: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms 47
Packing Cuts in Graphs 44
Impaccando T-tagli e T-giunti 44
Packing paths in digraphs 43
On minimizing symmetric set functions 42
On d-Threshold Graphs and d-Dimensional Bin Packing 42
Allocating Servers in Infostations for Bounded Simultaneous Requests 19
Shortest Paths in Conservative Graphs 19
On the Recognition of P4-Indifferent Graphs 18
Haplotyping Populations: Complexity and Approximations 17
Indecomposable r-graphs and some other counterexamples 16
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 16
Cycle Cover Property and CPP=SCC Property are not Equivalent 14
Channel Assignment with Separation on Trees and Interval Graphs 13
Sidepath results on packing $\vec{P}_1$'s and $\vec{P}_2$'s 12
Minimum T-cuts and optimal T-pairings 12
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 12
A short proof of König's matching theorem 12
A note on range-restricted circuit covers 12
König's Edge Coloring Theorem without augmenting paths 11
Packing Triangles in Bounded Degree Graphs 11
Edge­Coloring Bipartite Graphs 10
Impaccando T-tagli e T-giunti 10
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 10
On minimizing symmetric set functions 10
A Simple Minimum T-Cut Algorithm 10
Some Simple Distributed Algorithms for Sparse Networks 8
Excluding a Simple Good Pair Approach to Directed Cuts 8
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 7
On 4-connected graphs without even cycle decompositions 3
null 1
Totale 3.509
Categoria #
all - tutte 14.597
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 305
Totale 14.902


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020587 0 0 0 0 99 49 113 78 106 46 35 61
2020/2021461 6 71 5 70 54 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/2025370 8 11 45 249 57 0 0 0 0 0 0 0
Totale 3.509