CAIRO, Massimo
 Distribuzione geografica
Continente #
NA - Nord America 225
EU - Europa 215
AS - Asia 180
AF - Africa 3
SA - Sud America 1
Totale 624
Nazione #
US - Stati Uniti d'America 224
CN - Cina 109
GB - Regno Unito 68
SG - Singapore 37
IT - Italia 28
SE - Svezia 27
IE - Irlanda 23
RU - Federazione Russa 22
FR - Francia 20
DE - Germania 10
FI - Finlandia 8
ID - Indonesia 6
IR - Iran 6
VN - Vietnam 6
HK - Hong Kong 4
KR - Corea 4
TG - Togo 3
UA - Ucraina 3
CZ - Repubblica Ceca 2
LK - Sri Lanka 2
PK - Pakistan 2
RO - Romania 2
TW - Taiwan 2
BR - Brasile 1
CA - Canada 1
IN - India 1
JP - Giappone 1
NL - Olanda 1
PL - Polonia 1
Totale 624
Città #
Southend 63
Woodbridge 35
Singapore 32
Chandler 29
Ashburn 23
Dublin 23
Shenyang 13
Jacksonville 12
Wilmington 11
Ann Arbor 10
Beijing 10
Lawrence 9
Nanjing 9
Princeton 9
Houston 8
Jinan 8
Helsinki 7
Verona 7
Hebei 6
Jakarta 6
Ningbo 6
Phoenix 6
Tehran 6
Changsha 5
Seoul 4
Falls Church 3
Fuzhou 3
Guangzhou 3
Lanzhou 3
Lomé 3
Zhengzhou 3
Biassono 2
Boardman 2
Dallas 2
Dong Ket 2
Haikou 2
Hong Kong 2
Islamabad 2
Los Angeles 2
Mezzocorona 2
Nanchang 2
Prague 2
San Francisco 2
Santa Clara 2
Seattle 2
Taiyuan 2
Taizhou 2
Timisoara 2
Trento 2
Amsterdam 1
Bolzano 1
Bonndorf 1
Boston 1
Bovolone 1
Hangzhou 1
Hillsboro 1
Jiaxing 1
Lancaster 1
Lappeenranta 1
Nanning 1
New Taipei City 1
Norwalk 1
Redwood City 1
Sindelfingen 1
Taipei 1
Tappahannock 1
Tianjin 1
Tokyo 1
Toronto 1
Vellore 1
Venice 1
Warsaw 1
Wuhan 1
Totale 435
Nome #
Incorporating Decision Nodes into Conditional Simple Temporal Networks 116
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results 95
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks 62
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete 61
The Complexity of Simulation and Matrix Multiplication 60
Optimal Omnitig Listing for Safe and Complete Contig Assembly 56
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty 54
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG 36
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time 34
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time 29
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG 21
Cut Paths and Their Remainder Structure, with Applications 13
Width Helps and Hinders Splitting Flows 12
Totale 649
Categoria #
all - tutte 2.680
article - articoli 103
book - libri 0
conference - conferenze 2.577
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 5.360


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202040 0 0 0 0 11 3 1 0 4 2 2 17
2020/202187 9 11 19 18 10 5 0 0 5 0 3 7
2021/202268 6 14 2 4 7 3 1 6 2 0 1 22
2022/2023115 9 13 18 13 5 29 7 7 12 0 1 1
2023/2024110 2 12 1 7 12 2 22 7 1 9 16 19
2024/2025102 11 18 6 64 3 0 0 0 0 0 0 0
Totale 649