CATALOGO DEI PRODOTTI DELLA RICERCA

RIZZI, Romeo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.319
EU - Europa 4.392
AS - Asia 2.285
AF - Africa 20
OC - Oceania 6
SA - Sud America 6
Continente sconosciuto - Info sul continente non disponibili 3
Totale 12.031
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.296
GB - Regno Unito 1.420
CN - Cina 1.337
SG - Singapore 729
SE - Svezia 534
FR - Francia 506
RU - Federazione Russa 468
IE - Irlanda 426
FI - Finlandia 322
IT - Italia 270
DE - Germania 264
UA - Ucraina 86
KR - Corea 78
TR - Turchia 48
CA - Canada 21
HK - Hong Kong 21
NL - Olanda 21
BE - Belgio 16
VN - Vietnam 16
ID - Indonesia 14
TG - Togo 14
IN - India 10
PL - Polonia 10
AT - Austria 7
IR - Iran 7
AU - Australia 5
JP - Giappone 5
RO - Romania 5
ES - Italia 4
PK - Pakistan 4
BG - Bulgaria 3
CH - Svizzera 3
CZ - Repubblica Ceca 3
HU - Ungheria 3
PT - Portogallo 3
RS - Serbia 3
TW - Taiwan 3
BD - Bangladesh 2
BR - Brasile 2
CL - Cile 2
CM - Camerun 2
CO - Colombia 2
EE - Estonia 2
EU - Europa 2
KZ - Kazakistan 2
LK - Sri Lanka 2
LU - Lussemburgo 2
MA - Marocco 2
MT - Malta 2
SA - Arabia Saudita 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AD - Andorra 1
AE - Emirati Arabi Uniti 1
AN - Antille olandesi 1
BN - Brunei Darussalam 1
DK - Danimarca 1
IM - Isola di Man 1
LT - Lituania 1
LV - Lettonia 1
MD - Moldavia 1
MM - Myanmar 1
MX - Messico 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PH - Filippine 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
TN - Tunisia 1
ZA - Sudafrica 1
Totale 12.031
Salva come PNG Salva come JPEG
Città #
Southend 1.198
Woodbridge 862
Jacksonville 801
Chandler 733
Singapore 604
Ann Arbor 462
Dublin 420
Houston 369
Ashburn 236
Princeton 191
Lawrence 190
Beijing 173
Wilmington 170
Jinan 118
Nanjing 115
Shenyang 113
Boardman 98
Verona 90
Hebei 68
Seoul 59
Tianjin 58
Changsha 54
Zhengzhou 47
New York 43
Sindelfingen 42
Santa Clara 41
Guangzhou 40
Helsinki 40
Ningbo 39
Milan 36
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
Hong Kong 17
Brussels 16
Lanzhou 16
Taiyuan 16
Jakarta 14
Lomé 14
Chicago 13
Fairfield 13
Tappahannock 13
Amsterdam 12
Los Angeles 12
Fuzhou 10
Rome 10
Mezzocorona 8
Munich 8
Ottawa 8
Phoenix 8
Stockholm 7
Tehran 7
Balin 6
Dong Ket 6
Redwood City 6
Saint-Étienne-du-Rouvray 6
San Francisco 6
Shanghai 6
Vicenza 6
Auburn Hills 5
Dongguan 5
Frankfurt am Main 5
San Jose 5
Shenzhen 5
Tokyo 5
Tombolo 5
Toronto 5
Vienna 5
Vélizy 5
Lancaster 4
Padova 4
Trento 4
Xingtai 4
Belgrade 3
Coppell 3
Dalian 3
Düsseldorf 3
Edinburgh 3
Falkenstein 3
Groningen 3
Islamabad 3
London 3
Madrid 3
New Orleans 3
Paris 3
Qingdao 3
Riva 3
Saint Petersburg 3
San Diego 3
Siena 3
Totale 8.223
Salva come PNG Salva come JPEG
Nome #
Optimal Design of Consistent Simple Temporal Networks 137
The Price of Evolution in Temporal Databases 126
Incorporating Decision Nodes into Conditional Simple Temporal Networks 117
Hyper Temporal Networks 113
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 113
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 112
Indecomposable r-graphs and some other counterexamples 112
Covering partially directed graphs with directed paths 107
Combinatorial Optimization - Polyhedra and efficiency: A book review 99
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 96
A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games 95
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics 93
Some Simple Distributed Algorithms for Sparse Networks 92
Cycle cover property and CPP=SCC property are not equivalent 91
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. 90
A polynomial case of the parsimony haplotyping problem 90
Hypercube Computations on Partitioned Optical Passive Stars Networks 90
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 89
Approximation of RNA Multiple Structural Alignment 89
Haplotyping Populations by Pure Parsimony: Complexity, Exact, and Approximation Algorithms 88
Packing Cuts in Graphs 88
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem 87
Breaking the O(m^2 n) Barrier for Minimum Cycle Bases. 86
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 86
What Makes the Arc-Preserving Subsequence Problem Hard? 86
Evaluation of BIC-based algorithms for audio segmentation 86
Minimal multiset grammars for recurrent dynamics 85
A Simple Minimum T-Cut Algorithm 83
On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks. 82
A Faster Algorithm for Finding Minimum Tucker Submatrices. 82
A short proof of Konig's matching theorem 82
Lower bounds for strictly fundamental cycle bases in grid graphs. 81
Approximating the maximum 3-edge-colorable subgraph problem. 81
Allocating Servers in Infostations for Bounded Simultaneous Requests 81
On the approximability of the minimum strictly fundamental cycle basis problem. 81
Konig's Edge Coloring Theorem without augmenting paths 81
A novel min-cost flow method for estimating transcript expression with RNA-Seq. 81
Cycle bases in graphs characterization, algorithms, complexity, and applications. 80
Least and most colored bases 80
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 80
A Faster Algorithm for Finding Minimum Tucker Submatrices 79
Haplotyping for Disease Association: A Combinatorial Approach 79
Allocating Servers in Infostations for On-Demand Communications 79
Approximation of RNA multiple structural alignment. 78
Benchmarks for Strictly Fundamental Cycle Bases 78
Packing Cycles in Undirected Graphs 78
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem 78
Packing paths in digraphs 77
A DP algorithm for speaker change detection 76
Faster and better simple temporal problems 76
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval 75
On 4-connected graphs without even cycle decompositions 75
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of PathsAlgorithms in Bioinformatics 75
Channel Assignment in Honeycomb Networks 74
Pure Parsimony Xor Haplotyping. 74
Complexity of Weak, Strong and Dynamic Controllability of CNCUs 74
Packing Cycles and Cuts in Undirected Graphs 73
Optimal receiver scheduling algorithms for a multicast problem. 73
Polynomial and APX-hard cases of the Individual Haplotyping Problem 73
On the Recognition of P_4-Indifferent Graphs 73
Minimum Mosaic Inference of a Set of Recombinants 73
Acyclically pushable bipartite permutation digraphs: An algorithm 73
Routing Permutations in Partitioned Optical Passive Star Networks 72
Strong Controllability of Temporal Networks with Decisions 72
Network Synthesis for Distributed Embedded Systems 71
Eserciziario di matematica I e II 70
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 70
Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphAlgorithms and Computation 70
A note on range-restricted circuit covers 70
Impaccando T-tagli e T-giunti 69
Scheduling data broadcasts on wireless channels: exact solutions and heuristics 69
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions 69
Oriented star packings 68
Packing Triangles in Bounded Degree Graphs 67
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. 67
Hierarchical Clustering Using the Arithmetic-Harmonic Cut: Complexity and Experiments 66
On minimizing symmetric set functions 66
On cycle bases with limited edge overlap. 66
Complexity Insights of the Minimum Duplication Problem 65
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly 65
Discovering Evolving Temporal Information: Theory and Application to Clinical Databases 65
Genomes Containing Duplicates Are Hard to Compare 65
Excessive factorizations of bipartite multigraphs. 65
Dominating sequences in graphs 63
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 63
Some Results on more Flexible Versions of Graph Motif 63
Routing Permutations in Partitioned Optical Passive Stars Networks 62
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 62
Online Permutation Routing in Partitioned Optical Passive Star Networks 62
Mapping hypercube computations onto Partitioned Optical Passive Star Networks 62
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs 62
Conserved Interval Distance Computation Between Non-trivial Genomes 62
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel 62
Amortized \~O(\(\vert\)V\(\vert\)) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs 62
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 62
The Complexity of Simulation and Matrix Multiplication 62
Complexity issues in color-preserving graph embeddings. 61
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 61
Shortest Paths in Conservative Graphs 61
On the Trade-Off Between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks 61
Totale 7.841
Salva come PNG Salva come JPEG
Categoria #
all - tutte 46.358
article - articoli 25.581
book - libri 422
conference - conferenze 19.649
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 706
Totale 92.716
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020676 0 0 0 0 0 106 170 69 55 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/20251.538 237 328 149 587 126 111 0 0 0 0 0 0
Totale 12.243