CATALOGO DEI PRODOTTI DELLA RICERCA

RIZZI, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.177
EU - Europa 7.175
AS - Asia 5.492
SA - Sud America 731
AF - Africa 92
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 20.679
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.092
RU - Federazione Russa 2.706
SG - Singapore 2.390
CN - Cina 1.679
GB - Regno Unito 1.464
BR - Brasile 570
FR - Francia 550
HK - Hong Kong 545
IT - Italia 543
SE - Svezia 542
IE - Irlanda 430
FI - Finlandia 337
DE - Germania 331
VN - Vietnam 253
KR - Corea 229
TR - Turchia 101
UA - Ucraina 91
AR - Argentina 56
IN - India 53
ID - Indonesia 47
BD - Bangladesh 42
CA - Canada 37
EC - Ecuador 34
PL - Polonia 31
NL - Olanda 29
MX - Messico 26
IQ - Iraq 24
AT - Austria 23
PK - Pakistan 23
ZA - Sudafrica 22
CO - Colombia 20
BE - Belgio 17
BJ - Benin 15
ES - Italia 15
TG - Togo 14
PY - Paraguay 13
VE - Venezuela 12
JP - Giappone 11
TH - Thailandia 11
CL - Cile 10
MA - Marocco 10
SA - Arabia Saudita 9
MY - Malesia 8
TN - Tunisia 8
UZ - Uzbekistan 8
CZ - Repubblica Ceca 7
IR - Iran 7
JO - Giordania 7
RO - Romania 7
AE - Emirati Arabi Uniti 6
AL - Albania 6
AU - Australia 6
KE - Kenya 6
PE - Perù 6
BG - Bulgaria 5
DO - Repubblica Dominicana 5
KZ - Kazakistan 5
LT - Lituania 5
MM - Myanmar 5
UY - Uruguay 5
BO - Bolivia 4
EG - Egitto 4
HU - Ungheria 4
IL - Israele 4
PT - Portogallo 4
CH - Svizzera 3
MD - Moldavia 3
PA - Panama 3
RS - Serbia 3
TT - Trinidad e Tobago 3
TW - Taiwan 3
BN - Brunei Darussalam 2
CM - Camerun 2
DK - Danimarca 2
EE - Estonia 2
EU - Europa 2
HN - Honduras 2
KG - Kirghizistan 2
KW - Kuwait 2
LK - Sri Lanka 2
LU - Lussemburgo 2
MT - Malta 2
NO - Norvegia 2
NP - Nepal 2
OM - Oman 2
PH - Filippine 2
QA - Qatar 2
SI - Slovenia 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
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BY - Bielorussia 1
CG - Congo 1
CI - Costa d'Avorio 1
CR - Costa Rica 1
Totale 20.655
Salva come PNG Salva come JPEG
Città #
Southend 1.198
Singapore 1.126
Woodbridge 862
Moscow 817
Jacksonville 801
Chandler 733
Dallas 585
Hong Kong 541
Ashburn 512
Ann Arbor 462
Dublin 425
Houston 374
The Dalles 246
Beijing 225
Princeton 191
Lawrence 190
Wilmington 170
Milan 133
Verona 132
Jinan 118
Nanjing 115
Shenyang 114
Columbus 106
Boardman 98
Los Angeles 96
Ho Chi Minh City 88
Redondo Beach 80
Buffalo 74
Hebei 68
Tianjin 66
New York 65
Changsha 61
Seoul 61
Zhengzhou 54
São Paulo 51
Guangzhou 50
Hanoi 50
Santa Clara 50
Helsinki 43
Munich 43
Sindelfingen 42
Ningbo 40
Istanbul 39
Nanchang 37
Seattle 34
Haikou 33
Hangzhou 32
Jakarta 32
Jiaxing 29
Norwalk 28
Taizhou 23
Washington 23
North Bergen 22
Des Moines 19
Falls Church 19
Redmond 19
Rio de Janeiro 19
Amsterdam 18
Belo Horizonte 18
Chicago 18
Vienna 18
Lanzhou 17
London 17
Brussels 16
Taiyuan 16
Cotonou 15
Council Bluffs 15
Rome 15
Frankfurt am Main 14
Johannesburg 14
Lomé 14
Phoenix 14
San Francisco 14
Stockholm 14
Chennai 13
Fairfield 13
Guayaquil 13
San Jose 13
Tappahannock 13
Warsaw 13
Atlanta 12
Shanghai 12
Baghdad 11
Bangkok 11
Brasília 11
Dhaka 11
Brooklyn 10
Fuzhou 10
Tokyo 10
Biên Hòa 9
Da Nang 9
Haiphong 9
Porto Alegre 9
Ribeirão Preto 9
Trento 9
Mezzocorona 8
Montreal 8
Ottawa 8
Tashkent 8
Toronto 8
Totale 12.301
Salva come PNG Salva come JPEG
Nome #
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 174
Optimal Design of Consistent Simple Temporal Networks 174
A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games 173
Incorporating Decision Nodes into Conditional Simple Temporal Networks 173
Hyper Temporal Networks 171
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 161
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 161
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphAlgorithms and Computation 156
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of PathsAlgorithms in Bioinformatics 156
A polynomial case of the parsimony haplotyping problem 155
The Price of Evolution in Temporal Databases 154
A DP algorithm for speaker change detection 151
A Faster Algorithm for Finding Minimum Tucker Submatrices. 150
Covering partially directed graphs with directed paths 150
A novel min-cost flow method for estimating transcript expression with RNA-Seq. 149
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 146
Indecomposable r-graphs and some other counterexamples 145
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 144
A Simple Minimum T-Cut Algorithm 143
Faster and better simple temporal problems 143
A Faster Algorithm for Finding Minimum Tucker Submatrices 142
A short proof of Konig's matching theorem 142
Combinatorial Optimization - Polyhedra and efficiency: A book review 140
Acyclically pushable bipartite permutation digraphs: An algorithm 139
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases 139
Least and most colored bases 138
Approximating the maximum 3-edge-colorable subgraph problem. 135
Breaking the O(m^2 n) Barrier for Minimum Cycle Bases. 134
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 133
A note on range-restricted circuit covers 133
Evaluation of BIC-based algorithms for audio segmentation 130
Some Simple Distributed Algorithms for Sparse Networks 126
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 125
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 125
A greedy approach to compute a minimum cycle basis of a directed graph 125
Hypercube Computations on Partitioned Optical Passive Stars Networks 124
Benchmarks for Strictly Fundamental Cycle Bases 123
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 123
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics 122
Cycle bases in graphs characterization, algorithms, complexity, and applications. 122
Packing paths in digraphs 122
Complexity of Weak, Strong and Dynamic Controllability of CNCUs 122
What Makes the Arc-Preserving Subsequence Problem Hard? 121
Optimal Omnitig Listing for Safe and Complete Contig Assembly 121
Minimal multiset grammars for recurrent dynamics 121
On the approximability of the minimum strictly fundamental cycle basis problem. 120
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 120
Packing Cycles and Cuts in Undirected Graphs 119
Packing Cycles in Undirected Graphs 119
Cycle cover property and CPP=SCC property are not equivalent 119
Haplotyping Populations by Pure Parsimony: Complexity, Exact, and Approximation Algorithms 118
Pure Parsimony Xor Haplotyping. 118
Approximation of RNA Multiple Structural Alignment 115
An interdisciplinary experimental evaluation on the disjunctive temporal problem 113
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. 113
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 113
Allocating Servers in Infostations for Bounded Simultaneous Requests 112
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 112
Haplotyping for Disease Association: A Combinatorial Approach 111
Packing Cuts in Graphs 111
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way 110
Allocating Servers in Infostations for On-Demand Communications 109
On d-Threshold Graphs and d-Dimensional Bin Packing 108
A novel min-cost flow method for estimating transcript expression with RNA-Seq: Bounding the number of paths 108
Network Synthesis for Distributed Embedded Systems 108
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG 108
Dynamic controllability of temporal networks with instantaneous reaction 107
Algorithmic Aspects of Small Quasi-Kernels 107
Approximation of RNA multiple structural alignment. 107
Lower bounds for strictly fundamental cycle bases in grid graphs. 107
Scheduling data broadcasts on wireless channels: exact solutions and heuristics 107
Strong Controllability of Temporal Networks with Decisions 107
Dynamic Controllability and (J,K)-Resiliency in Generalized Constraint Networks with Uncertainty 107
Konig's Edge Coloring Theorem without augmenting paths 107
On the Recognition of P_4-Indifferent Graphs 105
On 4-connected graphs without even cycle decompositions 105
The Complexity of Simulation and Matrix Multiplication 105
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty 104
Channel Assignment in Honeycomb Networks 103
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval 103
Polynomial Time Instances for the IKHO Problem 103
Minimum Mosaic Inference of a Set of Recombinants 103
Polynomial and APX-hard cases of the Individual Haplotyping Problem 102
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals 102
Optimal receiver scheduling algorithms for a multicast problem. 101
Checking Sets of Pure Evolving Association Rules 101
Impaccando T-tagli e T-giunti 100
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel 100
Oriented star packings 99
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 99
Pattern Matching in Protein-Protein Interaction Graphs 99
Amortized \~O(\(\vert\)V\(\vert\)) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs 99
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. 99
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier 99
On the Complexity of Resource Controllability in Business Process Management 99
Some Results on more Flexible Versions of Graph Motif 99
Make your programs compete and watch them play in the Code Colosseum 98
Complexity Insights of the Minimum Duplication Problem 97
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem 97
Dominating sequences in graphs 97
Totale 12.214
Salva come PNG Salva come JPEG
Categoria #
all - tutte 73.613
article - articoli 41.198
book - libri 611
conference - conferenze 30.793
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.011
Totale 147.226
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021645 0 0 0 0 0 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/20266.239 789 496 737 1.378 2.184 655 0 0 0 0 0 0
Totale 20.900