statistiche ricercatore

Continente	#
NA - Nord America	955
AS - Asia	695
EU - Europa	527
SA - Sud America	108
Continente sconosciuto - Info sul continente non disponibili	78
AF - Africa	34
Totale	2.397

Nazione	#
US - Stati Uniti d'America	930
SG - Singapore	286
IT - Italia	267
CN - Cina	167
BR - Brasile	87
HK - Hong Kong	80
VN - Vietnam	64
GB - Regno Unito	54
SE - Svezia	50
FR - Francia	44
DE - Germania	38
JP - Giappone	34
BG - Bulgaria	16
CA - Canada	12
BD - Bangladesh	10
NL - Olanda	10
RU - Federazione Russa	10
MX - Messico	9
SN - Senegal	9
TR - Turchia	9
AR - Argentina	8
CI - Costa d'Avorio	8
KR - Corea	8
FI - Finlandia	7
IN - India	6
PL - Polonia	6
CO - Colombia	5
IQ - Iraq	5
RO - Romania	5
ZA - Sudafrica	5
AT - Austria	4
ES - Italia	4
ID - Indonesia	4
SA - Arabia Saudita	4
DK - Danimarca	3
EG - Egitto	3
NG - Nigeria	3
PY - Paraguay	3
CZ - Repubblica Ceca	2
EC - Ecuador	2
EE - Estonia	2
ET - Etiopia	2
GR - Grecia	2
IL - Israele	2
KE - Kenya	2
MY - Malesia	2
PA - Panama	2
PH - Filippine	2
PK - Pakistan	2
TW - Taiwan	2
UA - Ucraina	2
UY - Uruguay	2
AZ - Azerbaigian	1
BQ - ???statistics.table.value.countryCode.BQ???	1
DZ - Algeria	1
GE - Georgia	1
IE - Irlanda	1
JO - Giordania	1
KZ - Kazakistan	1
LB - Libano	1
MA - Marocco	1
NI - Nicaragua	1
PS - Palestinian Territory	1
QA - Qatar	1
TT - Trinidad e Tobago	1
UZ - Uzbekistan	1
VE - Venezuela	1
Totale	2.320

Nome	#
Online Algorithms on Antipowers and Antiperiods	378
Hide and Mine in Strings: Hardness and Algorithms	194
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	191
Enumeration of Maximal Common Subsequences Between Two Strings	191
Polynomial-Delay Enumeration of Maximal Common Subsequences	174
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails	147
Hide and Mine in Strings: Hardness, Algorithms, and Experiments	129
Finding Diverse Strings and Longest Common Subsequences in a Graph	115
A Compact DAG for Storing and Searching Maximal Common Subsequences	113
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs	105
Subsequence-Based Indices for Genome Sequence Analysis	104
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs	102
On Strings Having the Same Length- k Substrings	97
McDag: Indexing Maximal Common Subsequences in Practice	93
Bounding the Number of Eulerian Tours in Undirected Graphs	93
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space	77
$$\textsc {McDag}$$: indexing maximal common subsequences for k strings	46
Fast Assessment of Eulerian Trails in Graphs with Applications	26
The Complexity of Maximal Common Subsequence Enumeration	22
Totale	2.397

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2021/2022	66	0	0	1	5	21	9	1	2	6	5	6	10
2022/2023	101	9	11	10	6	6	12	0	5	30	0	12	0
2023/2024	161	17	14	13	18	32	8	12	0	1	2	20	24
2024/2025	626	6	13	25	25	48	57	67	32	37	53	75	188
2025/2026	1.023	34	115	79	130	92	70	115	38	86	111	49	104
2026/2027	285	70	188	27	0	0	0	0	0	0	0	0	0
Totale													2.397

CINECA IRIS Institutional Research Information System