IRIS
LANCIA, Giuseppe
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.353
EU - Europa 1.674
AS - Asia 523
Continente sconosciuto - Info sul continente non disponibili 10
SA - Sud America 8
AF - Africa 7
OC - Oceania 3
Totale 8.578
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.297
UA - Ucraina 469
IT - Italia 380
DE - Germania 211
SE - Svezia 206
CN - Cina 198
FI - Finlandia 136
SG - Singapore 133
IE - Irlanda 101
VN - Vietnam 87
GB - Regno Unito 66
TR - Turchia 63
CA - Canada 55
FR - Francia 33
IR - Iran 16
BE - Belgio 14
RU - Federazione Russa 13
JP - Giappone 11
EU - Europa 10
IN - India 8
RO - Romania 7
AT - Austria 6
NL - Olanda 6
BR - Brasile 5
PL - Polonia 5
ES - Italia 4
PT - Portogallo 4
AU - Australia 3
CH - Svizzera 3
CL - Cile 2
CM - Camerun 2
CZ - Repubblica Ceca 2
GR - Grecia 2
ID - Indonesia 2
LY - Libia 2
RS - Serbia 2
SI - Slovenia 2
TW - Taiwan 2
BG - Bulgaria 1
CO - Colombia 1
CR - Costa Rica 1
EE - Estonia 1
EG - Egitto 1
KR - Corea 1
OM - Oman 1
PH - Filippine 1
TG - Togo 1
ZA - Sudafrica 1
Totale 8.578
Salva come PNG Salva come JPEG
Città #
Woodbridge 827
Fairfield 746
Ann Arbor 631
Houston 565
Chandler 414
Ashburn 342
Jacksonville 317
Wilmington 293
Seattle 283
Cambridge 258
Dearborn 208
New York 200
Udine 126
Boardman 118
Singapore 115
Princeton 99
Dublin 98
Beijing 88
Dong Ket 87
Izmir 61
San Diego 43
Trieste 40
Ottawa 30
Scuola 28
Des Moines 27
Andover 24
Mcallen 20
Ogden 19
Rome 18
Nanjing 16
Toronto 16
Brussels 14
Norwalk 14
Hefei 13
Leawood 12
Kunming 9
Nanchang 9
Tokyo 9
Falls Church 8
Helsinki 8
San Jose 8
Milan 7
Saint-Etienne-de-Valoux 7
Simi Valley 7
Frankfurt am Main 6
Giessen 6
Verona 6
Auburn Hills 5
Cormòns 5
Palmanova 5
Zhengzhou 5
Guangzhou 4
Lancaster 4
Los Angeles 4
Monfalcone 4
Nuremberg 4
Paris 4
San Mateo 4
Selvazzano Dentro 4
Tianjin 4
Timisoara 4
Vienna 4
Zanjan 4
Cork 3
Giungano 3
Harbin 3
Henderson 3
João Pessoa 3
Kish 3
London 3
Phoenix 3
Pordenone 3
Porto 3
Portsmouth 3
Redwood City 3
Sacramento 3
Shanghai 3
Shenyang 3
Torino 3
Utrecht 3
Villeurbanne 3
Winnipeg 3
Wuhan 3
Xian 3
Zurich 3
Amsterdam 2
Baotou 2
Bekasi 2
Belgrade 2
Boston 2
Chaoyang 2
Chennai 2
Chicago 2
Chongqing 2
Comacchio 2
Council Bluffs 2
Dallas 2
Frontone 2
Guiyang 2
Günzburg 2
Totale 6.464
Salva come PNG Salva come JPEG
Nome #
1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap 225
Combinatorial Haplotyping Problems 171
A Facility Location Model for Air Pollution Detection 162
The complexity of some pattern problems in the logical analysis of large genomic data sets 157
Estimating the strength of poker hands by integer linear programming techniques 155
101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem 148
Protein Structure Comparison: Algorithms and Applications 145
A time-indexed LP-based approach for min-sum job-shop problems 138
Sorting Permutations by Reversals through Branch and Price 137
Opportunities for Combinatorial Optimization in Computational Biology 136
Deriving compact extended formulations via LP-based separation techniques 135
CollHaps: a heuristic approach to haplotype inference by parsimony 134
A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals 130
A polynomial case of the parsimony haplotyping problem 130
Local search inequalities 130
Compact extended linear programming models 130
Scheduling Jobs with Release Dates and Tails on Two Unrelated Parallel Machines to Minimize the Makespan 129
New modeling ideas for the exact solution of the closest string problem 129
Optimal and Near-Optimal solutions for 3D Structure Comparisons 127
A unified integer programming model for genome rearrangement problems 127
GESTALT: GEnomic STeiner ALignmenTs 126
Structural alignment of large-size proteins via Lagrangian Relaxation 126
FASTSET: A Fast Data Structure for the Representation of Sets of Integers 125
An effective compact formulation of the max cut problem on sparse graphs 123
A set covering approach with column generation for parsimony haplotyping 122
Mathematical Models and Solutions for the Analysis of Human Genotypes 121
Haplotyping Populations by Pure Parsimony. Complexity, Exact and Approximation Algorithms 118
Haplotyping as Perfect Phylogeny: A Direct Approach 117
Algorithmic approaches for the single individual haplotyping problem 114
Experimental and statistical analysis of sorting by reversals 113
Banishing Bias from Consensus Sequences 112
Exact algorithms for minimum routing cost trees 109
Deriving compact extended formulations via LP-based separation techniques 109
Compact Optimization Can Outperform Separation: A Case Study in Structural Proteomics 107
Speeding-up the exploration of the 3-OPT neighborhood for the TSP 107
Application of Feature Selection and Classification to Computational Molecular Biology 106
Perfect Phylogeny Haplotyping 105
Polynomial and APX-hard cases of the individual haplotyping problem 105
Haplotyping for disease association: a combinatorial approach 104
Mathematical Programming in Computational Biology: An Annotated Bibliography 104
Ramsey Theory and integrality gap for the independent set problem 104
Separating sets of strings by finding matching patterns is almost always hard 104
Algorithms and Data Structures for Next Generation Sequences 104
The string barcoding problem is NP-hard 103
Flipping letters to minimize the support of a string 103
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques 99
Practical Algorithms and Fixed-Parameter Tractability of the Single Individual Haplotyping Problem 94
Algorithmic strategies for the SNPs haplotype assembly problem 94
Integer Programming models for computational biology problems 92
Flipping letters to minimize the support of a string 91
Perfect Phylogeny Haplotyping 91
A Polynomial-time Approximation Scheme for the Minimum Routing Cost Tree Problem 90
Alberto Caprara (1968-2012): Scientific Contributions 84
A time indexed model for Open Shop and Job Shop with three operations 84
Computing the equity of a poker hand by Integer Linear Programming 83
Toward Fully Automated Genotyping: Genotyping Microsatellite Markers by Deconvolution 82
Using Tiny IP Formulations to Solve Max-Cut Instances 82
SNPs Problems, Algorithms and Complexity 81
Logic Classification and Feature Selection for Biomedical Data 81
Fast Practical Solution of Sorting By Reversals 79
Algorithmic Strategies in Combinatorial Chemistry 79
Speeding-up the dynamic programming procedure for the edit distance of two strings 79
Compact vs Exponential-Size LP Relaxations 76
The phasing of heterozygous traits: algorithms and complexity 73
Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood 70
Compact formulations for large-scale LP problems 68
NEW IDEAS TO SPEED-UP FLOYD-WARSHALL SHORTEST PATHS ALGORITHM 66
Integer Programming Models For Sorting Permutations And Genome Rearrangement Problems 65
A tabu search procedure for the TSP with time windows 62
An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian 62
Applications to Computational Molecular Biology 61
The approximability of the String-Barcoding problem 60
A compact optimization approach for jobshop problems 60
Compact formulations for large-scale LP problems 60
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology 57
Using Integer Programming to Search for Counterexamples: A Case Study 57
Scheduling teams for aircraft ground maintenance 57
Combinatorial optimization problems in the study of human diversities 42
Finding the Best 3-{OPT} Move in Subcubic Time 40
Tiling binary matrices in haplotyping: Complexity, algorithms and models 39
Finding the largest triangle in a graph in expected quadratic time 39
Job Shop Scheduling With Deadlines 37
Haplotyping as perfect phylogeny 35
Packing 33
Stable Sets 31
SNPs problems, complexity, and algorithms 30
Scheduling 27
General Techniques for Compact Formulations 25
Cuts and Induced Bipartite Subgraphs 25
Trees 25
Computational complexity and ilp models for pattern problems in the logical analysis of data 24
Computational molecular biology 24
Finding the best 2-OPT move on nearly random Euclidean TSP tours in average linear time 23
Polyhedra 23
The Permutahedron 22
Large-Scale Linear Programming 20
Computational Biology Problems 19
An ILP Approach to Determine Smallest 4-Regular Nonhamiltonian, Nontraceable, and Nonhomogeneously Taceable Graphs 18
The Parity Polytope 16
A polynomial-time approximation scheme for minimum routing cost spanning trees 14
Totale 8.716
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.973
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 27.973
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.891 0 0 106 305 157 318 256 238 162 156 45 148
2020/20211.245 28 166 41 129 48 141 58 120 164 85 123 142
2021/2022932 47 59 30 130 48 31 42 38 8 141 218 140
2022/2023982 115 48 11 143 89 244 3 84 153 6 49 37
2023/2024549 45 36 25 21 62 226 13 26 30 22 18 25
2024/2025235 23 111 101 0 0 0 0 0 0 0 0 0
Totale 8.757