CATALOGO DEI PRODOTTI DELLA RICERCA

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022814 0 0 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.651 789 496 737 1.378 2.184 706 1.036 633 1.001 805 401 485
2026/2027653 183 468 2 0 0 0 0 0 0 0 0 0
Totale 25.965