DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 17.473
NA - Nord America 6.381
AS - Asia 1.797
AF - Africa 12
Continente sconosciuto - Info sul continente non disponibili 10
OC - Oceania 10
SA - Sud America 7
Totale 25.690
Salva come PNG Salva come JPEG
Nazione #
GB - Regno Unito 7.102
US - Stati Uniti d'America 6.119
IE - Irlanda 3.615
PL - Polonia 2.848
CN - Cina 1.111
RU - Federazione Russa 1.081
IT - Italia 832
DE - Germania 558
FR - Francia 509
SE - Svezia 413
CA - Canada 258
UA - Ucraina 238
SG - Singapore 213
IN - India 90
VN - Vietnam 82
FI - Finlandia 79
KR - Corea 72
TR - Turchia 62
AT - Austria 57
NL - Olanda 46
ID - Indonesia 44
JP - Giappone 26
EU - Europa 23
IR - Iran 21
BE - Belgio 19
HK - Hong Kong 16
CZ - Repubblica Ceca 15
LT - Lituania 14
TW - Taiwan 14
RO - Romania 13
MY - Malesia 11
AU - Australia 10
CH - Svizzera 7
ES - Italia 7
PH - Filippine 7
SI - Slovenia 6
PK - Pakistan 5
CO - Colombia 4
ET - Etiopia 4
PT - Portogallo 4
SA - Arabia Saudita 4
UZ - Uzbekistan 4
YE - Yemen 4
MX - Messico 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BD - Bangladesh 2
BR - Brasile 2
DK - Danimarca 2
EG - Egitto 2
JO - Giordania 2
NO - Norvegia 2
SY - Repubblica araba siriana 2
TN - Tunisia 2
BH - Bahrain 1
BJ - Benin 1
BY - Bielorussia 1
EE - Estonia 1
GR - Grecia 1
IL - Israele 1
IQ - Iraq 1
IS - Islanda 1
MD - Moldavia 1
MV - Maldive 1
NE - Niger 1
NG - Nigeria 1
OM - Oman 1
PA - Panama 1
PE - Perù 1
RS - Serbia 1
ZA - Sudafrica 1
Totale 25.705
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.840
Jacksonville 787
Chandler 458
Fairfield 375
Ashburn 331
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 221
Woodbridge 211
Mountain View 210
Toronto 171
Dalmine 164
Houston 157
Seattle 156
Boardman 155
Beijing 150
Dearborn 150
Bergamo 129
Cambridge 120
Shanghai 106
Altamura 97
Moscow 97
San Mateo 95
Singapore 90
Nanchang 85
Redwood City 74
Atlanta 73
Dong Ket 72
Fredericton 69
Andover 68
London 61
Milan 55
Washington 55
Kocaeli 51
Kunming 45
Vienna 45
Ogden 44
Hebei 37
Rancio Valcuvia 35
Jakarta 32
Sunnyvale 31
Shenyang 29
Jiaxing 26
Hangzhou 25
Needham Heights 23
Tianjin 22
Los Angeles 21
Chicago 19
Changsha 18
Seoul 17
Hefei 15
Hounslow 15
Brussels 14
Amsterdam 13
Auburn Hills 13
Brno 13
Changchun 13
Fremont 13
Phoenix 13
Chennai 12
Jinan 12
Pune 12
Taipei 12
Lanzhou 11
Acton 10
Guangzhou 10
Norwalk 10
Ottawa 10
Padova 10
Falls Church 9
Kiez 9
Verona 9
Zhengzhou 9
Azzano Decimo 8
Bucharest 8
Graz 8
Kilburn 8
Munich 8
New York 8
Paris 8
San Diego 8
Tokyo 8
Dallas 7
Dresden 7
Hanoi 7
Hanover 7
Helsinki 7
North Bergen 7
Nuremberg 7
Perugia 7
Philadelphia 7
Redmond 7
Tappahannock 7
Chiswick 6
Frankfurt am Main 6
Haikou 6
Ljubljana 6
Totale 20.088
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 578
The link between orthology relations and gene trees: a correction perspective 531
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 485
Polytomy refinement for the correction of dubious duplications in gene trees 477
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 474
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 471
Parameterized complexity and approximation issues for the colorful components problems 466
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 463
Parameterized tractability of the maximum-duo preservation string mapping problem 455
The longest filled common subsequence problem 452
Clique editing to support case versus control discrimination 448
Correcting gene trees by leaf insertions: complexity and approximation 445
Approximating the correction of weighted and unweighted orthology and paralogy relations 440
Kernel Methods: Support Vector Machines 402
Reconciling multiple genes trees via segmental duplications and losses 335
Complexity issues in vertex-colored graph pattern matching 325
The binary perfect phylogeny with persistent characters 314
Pure Parsimony Xor Haplotyping 305
Fixed-parameter algorithms for scaffold filling 305
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 302
Finding approximate and constrained motifs in Graphs 295
New results for the Longest Haplotype Reconstruction problem 294
Weak pattern matching in colored graphs: Minimizing the number of connected components 294
Computational methods for resting-state EEG of patients with disorders of consciousness 294
Restricted and Swap Common Superstring: A Parameterized View 293
On the parameterized complexity of the repetition free longest common subsequence problem 286
Exemplar Longest Common Subsequence 286
The l-Diversity problem: tractability and approximability 281
Moving Assistive Technology on the Web: The Farfalla Experience 280
Farfalla: a step toward an inclusive web 278
Fingerprint Clustering with Bounded Number of Missing Values 274
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 274
Complexity Insights of the Minimum Duplication Problem 273
Pure Parsimony Xor Haplotyping 256
The k-Anonymity Problem Is Hard 255
Fixed-Parameter Algorithms for Scaffold Filling 255
On the Approximation of Correlation Clustering and Consensus Clustering 252
Finding approximate and constrained motifs in graphs 251
Beyond evolutionary trees 250
Parameterized complexity of k-anonymity: hardness and tractability 250
Aligning and Labeling Genomes under the Duplication-Loss Model 248
Minimum Factorization Agreement of Spliced ESTs 245
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 241
Reconciling multiple genes trees via segmental duplications and losses 241
The Haplotyping Problem: An Overview of Computational Models and Solutions 240
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 240
Variants of constrained longest common subsequence 238
Duplication-Loss Genome Alignment: Complexity and Algorithm 237
Complexity insights of the Minimum Duplication problem 237
Graph Algorithms 236
Beyond Evolutionary Trees 235
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 233
The Longest Haplotype Reconstruction Problem Revisited 233
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 231
Signal Transduction Networks via Transitive Reductions of Directed Graphs 231
On the Complexity of the l-diversity Problem 229
Maximum disjoint paths on edge-colored graphs: approximability and tractability 229
Top-k overlapping densest subgraphs: Approximation and complexity 229
The constrained shortest common supersequence problem 228
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 227
Anonymizing binary and small tables is hard to approximate 225
HapCol: Accurate and memory-efficient haplotype assembly from long reads 223
Covering Pairs in Directed Acyclic Graphs 222
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 221
The Comparison of Phylogenetic Networks: Algorithms and Complexity 220
Maximum Motif Problem in Vertex-Colored Graphs 218
Robust Conclusions in Mass Spectrometry Analysis 213
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 210
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 200
Parameterized Complexity of k-Anonymity: Hardness and Tractability 199
When and How the Perfect Phylogeny Model Explains Evolution 195
A clustering algorithm for planning the integration process of a large number of conceptual schemas 190
Kernel Machines: Introduction 187
Optimized Social Explanation for Educational Platforms 187
Restricted and swap common superstring: a multivariate algorithmic perspective 176
Correcting gene tree by removal and modification: tractability and approximability 173
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 170
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 170
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 169
Covering pairs in directed acyclic graphs 167
Kernel Machines: Applications 155
Covering a Graph with Clubs 155
On the tractability of finding disjoint clubs in a network 144
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 144
Genetic algorithms for finding episodes in temporal networks 144
Covering with clubs: Complexity and approximability 143
Parameterized complexity and approximation issues for the colorful components problems 141
Editorial [to Theoretical computer Science, vol. 717] 139
Graph Isomorphism 137
Finding disjoint paths on edge-colored graphs: more tractability results 135
Comparing incomplete sequences via longest common subsequence 135
Top k 2-clubs in a network: A genetic algorithm 126
Complexity issues of string to graph approximate matching 118
On the Tractability of Covering a Graph with 2-Clubs 117
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 102
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 101
Hardness and tractability of the γ-Complete Subgraph problem 99
Complexity and Algorithms for MUL-Tree Pruning 92
SOFSEM 2021: Theory and Practice of Computer Science: 47th International Conference on Current Trends in Theory and Practice of Computer Science, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings 91
Top-k Connected Overlapping Densest Subgraphs in Dual Networks 91
Totale 25.096
Salva come PNG Salva come JPEG
Categoria #
all - tutte 71.105
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 71.105
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.610 0 0 0 0 0 185 334 197 359 146 208 181
2020/20214.092 445 252 170 218 229 414 428 132 502 486 609 207
2021/20222.788 226 300 202 189 247 390 161 117 178 286 338 154
2022/20232.089 356 218 274 298 152 293 41 89 174 27 92 75
2023/20244.551 84 88 113 129 172 857 2.786 83 73 14 17 135
2024/20251.075 139 290 100 444 61 41 0 0 0 0 0 0
Totale 26.320