CATALOGO DEI PRODOTTI DELLA RICERCA

RIZZI, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.672
EU - Europa 5.007
AS - Asia 4.440
SA - Sud America 575
AF - Africa 58
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 16.764
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.603
SG - Singapore 1.842
CN - Cina 1.539
GB - Regno Unito 1.436
RU - Federazione Russa 598
FR - Francia 547
HK - Hong Kong 541
IT - Italia 541
SE - Svezia 539
BR - Brasile 480
IE - Irlanda 429
FI - Finlandia 336
DE - Germania 327
KR - Corea 125
TR - Turchia 99
UA - Ucraina 89
VN - Vietnam 83
IN - India 44
CA - Canada 34
BD - Bangladesh 31
AR - Argentina 30
PL - Polonia 29
NL - Olanda 28
ID - Indonesia 24
AT - Austria 21
IQ - Iraq 18
BE - Belgio 17
EC - Ecuador 17
MX - Messico 16
PK - Pakistan 15
TG - Togo 14
CO - Colombia 13
ES - Italia 12
ZA - Sudafrica 12
PY - Paraguay 10
SA - Arabia Saudita 9
MA - Marocco 8
TN - Tunisia 8
UZ - Uzbekistan 8
VE - Venezuela 8
CZ - Repubblica Ceca 7
IR - Iran 7
RO - Romania 7
AU - Australia 6
JP - Giappone 6
AL - Albania 5
CL - Cile 5
DO - Repubblica Dominicana 5
JO - Giordania 5
MY - Malesia 5
UY - Uruguay 5
AE - Emirati Arabi Uniti 4
BG - Bulgaria 4
HU - Ungheria 4
KZ - Kazakistan 4
PE - Perù 4
PT - Portogallo 4
TH - Thailandia 4
CH - Svizzera 3
IL - Israele 3
KE - Kenya 3
LT - Lituania 3
PA - Panama 3
RS - Serbia 3
TT - Trinidad e Tobago 3
TW - Taiwan 3
BN - Brunei Darussalam 2
BO - Bolivia 2
CM - Camerun 2
DK - Danimarca 2
EE - Estonia 2
EG - Egitto 2
EU - Europa 2
KG - Kirghizistan 2
KW - Kuwait 2
LK - Sri Lanka 2
LU - Lussemburgo 2
MD - Moldavia 2
MM - Myanmar 2
MT - Malta 2
NO - Norvegia 2
NP - Nepal 2
PH - Filippine 2
QA - Qatar 2
SN - Senegal 2
SV - El Salvador 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AD - Andorra 1
AM - Armenia 1
AN - Antille olandesi 1
CG - Congo 1
CI - Costa d'Avorio 1
CV - Capo Verde 1
GE - Georgia 1
GM - Gambi 1
GY - Guiana 1
HN - Honduras 1
HT - Haiti 1
IM - Isola di Man 1
JM - Giamaica 1
Totale 16.749
Salva come PNG Salva come JPEG
Città #
Southend 1.198
Woodbridge 862
Singapore 850
Jacksonville 801
Chandler 733
Dallas 584
Hong Kong 537
Ann Arbor 462
Dublin 423
Houston 371
Ashburn 266
Beijing 207
Princeton 191
Lawrence 190
Wilmington 170
The Dalles 141
Milan 133
Verona 132
Jinan 118
Nanjing 115
Shenyang 114
Columbus 106
Boardman 98
Los Angeles 86
Redondo Beach 76
Buffalo 71
Hebei 68
Tianjin 63
Seoul 61
Changsha 58
New York 53
Zhengzhou 51
Santa Clara 48
Guangzhou 45
Helsinki 43
Munich 43
Sindelfingen 42
Ningbo 40
São Paulo 40
Istanbul 39
Nanchang 37
Haikou 33
Seattle 33
Hangzhou 32
Ho Chi Minh City 29
Jiaxing 29
Norwalk 28
Moscow 23
Taizhou 23
Washington 23
North Bergen 22
Falls Church 19
Jakarta 19
Redmond 19
Hanoi 18
Amsterdam 17
Belo Horizonte 17
Chicago 17
Lanzhou 17
Vienna 17
Brussels 16
Taiyuan 16
Rio de Janeiro 15
Rome 15
Frankfurt am Main 14
Lomé 14
San Francisco 14
Fairfield 13
Tappahannock 13
Stockholm 12
Council Bluffs 11
Dhaka 11
Phoenix 11
Warsaw 11
Chennai 10
Fuzhou 10
Shanghai 10
Baghdad 9
Brooklyn 9
Porto Alegre 9
Trento 9
Johannesburg 8
Mezzocorona 8
Ottawa 8
Tashkent 8
Turku 8
Boston 7
Brasília 7
Madrid 7
Montreal 7
Monza 7
Padova 7
Ribeirão Preto 7
San Jose 7
Secaucus 7
Shenzhen 7
Tehran 7
Wroclaw 7
Atlanta 6
Balin 6
Totale 10.589
Salva come PNG Salva come JPEG
Nome #
Optimal Design of Consistent Simple Temporal Networks 158
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 140
Incorporating Decision Nodes into Conditional Simple Temporal Networks 140
The Price of Evolution in Temporal Databases 137
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 136
Hyper Temporal Networks 133
Covering partially directed graphs with directed paths 133
Indecomposable r-graphs and some other counterexamples 131
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 129
A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games 127
A polynomial case of the parsimony haplotyping problem 125
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphAlgorithms and Computation 124
Least and most colored bases 123
Combinatorial Optimization - Polyhedra and efficiency: A book review 123
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of PathsAlgorithms in Bioinformatics 122
Breaking the O(m^2 n) Barrier for Minimum Cycle Bases. 121
A DP algorithm for speaker change detection 121
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 121
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 119
A Faster Algorithm for Finding Minimum Tucker Submatrices. 117
A novel min-cost flow method for estimating transcript expression with RNA-Seq. 117
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 115
Some Simple Distributed Algorithms for Sparse Networks 114
A Simple Minimum T-Cut Algorithm 114
A short proof of Konig's matching theorem 112
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 110
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics 110
Benchmarks for Strictly Fundamental Cycle Bases 110
Evaluation of BIC-based algorithms for audio segmentation 110
Packing Cycles and Cuts in Undirected Graphs 109
A Faster Algorithm for Finding Minimum Tucker Submatrices 109
Hypercube Computations on Partitioned Optical Passive Stars Networks 109
Acyclically pushable bipartite permutation digraphs: An algorithm 109
Cycle bases in graphs characterization, algorithms, complexity, and applications. 107
Pure Parsimony Xor Haplotyping. 107
Faster and better simple temporal problems 107
Cycle cover property and CPP=SCC property are not equivalent 107
Packing paths in digraphs 106
Haplotyping Populations by Pure Parsimony: Complexity, Exact, and Approximation Algorithms 105
Minimal multiset grammars for recurrent dynamics 105
What Makes the Arc-Preserving Subsequence Problem Hard? 104
A note on range-restricted circuit covers 104
Packing Cycles in Undirected Graphs 103
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases 103
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. 102
Approximating the maximum 3-edge-colorable subgraph problem. 102
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 102
On the approximability of the minimum strictly fundamental cycle basis problem. 102
Packing Cuts in Graphs 101
Allocating Servers in Infostations for Bounded Simultaneous Requests 99
Lower bounds for strictly fundamental cycle bases in grid graphs. 98
Approximation of RNA Multiple Structural Alignment 98
Haplotyping for Disease Association: A Combinatorial Approach 97
Network Synthesis for Distributed Embedded Systems 96
Konig's Edge Coloring Theorem without augmenting paths 96
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 94
A greedy approach to compute a minimum cycle basis of a directed graph 94
On 4-connected graphs without even cycle decompositions 93
On the Recognition of P_4-Indifferent Graphs 92
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 92
Scheduling data broadcasts on wireless channels: exact solutions and heuristics 92
Complexity of Weak, Strong and Dynamic Controllability of CNCUs 92
Approximation of RNA multiple structural alignment. 91
Minimum Mosaic Inference of a Set of Recombinants 91
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 91
Channel Assignment in Honeycomb Networks 90
Polynomial and APX-hard cases of the Individual Haplotyping Problem 90
Polynomial Time Instances for the IKHO Problem 90
Allocating Servers in Infostations for On-Demand Communications 90
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval 89
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 89
Strong Controllability of Temporal Networks with Decisions 89
Optimal receiver scheduling algorithms for a multicast problem. 88
Impaccando T-tagli e T-giunti 88
Oriented star packings 87
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel 86
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem 86
Dominating sequences in graphs 86
On cycle bases with limited edge overlap. 86
Eserciziario di matematica I e II 85
Pattern Matching in Protein-Protein Interaction Graphs 85
The optimal statistical median of a convex set of arrays. 85
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. 85
Optimal Omnitig Listing for Safe and Complete Contig Assembly 84
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 83
Routing Permutations in Partitioned Optical Passive Star Networks 83
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs 83
Checking Sets of Pure Evolving Association Rules 83
Complexity issues in color-preserving graph embeddings. 82
Complexity Insights of the Minimum Duplication Problem 82
Amortized \~O(\(\vert\)V\(\vert\)) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs 82
A novel min-cost flow method for estimating transcript expression with RNA-Seq: Bounding the number of paths 82
On minimizing symmetric set functions 82
The Complexity of Simulation and Matrix Multiplication 82
Routing Permutations in Partitioned Optical Passive Stars Networks 81
Hierarchical Clustering Using the Arithmetic-Harmonic Cut: Complexity and Experiments 81
Excessive factorizations of bipartite multigraphs. 81
Eserciziario di matematica vol.2 80
Ranking, unranking and random generation of extensional acyclic digraphs 80
The firefighter problem for graphs of maximum degree three 80
Totale 10.166
Salva come PNG Salva come JPEG
Categoria #
all - tutte 65.763
article - articoli 36.768
book - libri 556
conference - conferenze 27.514
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 925
Totale 131.526
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021934 0 0 0 158 131 204 10 96 32 9 190 104
2021/20221.050 106 130 18 23 74 95 44 104 42 20 83 311
2022/20232.543 240 140 271 459 204 591 62 167 274 18 79 38
2023/20241.259 57 143 110 89 185 86 78 154 30 94 142 91
2024/20253.956 237 328 149 587 126 113 156 389 604 223 287 757
2025/20262.324 789 496 737 302 0 0 0 0 0 0 0 0
Totale 16.985