DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.180
NA - Nord America 7.635
AS - Asia 3.672
SA - Sud America 277
AF - Africa 153
Continente sconosciuto - Info sul continente non disponibili 11
OC - Oceania 10
Totale 30.938
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.322
GB - Regno Unito 7.148
IE - Irlanda 3.615
PL - Polonia 2.880
RU - Federazione Russa 1.965
CN - Cina 1.606
SG - Singapore 1.360
IT - Italia 924
NL - Olanda 594
DE - Germania 591
FR - Francia 513
SE - Svezia 426
CA - Canada 294
UA - Ucraina 240
BR - Brasile 221
VN - Vietnam 167
ZA - Sudafrica 129
IN - India 114
FI - Finlandia 93
KR - Corea 82
TR - Turchia 71
AT - Austria 63
JP - Giappone 53
ID - Indonesia 50
HK - Hong Kong 34
AR - Argentina 23
ES - Italia 23
EU - Europa 23
IR - Iran 22
BE - Belgio 19
CZ - Repubblica Ceca 17
LT - Lituania 17
MY - Malesia 17
BD - Bangladesh 15
RO - Romania 14
TW - Taiwan 14
MX - Messico 13
EC - Ecuador 12
AU - Australia 10
IQ - Iraq 10
CH - Svizzera 9
CO - Colombia 9
PH - Filippine 9
PK - Pakistan 8
SA - Arabia Saudita 8
SI - Slovenia 6
UZ - Uzbekistan 6
CL - Cile 5
MA - Marocco 5
EG - Egitto 4
ET - Etiopia 4
PT - Portogallo 4
YE - Yemen 4
DK - Danimarca 3
JO - Giordania 3
PY - Paraguay 3
RS - Serbia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AE - Emirati Arabi Uniti 2
GR - Grecia 2
HU - Ungheria 2
IL - Israele 2
KH - Cambogia 2
MD - Moldavia 2
NO - Norvegia 2
OM - Oman 2
PA - Panama 2
PE - Perù 2
SN - Senegal 2
SY - Repubblica araba siriana 2
TN - Tunisia 2
TT - Trinidad e Tobago 2
AM - Armenia 1
AO - Angola 1
BH - Bahrain 1
BJ - Benin 1
BY - Bielorussia 1
CI - Costa d'Avorio 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
EE - Estonia 1
HR - Croazia 1
IS - Islanda 1
JM - Giamaica 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
MV - Maldive 1
MZ - Mozambico 1
NE - Niger 1
NG - Nigeria 1
NP - Nepal 1
PS - Palestinian Territory 1
SK - Slovacchia (Repubblica Slovacca) 1
SR - Suriname 1
TH - Thailandia 1
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 30.953
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.859
Jacksonville 787
Ashburn 701
Moscow 602
Singapore 542
Chandler 458
Fairfield 375
Hefei 321
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 221
Woodbridge 211
Mountain View 210
Beijing 206
The Dalles 182
Toronto 176
Dalmine 164
Houston 162
Seattle 160
Boardman 156
Dearborn 150
Bergamo 139
Johannesburg 125
Cambridge 120
Shanghai 108
Altamura 97
San Mateo 95
Los Angeles 91
Milan 87
Nanchang 85
Atlanta 81
Fredericton 80
Redwood City 74
Dong Ket 72
London 69
Andover 68
Washington 56
Buffalo 55
Kocaeli 51
Kunming 45
Vienna 45
Ogden 44
Chicago 40
Council Bluffs 40
Hebei 37
Dallas 36
Redondo Beach 36
Ho Chi Minh City 35
Rancio Valcuvia 35
New York 33
Jakarta 32
Sunnyvale 31
Shenyang 29
Santa Clara 27
Seoul 27
São Paulo 27
Hangzhou 26
Jiaxing 26
Tokyo 26
Tianjin 24
Needham Heights 23
Chennai 22
Changsha 21
Hanoi 21
Hong Kong 21
Brusaporto 19
Amsterdam 18
Munich 18
Phoenix 18
Assago 16
Frankfurt am Main 15
Hounslow 15
Boston 14
Brussels 14
Guangzhou 14
Poplar 14
Stockholm 14
Auburn Hills 13
Brno 13
Brooklyn 13
Changchun 13
Fremont 13
Montreal 13
Jinan 12
Pune 12
Taipei 12
Helsinki 11
Lanzhou 11
Lappeenranta 11
Zhengzhou 11
Acton 10
Norwalk 10
Nuremberg 10
Orem 10
Ottawa 10
Padova 10
San Francisco 10
Totale 22.668
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 630
The link between orthology relations and gene trees: a correction perspective 564
Polytomy refinement for the correction of dubious duplications in gene trees 515
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 513
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 512
Parameterized complexity and approximation issues for the colorful components problems 499
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 499
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 493
The longest filled common subsequence problem 488
Parameterized tractability of the maximum-duo preservation string mapping problem 485
Clique editing to support case versus control discrimination 476
Correcting gene trees by leaf insertions: complexity and approximation 468
Approximating the correction of weighted and unweighted orthology and paralogy relations 467
Kernel Methods: Support Vector Machines 465
Reconciling multiple genes trees via segmental duplications and losses 358
Complexity issues in vertex-colored graph pattern matching 354
The binary perfect phylogeny with persistent characters 342
Fixed-parameter algorithms for scaffold filling 337
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 334
Finding approximate and constrained motifs in Graphs 333
Pure Parsimony Xor Haplotyping 333
Weak pattern matching in colored graphs: Minimizing the number of connected components 327
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 326
New results for the Longest Haplotype Reconstruction problem 323
Moving Assistive Technology on the Web: The Farfalla Experience 323
Restricted and Swap Common Superstring: A Parameterized View 321
Computational methods for resting-state EEG of patients with disorders of consciousness 320
The l-Diversity problem: tractability and approximability 316
On the parameterized complexity of the repetition free longest common subsequence problem 313
Farfalla: a step toward an inclusive web 310
Exemplar Longest Common Subsequence 310
Fingerprint Clustering with Bounded Number of Missing Values 300
Complexity Insights of the Minimum Duplication Problem 299
Fixed-Parameter Algorithms for Scaffold Filling 297
Top-k overlapping densest subgraphs: Approximation and complexity 295
Pure Parsimony Xor Haplotyping 292
On the Approximation of Correlation Clustering and Consensus Clustering 285
The k-Anonymity Problem Is Hard 283
Finding approximate and constrained motifs in graphs 283
Duplication-Loss Genome Alignment: Complexity and Algorithm 282
Variants of constrained longest common subsequence 280
Beyond evolutionary trees 280
Parameterized complexity of k-anonymity: hardness and tractability 277
Aligning and Labeling Genomes under the Duplication-Loss Model 276
Minimum Factorization Agreement of Spliced ESTs 273
Complexity insights of the Minimum Duplication problem 272
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 270
Beyond Evolutionary Trees 270
Reconciling multiple genes trees via segmental duplications and losses 270
The Haplotyping Problem: An Overview of Computational Models and Solutions 269
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 265
Maximum disjoint paths on edge-colored graphs: approximability and tractability 263
On the Complexity of the l-diversity Problem 262
Graph Algorithms 262
Anonymizing binary and small tables is hard to approximate 261
The Longest Haplotype Reconstruction Problem Revisited 261
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 259
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 258
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 257
Signal Transduction Networks via Transitive Reductions of Directed Graphs 257
The constrained shortest common supersequence problem 256
HapCol: Accurate and memory-efficient haplotype assembly from long reads 254
The Comparison of Phylogenetic Networks: Algorithms and Complexity 248
Covering Pairs in Directed Acyclic Graphs 248
Maximum Motif Problem in Vertex-Colored Graphs 248
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 242
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 241
Robust Conclusions in Mass Spectrometry Analysis 241
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 237
When and How the Perfect Phylogeny Model Explains Evolution 235
Kernel Machines: Introduction 235
Parameterized Complexity of k-Anonymity: Hardness and Tractability 230
Covering a Graph with Clubs 226
Optimized Social Explanation for Educational Platforms 226
A clustering algorithm for planning the integration process of a large number of conceptual schemas 220
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 215
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 206
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 204
Restricted and swap common superstring: a multivariate algorithmic perspective 200
Genetic algorithms for finding episodes in temporal networks 199
Correcting gene tree by removal and modification: tractability and approximability 197
Covering pairs in directed acyclic graphs 193
Kernel Machines: Applications 192
Insights into the Complexity of Disentangling Temporal Graphs 185
Covering with clubs: Complexity and approximability 178
Editorial [to Theoretical computer Science, vol. 717] 176
Comparing incomplete sequences via longest common subsequence 175
On the tractability of finding disjoint clubs in a network 173
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 171
Parameterized complexity and approximation issues for the colorful components problems 170
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 169
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 169
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 164
Finding disjoint paths on edge-colored graphs: more tractability results 163
Graph Isomorphism 163
Hardness and tractability of the γ-Complete Subgraph problem 159
Finding Colorful Paths in Temporal Graphs 158
Colorful path detection in vertex-colored temporal 152
Top k 2-clubs in a network: A genetic algorithm 149
Complexity issues of string to graph approximate matching 146
Totale 28.625
Salva come PNG Salva come JPEG
Categoria #
all - tutte 94.122
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 94.122
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20212.778 0 0 0 0 0 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/20253.497 139 290 100 444 61 42 44 180 297 797 597 506
2025/20262.846 245 312 589 538 896 266 0 0 0 0 0 0
Totale 31.588