DONDI, Riccardo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 19.166
NA - Nord America 7.568
AS - Asia 3.604
SA - Sud America 269
AF - Africa 152
Continente sconosciuto - Info sul continente non disponibili 11
OC - Oceania 10
Totale 30.780
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.260
GB - Regno Unito 7.142
IE - Irlanda 3.615
PL - Polonia 2.877
RU - Federazione Russa 1.965
CN - Cina 1.599
SG - Singapore 1.318
IT - Italia 924
NL - Olanda 594
DE - Germania 588
FR - Francia 513
SE - Svezia 425
CA - Canada 291
UA - Ucraina 240
BR - Brasile 215
VN - Vietnam 164
ZA - Sudafrica 129
IN - India 112
FI - Finlandia 93
KR - Corea 74
TR - Turchia 71
AT - Austria 63
ID - Indonesia 50
JP - Giappone 50
HK - Hong Kong 34
ES - Italia 23
EU - Europa 23
AR - Argentina 22
IR - Iran 22
BE - Belgio 19
LT - Lituania 17
MY - Malesia 17
CZ - Repubblica Ceca 16
RO - Romania 14
TW - Taiwan 14
BD - Bangladesh 13
EC - Ecuador 12
MX - Messico 11
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
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
PY - Paraguay 2
SN - Senegal 2
SY - Repubblica araba siriana 2
TN - Tunisia 2
TT - Trinidad e Tobago 2
AM - Armenia 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
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.795
Salva come PNG Salva come JPEG
Città #
Southend 6.836
Dublin 3.564
Warsaw 2.856
Jacksonville 787
Ashburn 687
Moscow 602
Singapore 506
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 160
Seattle 160
Boardman 155
Dearborn 150
Bergamo 139
Johannesburg 125
Cambridge 120
Shanghai 106
Altamura 97
San Mateo 95
Los Angeles 88
Milan 87
Nanchang 85
Atlanta 80
Fredericton 79
Redwood City 74
Dong Ket 72
Andover 68
London 68
Washington 56
Buffalo 55
Kocaeli 51
Kunming 45
Vienna 45
Ogden 44
Chicago 40
Council Bluffs 38
Hebei 37
Redondo Beach 36
Dallas 35
Rancio Valcuvia 35
Ho Chi Minh City 34
Jakarta 32
Sunnyvale 31
New York 29
Shenyang 29
Hangzhou 26
Jiaxing 26
São Paulo 26
Tianjin 24
Tokyo 24
Needham Heights 23
Changsha 21
Chennai 21
Hanoi 21
Hong Kong 21
Santa Clara 20
Brusaporto 19
Seoul 19
Amsterdam 18
Munich 18
Phoenix 18
Assago 16
Hounslow 15
Boston 14
Brussels 14
Guangzhou 14
Auburn Hills 13
Brno 13
Brooklyn 13
Changchun 13
Fremont 13
Stockholm 13
Frankfurt am Main 12
Jinan 12
Montreal 12
Pune 12
Taipei 12
Helsinki 11
Lanzhou 11
Lappeenranta 11
Poplar 11
Zhengzhou 11
Acton 10
Norwalk 10
Nuremberg 10
Ottawa 10
Padova 10
San Francisco 10
Berlin 9
Totale 22.568
Salva come PNG Salva come JPEG
Nome #
10th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2017 [Introduction] 629
The link between orthology relations and gene trees: a correction perspective 563
Polytomy refinement for the correction of dubious duplications in gene trees 515
Finding disjoint paths on edge-colored graphs: A multivariate complexity analysis 511
Correction of weighted orthology and paralogy relations. Complexity and algorithmic results 510
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 492
The longest filled common subsequence problem 486
Parameterized tractability of the maximum-duo preservation string mapping problem 485
Clique editing to support case versus control discrimination 475
Correcting gene trees by leaf insertions: complexity and approximation 467
Approximating the correction of weighted and unweighted orthology and paralogy relations 466
Kernel Methods: Support Vector Machines 464
Reconciling multiple genes trees via segmental duplications and losses 357
Complexity issues in vertex-colored graph pattern matching 353
The binary perfect phylogeny with persistent characters 342
Fixed-parameter algorithms for scaffold filling 336
Pure Parsimony Xor Haplotyping 332
Editorial of the special issue of the 10th workshop on biomedical and bioinformatics challenges for computer science—BBC 2017 332
Finding approximate and constrained motifs in Graphs 331
8th Workshop on Biomedical and Bioinformatics Challenges for Computer Science – BBC2015. Introduction 325
Weak pattern matching in colored graphs: Minimizing the number of connected components 324
New results for the Longest Haplotype Reconstruction problem 322
Moving Assistive Technology on the Web: The Farfalla Experience 322
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 315
On the parameterized complexity of the repetition free longest common subsequence problem 313
Exemplar Longest Common Subsequence 310
Farfalla: a step toward an inclusive web 309
Complexity Insights of the Minimum Duplication Problem 298
Fingerprint Clustering with Bounded Number of Missing Values 298
Fixed-Parameter Algorithms for Scaffold Filling 294
Top-k overlapping densest subgraphs: Approximation and complexity 292
Pure Parsimony Xor Haplotyping 291
On the Approximation of Correlation Clustering and Consensus Clustering 282
The k-Anonymity Problem Is Hard 282
Finding approximate and constrained motifs in graphs 282
Beyond evolutionary trees 280
Variants of constrained longest common subsequence 277
Duplication-Loss Genome Alignment: Complexity and Algorithm 277
Parameterized complexity of k-anonymity: hardness and tractability 275
Aligning and Labeling Genomes under the Duplication-Loss Model 274
Minimum Factorization Agreement of Spliced ESTs 272
Complexity insights of the Minimum Duplication problem 271
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 269
Reconciling multiple genes trees via segmental duplications and losses 269
Beyond Evolutionary Trees 268
The Haplotyping Problem: An Overview of Computational Models and Solutions 267
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs 263
Maximum disjoint paths on edge-colored graphs: approximability and tractability 262
Graph Algorithms 261
Anonymizing binary and small tables is hard to approximate 260
On the Complexity of the l-diversity Problem 260
The Longest Haplotype Reconstruction Problem Revisited 259
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence 258
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. 257
The constrained shortest common supersequence problem 256
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms 255
Signal Transduction Networks via Transitive Reductions of Directed Graphs 255
HapCol: Accurate and memory-efficient haplotype assembly from long reads 253
Covering Pairs in Directed Acyclic Graphs 248
Maximum Motif Problem in Vertex-Colored Graphs 248
The Comparison of Phylogenetic Networks: Algorithms and Complexity 247
Robust Conclusions in Mass Spectrometry Analysis 241
Preface [11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016; Bergamo; Italy; 18 July 2016 through 20 July 2016] 241
Gene tree correction for reconciliation and species tree inference: complexity and algorithms 240
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability 237
Kernel Machines: Introduction 234
When and How the Perfect Phylogeny Model Explains Evolution 232
Parameterized Complexity of k-Anonymity: Hardness and Tractability 230
Covering a Graph with Clubs 226
Optimized Social Explanation for Educational Platforms 224
A clustering algorithm for planning the integration process of a large number of conceptual schemas 218
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 205
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 203
Restricted and swap common superstring: a multivariate algorithmic perspective 200
Genetic algorithms for finding episodes in temporal networks 197
Correcting gene tree by removal and modification: tractability and approximability 196
Kernel Machines: Applications 191
Covering pairs in directed acyclic graphs 191
Covering with clubs: Complexity and approximability 178
Editorial [to Theoretical computer Science, vol. 717] 176
Insights into the Complexity of Disentangling Temporal Graphs 174
Comparing incomplete sequences via longest common subsequence 173
On the tractability of finding disjoint clubs in a network 172
Optimizing Social Interaction. A Computational Approach to Support Patient Engagement 170
Parameterized complexity and approximation issues for the colorful components problems 170
Temporal networks in biology and medicine: a survey on models, algorithms, and tools 168
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks 166
Finding disjoint paths on edge-colored graphs: more tractability results 163
Graph Isomorphism 163
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity 162
Finding Colorful Paths in Temporal Graphs 156
Hardness and tractability of the γ-Complete Subgraph problem 156
Colorful path detection in vertex-colored temporal 150
Top k 2-clubs in a network: A genetic algorithm 147
On the Tractability of Covering a Graph with 2-Clubs 145
Totale 28.495
Salva come PNG Salva come JPEG
Categoria #
all - tutte 93.453
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 93.453
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.688 245 312 589 538 896 108 0 0 0 0 0 0
Totale 31.430