CATALOGO DEI PRODOTTI DELLA RICERCA

RIZZI, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.470
EU - Europa 4.676
AS - Asia 2.922
SA - Sud America 179
AF - Africa 29
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 3
Totale 13.285
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.437
GB - Regno Unito 1.420
CN - Cina 1.337
SG - Singapore 1.213
SE - Svezia 534
IT - Italia 516
FR - Francia 506
RU - Federazione Russa 470
IE - Irlanda 428
FI - Finlandia 326
DE - Germania 279
BR - Brasile 144
KR - Corea 107
HK - Hong Kong 102
UA - Ucraina 87
TR - Turchia 54
NL - Olanda 24
CA - Canada 21
BE - Belgio 16
VN - Vietnam 16
AT - Austria 15
ID - Indonesia 15
TG - Togo 14
IN - India 12
AR - Argentina 11
PL - Polonia 10
PK - Pakistan 9
BD - Bangladesh 8
IQ - Iraq 8
IR - Iran 7
CO - Colombia 6
EC - Ecuador 6
AU - Australia 5
JP - Giappone 5
MA - Marocco 5
MX - Messico 5
RO - Romania 5
UZ - Uzbekistan 5
ES - Italia 4
KZ - Kazakistan 4
VE - Venezuela 4
BG - Bulgaria 3
CH - Svizzera 3
CL - Cile 3
CZ - Repubblica Ceca 3
HU - Ungheria 3
KE - Kenya 3
PT - Portogallo 3
PY - Paraguay 3
RS - Serbia 3
SA - Arabia Saudita 3
TW - Taiwan 3
AE - Emirati Arabi Uniti 2
CM - Camerun 2
DO - Repubblica Dominicana 2
EE - Estonia 2
EU - Europa 2
JO - Giordania 2
LK - Sri Lanka 2
LT - Lituania 2
LU - Lussemburgo 2
MD - Moldavia 2
MT - Malta 2
UY - Uruguay 2
ZA - Sudafrica 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AD - Andorra 1
AL - Albania 1
AN - Antille olandesi 1
BN - Brunei Darussalam 1
CI - Costa d'Avorio 1
DK - Danimarca 1
HN - Honduras 1
IL - Israele 1
IM - Isola di Man 1
JM - Giamaica 1
KW - Kuwait 1
LV - Lettonia 1
MM - Myanmar 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
PA - Panama 1
PH - Filippine 1
QA - Qatar 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
SV - El Salvador 1
TN - Tunisia 1
Totale 13.285
Salva come PNG Salva come JPEG
Città #
Southend 1.198
Woodbridge 862
Jacksonville 801
Singapore 762
Chandler 733
Ann Arbor 462
Dublin 422
Houston 369
Ashburn 236
Princeton 191
Lawrence 190
Beijing 173
Wilmington 170
Verona 131
Milan 126
Jinan 118
Nanjing 115
Shenyang 113
Boardman 98
Hong Kong 98
The Dalles 85
Hebei 68
Seoul 59
Tianjin 58
Changsha 54
Zhengzhou 47
Helsinki 43
New York 43
Sindelfingen 42
Santa Clara 41
Guangzhou 40
Ningbo 39
Nanchang 36
Haikou 33
Seattle 31
Hangzhou 29
Jiaxing 29
Norwalk 28
Taizhou 23
North Bergen 22
Washington 22
Dallas 21
Moscow 20
Falls Church 19
Redmond 19
Brussels 16
Lanzhou 16
Taiyuan 16
Amsterdam 15
Jakarta 14
Lomé 14
Rome 14
Chicago 13
Fairfield 13
Los Angeles 13
Tappahannock 13
Vienna 13
Council Bluffs 11
Fuzhou 10
Belo Horizonte 9
Trento 9
Mezzocorona 8
Munich 8
Ottawa 8
Phoenix 8
Monza 7
Padova 7
Stockholm 7
São Paulo 7
Tehran 7
Baghdad 6
Balin 6
Dong Ket 6
Naples 6
Redwood City 6
Saint-Étienne-du-Rouvray 6
San Francisco 6
Shanghai 6
Vicenza 6
Auburn Hills 5
Dongguan 5
Florence 5
Frankfurt am Main 5
Rimini 5
San Jose 5
Shenzhen 5
Tashkent 5
Tokyo 5
Tombolo 5
Toronto 5
Turin 5
Vélizy 5
Brescia 4
Dhaka 4
Islamabad 4
Lancaster 4
Nuremberg 4
Rio de Janeiro 4
Xingtai 4
Belgrade 3
Totale 8.745
Salva come PNG Salva come JPEG
Nome #
Optimal Design of Consistent Simple Temporal Networks 141
The Price of Evolution in Temporal Databases 128
Incorporating Decision Nodes into Conditional Simple Temporal Networks 123
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 120
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 115
Hyper Temporal Networks 115
Indecomposable r-graphs and some other counterexamples 115
Covering partially directed graphs with directed paths 113
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 108
Combinatorial Optimization - Polyhedra and efficiency: A book review 106
Breaking the O(m^2 n) Barrier for Minimum Cycle Bases. 104
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 103
Evaluation of BIC-based algorithms for audio segmentation 101
Hypercube Computations on Partitioned Optical Passive Stars Networks 99
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics 99
Least and most colored bases 99
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 99
A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games 97
Some Simple Distributed Algorithms for Sparse Networks 96
Cycle cover property and CPP=SCC property are not equivalent 96
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 94
A polynomial case of the parsimony haplotyping problem 94
A Faster Algorithm for Finding Minimum Tucker Submatrices. 93
A DP algorithm for speaker change detection 93
Approximation of RNA Multiple Structural Alignment 92
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphAlgorithms and Computation 92
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of PathsAlgorithms in Bioinformatics 92
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 91
Haplotyping Populations by Pure Parsimony: Complexity, Exact, and Approximation Algorithms 91
Packing Cuts in Graphs 91
Cycle bases in graphs characterization, algorithms, complexity, and applications. 89
What Makes the Arc-Preserving Subsequence Problem Hard? 89
Pure Parsimony Xor Haplotyping. 89
Minimal multiset grammars for recurrent dynamics 89
A Simple Minimum T-Cut Algorithm 88
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. 87
A short proof of Konig's matching theorem 87
Lower bounds for strictly fundamental cycle bases in grid graphs. 86
Approximating the maximum 3-edge-colorable subgraph problem. 86
Allocating Servers in Infostations for Bounded Simultaneous Requests 86
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases 86
A novel min-cost flow method for estimating transcript expression with RNA-Seq. 86
On the approximability of the minimum strictly fundamental cycle basis problem. 85
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 85
Konig's Edge Coloring Theorem without augmenting paths 84
A Faster Algorithm for Finding Minimum Tucker Submatrices 83
Benchmarks for Strictly Fundamental Cycle Bases 83
Packing paths in digraphs 82
Faster and better simple temporal problems 82
Haplotyping for Disease Association: A Combinatorial Approach 81
Packing Cycles in Undirected Graphs 81
Allocating Servers in Infostations for On-Demand Communications 81
Approximation of RNA multiple structural alignment. 80
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem 80
Network Synthesis for Distributed Embedded Systems 79
A note on range-restricted circuit covers 79
Acyclically pushable bipartite permutation digraphs: An algorithm 79
Channel Assignment in Honeycomb Networks 78
Polynomial and APX-hard cases of the Individual Haplotyping Problem 78
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval 78
Complexity of Weak, Strong and Dynamic Controllability of CNCUs 78
Packing Cycles and Cuts in Undirected Graphs 77
Optimal receiver scheduling algorithms for a multicast problem. 77
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 77
On 4-connected graphs without even cycle decompositions 77
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. 77
On the Recognition of P_4-Indifferent Graphs 76
Routing Permutations in Partitioned Optical Passive Star Networks 76
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel 75
Minimum Mosaic Inference of a Set of Recombinants 75
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 75
On cycle bases with limited edge overlap. 75
Strong Controllability of Temporal Networks with Decisions 74
Oriented star packings 73
Impaccando T-tagli e T-giunti 73
Eserciziario di matematica I e II 73
Scheduling data broadcasts on wireless channels: exact solutions and heuristics 73
Amortized \~O(\(\vert\)V\(\vert\)) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs 73
Polynomial Time Instances for the IKHO Problem 72
On minimizing symmetric set functions 72
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 70
Packing Triangles in Bounded Degree Graphs 70
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 70
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly 69
Complexity Insights of the Minimum Duplication Problem 68
Hierarchical Clustering Using the Arithmetic-Harmonic Cut: Complexity and Experiments 68
Genomes Containing Duplicates Are Hard to Compare 68
Some Results on more Flexible Versions of Graph Motif 68
Excessive factorizations of bipartite multigraphs. 68
Ranking, unranking and random generation of extensional acyclic digraphs 67
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 67
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way 67
Complexity issues in color-preserving graph embeddings. 66
Routing Permutations in Partitioned Optical Passive Stars Networks 66
Pattern Matching in Protein-Protein Interaction Graphs 66
Mapping hypercube computations onto Partitioned Optical Passive Star Networks 66
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs 66
Dominating sequences in graphs 66
The Complexity of Simulation and Matrix Multiplication 66
Checking Sets of Pure Evolving Association Rules 66
Totale 8.452
Salva come PNG Salva come JPEG
Categoria #
all - tutte 51.934
article - articoli 28.795
book - libri 463
conference - conferenze 21.920
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 756
Totale 103.868
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020276 0 0 0 0 0 0 0 0 0 113 24 139
2020/20211.518 89 429 66 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/20252.800 237 328 149 587 126 113 156 389 604 111 0 0
Totale 13.505