statistiche ricercatore

Continente	#
NA - Nord America	508
AS - Asia	352
EU - Europa	187
SA - Sud America	53
Continente sconosciuto - Info sul continente non disponibili	40
AF - Africa	7
OC - Oceania	2
Totale	1.149

Nazione	#
US - Stati Uniti d'America	471
SG - Singapore	145
IT - Italia	57
HK - Hong Kong	55
CN - Cina	46
BR - Brasile	40
KR - Corea	34
RU - Federazione Russa	33
FR - Francia	28
VN - Vietnam	23
CA - Canada	17
DE - Germania	13
BD - Bangladesh	10
FI - Finlandia	9
GB - Regno Unito	9
IE - Irlanda	9
CO - Colombia	6
IL - Israele	6
CZ - Repubblica Ceca	5
ES - Italia	5
HN - Honduras	5
IN - India	5
PK - Pakistan	4
PL - Polonia	4
TR - Turchia	4
AR - Argentina	3
CL - Cile	3
CR - Costa Rica	3
CW - ???statistics.table.value.countryCode.CW???	3
HR - Croazia	3
ID - Indonesia	3
IQ - Iraq	3
MX - Messico	3
PH - Filippine	3
SE - Svezia	3
AT - Austria	2
GP - Guadalupe	2
GR - Grecia	2
MD - Moldavia	2
PT - Portogallo	2
TN - Tunisia	2
TT - Trinidad e Tobago	2
UZ - Uzbekistan	2
AE - Emirati Arabi Uniti	1
AG - Antigua e Barbuda	1
AU - Australia	1
AZ - Azerbaigian	1
BH - Bahrain	1
BO - Bolivia	1
GN - Guinea	1
JM - Giamaica	1
JO - Giordania	1
JP - Giappone	1
KE - Kenya	1
MA - Marocco	1
MM - Myanmar	1
NI - Nicaragua	1
NZ - Nuova Zelanda	1
PA - Panama	1
PR - Porto Rico	1
PS - Palestinian Territory	1
SA - Arabia Saudita	1
SC - Seychelles	1
SY - Repubblica araba siriana	1
UA - Ucraina	1
ZA - Sudafrica	1
Totale	1.112

Nome	#
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	96
Optimal orthogonal drawings of planar 3-graphs in linear time	94
On the parameterized complexity of s-club cluster deletion problems	81
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity	74
Small Point-Sets Supporting Graph Stories	73
On the Parameterized Complexity of s-club Cluster Deletion Problems	72
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges	70
Partial Temporal Vertex Cover with Bounded Activity Intervals	69
Small Point-Sets Supporting Graph Stories	67
Rectilinear Planarity of Partial 2-Trees	66
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper)	64
Rectilinear Planarity of Partial 2-Trees	62
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time	61
Rectilinear-Upward Planarity Testing of Digraphs	59
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges	37
On Planar Straight-Line Dominance Drawings	36
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity	34
Rectilinear Planarity of Partial 2-Trees	19
Rectilinear-upward planarity testing of digraphs	15
Totale	1.149

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2021/2022	9	0	0	0	0	1	0	0	5	0	1	0	2
2022/2023	22	2	3	0	0	2	1	0	0	13	0	0	1
2023/2024	84	7	4	3	4	1	7	3	3	26	6	12	8
2024/2025	269	12	26	8	9	23	9	18	45	31	29	44	15
2025/2026	521	33	46	31	39	70	34	86	31	42	74	23	12
2026/2027	238	5	30	40	139	24	0	0	0	0	0	0	0
Totale													1.149

IRIS - Res&Arch Institutional Research Information System - Research & Archive