CATALOGO DEI PRODOTTI DELLA RICERCA

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021104 0 0 0 0 0 0 0 0 0 0 0 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/202610.643 789 496 737 1.378 2.184 706 1.036 633 1.001 805 401 477
Totale 25.304