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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021130 0 0 0 0 0 0 0 0 0 0 0 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/20263.678 654 705 188 372 151 152 453 204 165 314 61 259
Totale 9.156