statistiche ricercatore

Nazione	#
US - Stati Uniti d'America	367
SG - Singapore	192
BR - Brasile	84
CN - Cina	82
VN - Vietnam	64
IT - Italia	48
HK - Hong Kong	47
FR - Francia	23
ID - Indonesia	17
TH - Thailandia	17
MY - Malesia	15
PL - Polonia	12
IN - India	10
TR - Turchia	7
KR - Corea	6
PH - Filippine	6
DE - Germania	5
EC - Ecuador	5
ZA - Sudafrica	5
AR - Argentina	4
JP - Giappone	4
RU - Federazione Russa	4
AE - Emirati Arabi Uniti	3
CO - Colombia	3
AT - Austria	2
BD - Bangladesh	2
CA - Canada	2
CL - Cile	2
EG - Egitto	2
IL - Israele	2
JO - Giordania	2
KZ - Kazakistan	2
PK - Pakistan	2
PY - Paraguay	2
TN - Tunisia	2
UA - Ucraina	2
VE - Venezuela	2
BA - Bosnia-Erzegovina	1
BO - Bolivia	1
CY - Cipro	1
DZ - Algeria	1
ES - Italia	1
FI - Finlandia	1
GB - Regno Unito	1
HN - Honduras	1
HU - Ungheria	1
IQ - Iraq	1
JM - Giamaica	1
KE - Kenya	1
KG - Kirghizistan	1
LK - Sri Lanka	1
LT - Lituania	1
MA - Marocco	1
MX - Messico	1
NL - Olanda	1
NP - Nepal	1
PA - Panama	1
PF - Polinesia Francese	1
SA - Arabia Saudita	1
SK - Slovacchia (Repubblica Slovacca)	1
SL - Sierra Leone	1
UY - Uruguay	1
UZ - Uzbekistan	1
VG - Isole Vergini Britanniche	1
Totale	1.083

Nome	#
Bipartite finite Toeplitz graphs	97
A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs	70
On the Benchmark Instances for the Bin Packing Problem with Conflicts	69
Coloring Toeplitz graphs	68
A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs	51
Vertex-colouring of circulant graphs: a combinatorial approach	47
On the benchmark instances for the Bin Packing with Conflicts	43
Bipartite finite Toeplitz graphs	41
Vertex-colouring of 3-chromatic circulant graphs	40
Coloring Circulant Graphs	39
Optimal Partition of a Bipartite Graph with prescribed layout into Non-Crossing b-Matchings	39
On the chromatic number of Toeplitz graphs	39
On the chromatic number of Toeplitz graphs	39
On the chromatic number of Toeplitz graphs	38
On Isomorphic 4-Regular Circulant Graphs	37
Isomorphism testing for circulant graphs Cn(a,b)	36
Isomorphism Testing for Circulant Graphs	35
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors	34
Isomorphism testing for circulant graphs C_n(a,b)	34
Optimal Partition of a Bipartite Graph with Prescribed Layout into NonCrossing Matchings	33
Optimal Partition of a Bipartite Graph with prescribed layout into Non-Crossing Matchings	33
Shiftable Intervals	31
Bipartite finite Toeplitz graphs	28
Optimal partition of a bipartite graph into non-crossing matchings	28
Optimal Partition of a Bipartite Graph into Non-Crossing Matchings	25
null	22
Totale	1.096

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2023/2024	2	0	0	0	0	0	0	0	0	0	1	0	1
2024/2025	475	0	2	38	13	171	27	16	30	5	4	94	75
2025/2026	597	10	21	64	72	160	45	104	26	25	32	22	16
2026/2027	22	22	0	0	0	0	0	0	0	0	0	0	0
Totale													1.096

CNR Institutional Research Information System