IRIS
LANCIA, Giuseppe
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.246
EU - Europa 1.648
AS - Asia 381
Continente sconosciuto - Info sul continente non disponibili 10
SA - Sud America 8
AF - Africa 7
OC - Oceania 3
Totale 8.303
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.190
UA - Ucraina 469
IT - Italia 374
SE - Svezia 206
DE - Germania 200
CN - Cina 194
FI - Finlandia 133
IE - Irlanda 101
VN - Vietnam 87
GB - Regno Unito 64
TR - Turchia 63
CA - Canada 55
FR - Francia 30
IR - Iran 16
BE - Belgio 14
RU - Federazione Russa 13
JP - Giappone 11
EU - Europa 10
RO - Romania 7
AT - Austria 6
NL - Olanda 6
BR - Brasile 5
PL - Polonia 5
ES - Italia 4
AU - Australia 3
CH - Svizzera 3
IN - India 3
PT - Portogallo 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.303
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
Princeton 99
Dublin 98
Beijing 88
Dong Ket 87
Izmir 61
San Diego 43
Trieste 38
Ottawa 30
Scuola 28
Des Moines 27
Andover 24
Mcallen 20
Ogden 19
Rome 18
Nanjing 16
Toronto 16
Boardman 14
Brussels 14
Norwalk 14
Hefei 13
Leawood 12
Kunming 9
Nanchang 9
Tokyo 9
Falls Church 8
San Jose 8
Saint-Etienne-de-Valoux 7
Simi Valley 7
Verona 6
Auburn Hills 5
Cormòns 5
Frankfurt am Main 5
Helsinki 5
Palmanova 5
Zhengzhou 5
Los Angeles 4
Milan 4
Monfalcone 4
Nuremberg 4
San Mateo 4
Selvazzano Dentro 4
Tianjin 4
Timisoara 4
Vienna 4
Zanjan 4
Cork 3
Giungano 3
Guangzhou 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
Chicago 2
Chongqing 2
Comacchio 2
Council Bluffs 2
Dallas 2
Frontone 2
Guiyang 2
Günzburg 2
Hangzhou 2
Hebei 2
Indiana 2
Jinan 2
Lancaster 2
Totale 6.229
Salva come PNG Salva come JPEG
Nome #
1001 optimal PDB structure alignments: Integer Programming methods for finding the maximum contact map overlap 220
Combinatorial Haplotyping Problems 169
A Facility Location Model for Air Pollution Detection 161
The complexity of some pattern problems in the logical analysis of large genomic data sets 156
Estimating the strength of poker hands by integer linear programming techniques 151
101 Optimal PDB Structure Alignments: a Branch-And-Cut Algorithm for the Maximum Contact Map Overlap Problem 144
Protein Structure Comparison: Algorithms and Applications 142
A time-indexed LP-based approach for min-sum job-shop problems 137
Sorting Permutations by Reversals through Branch and Price 135
Opportunities for Combinatorial Optimization in Computational Biology 134
Deriving compact extended formulations via LP-based separation techniques 133
CollHaps: a heuristic approach to haplotype inference by parsimony 132
A Column-Generation Based Branch-and-Bound Algorithm for Sorting By Reversals 127
A polynomial case of the parsimony haplotyping problem 127
Local search inequalities 127
Scheduling Jobs with Release Dates and Tails on Two Unrelated Parallel Machines to Minimize the Makespan 127
New modeling ideas for the exact solution of the closest string problem 127
Compact extended linear programming models 126
A unified integer programming model for genome rearrangement problems 125
GESTALT: GEnomic STeiner ALignmenTs 124
Optimal and Near-Optimal solutions for 3D Structure Comparisons 124
Structural alignment of large-size proteins via Lagrangian Relaxation 124
FASTSET: A Fast Data Structure for the Representation of Sets of Integers 123
An effective compact formulation of the max cut problem on sparse graphs 121
A set covering approach with column generation for parsimony haplotyping 120
Mathematical Models and Solutions for the Analysis of Human Genotypes 118
Haplotyping Populations by Pure Parsimony. Complexity, Exact and Approximation Algorithms 116
Haplotyping as Perfect Phylogeny: A Direct Approach 115
Algorithmic approaches for the single individual haplotyping problem 111
Experimental and statistical analysis of sorting by reversals 110
Banishing Bias from Consensus Sequences 110
Exact algorithms for minimum routing cost trees 107
Deriving compact extended formulations via LP-based separation techniques 107
Compact Optimization Can Outperform Separation: A Case Study in Structural Proteomics 104
Speeding-up the exploration of the 3-OPT neighborhood for the TSP 104
Application of Feature Selection and Classification to Computational Molecular Biology 104
Perfect Phylogeny Haplotyping 103
Haplotyping for disease association: a combinatorial approach 102
Polynomial and APX-hard cases of the individual haplotyping problem 102
Separating sets of strings by finding matching patterns is almost always hard 102
The string barcoding problem is NP-hard 101
Mathematical Programming in Computational Biology: An Annotated Bibliography 101
Flipping letters to minimize the support of a string 101
Algorithms and Data Structures for Next Generation Sequences 101
Ramsey Theory and integrality gap for the independent set problem 100
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques 96
Practical Algorithms and Fixed-Parameter Tractability of the Single Individual Haplotyping Problem 91
Algorithmic strategies for the SNPs haplotype assembly problem 90
Integer Programming models for computational biology problems 90
Flipping letters to minimize the support of a string 88
Perfect Phylogeny Haplotyping 88
A Polynomial-time Approximation Scheme for the Minimum Routing Cost Tree Problem 87
A time indexed model for Open Shop and Job Shop with three operations 83
Alberto Caprara (1968-2012): Scientific Contributions 81
Computing the equity of a poker hand by Integer Linear Programming 81
Toward Fully Automated Genotyping: Genotyping Microsatellite Markers by Deconvolution 80
SNPs Problems, Algorithms and Complexity 79
Fast Practical Solution of Sorting By Reversals 77
Logic Classification and Feature Selection for Biomedical Data 77
Speeding-up the dynamic programming procedure for the edit distance of two strings 77
Algorithmic Strategies in Combinatorial Chemistry 76
Using Tiny IP Formulations to Solve Max-Cut Instances 76
Compact vs Exponential-Size LP Relaxations 74
The phasing of heterozygous traits: algorithms and complexity 71
Compact formulations for large-scale LP problems 67
Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood 67
Integer Programming Models For Sorting Permutations And Genome Rearrangement Problems 62
A tabu search procedure for the TSP with time windows 61
Applications to Computational Molecular Biology 59
An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian 59
The approximability of the String-Barcoding problem 57
A compact optimization approach for jobshop problems 57
Compact formulations for large-scale LP problems 57
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology 55
Using Integer Programming to Search for Counterexamples: A Case Study 54
Scheduling teams for aircraft ground maintenance 54
NEW IDEAS TO SPEED-UP FLOYD-WARSHALL SHORTEST PATHS ALGORITHM 50
Combinatorial optimization problems in the study of human diversities 39
Finding the Best 3-{OPT} Move in Subcubic Time 38
Finding the largest triangle in a graph in expected quadratic time 37
Tiling binary matrices in haplotyping: Complexity, algorithms and models 36
Job Shop Scheduling With Deadlines 35
Haplotyping as perfect phylogeny 32
Packing 30
SNPs problems, complexity, and algorithms 28
Stable Sets 28
Scheduling 24
Cuts and Induced Bipartite Subgraphs 23
Trees 23
Computational complexity and ilp models for pattern problems in the logical analysis of data 22
General Techniques for Compact Formulations 22
Computational molecular biology 21
Polyhedra 21
Finding the best 2-OPT move on nearly random Euclidean TSP tours in average linear time 20
The Permutahedron 20
Large-Scale Linear Programming 17
Computational Biology Problems 16
An ILP Approach to Determine Smallest 4-Regular Nonhamiltonian, Nontraceable, and Nonhomogeneously Taceable Graphs 14
The Parity Polytope 14
A polynomial-time approximation scheme for minimum routing cost spanning trees 12
Totale 8.448
Salva come PNG Salva come JPEG
Categoria #
all - tutte 23.637
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 23.637
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019544 0 0 0 0 0 0 0 0 0 0 334 210
2019/20202.135 128 116 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/2024509 45 36 25 21 62 226 13 26 30 22 3 0
Totale 8.482