DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.522
NA - Nord America 8.848
AS - Asia 4.734
SA - Sud America 380
AF - Africa 182
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 11
Totale 33.690
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8.507
GB - Regno Unito 7.188
IE - Irlanda 3.615
PL - Polonia 2.882
RU - Federazione Russa 1.972
SG - Singapore 1.767
CN - Cina 1.751
IT - Italia 964
FR - Francia 645
DE - Germania 620
NL - Olanda 598
SE - Svezia 426
VN - Vietnam 405
CA - Canada 308
BR - Brasile 262
UA - Ucraina 242
IN - India 169
FI - Finlandia 155
ZA - Sudafrica 133
TR - Turchia 90
KR - Corea 89
AT - Austria 63
HK - Hong Kong 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
BE - Belgio 21
CO - Colombia 21
MX - Messico 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
VE - Venezuela 10
CH - Svizzera 9
NP - Nepal 7
TN - Tunisia 7
JO - Giordania 6
KZ - Kazakistan 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
JM - Giamaica 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
NG - Nigeria 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
HN - Honduras 1
Totale 33.690
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.860
Ashburn 980
Jacksonville 788
Singapore 723
San Jose 719
Moscow 604
Chandler 458
Fairfield 375
Hefei 321
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 222
Beijing 215
Woodbridge 211
Mountain View 210
The Dalles 182
Dalmine 181
Toronto 177
Houston 164
Seattle 160
Boardman 158
Dearborn 150
Bergamo 140
Johannesburg 128
Cambridge 120
Lauterbourg 115
Ho Chi Minh City 112
Shanghai 108
Altamura 97
Los Angeles 96
San Mateo 95
Milan 94
Hanoi 88
Nanchang 85
Atlanta 84
Fredericton 84
Council Bluffs 83
Redwood City 74
Dong Ket 72
London 72
Helsinki 71
Andover 68
Buffalo 58
Washington 56
Kocaeli 51
Chicago 47
Kunming 45
Vienna 45
Hong Kong 44
Ogden 44
New York 43
Dallas 42
Santa Clara 40
Hebei 37
Redondo Beach 36
Rancio Valcuvia 35
Tokyo 33
Jakarta 32
Seoul 32
Sunnyvale 31
São Paulo 30
Shenyang 29
Frankfurt am Main 28
Guangzhou 27
Hangzhou 26
Jiaxing 26
Tianjin 26
Chennai 23
Needham Heights 23
Changsha 21
Amsterdam 20
Da Nang 20
Orem 20
Phoenix 20
Brusaporto 19
Montreal 18
Munich 18
Assago 16
Barnet 16
Brussels 16
Boston 15
Brooklyn 15
Haiphong 15
Hounslow 15
Nuremberg 15
Baghdad 14
Manchester 14
Poplar 14
Stockholm 14
Auburn Hills 13
Brno 13
Changchun 13
Fremont 13
Jinan 13
Pune 13
Istanbul 12
Lappeenranta 12
Totale 24.416
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 656
The link between orthology relations and gene trees: a correction perspective 595
Polytomy refinement for the correction of dubious duplications in gene trees 544
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 534
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 530
Parameterized complexity and approximation issues for the colorful components problems 519
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 519
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 511
Parameterized tractability of the maximum-duo preservation string mapping problem 509
The longest filled common subsequence problem 505
Clique editing to support case versus control discrimination 491
Approximating the correction of weighted and unweighted orthology and paralogy relations 489
Kernel Methods: Support Vector Machines 483
Correcting gene trees by leaf insertions: complexity and approximation 482
Complexity issues in vertex-colored graph pattern matching 379
Reconciling multiple genes trees via segmental duplications and losses 373
Fixed-parameter algorithms for scaffold filling 366
Finding approximate and constrained motifs in Graphs 365
The binary perfect phylogeny with persistent characters 362
Moving Assistive Technology on the Web: The Farfalla Experience 355
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 349
New results for the Longest Haplotype Reconstruction problem 345
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 345
Pure Parsimony Xor Haplotyping 343
Fixed-Parameter Algorithms for Scaffold Filling 339
Weak pattern matching in colored graphs: Minimizing the number of connected components 339
The l-Diversity problem: tractability and approximability 336
Computational methods for resting-state EEG of patients with disorders of consciousness 336
Restricted and Swap Common Superstring: A Parameterized View 333
Farfalla: a step toward an inclusive web 333
On the parameterized complexity of the repetition free longest common subsequence problem 332
Exemplar Longest Common Subsequence 327
Finding approximate and constrained motifs in graphs 323
Top-k overlapping densest subgraphs: Approximation and complexity 322
Complexity Insights of the Minimum Duplication Problem 312
Fingerprint Clustering with Bounded Number of Missing Values 311
Complexity insights of the Minimum Duplication problem 305
The k-Anonymity Problem Is Hard 302
Duplication-Loss Genome Alignment: Complexity and Algorithm 302
Pure Parsimony Xor Haplotyping 301
Variants of constrained longest common subsequence 300
On the Approximation of Correlation Clustering and Consensus Clustering 299
Parameterized complexity of k-anonymity: hardness and tractability 295
Maximum disjoint paths on edge-colored graphs: approximability and tractability 295
The Haplotyping Problem: An Overview of Computational Models and Solutions 293
Beyond evolutionary trees 293
Aligning and Labeling Genomes under the Duplication-Loss Model 292
Reconciling multiple genes trees via segmental duplications and losses 291
Anonymizing binary and small tables is hard to approximate 290
Minimum Factorization Agreement of Spliced ESTs 286
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 286
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 283
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 283
The constrained shortest common supersequence problem 282
Graph Algorithms 281
On the Complexity of the l-diversity Problem 280
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 280
Beyond Evolutionary Trees 280
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 275
Signal Transduction Networks via Transitive Reductions of Directed Graphs 272
The Comparison of Phylogenetic Networks: Algorithms and Complexity 271
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 271
The Longest Haplotype Reconstruction Problem Revisited 271
HapCol: Accurate and memory-efficient haplotype assembly from long reads 270
Covering Pairs in Directed Acyclic Graphs 265
Maximum Motif Problem in Vertex-Colored Graphs 263
Robust Conclusions in Mass Spectrometry Analysis 262
When and How the Perfect Phylogeny Model Explains Evolution 261
Kernel Machines: Introduction 256
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 255
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 255
Parameterized Complexity of k-Anonymity: Hardness and Tractability 244
Optimized Social Explanation for Educational Platforms 242
Covering a Graph with Clubs 238
A clustering algorithm for planning the integration process of a large number of conceptual schemas 232
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 226
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 221
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 219
Covering pairs in directed acyclic graphs 215
Genetic algorithms for finding episodes in temporal networks 213
Correcting gene tree by removal and modification: tractability and approximability 212
Restricted and swap common superstring: a multivariate algorithmic perspective 211
Kernel Machines: Applications 207
Insights into the Complexity of Disentangling Temporal Graphs 206
Comparing incomplete sequences via longest common subsequence 200
Covering with clubs: Complexity and approximability 196
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 193
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 191
Editorial [to Theoretical computer Science, vol. 717] 190
On the tractability of finding disjoint clubs in a network 189
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 189
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 188
Parameterized complexity and approximation issues for the colorful components problems 185
Hardness and tractability of the γ-Complete Subgraph problem 184
Graph Isomorphism 180
Finding Colorful Paths in Temporal Graphs 176
Finding disjoint paths on edge-colored graphs: more tractability results 174
Colorful path detection in vertex-colored temporal 171
Dense Sub-networks Discovery in Temporal Networks 167
Dense subgraphs in temporal social networks 165
Totale 30.562
Salva come PNG Salva come JPEG
Categoria #
all - tutte 99.457
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 99.457
Salva come PNG Salva come JPEG


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