CATALOGO DEI PRODOTTI DELLA RICERCA

RIZZI, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 11.414
EU - Europa 7.805
AS - Asia 6.877
SA - Sud America 898
Continente sconosciuto - Info sul continente non disponibili 239
AF - Africa 163
OC - Oceania 10
Totale 27.406
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 11.123
SG - Singapore 2.882
RU - Federazione Russa 2.689
CN - Cina 1.771
GB - Regno Unito 1.496
IT - Italia 1.037
BR - Brasile 658
HK - Hong Kong 601
FR - Francia 563
SE - Svezia 543
VN - Vietnam 459
IE - Irlanda 432
DE - Germania 355
FI - Finlandia 340
KR - Corea 290
BD - Bangladesh 283
CA - Canada 139
TR - Turchia 112
UA - Ucraina 101
IN - India 99
AR - Argentina 68
ID - Indonesia 62
NL - Olanda 45
EC - Ecuador 44
PK - Pakistan 43
IQ - Iraq 42
MX - Messico 41
CO - Colombia 34
JP - Giappone 33
PL - Polonia 33
ZA - Sudafrica 30
AT - Austria 28
NG - Nigeria 27
ES - Italia 26
VE - Venezuela 25
PH - Filippine 23
SA - Arabia Saudita 22
TH - Thailandia 22
CL - Cile 21
PY - Paraguay 20
UZ - Uzbekistan 18
BE - Belgio 17
LT - Lituania 17
MA - Marocco 17
MY - Malesia 16
BJ - Benin 15
HN - Honduras 15
TN - Tunisia 15
CR - Costa Rica 14
GT - Guatemala 14
TG - Togo 14
TT - Trinidad e Tobago 14
PE - Perù 13
JM - Giamaica 12
JO - Giordania 12
SV - El Salvador 10
HU - Ungheria 9
IR - Iran 9
AU - Australia 8
BG - Bulgaria 8
CW - ???statistics.table.value.countryCode.CW??? 8
CZ - Repubblica Ceca 8
KZ - Kazakistan 8
AE - Emirati Arabi Uniti 7
AL - Albania 7
DO - Repubblica Dominicana 7
NI - Nicaragua 7
RO - Romania 7
DZ - Algeria 6
EG - Egitto 6
ET - Etiopia 6
IL - Israele 6
KE - Kenya 6
UY - Uruguay 6
AZ - Azerbaigian 5
BO - Bolivia 5
CH - Svizzera 5
GP - Guadalupe 5
MM - Myanmar 5
NP - Nepal 5
OM - Oman 5
PR - Porto Rico 5
PS - Palestinian Territory 5
PT - Portogallo 5
QA - Qatar 5
EE - Estonia 4
KG - Kirghizistan 4
KW - Kuwait 4
LB - Libano 4
MD - Moldavia 4
SN - Senegal 4
LV - Lettonia 3
PA - Panama 3
RS - Serbia 3
SI - Slovenia 3
TW - Taiwan 3
BA - Bosnia-Erzegovina 2
BH - Bahrain 2
BN - Brunei Darussalam 2
CM - Camerun 2
Totale 27.126
Salva come PNG Salva come JPEG
Città #
Ashburn 1.543
Singapore 1.479
San Jose 1.234
Southend 1.196
Woodbridge 854
Moscow 810
Jacksonville 804
Chandler 733
Dallas 646
Hong Kong 592
Ann Arbor 463
Dublin 427
The Dalles 403
Houston 383
Council Bluffs 373
Verona 353
Beijing 240
Princeton 191
Lawrence 190
Milan 184
Wilmington 168
Ho Chi Minh City 154
Los Angeles 133
Santa Clara 130
Jinan 118
Columbus 117
New York 115
Nanjing 114
Shenyang 114
Hanoi 109
Boardman 101
Buffalo 90
Redondo Beach 80
Hebei 68
Tianjin 67
Changsha 62
Seoul 62
São Paulo 62
Chicago 55
Zhengzhou 54
Guangzhou 52
Helsinki 47
Munich 43
Phoenix 42
Sindelfingen 42
Rome 41
Ningbo 40
Istanbul 39
Jakarta 37
Nanchang 37
Seattle 36
Hangzhou 34
Haikou 33
North Bergen 33
Norwalk 30
Jiaxing 29
Tokyo 29
Des Moines 27
Washington 27
Abuja 26
Amsterdam 25
Atlanta 25
Rio de Janeiro 25
Frankfurt am Main 24
San Francisco 23
Taizhou 23
Montreal 22
Naples 21
Orem 21
Bangkok 20
London 20
Falls Church 19
Redmond 19
Staranzano 19
Baghdad 18
Belo Horizonte 18
Da Nang 18
Denver 18
Toronto 18
Vienna 18
Chennai 17
Johannesburg 17
Lanzhou 17
Shanghai 17
Tashkent 17
Brooklyn 16
Brussels 16
Guayaquil 16
Las Vegas 16
Stockholm 16
Taiyuan 16
Cotonou 15
Fairfield 15
Lomé 14
Brasília 13
Haiphong 13
Kingston 13
San José 13
Tappahannock 13
Vilnius 13
Totale 16.512
Salva come PNG Salva come JPEG
Nome #
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 283
Incorporating Decision Nodes into Conditional Simple Temporal Networks 224
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 214
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphAlgorithms and Computation 213
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 209
A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games 207
Hyper Temporal Networks 204
Optimal Design of Consistent Simple Temporal Networks 194
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases 190
Covering partially directed graphs with directed paths 189
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 189
A novel min-cost flow method for estimating transcript expression with RNA-Seq. 188
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of PathsAlgorithms in Bioinformatics 188
A Faster Algorithm for Finding Minimum Tucker Submatrices 186
Packing Cycles in Undirected Graphs 186
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 184
A polynomial case of the parsimony haplotyping problem 183
A Simple Minimum T-Cut Algorithm 183
A Faster Algorithm for Finding Minimum Tucker Submatrices. 182
A DP algorithm for speaker change detection 182
Acyclically pushable bipartite permutation digraphs: An algorithm 182
Indecomposable r-graphs and some other counterexamples 180
The Price of Evolution in Temporal Databases 180
Faster and better simple temporal problems 179
Approximating the maximum 3-edge-colorable subgraph problem. 177
A short proof of Konig's matching theorem 177
Least and most colored bases 176
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 176
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 170
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 170
A greedy approach to compute a minimum cycle basis of a directed graph 169
Evaluation of BIC-based algorithms for audio segmentation 168
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG 166
Some Simple Distributed Algorithms for Sparse Networks 164
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 164
Combinatorial Optimization - Polyhedra and efficiency: A book review 163
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics 162
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 162
A note on range-restricted circuit covers 162
An interdisciplinary experimental evaluation on the disjunctive temporal problem 159
Breaking the O(m^2 n) Barrier for Minimum Cycle Bases. 159
On the Recognition of P_4-Indifferent Graphs 159
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty 157
Packing Cuts in Graphs 157
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel 155
Lower bounds for strictly fundamental cycle bases in grid graphs. 150
Complexity of Weak, Strong and Dynamic Controllability of CNCUs 150
Hypercube Computations on Partitioned Optical Passive Stars Networks 149
What Makes the Arc-Preserving Subsequence Problem Hard? 149
Benchmarks for Strictly Fundamental Cycle Bases 149
Packing paths in digraphs 148
Network Synthesis for Distributed Embedded Systems 148
Cycle bases in graphs characterization, algorithms, complexity, and applications. 147
Optimal Omnitig Listing for Safe and Complete Contig Assembly 147
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 147
Dynamic controllability of temporal networks with instantaneous reaction 146
Cycle cover property and CPP=SCC property are not equivalent 146
Packing Cycles and Cuts in Undirected Graphs 145
Pure Parsimony Xor Haplotyping. 145
Approximation of RNA Multiple Structural Alignment 144
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way 144
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. 143
Allocating Servers in Infostations for Bounded Simultaneous Requests 143
On the approximability of the minimum strictly fundamental cycle basis problem. 143
Minimal multiset grammars for recurrent dynamics 143
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 142
Dynamic Controllability and (J,K)-Resiliency in Generalized Constraint Networks with Uncertainty 142
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 141
Allocating Servers in Infostations for On-Demand Communications 141
Haplotyping Populations by Pure Parsimony: Complexity, Exact, and Approximation Algorithms 140
Discovering Predictive Dependencies on Multi-Temporal Relations 139
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 139
When a Dollar Makes a BWT 139
Decomposing subcubic graphs into claws, paths or triangles 139
Polynomial and APX-hard cases of the Individual Haplotyping Problem 138
On d-Threshold Graphs and d-Dimensional Bin Packing 138
Approximation of RNA multiple structural alignment. 136
Minimum Mosaic Inference of a Set of Recombinants 136
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication 136
Strong Controllability of Temporal Networks with Decisions 135
A simplified algorithm computing all s-t bridges and articulation points 135
Algorithmic Aspects of Small Quasi-Kernels 134
Pattern Matching in Protein-Protein Interaction Graphs 134
Haplotyping for Disease Association: A Combinatorial Approach 133
Optimal receiver scheduling algorithms for a multicast problem. 133
The Complexity of Simulation and Matrix Multiplication 133
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier 133
Konig's Edge Coloring Theorem without augmenting paths 133
Eserciziario di matematica I e II 132
On minimizing symmetric set functions 132
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. 131
Checking Sets of Pure Evolving Association Rules 131
Complexity Insights of the Minimum Duplication Problem 130
Scheduling data broadcasts on wireless channels: exact solutions and heuristics 130
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval 129
When a dollar makes a BWT 129
On 4-connected graphs without even cycle decompositions 128
On the Complexity of Resource Controllability in Business Process Management 128
On the complexity of digraph packings 127
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time 127
Totale 15.800
Salva come PNG Salva come JPEG
Categoria #
all - tutte 95.601
article - articoli 54.168
book - libri 787
conference - conferenze 39.386
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.260
Totale 191.202
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022793 0 0 0 23 74 95 44 103 42 20 82 310
2022/20232.539 239 140 271 458 204 590 62 167 273 18 79 38
2023/20241.253 57 143 109 89 183 86 78 154 30 93 141 90
2024/20253.938 236 326 149 583 126 112 155 389 601 223 285 753
2025/202610.587 785 492 729 1.369 2.166 704 1.032 628 996 801 400 485
2026/20272.222 182 467 551 1.022 0 0 0 0 0 0 0 0
Totale 27.406