DONDI, Riccardo
 Distribuzione geografica
Continente #
EU - Europa 17.000
NA - Nord America 6.209
AS - Asia 1.641
AF - Africa 12
Continente sconosciuto - Info sul continente non disponibili 10
OC - Oceania 10
SA - Sud America 7
Totale 24.889
Nazione #
GB - Regno Unito 7.093
US - Stati Uniti d'America 5.955
IE - Irlanda 3.615
PL - Polonia 2.848
CN - Cina 1.102
IT - Italia 811
RU - Federazione Russa 693
DE - Germania 539
FR - Francia 502
SE - Svezia 413
CA - Canada 250
UA - Ucraina 238
SG - Singapore 104
IN - India 90
VN - Vietnam 82
KR - Corea 72
FI - Finlandia 70
TR - Turchia 60
AT - Austria 52
NL - Olanda 44
JP - Giappone 26
EU - Europa 23
IR - Iran 21
BE - Belgio 15
CZ - Repubblica Ceca 15
HK - Hong Kong 15
RO - Romania 13
TW - Taiwan 13
ID - Indonesia 12
MY - Malesia 11
AU - Australia 10
CH - Svizzera 7
ES - Italia 7
PH - Filippine 7
LT - Lituania 6
SI - Slovenia 6
PK - Pakistan 5
CO - Colombia 4
ET - Etiopia 4
PT - Portogallo 4
YE - Yemen 4
MX - Messico 3
SA - Arabia Saudita 3
UZ - Uzbekistan 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BD - Bangladesh 2
BR - Brasile 2
DK - Danimarca 2
EG - Egitto 2
JO - Giordania 2
NO - Norvegia 2
SY - Repubblica araba siriana 2
TN - Tunisia 2
BH - Bahrain 1
BJ - Benin 1
BY - Bielorussia 1
GR - Grecia 1
IL - Israele 1
IQ - Iraq 1
IS - Islanda 1
MD - Moldavia 1
MV - Maldive 1
NE - Niger 1
NG - Nigeria 1
OM - Oman 1
PA - Panama 1
PE - Perù 1
RS - Serbia 1
ZA - Sudafrica 1
Totale 24.904
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.840
Jacksonville 787
Chandler 458
Fairfield 375
Ashburn 328
Princeton 319
Ann Arbor 286
Nanjing 241
Wilmington 221
Woodbridge 211
Mountain View 210
Toronto 168
Dalmine 164
Houston 157
Seattle 156
Beijing 150
Dearborn 150
Bergamo 124
Cambridge 120
Shanghai 106
Altamura 97
Moscow 97
San Mateo 95
Nanchang 85
Redwood City 74
Atlanta 73
Dong Ket 72
Andover 68
Fredericton 66
London 57
Washington 55
Kocaeli 51
Milan 51
Kunming 45
Ogden 44
Vienna 41
Boardman 37
Hebei 37
Rancio Valcuvia 35
Sunnyvale 31
Shenyang 29
Jiaxing 26
Hangzhou 25
Needham Heights 23
Tianjin 22
Los Angeles 20
Chicago 19
Changsha 18
Singapore 18
Seoul 17
Hefei 15
Hounslow 15
Auburn Hills 13
Brno 13
Changchun 13
Fremont 13
Phoenix 13
Amsterdam 12
Chennai 12
Jinan 12
Pune 12
Taipei 12
Lanzhou 11
Acton 10
Brussels 10
Guangzhou 10
Norwalk 10
Falls Church 9
Kiez 9
Verona 9
Zhengzhou 9
Azzano Decimo 8
Bucharest 8
Graz 8
Kilburn 8
New York 8
Ottawa 8
San Diego 8
Tokyo 8
Dresden 7
Hanoi 7
Hanover 7
Perugia 7
Philadelphia 7
Redmond 7
Tappahannock 7
Chiswick 6
Dallas 6
Haikou 6
Ljubljana 6
Munich 6
New Bedfont 6
Rome 6
Carignano 5
Cologno Al Serio 5
Luzzana 5
Nuremberg 5
Pars 5
Totale 19.821
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 567
The link between orthology relations and gene trees: a correction perspective 524
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 482
Polytomy refinement for the correction of dubious duplications in gene trees 472
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25] 467
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 464
Parameterized complexity and approximation issues for the colorful components problems 461
Orthology Correction for Gene Tree Reconstruction: Theoretical and Experimental Results 460
Parameterized tractability of the maximum-duo preservation string mapping problem 449
The longest filled common subsequence problem 445
Clique editing to support case versus control discrimination 443
Correcting gene trees by leaf insertions: complexity and approximation 442
Approximating the correction of weighted and unweighted orthology and paralogy relations 436
Kernel Methods: Support Vector Machines 393
Reconciling multiple genes trees via segmental duplications and losses 331
Complexity issues in vertex-colored graph pattern matching 322
The binary perfect phylogeny with persistent characters 308
Pure Parsimony Xor Haplotyping 301
Fixed-parameter algorithms for scaffold filling 297
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 297
Finding approximate and constrained motifs in Graphs 291
New results for the Longest Haplotype Reconstruction problem 290
Computational methods for resting-state EEG of patients with disorders of consciousness 290
Restricted and Swap Common Superstring: A Parameterized View 288
Weak pattern matching in colored graphs: Minimizing the number of connected components 287
On the parameterized complexity of the repetition free longest common subsequence problem 282
Exemplar Longest Common Subsequence 281
The l-Diversity problem: tractability and approximability 275
Farfalla: a step toward an inclusive web 272
Moving Assistive Technology on the Web: The Farfalla Experience 270
Fingerprint Clustering with Bounded Number of Missing Values 270
Complexity Insights of the Minimum Duplication Problem 269
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 263
Fixed-Parameter Algorithms for Scaffold Filling 251
Pure Parsimony Xor Haplotyping 250
The k-Anonymity Problem Is Hard 249
Finding approximate and constrained motifs in graphs 249
On the Approximation of Correlation Clustering and Consensus Clustering 248
Parameterized complexity of k-anonymity: hardness and tractability 246
Aligning and Labeling Genomes under the Duplication-Loss Model 243
Minimum Factorization Agreement of Spliced ESTs 241
Beyond evolutionary trees 241
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 237
Reconciling multiple genes trees via segmental duplications and losses 237
The Haplotyping Problem: An Overview of Computational Models and Solutions 236
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 234
Variants of constrained longest common subsequence 233
Complexity insights of the Minimum Duplication problem 233
Graph Algorithms 232
Duplication-Loss Genome Alignment: Complexity and Algorithm 231
The Longest Haplotype Reconstruction Problem Revisited 230
Signal Transduction Networks via Transitive Reductions of Directed Graphs 227
Beyond Evolutionary Trees 227
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 226
Maximum disjoint paths on edge-colored graphs: approximability and tractability 225
The constrained shortest common supersequence problem 224
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 224
On the Complexity of the l-diversity Problem 224
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 222
Anonymizing binary and small tables is hard to approximate 221
Top-k overlapping densest subgraphs: Approximation and complexity 221
Covering Pairs in Directed Acyclic Graphs 218
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 218
The Comparison of Phylogenetic Networks: Algorithms and Complexity 215
Maximum Motif Problem in Vertex-Colored Graphs 215
HapCol: Accurate and memory-efficient haplotype assembly from long reads 214
Robust Conclusions in Mass Spectrometry Analysis 208
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 205
Parameterized Complexity of k-Anonymity: Hardness and Tractability 193
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 192
A clustering algorithm for planning the integration process of a large number of conceptual schemas 186
When and How the Perfect Phylogeny Model Explains Evolution 185
Kernel Machines: Introduction 182
Optimized Social Explanation for Educational Platforms 178
Restricted and swap common superstring: a multivariate algorithmic perspective 173
Correcting gene tree by removal and modification: tractability and approximability 167
Distributed Heuristics for Optimizing Cohesive Groups: A Support for Clinical Patient Engagement in Social Network Analysis 167
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 166
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 166
Covering pairs in directed acyclic graphs 164
Kernel Machines: Applications 148
Covering a Graph with Clubs 146
On the tractability of finding disjoint clubs in a network 141
Covering with clubs: Complexity and approximability 140
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 140
Parameterized complexity and approximation issues for the colorful components problems 138
Editorial [to Theoretical computer Science, vol. 717] 136
Graph Isomorphism 134
Finding disjoint paths on edge-colored graphs: more tractability results 133
Genetic algorithms for finding episodes in temporal networks 133
Comparing incomplete sequences via longest common subsequence 131
Top k 2-clubs in a network: A genetic algorithm 122
On the Tractability of Covering a Graph with 2-Clubs 115
Complexity issues of string to graph approximate matching 112
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 94
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 92
Complexity and Algorithms for MUL-Tree Pruning 88
Hardness and tractability of the γ-Complete Subgraph problem 86
SOFSEM 2021: Theory and Practice of Computer Science: 47th International Conference on Current Trends in Theory and Practice of Computer Science, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings 82
Top-k Connected Overlapping Densest Subgraphs in Dual Networks 81
Totale 24.555
Categoria #
all - tutte 64.680
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 64.680


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20203.010 0 146 441 566 247 185 334 197 359 146 208 181
2020/20214.092 445 252 170 218 229 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/2025256 139 117 0 0 0 0 0 0 0 0 0 0
Totale 25.501