CATALOGO DEI PRODOTTI DELLA RICERCA

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020834 0 0 0 114 44 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/2025761 237 328 149 47 0 0 0 0 0 0 0 0
Totale 11.466