IRIS
LANCIA, Giuseppe
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.400
EU - Europa 1.899
AS - Asia 1.302
SA - Sud America 167
AF - Africa 13
Continente sconosciuto - Info sul continente non disponibili 9
OC - Oceania 4
Totale 9.794
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.334
SG - Singapore 770
UA - Ucraina 463
IT - Italia 399
CN - Cina 260
DE - Germania 233
SE - Svezia 200
RU - Federazione Russa 168
BR - Brasile 156
FI - Finlandia 136
IE - Irlanda 101
VN - Vietnam 87
GB - Regno Unito 71
TR - Turchia 66
CA - Canada 58
KR - Corea 49
FR - Francia 42
BE - Belgio 15
IR - Iran 15
JP - Giappone 14
PL - Polonia 14
IN - India 11
AT - Austria 10
EU - Europa 9
NL - Olanda 9
RO - Romania 7
ES - Italia 6
AU - Australia 4
BD - Bangladesh 4
HK - Hong Kong 4
PT - Portogallo 4
AR - Argentina 3
CH - Svizzera 3
EG - Egitto 3
IQ - Iraq 3
MK - Macedonia 3
MX - Messico 3
PK - Pakistan 3
RS - Serbia 3
SA - Arabia Saudita 3
CL - Cile 2
CM - Camerun 2
CO - Colombia 2
CZ - Repubblica Ceca 2
GR - Grecia 2
ID - Indonesia 2
KE - Kenya 2
LY - Libia 2
PE - Perù 2
SI - Slovenia 2
TW - Taiwan 2
ZA - Sudafrica 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BO - Bolivia 1
CR - Costa Rica 1
DO - Repubblica Dominicana 1
EC - Ecuador 1
EE - Estonia 1
HU - Ungheria 1
JO - Giordania 1
KY - Cayman, isole 1
KZ - Kazakistan 1
NO - Norvegia 1
NP - Nepal 1
OM - Oman 1
PH - Filippine 1
QA - Qatar 1
SV - El Salvador 1
TG - Togo 1
TN - Tunisia 1
UZ - Uzbekistan 1
VC - Saint Vincent e Grenadine 1
Totale 9.794
Salva come PNG Salva come JPEG
Città #
Woodbridge 817
Fairfield 744
Ann Arbor 615
Houston 565
Singapore 425
Chandler 408
Ashburn 342
Jacksonville 312
Wilmington 293
Seattle 285
Cambridge 258
Dearborn 208
New York 201
Beijing 138
Udine 136
Boardman 116
Dublin 98
Princeton 98
Dong Ket 87
Izmir 60
Seoul 48
San Diego 43
Trieste 40
Ottawa 29
Scuola 28
Des Moines 26
Andover 24
Mcallen 20
Ogden 19
Toronto 19
Rome 18
Brussels 15
Nanjing 15
Frankfurt am Main 13
Hefei 13
Norwalk 13
Leawood 12
Los Angeles 12
São Paulo 12
Tokyo 12
Düsseldorf 11
Warsaw 11
Helsinki 9
Kunming 9
Nanchang 9
Belo Horizonte 8
Falls Church 8
Milan 8
San Jose 8
Saint-Etienne-de-Valoux 7
Simi Valley 7
Giessen 6
Verona 6
Vienna 6
Auburn Hills 5
Cormòns 5
João Pessoa 5
Nuremberg 5
Palmanova 5
Paris 5
Portsmouth 5
Santa Clara 5
Shanghai 5
Zhengzhou 5
Boston 4
Brooklyn 4
Guangzhou 4
Hong Kong 4
Lancaster 4
Monfalcone 4
Porto Alegre 4
Rio de Janeiro 4
Salvador 4
San Francisco 4
San Mateo 4
Selvazzano Dentro 4
Tianjin 4
Timisoara 4
Zanjan 4
Buffalo 3
Chennai 3
Cork 3
Fortaleza 3
Giungano 3
Harbin 3
Henderson 3
Jinan 3
Kish 3
London 3
Phoenix 3
Pordenone 3
Porto 3
Redwood City 3
Sacramento 3
Shenyang 3
Skopje 3
Torino 3
Utrecht 3
Villeurbanne 3
Winnipeg 3
Totale 6.923
Salva come PNG Salva come JPEG
Nome #
1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap 244
Combinatorial Haplotyping Problems 180
A Facility Location Model for Air Pollution Detection 177
Tiling binary matrices in haplotyping: Complexity, algorithms and models 170
The complexity of some pattern problems in the logical analysis of large genomic data sets 168
101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem 166
Estimating the strength of poker hands by integer linear programming techniques 164
Protein Structure Comparison: Algorithms and Applications 154
A time-indexed LP-based approach for min-sum job-shop problems 150
CollHaps: a heuristic approach to haplotype inference by parsimony 147
Opportunities for Combinatorial Optimization in Computational Biology 147
Sorting Permutations by Reversals through Branch and Price 145
Deriving compact extended formulations via LP-based separation techniques 145
A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals 143
A unified integer programming model for genome rearrangement problems 143
Compact extended linear programming models 142
A polynomial case of the parsimony haplotyping problem 140
GESTALT: GEnomic STeiner ALignmenTs 139
Structural alignment of large-size proteins via Lagrangian Relaxation 139
Local search inequalities 139
A set covering approach with column generation for parsimony haplotyping 138
Scheduling Jobs with Release Dates and Tails on Two Unrelated Parallel Machines to Minimize the Makespan 138
Optimal and Near-Optimal solutions for 3D Structure Comparisons 137
FASTSET: A Fast Data Structure for the Representation of Sets of Integers 134
Haplotyping as Perfect Phylogeny: A Direct Approach 133
New modeling ideas for the exact solution of the closest string problem 133
An effective compact formulation of the max cut problem on sparse graphs 132
Mathematical Models and Solutions for the Analysis of Human Genotypes 131
Algorithmic approaches for the single individual haplotyping problem 128
Haplotyping Populations by Pure Parsimony. Complexity, Exact and Approximation Algorithms 127
Exact algorithms for minimum routing cost trees 124
Banishing Bias from Consensus Sequences 123
Experimental and statistical analysis of sorting by reversals 122
Compact Optimization Can Outperform Separation: A Case Study in Structural Proteomics 119
Algorithms and Data Structures for Next Generation Sequences 119
Separating sets of strings by finding matching patterns is almost always hard 116
Haplotyping for disease association: a combinatorial approach 115
Polynomial and APX-hard cases of the individual haplotyping problem 115
Speeding-up the exploration of the 3-OPT neighborhood for the TSP 115
Deriving compact extended formulations via LP-based separation techniques 115
Ramsey Theory and integrality gap for the independent set problem 114
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques 113
Perfect Phylogeny Haplotyping 113
The string barcoding problem is NP-hard 112
Mathematical Programming in Computational Biology: An Annotated Bibliography 112
Flipping letters to minimize the support of a string 112
Application of Feature Selection and Classification to Computational Molecular Biology 112
Integer Programming models for computational biology problems 108
Algorithmic strategies for the SNPs haplotype assembly problem 106
A time indexed model for Open Shop and Job Shop with three operations 104
Practical Algorithms and Fixed-Parameter Tractability of the Single Individual Haplotyping Problem 103
Logic Classification and Feature Selection for Biomedical Data 101
Flipping letters to minimize the support of a string 98
Alberto Caprara (1968-2012): Scientific Contributions 98
Computing the equity of a poker hand by Integer Linear Programming 98
Perfect Phylogeny Haplotyping 98
NEW IDEAS TO SPEED-UP FLOYD-WARSHALL SHORTEST PATHS ALGORITHM 96
Toward Fully Automated Genotyping: Genotyping Microsatellite Markers by Deconvolution 96
Fast Practical Solution of Sorting By Reversals 94
SNPs Problems, Algorithms and Complexity 93
Algorithmic Strategies in Combinatorial Chemistry 91
Using Tiny IP Formulations to Solve Max-Cut Instances 90
Compact vs Exponential-Size LP Relaxations 84
Speeding-up the dynamic programming procedure for the edit distance of two strings 84
Compact formulations for large-scale LP problems 82
The phasing of heterozygous traits: algorithms and complexity 80
An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian 79
Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood 78
A tabu search procedure for the TSP with time windows 76
A compact optimization approach for jobshop problems 75
The approximability of the String-Barcoding problem 72
Integer Programming Models For Sorting Permutations And Genome Rearrangement Problems 72
Compact formulations for large-scale LP problems 71
Applications to Computational Molecular Biology 69
Using Integer Programming to Search for Counterexamples: A Case Study 68
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology 66
Scheduling teams for aircraft ground maintenance 64
Finding the largest triangle in a graph in expected quadratic time 59
Combinatorial optimization problems in the study of human diversities 51
Job Shop Scheduling With Deadlines 49
Stable Sets 46
Finding the Best 3-{OPT} Move in Subcubic Time 44
Haplotyping as perfect phylogeny 43
Packing 42
Computational complexity and ilp models for pattern problems in the logical analysis of data 41
SNPs problems, complexity, and algorithms 41
An ILP Approach to Determine Smallest 4-Regular Nonhamiltonian, Nontraceable, and Nonhomogeneously Taceable Graphs 38
Finding the best 2-OPT move on nearly random Euclidean TSP tours in average linear time 37
Cuts and Induced Bipartite Subgraphs 35
Scheduling 34
General Techniques for Compact Formulations 33
Polyhedra 33
Computational molecular biology 32
Large-Scale Linear Programming 31
Trees 31
Average Case Subquadratic Exact and Heuristic Procedures for the Traveling Salesman 2-OPT Neighborhood 28
The Permutahedron 27
A polynomial-time approximation scheme for minimum routing cost spanning trees 26
Computational Biology Problems 25
Linear Programming 24
Totale 9.888
Salva come PNG Salva come JPEG
Categoria #
all - tutte 34.850
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 34.850
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020146 0 0 0 0 0 0 0 0 0 0 0 146
2020/20211.235 28 165 41 128 48 139 58 119 162 85 121 141
2021/2022920 47 58 28 128 48 31 42 37 8 140 214 139
2022/2023966 114 46 11 140 88 241 3 83 150 6 48 36
2023/2024545 45 36 25 21 62 224 13 26 30 21 18 24
2024/20251.542 23 110 112 66 93 149 102 105 162 158 416 46
Totale 9.976