MAFFIOLI, FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 3.594
EU - Europa 2.296
AS - Asia 1.342
SA - Sud America 408
AF - Africa 56
Continente sconosciuto - Info sul continente non disponibili 5
OC - Oceania 2
Totale 7.703
Nazione #
US - Stati Uniti d'America 3.482
RU - Federazione Russa 934
SG - Singapore 608
CN - Cina 398
BR - Brasile 343
UA - Ucraina 281
SE - Svezia 190
IT - Italia 172
VN - Vietnam 166
DE - Germania 157
AT - Austria 117
GB - Regno Unito 99
CA - Canada 94
FI - Finlandia 83
ES - Italia 73
IE - Irlanda 64
NL - Olanda 51
FR - Francia 37
MA - Marocco 31
IN - India 27
KR - Corea 24
AR - Argentina 23
GR - Grecia 18
BD - Bangladesh 16
IQ - Iraq 15
EC - Ecuador 13
TR - Turchia 13
ID - Indonesia 10
HK - Hong Kong 9
JO - Giordania 9
CO - Colombia 8
CI - Costa d'Avorio 7
PK - Pakistan 7
PY - Paraguay 7
CL - Cile 6
IL - Israele 5
MX - Messico 5
PL - Polonia 5
ZA - Sudafrica 5
AE - Emirati Arabi Uniti 4
EU - Europa 4
JP - Giappone 4
SA - Arabia Saudita 4
CH - Svizzera 3
HN - Honduras 3
LT - Lituania 3
PE - Perù 3
TN - Tunisia 3
UY - Uruguay 3
UZ - Uzbekistan 3
AL - Albania 2
AM - Armenia 2
AU - Australia 2
AZ - Azerbaigian 2
BE - Belgio 2
CZ - Repubblica Ceca 2
EG - Egitto 2
IR - Iran 2
JM - Giamaica 2
KE - Kenya 2
LB - Libano 2
MY - Malesia 2
NP - Nepal 2
SN - Senegal 2
TT - Trinidad e Tobago 2
VE - Venezuela 2
BB - Barbados 1
BG - Bulgaria 1
BH - Bahrain 1
CR - Costa Rica 1
CY - Cipro 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
GA - Gabon 1
GE - Georgia 1
GT - Guatemala 1
HR - Croazia 1
KG - Kirghizistan 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
LV - Lettonia 1
LY - Libia 1
MU - Mauritius 1
OM - Oman 1
PA - Panama 1
PH - Filippine 1
PR - Porto Rico 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.703
Città #
Fairfield 491
Ashburn 325
Woodbridge 278
Santa Clara 246
Singapore 210
Wilmington 203
Houston 195
Chandler 180
Seattle 167
Jacksonville 162
Cambridge 138
Ann Arbor 131
Vienna 116
Moscow 115
Dearborn 108
Hefei 103
Beijing 91
Boardman 72
Málaga 70
Lawrence 68
Medford 68
Dublin 64
Council Bluffs 63
Ottawa 63
Dong Ket 55
Los Angeles 33
São Paulo 30
Buffalo 25
Amsterdam 24
Des Moines 23
New York 23
Ho Chi Minh City 22
Columbus 20
San Diego 19
Hanoi 18
Rio de Janeiro 18
San Jose 18
Dallas 17
Helsinki 15
Seoul 15
Casablanca 13
Milan 13
Kenitra 12
London 11
Shanghai 11
Guangzhou 10
Amman 9
Auburn Hills 9
Montréal 9
Verona 9
Norwalk 8
Seongnam 8
Abidjan 7
Belo Horizonte 7
Frankfurt am Main 7
Hong Kong 7
Ankara 6
Baghdad 6
Düsseldorf 6
Montreal 6
Mountain View 6
North York 6
Curitiba 5
Denver 5
Guayaquil 5
Haiphong 5
Juiz de Fora 5
Kent 5
Nanjing 5
Pelotas 5
Porto Alegre 5
Redwood City 5
Turin 5
Uberlândia 5
Asunción 4
Boston 4
Brooklyn 4
Campinas 4
Chicago 4
Duncan 4
Hangzhou 4
Hortolândia 4
Johannesburg 4
Kunming 4
Orem 4
Portsmouth 4
Rome 4
Santo André 4
Shenzhen 4
Stockholm 4
The Dalles 4
Tianjin 4
Tokyo 4
Toronto 4
Warsaw 4
Washington 4
Wuhan 4
Atlanta 3
Bitritto 3
Brasília 3
Totale 4.449
Nome #
Algorithms for finding minimum fundamental cycle bases in graphs 240
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints 216
A branch-and-cut method for the obnoxious p-median problem 185
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance 182
Approximating Maximum Cut with Limited Unbalance 161
Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited Unbalance 159
Cardinality constrained minimum cut problems: complexity and algorithms 157
On Minimum Reload Cost Cycle Cover 147
A particular class of graphic matroids 144
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases 144
A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem 142
Workforce Management based on forecasted demand 142
The vehicle routing problem: A book review 141
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases 140
A Mixed-integer Model for Solving Ordering problems with Side Constraints 136
Coloured Ant System and Local Search to Design Local Telecommunication Networks 133
Solving minimum k-cardinality cut problems in planar graphs 132
Approximation algorithms for maximum cut with limited unbalance 131
Approximability of hard combiantorial optimization problems: an introduction 129
Erasmus thematic networks and the European dimension of engineering education 129
Coloured ant system and local search to design local telecommunication networks 129
Innovation, quality and networking in Engineering Education in Europe: the contribution of SOCRATES Thematic Networks 128
Efficient algorithms for the assignment of OVSF codes in wideband CDMA 124
Approximating max cut with limited unbalence 123
Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask 122
Combining Linear and Non-Linear Objectives in Spanning Tree Problems 121
The vehicle routing problem: A book review 121
A Lagrangian Heuristic for the Prize Collecting TSP 120
On Minimum Reload Cost Paths, Tours and Flows 118
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps 116
On the complexity of graph tree partition problems 114
Discrete Facility Location and Routing of Obnoxious Activities 113
A characterization of the base-matroids of a graphic matroid 113
Extensions of matroids to uniform matroids 111
On minimum reload cost paths, tours, and flows 111
Edge-swapping algorithms for the minimum fundamental cycle basis problem 111
Elementi di Programmazione Matematica 2^ edizione 110
The Thematic Network E4: Enhancing Engineering Education in Europe 105
On some properties of base-matroids 105
Minimum cut bases in undirected networks 105
Fishman's sampling plan for computing network reliability 104
Improved algorithms for orthogonal code assignment in W-CDMA 103
Erasmus thematic networks and the European dimension of engineering education 103
Tuning engineering education into the European higher education orchestra 101
The base-matroid and inverse combinatorial optimization problems 101
Solving the Feedback Vertex Set Problem on Undirected Graphs 99
Exact Solution of the SONET Ring Loading Problem 99
On binary matroids not isomorphic to their base matroids 98
Third ALIO-EURO meeting on Applied Combinatorial Optimization-Discrete Applied Mathematics 96
On some properties of base-matroids 95
A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in CDMA 93
SOCRATES Thematic Networks: contributions to mutual knowledge and recognition of engineering education in Europe 89
Least and most colored bases 88
Thematic Network E4: an effective tool to improve EE in Europe 85
New Bounds for Optimum Traffic Assignment in Satellite Communication 84
On the Approximability of Some Maximum Spanning Tree Problems 83
Re-engineering Engineering Education in Europe 80
Il contributo delle Reti Tematiche SOCRATES al mutuo riconoscimento e accreditamento Europeo dei titoli di studio in ingegneria 76
The Contribution of Socrates Thematic Networks to Mutual Recognition of Engineering Study Programs across Europe 74
Two-Connected Networks with Bounded Meshes 73
Tuning engineering education into the European higher education orchestra 73
Discrete Applied Mathematics - 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (special issue) 72
Eugene Academic Network Contributing to the Realisation of the European Higher Education Area 64
Randomized algorithms over finite fields for the exact parity base problems 64
ECCE - Engineering Observatory on Competence Based Curricula for Job Enhancement 62
Solution of the Cumulative Assignment Problem with a well-structured Tabu Search Method 59
Discrete Optimization - Special issue on Graphs and Combinatorial Optimization 59
On Minimum (Fundamental) Cut Bases Of A Graph 53
Totale 7.740
Categoria #
all - tutte 20.834
article - articoli 12.156
book - libri 277
conference - conferenze 6.487
curatela - curatele 724
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.190
Totale 41.668


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021427 0 0 0 0 0 0 63 70 35 85 44 130
2021/2022497 20 51 14 40 93 28 19 21 28 41 37 105
2022/2023476 75 27 25 32 57 56 0 26 67 75 33 3
2023/2024223 24 61 29 29 6 26 11 11 0 7 6 13
2024/20251.216 18 6 16 18 247 90 39 97 143 135 177 230
2025/20262.262 654 705 188 372 151 152 40 0 0 0 0 0
Totale 7.740