DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.529
NA - Nord America 9.392
AS - Asia 4.783
SA - Sud America 380
AF - Africa 186
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 11
Totale 34.294
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.031
GB - Regno Unito 7.189
IE - Irlanda 3.615
PL - Polonia 2.882
RU - Federazione Russa 1.972
SG - Singapore 1.796
CN - Cina 1.766
IT - Italia 967
FR - Francia 645
DE - Germania 620
NL - Olanda 600
SE - Svezia 426
VN - Vietnam 405
CA - Canada 322
BR - Brasile 262
UA - Ucraina 242
IN - India 169
FI - Finlandia 155
ZA - Sudafrica 133
TR - Turchia 90
KR - Corea 89
HK - Hong Kong 68
AT - Austria 63
ID - Indonesia 61
JP - Giappone 61
BD - Bangladesh 43
AR - Argentina 40
ES - Italia 37
IQ - Iraq 34
PK - Pakistan 28
MY - Malesia 24
EU - Europa 23
IR - Iran 22
MX - Messico 22
BE - Belgio 21
CO - Colombia 21
SA - Arabia Saudita 21
EC - Ecuador 19
CZ - Repubblica Ceca 18
LT - Lituania 17
PH - Filippine 16
RO - Romania 16
TW - Taiwan 15
AU - Australia 13
MA - Marocco 13
CL - Cile 12
UZ - Uzbekistan 12
CH - Svizzera 10
VE - Venezuela 10
JM - Giamaica 7
NP - Nepal 7
TN - Tunisia 7
JO - Giordania 6
KZ - Kazakistan 6
NG - Nigeria 6
SI - Slovenia 6
EG - Egitto 5
ET - Etiopia 5
IL - Israele 5
AE - Emirati Arabi Uniti 4
BO - Bolivia 4
PE - Perù 4
PS - Palestinian Territory 4
PT - Portogallo 4
PY - Paraguay 4
RS - Serbia 4
TH - Thailandia 4
YE - Yemen 4
DK - Danimarca 3
DZ - Algeria 3
KH - Cambogia 3
OM - Oman 3
SY - Repubblica araba siriana 3
TT - Trinidad e Tobago 3
UY - Uruguay 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AL - Albania 2
AZ - Azerbaigian 2
BH - Bahrain 2
GR - Grecia 2
HU - Ungheria 2
KW - Kuwait 2
MD - Moldavia 2
MN - Mongolia 2
NI - Nicaragua 2
NO - Norvegia 2
PA - Panama 2
SK - Slovacchia (Repubblica Slovacca) 2
SN - Senegal 2
ZM - Zambia 2
AM - Armenia 1
AO - Angola 1
BJ - Benin 1
BY - Bielorussia 1
CG - Congo 1
CI - Costa d'Avorio 1
DO - Repubblica Dominicana 1
EE - Estonia 1
GE - Georgia 1
GT - Guatemala 1
Totale 34.293
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.860
Ashburn 999
San Jose 818
Jacksonville 791
Singapore 731
Moscow 604
Chandler 458
Fairfield 375
Council Bluffs 324
Hefei 321
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 222
Beijing 215
Woodbridge 211
Mountain View 210
The Dalles 182
Dalmine 181
Toronto 178
Houston 166
Seattle 160
Boardman 158
Dearborn 150
Bergamo 140
Johannesburg 128
Cambridge 120
Lauterbourg 115
Ho Chi Minh City 112
Shanghai 109
Los Angeles 98
Altamura 97
Milan 96
San Mateo 95
Fredericton 89
Hanoi 88
Atlanta 85
Nanchang 85
Redwood City 74
Dong Ket 72
London 72
Helsinki 71
Andover 68
Buffalo 60
Santa Clara 58
Washington 58
Chicago 51
Kocaeli 51
Hong Kong 49
New York 46
Dallas 45
Kunming 45
Vienna 45
Ogden 44
Hebei 37
Redondo Beach 36
Rancio Valcuvia 35
Tokyo 33
Jakarta 32
Seoul 32
Sunnyvale 32
São Paulo 30
Shenyang 29
Frankfurt am Main 28
Guangzhou 27
Hangzhou 26
Jiaxing 26
Tianjin 26
Chennai 23
Needham Heights 23
Phoenix 22
Changsha 21
Amsterdam 20
Da Nang 20
Orem 20
Brusaporto 19
Montreal 19
Munich 18
Assago 16
Barnet 16
Brooklyn 16
Brussels 16
Boston 15
Haiphong 15
Hounslow 15
Nuremberg 15
Baghdad 14
Manchester 14
Philadelphia 14
Poplar 14
Stockholm 14
Auburn Hills 13
Brno 13
Changchun 13
Fremont 13
Jinan 13
Pune 13
Istanbul 12
Totale 24.844
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 670
The link between orthology relations and gene trees: a correction perspective 603
Polytomy refinement for the correction of dubious duplications in gene trees 551
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 538
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 534
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 528
Parameterized complexity and approximation issues for the colorful components problems 524
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 517
The longest filled common subsequence problem 514
Parameterized tractability of the maximum-duo preservation string mapping problem 511
Approximating the correction of weighted and unweighted orthology and paralogy relations 500
Clique editing to support case versus control discrimination 497
Correcting gene trees by leaf insertions: complexity and approximation 490
Kernel Methods: Support Vector Machines 485
Complexity issues in vertex-colored graph pattern matching 384
Reconciling multiple genes trees via segmental duplications and losses 374
Finding approximate and constrained motifs in Graphs 371
Fixed-parameter algorithms for scaffold filling 371
The binary perfect phylogeny with persistent characters 368
Moving Assistive Technology on the Web: The Farfalla Experience 361
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 359
New results for the Longest Haplotype Reconstruction problem 351
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 350
Pure Parsimony Xor Haplotyping 347
Weak pattern matching in colored graphs: Minimizing the number of connected components 346
Fixed-Parameter Algorithms for Scaffold Filling 344
Computational methods for resting-state EEG of patients with disorders of consciousness 339
Restricted and Swap Common Superstring: A Parameterized View 338
The l-Diversity problem: tractability and approximability 338
On the parameterized complexity of the repetition free longest common subsequence problem 336
Farfalla: a step toward an inclusive web 335
Exemplar Longest Common Subsequence 327
Finding approximate and constrained motifs in graphs 324
Top-k overlapping densest subgraphs: Approximation and complexity 322
Complexity Insights of the Minimum Duplication Problem 321
Fingerprint Clustering with Bounded Number of Missing Values 312
Duplication-Loss Genome Alignment: Complexity and Algorithm 309
Complexity insights of the Minimum Duplication problem 308
The k-Anonymity Problem Is Hard 302
Pure Parsimony Xor Haplotyping 302
Variants of constrained longest common subsequence 301
On the Approximation of Correlation Clustering and Consensus Clustering 300
Maximum disjoint paths on edge-colored graphs: approximability and tractability 300
Aligning and Labeling Genomes under the Duplication-Loss Model 298
Parameterized complexity of k-anonymity: hardness and tractability 298
Anonymizing binary and small tables is hard to approximate 294
Beyond evolutionary trees 294
The Haplotyping Problem: An Overview of Computational Models and Solutions 293
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 293
Reconciling multiple genes trees via segmental duplications and losses 292
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 288
Minimum Factorization Agreement of Spliced ESTs 287
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 287
Beyond Evolutionary Trees 287
The constrained shortest common supersequence problem 286
On the Complexity of the l-diversity Problem 286
Graph Algorithms 286
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 283
Robust Conclusions in Mass Spectrometry Analysis 280
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 278
Signal Transduction Networks via Transitive Reductions of Directed Graphs 277
The Longest Haplotype Reconstruction Problem Revisited 275
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 274
HapCol: Accurate and memory-efficient haplotype assembly from long reads 273
The Comparison of Phylogenetic Networks: Algorithms and Complexity 272
Covering Pairs in Directed Acyclic Graphs 269
Maximum Motif Problem in Vertex-Colored Graphs 268
When and How the Perfect Phylogeny Model Explains Evolution 262
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 261
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 260
Kernel Machines: Introduction 258
Parameterized Complexity of k-Anonymity: Hardness and Tractability 249
Optimized Social Explanation for Educational Platforms 242
Covering a Graph with Clubs 239
A clustering algorithm for planning the integration process of a large number of conceptual schemas 236
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 233
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 227
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 223
Genetic algorithms for finding episodes in temporal networks 223
Covering pairs in directed acyclic graphs 219
Restricted and swap common superstring: a multivariate algorithmic perspective 213
Correcting gene tree by removal and modification: tractability and approximability 212
Insights into the Complexity of Disentangling Temporal Graphs 211
Kernel Machines: Applications 208
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 205
Comparing incomplete sequences via longest common subsequence 201
Covering with clubs: Complexity and approximability 199
On the tractability of finding disjoint clubs in a network 195
Editorial [to Theoretical computer Science, vol. 717] 193
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 192
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 191
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 190
Parameterized complexity and approximation issues for the colorful components problems 187
Hardness and tractability of the γ-Complete Subgraph problem 186
Graph Isomorphism 183
Finding Colorful Paths in Temporal Graphs 180
Finding disjoint paths on edge-colored graphs: more tractability results 177
Colorful path detection in vertex-colored temporal 174
Dense subgraphs in temporal social networks 169
Dense Sub-networks Discovery in Temporal Networks 168
Totale 30.986
Salva come PNG Salva come JPEG
Categoria #
all - tutte 103.988
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 103.988
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021207 0 0 0 0 0 0 0 0 0 0 0 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/20253.497 139 290 100 444 61 42 44 180 297 797 597 506
2025/20266.265 245 312 589 538 896 438 902 607 498 665 324 251
Totale 35.007