CATALOGO DEI PRODOTTI DELLA RICERCA

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021303 0 0 0 0 0 0 0 0 0 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/20269.707 789 496 737 1.378 2.184 706 1.036 633 1.001 747 0 0
Totale 24.368