DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.575
NA - Nord America 9.828
AS - Asia 4.843
Continente sconosciuto - Info sul continente non disponibili 725
SA - Sud America 384
AF - Africa 189
OC - Oceania 13
Totale 35.557
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.434
GB - Regno Unito 7.190
IE - Irlanda 3.615
PL - Polonia 2.884
RU - Federazione Russa 1.972
SG - Singapore 1.830
CN - Cina 1.774
IT - Italia 996
FR - Francia 646
DE - Germania 620
NL - Olanda 600
SE - Svezia 434
VN - Vietnam 405
CA - Canada 343
BR - Brasile 264
UA - Ucraina 242
IN - India 169
FI - Finlandia 155
ZA - Sudafrica 133
TR - Turchia 90
KR - Corea 89
HK - Hong Kong 71
AT - Austria 63
JP - Giappone 62
ID - Indonesia 61
BD - Bangladesh 54
AR - Argentina 40
ES - Italia 40
IQ - Iraq 34
PK - Pakistan 28
MX - Messico 25
MY - Malesia 24
EU - Europa 23
CO - Colombia 22
IR - Iran 22
BE - Belgio 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
CL - Cile 13
MA - Marocco 13
UZ - Uzbekistan 12
JM - Giamaica 11
CH - Svizzera 10
VE - Venezuela 10
NP - Nepal 8
TN - Tunisia 7
IL - Israele 6
JO - Giordania 6
KZ - Kazakistan 6
NG - Nigeria 6
SI - Slovenia 6
AE - Emirati Arabi Uniti 5
EG - Egitto 5
ET - Etiopia 5
PT - Portogallo 5
BO - Bolivia 4
PE - Perù 4
PS - Palestinian Territory 4
PY - Paraguay 4
RS - Serbia 4
TH - Thailandia 4
TT - Trinidad e Tobago 4
YE - Yemen 4
DK - Danimarca 3
DZ - Algeria 3
KH - Cambogia 3
OM - Oman 3
SC - Seychelles 3
SK - Slovacchia (Repubblica Slovacca) 3
SY - Repubblica araba siriana 3
UY - Uruguay 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AL - Albania 2
AZ - Azerbaigian 2
BB - Barbados 2
BH - Bahrain 2
GR - Grecia 2
GT - Guatemala 2
HN - Honduras 2
HU - Ungheria 2
KW - Kuwait 2
MD - Moldavia 2
MN - Mongolia 2
NI - Nicaragua 2
NO - Norvegia 2
PA - Panama 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
Totale 34.840
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.565
Warsaw 2.861
Ashburn 1.041
San Jose 921
Jacksonville 793
Singapore 733
Moscow 604
Chandler 458
Council Bluffs 392
Fairfield 376
Hefei 321
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 222
Beijing 219
Woodbridge 211
Mountain View 210
The Dalles 182
Dalmine 181
Toronto 179
Houston 166
Seattle 161
Boardman 158
Dearborn 150
Bergamo 140
Johannesburg 128
Cambridge 120
Lauterbourg 115
Ho Chi Minh City 112
Shanghai 112
Santa Clara 109
Milan 103
Los Angeles 99
Fredericton 98
Altamura 97
San Mateo 95
Hanoi 88
Atlanta 85
Nanchang 85
Redwood City 74
Dong Ket 72
London 72
Helsinki 71
Andover 68
Columbus 65
Buffalo 62
Washington 58
Chicago 52
Hong Kong 51
Kocaeli 51
Dallas 48
New York 46
Kunming 45
Vienna 45
Ogden 44
Hebei 37
Redondo Beach 36
Rancio Valcuvia 35
Tokyo 34
Jakarta 32
Seoul 32
Sunnyvale 32
São Paulo 30
Shenyang 29
Frankfurt am Main 28
Guangzhou 27
Hangzhou 26
Jiaxing 26
Phoenix 26
Tianjin 26
Chennai 23
Needham Heights 23
Changsha 21
Amsterdam 20
Da Nang 20
Montreal 20
Orem 20
Brusaporto 19
Munich 18
Assago 16
Barnet 16
Boston 16
Brooklyn 16
Brussels 16
Haiphong 15
Hounslow 15
Nuremberg 15
Philadelphia 15
Baghdad 14
Manchester 14
Poplar 14
Stockholm 14
Auburn Hills 13
Brno 13
Changchun 13
Fremont 13
Jinan 13
Pune 13
Totale 25.210
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 675
The link between orthology relations and gene trees: a correction perspective 612
Polytomy refinement for the correction of dubious duplications in gene trees 554
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 554
Parameterized complexity and approximation issues for the colorful components problems 535
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 535
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 532
The longest filled common subsequence problem 527
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 518
Parameterized tractability of the maximum-duo preservation string mapping problem 512
Approximating the correction of weighted and unweighted orthology and paralogy relations 505
Clique editing to support case versus control discrimination 504
Correcting gene trees by leaf insertions: complexity and approximation 490
Kernel Methods: Support Vector Machines 487
Complexity issues in vertex-colored graph pattern matching 389
Fixed-parameter algorithms for scaffold filling 375
Reconciling multiple genes trees via segmental duplications and losses 375
Finding approximate and constrained motifs in Graphs 374
The binary perfect phylogeny with persistent characters 372
Moving Assistive Technology on the Web: The Farfalla Experience 365
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 360
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 357
New results for the Longest Haplotype Reconstruction problem 353
Pure Parsimony Xor Haplotyping 347
Fixed-Parameter Algorithms for Scaffold Filling 346
Weak pattern matching in colored graphs: Minimizing the number of connected components 346
Restricted and Swap Common Superstring: A Parameterized View 341
Computational methods for resting-state EEG of patients with disorders of consciousness 341
The l-Diversity problem: tractability and approximability 340
On the parameterized complexity of the repetition free longest common subsequence problem 338
Farfalla: a step toward an inclusive web 337
Exemplar Longest Common Subsequence 329
Finding approximate and constrained motifs in graphs 326
Top-k overlapping densest subgraphs: Approximation and complexity 325
Complexity Insights of the Minimum Duplication Problem 322
Complexity insights of the Minimum Duplication problem 314
Duplication-Loss Genome Alignment: Complexity and Algorithm 313
Fingerprint Clustering with Bounded Number of Missing Values 313
The Haplotyping Problem: An Overview of Computational Models and Solutions 308
Variants of constrained longest common subsequence 306
The k-Anonymity Problem Is Hard 305
Pure Parsimony Xor Haplotyping 305
On the Approximation of Correlation Clustering and Consensus Clustering 302
Maximum disjoint paths on edge-colored graphs: approximability and tractability 300
Anonymizing binary and small tables is hard to approximate 299
Aligning and Labeling Genomes under the Duplication-Loss Model 299
Parameterized complexity of k-anonymity: hardness and tractability 299
On the Complexity of the l-diversity Problem 296
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 295
Beyond evolutionary trees 294
Reconciling multiple genes trees via segmental duplications and losses 294
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 292
The constrained shortest common supersequence problem 289
Beyond Evolutionary Trees 289
Minimum Factorization Agreement of Spliced ESTs 288
Graph Algorithms 288
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 287
Robust Conclusions in Mass Spectrometry Analysis 284
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 283
Signal Transduction Networks via Transitive Reductions of Directed Graphs 280
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 279
The Longest Haplotype Reconstruction Problem Revisited 277
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 276
HapCol: Accurate and memory-efficient haplotype assembly from long reads 276
The Comparison of Phylogenetic Networks: Algorithms and Complexity 274
Maximum Motif Problem in Vertex-Colored Graphs 271
Covering Pairs in Directed Acyclic Graphs 270
When and How the Perfect Phylogeny Model Explains Evolution 265
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 264
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 261
Kernel Machines: Introduction 259
Parameterized Complexity of k-Anonymity: Hardness and Tractability 252
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 243
Optimized Social Explanation for Educational Platforms 243
Covering a Graph with Clubs 242
A clustering algorithm for planning the integration process of a large number of conceptual schemas 237
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 230
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 224
Genetic algorithms for finding episodes in temporal networks 224
Covering pairs in directed acyclic graphs 220
Correcting gene tree by removal and modification: tractability and approximability 215
Insights into the Complexity of Disentangling Temporal Graphs 214
Restricted and swap common superstring: a multivariate algorithmic perspective 214
Kernel Machines: Applications 214
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 206
Covering with clubs: Complexity and approximability 206
Comparing incomplete sequences via longest common subsequence 203
On the tractability of finding disjoint clubs in a network 195
Editorial [to Theoretical computer Science, vol. 717] 194
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 193
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 193
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 191
Hardness and tractability of the γ-Complete Subgraph problem 191
Parameterized complexity and approximation issues for the colorful components problems 189
Graph Isomorphism 185
Finding Colorful Paths in Temporal Graphs 184
Dense Temporal Subgraphs in Protein-Protein Interaction Networks 177
Dense subgraphs in temporal social networks 177
Finding disjoint paths on edge-colored graphs: more tractability results 177
Colorful path detection in vertex-colored temporal 175
Totale 31.300
Salva come PNG Salva come JPEG
Categoria #
all - tutte 109.404
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 109.404
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20222.562 0 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.498 245 312 589 538 896 438 902 607 498 665 324 484
2026/2027317 243 74 0 0 0 0 0 0 0 0 0 0
Totale 35.557