statistiche ricercatore

Continente	#
NA - Nord America	711
AS - Asia	692
EU - Europa	506
SA - Sud America	107
AF - Africa	34
Continente sconosciuto - Info sul continente non disponibili	1
Totale	2.051

Nazione	#
US - Stati Uniti d'America	691
SG - Singapore	286
IT - Italia	256
CN - Cina	166
BR - Brasile	86
HK - Hong Kong	79
VN - Vietnam	64
GB - Regno Unito	54
FR - Francia	44
SE - Svezia	40
DE - Germania	38
JP - Giappone	34
BG - Bulgaria	16
BD - Bangladesh	10
NL - Olanda	10
RU - Federazione Russa	10
CA - Canada	9
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
SA - Arabia Saudita	4
DK - Danimarca	3
EG - Egitto	3
ID - Indonesia	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
PS - Palestinian Territory	1
QA - Qatar	1
UZ - Uzbekistan	1
VE - Venezuela	1
Totale	2.051

Nome	#
Online Algorithms on Antipowers and Antiperiods	200
Hide and Mine in Strings: Hardness and Algorithms	184
Enumeration of Maximal Common Subsequences Between Two Strings	181
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	176
Polynomial-Delay Enumeration of Maximal Common Subsequences	168
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails	143
Hide and Mine in Strings: Hardness, Algorithms, and Experiments	127
Finding Diverse Strings and Longest Common Subsequences in a Graph	111
A Compact DAG for Storing and Searching Maximal Common Subsequences	108
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs	103
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs	102
Subsequence-Based Indices for Genome Sequence Analysis	97
On Strings Having the Same Length- k Substrings	94
Bounding the Number of Eulerian Tours in Undirected Graphs	92
McDag: Indexing Maximal Common Subsequences in Practice	89
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space	73
$$\textsc {McDag}$$: indexing maximal common subsequences for k strings	42
Fast Assessment of Eulerian Trails in Graphs with Applications	19
The Complexity of Maximal Common Subsequence Enumeration	19
Totale	2.128

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2021/2022	80	11	3	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	16	16	0	0	0	0	0	0	0	0	0	0	0
Totale													2.128

CINECA IRIS Institutional Research Information System