DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.938
NA - Nord America 10.805
AS - Asia 4.879
Continente sconosciuto - Info sul continente non disponibili 725
SA - Sud America 415
AF - Africa 189
OC - Oceania 14
Totale 36.965
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.366
GB - Regno Unito 7.197
IE - Irlanda 3.616
PL - Polonia 2.884
RU - Federazione Russa 1.972
SG - Singapore 1.840
CN - Cina 1.777
IT - Italia 1.312
FR - Francia 650
DE - Germania 620
NL - Olanda 600
SE - Svezia 464
VN - Vietnam 408
CA - Canada 364
BR - Brasile 275
UA - Ucraina 246
IN - India 169
FI - Finlandia 155
ZA - Sudafrica 133
TR - Turchia 90
KR - Corea 89
HK - Hong Kong 72
ID - Indonesia 67
AT - Austria 63
JP - Giappone 63
BD - Bangladesh 54
ES - Italia 41
AR - Argentina 40
IQ - Iraq 34
CO - Colombia 33
MX - Messico 31
PK - Pakistan 28
MY - Malesia 25
EC - Ecuador 24
EU - Europa 23
SA - Arabia Saudita 23
IR - Iran 22
BE - Belgio 21
PH - Filippine 21
CZ - Repubblica Ceca 18
LT - Lituania 17
RO - Romania 16
JM - Giamaica 15
TW - Taiwan 15
AU - Australia 14
CL - Cile 13
MA - Marocco 13
VE - Venezuela 13
UZ - Uzbekistan 12
CH - Svizzera 10
NP - Nepal 10
KZ - Kazakistan 7
TN - Tunisia 7
IL - Israele 6
JO - Giordania 6
NG - Nigeria 6
SI - Slovenia 6
AE - Emirati Arabi Uniti 5
CR - Costa Rica 5
EG - Egitto 5
ET - Etiopia 5
PT - Portogallo 5
TT - Trinidad e Tobago 5
BO - Bolivia 4
PE - Perù 4
PS - Palestinian Territory 4
PY - Paraguay 4
RS - Serbia 4
TH - Thailandia 4
UY - Uruguay 4
YE - Yemen 4
DK - Danimarca 3
DZ - Algeria 3
HN - Honduras 3
KH - Cambogia 3
NI - Nicaragua 3
OM - Oman 3
SC - Seychelles 3
SK - Slovacchia (Repubblica Slovacca) 3
SY - Repubblica araba siriana 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
HU - Ungheria 2
KW - Kuwait 2
MD - Moldavia 2
MN - Mongolia 2
NO - Norvegia 2
PA - Panama 2
SN - Senegal 2
ZM - Zambia 2
AM - Armenia 1
AO - Angola 1
BJ - Benin 1
BS - Bahamas 1
BY - Bielorussia 1
Totale 36.240
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.565
Warsaw 2.861
Ashburn 1.091
San Jose 937
Council Bluffs 823
Jacksonville 796
Singapore 737
Moscow 604
Chandler 458
Fairfield 376
Hefei 321
Princeton 319
Ann Arbor 286
Staranzano 274
Nanjing 241
Wilmington 222
Beijing 219
Woodbridge 211
Mountain View 210
The Dalles 182
Toronto 182
Dalmine 181
Houston 167
Seattle 162
Boardman 158
Dearborn 150
Bergamo 141
Johannesburg 128
Santa Clara 128
Cambridge 120
Lauterbourg 115
Shanghai 113
Ho Chi Minh City 112
Los Angeles 106
Milan 103
Columbus 101
Fredericton 101
Altamura 97
San Mateo 95
Hanoi 90
Atlanta 87
Nanchang 85
Redwood City 74
Dong Ket 72
London 72
Helsinki 71
Andover 68
Buffalo 65
Chicago 63
Washington 58
Dallas 56
New York 53
Hong Kong 52
Kocaeli 51
Kunming 45
Vienna 45
Ogden 44
Phoenix 42
Hebei 37
Redondo Beach 36
Rancio Valcuvia 35
Tokyo 35
São Paulo 33
Jakarta 32
Seoul 32
Sunnyvale 32
Shenyang 29
Frankfurt am Main 28
Guangzhou 27
Hangzhou 26
Jiaxing 26
Tianjin 26
Chennai 23
Needham Heights 23
Changsha 21
Montreal 21
Amsterdam 20
Brooklyn 20
Da Nang 20
Orem 20
Philadelphia 20
Brusaporto 19
Munich 18
Rome 18
Boston 17
Assago 16
Barnet 16
Brussels 16
Haiphong 15
Hounslow 15
Nuremberg 15
Baghdad 14
Manchester 14
Newark 14
Poplar 14
San Francisco 14
Stockholm 14
Auburn Hills 13
Brno 13
Totale 26.119
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 683
The link between orthology relations and gene trees: a correction perspective 624
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 568
Polytomy refinement for the correction of dubious duplications in gene trees 560
Parameterized complexity and approximation issues for the colorful components problems 548
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 541
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 539
The longest filled common subsequence problem 539
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 529
Parameterized tractability of the maximum-duo preservation string mapping problem 519
Approximating the correction of weighted and unweighted orthology and paralogy relations 517
Clique editing to support case versus control discrimination 513
Correcting gene trees by leaf insertions: complexity and approximation 497
Kernel Methods: Support Vector Machines 495
Complexity issues in vertex-colored graph pattern matching 399
Finding approximate and constrained motifs in Graphs 389
Fixed-parameter algorithms for scaffold filling 386
The binary perfect phylogeny with persistent characters 384
Reconciling multiple genes trees via segmental duplications and losses 381
Moving Assistive Technology on the Web: The Farfalla Experience 380
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 366
New results for the Longest Haplotype Reconstruction problem 364
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 361
Restricted and Swap Common Superstring: A Parameterized View 357
Fixed-Parameter Algorithms for Scaffold Filling 356
Pure Parsimony Xor Haplotyping 356
The l-Diversity problem: tractability and approximability 352
Weak pattern matching in colored graphs: Minimizing the number of connected components 351
Farfalla: a step toward an inclusive web 350
On the parameterized complexity of the repetition free longest common subsequence problem 349
Computational methods for resting-state EEG of patients with disorders of consciousness 347
Finding approximate and constrained motifs in graphs 340
Exemplar Longest Common Subsequence 338
Complexity Insights of the Minimum Duplication Problem 336
Top-k overlapping densest subgraphs: Approximation and complexity 332
The Haplotyping Problem: An Overview of Computational Models and Solutions 328
Duplication-Loss Genome Alignment: Complexity and Algorithm 326
Fingerprint Clustering with Bounded Number of Missing Values 323
Complexity insights of the Minimum Duplication problem 323
The k-Anonymity Problem Is Hard 317
Pure Parsimony Xor Haplotyping 315
Variants of constrained longest common subsequence 312
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 312
Aligning and Labeling Genomes under the Duplication-Loss Model 311
On the Approximation of Correlation Clustering and Consensus Clustering 310
Anonymizing binary and small tables is hard to approximate 310
Maximum disjoint paths on edge-colored graphs: approximability and tractability 306
Beyond evolutionary trees 305
On the Complexity of the l-diversity Problem 305
Parameterized complexity of k-anonymity: hardness and tractability 305
Reconciling multiple genes trees via segmental duplications and losses 304
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 303
The constrained shortest common supersequence problem 301
Minimum Factorization Agreement of Spliced ESTs 298
Beyond Evolutionary Trees 298
Graph Algorithms 298
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 293
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 292
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 292
Signal Transduction Networks via Transitive Reductions of Directed Graphs 292
Robust Conclusions in Mass Spectrometry Analysis 289
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 288
HapCol: Accurate and memory-efficient haplotype assembly from long reads 285
The Longest Haplotype Reconstruction Problem Revisited 284
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 283
Maximum Motif Problem in Vertex-Colored Graphs 282
Covering Pairs in Directed Acyclic Graphs 281
The Comparison of Phylogenetic Networks: Algorithms and Complexity 280
When and How the Perfect Phylogeny Model Explains Evolution 271
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 269
Parameterized Complexity of k-Anonymity: Hardness and Tractability 266
Kernel Machines: Introduction 263
Optimized Social Explanation for Educational Platforms 252
Covering a Graph with Clubs 251
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 249
A clustering algorithm for planning the integration process of a large number of conceptual schemas 245
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 243
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 235
Genetic algorithms for finding episodes in temporal networks 232
Insights into the Complexity of Disentangling Temporal Graphs 227
Covering pairs in directed acyclic graphs 225
Correcting gene tree by removal and modification: tractability and approximability 222
Restricted and swap common superstring: a multivariate algorithmic perspective 221
Kernel Machines: Applications 220
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 217
Covering with clubs: Complexity and approximability 215
Comparing incomplete sequences via longest common subsequence 209
On the tractability of finding disjoint clubs in a network 203
Editorial [to Theoretical computer Science, vol. 717] 202
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 202
Hardness and tractability of the γ-Complete Subgraph problem 200
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 200
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 198
Parameterized complexity and approximation issues for the colorful components problems 195
Graph Isomorphism 194
Finding Colorful Paths in Temporal Graphs 191
Dense Temporal Subgraphs in Protein-Protein Interaction Networks 189
Dense subgraphs in temporal social networks 185
Finding disjoint paths on edge-colored graphs: more tractability results 185
Colorful path detection in vertex-colored temporal 183
Totale 32.256
Salva come PNG Salva come JPEG
Categoria #
all - tutte 113.489
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 113.489
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20222.060 0 0 0 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/20271.725 243 325 887 270 0 0 0 0 0 0 0 0
Totale 36.965