Giuseppe Lancia

67 papers A* 3A 1B 4C 1Misc 2Journal 45Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Average Case Subquadratic Exact and Heuristic Procedures for the Traveling Salesman 2-OPT Neighborhood.
INFORMS J. Comput.
Giuseppe Lancia, Paolo Vidoni
2025 J jnl
Speeding Up Floyd-Warshall's Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph.
Algorithms
Giuseppe Lancia, Marcello Dalpasso
2024 J jnl
Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood.
J. Heuristics
Giuseppe Lancia, Marcello Dalpasso
2024 J jnl
Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time.
CoRR
Giuseppe Lancia, Paolo Vidoni
2023 J jnl
Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood.
CoRR
Giuseppe Lancia, Marcello Dalpasso
2021 J jnl
Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data.
Algorithms
Giuseppe Lancia, Paolo Serafini
2020 J jnl
Finding the Best 3-OPT Move in Subcubic Time.
Algorithms
Giuseppe Lancia, Marcello Dalpasso
2020 J jnl
Finding the largest triangle in a graph in expected quadratic time.
Eur. J. Oper. Res.
Giuseppe Lancia, Paolo Vidoni
2020 J jnl
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP.
CoRR
Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley
2020 — conf
Using Integer Programming to Search for Counterexamples: A Case Study.
MOTOR
Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi
2019 J jnl
<tt>FASTSET</tt>: A Fast Data Structure for the Representation of Sets of Integers.
Algorithms
Giuseppe Lancia, Marcello Dalpasso
2019 — conf
Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings.
DEXA Workshops
Giuseppe Lancia, Marcello Dalpasso
2018 — conf
New Modeling Ideas for the Exact Solution of the Closest String Problem.
DEXA Workshops
Marcello Dalpasso, Giuseppe Lancia
2017 J jnl
Separating sets of strings by finding matching patterns is almost always hard.
Theor. Comput. Sci.
Giuseppe Lancia, Luke Mathieson, Pablo Moscato
2016 J jnl
Algorithmic approaches for the single individual haplotyping problem.
RAIRO Oper. Res.
Giuseppe Lancia
2016 J jnl
Deriving compact extended formulations via LP-based separation techniques.
Ann. Oper. Res.
Giuseppe Lancia, Paolo Serafini
2016 J jnl
Finding Patterns is Almost Always Hard.
CoRR
Giuseppe Lancia, Luke Mathieson, Pablo Moscato
2016 — ch.
Perfect Phylogeny Haplotyping.
Encyclopedia of Algorithms
Giuseppe Lancia
2016 — conf
The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets.
IWBBIO
Giuseppe Lancia, Paolo Serafini
2015 — conf
A Unified Integer Programming Model for Genome Rearrangement Problems.
IWBBIO (1)
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
2015 J jnl
Estimating the strength of poker hands by integer linear programming techniques.
Central Eur. J. Oper. Res.
Marcello Dalpasso, Giuseppe Lancia
2015 J jnl
Local search inequalities.
Discret. Optim.
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
2014 J jnl
Deriving compact extended formulations via LP-based separation techniques.
4OR
Giuseppe Lancia, Paolo Serafini
2014 J jnl
Ramsey theory and integrality gap for the independent set problem.
Oper. Res. Lett.
Robert D. Carr, Giuseppe Lancia
2011 J jnl
A time-indexed LP-based approach for min-sum job-shop problems.
Ann. Oper. Res.
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
2011 J jnl
An effective compact formulation of the max cut problem on sparse graphs.
Electron. Notes Discret. Math.
Giuseppe Lancia, Paolo Serafini
2010 J jnl
CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony.
IEEE ACM Trans. Comput. Biol. Bioinform.
Leonardo Tininini, Paola Bertolazzi, Alessandra Godi, Giuseppe Lancia
2010 Misc conf
Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms.
PSC
Giuseppe Lancia, Romeo Rizzi, Russell Schwartz
2009 J jnl
A Set-Covering Approach with Column Generation for Parsimony Haplotyping.
INFORMS J. Comput.
Giuseppe Lancia, Paolo Serafini
2008 J jnl
Flipping Letters to minimize the Support of a String.
Int. J. Found. Comput. Sci.
Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi
2008 J jnl
Haplotyping for Disease Association: A Combinatorial Approach.
IEEE ACM Trans. Comput. Biol. Bioinform.
Giuseppe Lancia, R. Ravi, Romeo Rizzi
2008 J jnl
Logic classification and feature selection for biomedical data.
Comput. Math. Appl.
Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia
2008 J jnl
Mathematical Programming in Computational Biology: an Annotated Bibliography.
Algorithms
Giuseppe Lancia
2008 — ch.
Perfect Phylogeny Haplotyping.
Encyclopedia of Algorithms
Giuseppe Lancia
2008 J jnl
The phasing of heterozygous traits: Algorithms and complexity.
Comput. Math. Appl.
Giuseppe Lancia
2007 J jnl
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface.
BMC Bioinform.
Alberto Apostolico, Raffaele Giancarlo, Concettina Guerra, Giuseppe Lancia
2006 J jnl
A polynomial case of the parsimony haplotyping problem.
Oper. Res. Lett.
Giuseppe Lancia, Romeo Rizzi
2006 Misc conf
Flipping letters to minimize the support of a string.
PSC
Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi
2006 J jnl
The approximability of the String Barcoding problem.
Algorithms Mol. Biol.
Giuseppe Lancia, Romeo Rizzi
2005 J jnl
Polynomial and APX-hard cases of the individual haplotyping problem.
Theor. Comput. Sci.
Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi
2005 — conf
The String Barcoding Problem is NP-Hard.
Comparative Genomics
Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi
2004 J jnl
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.
J. Comput. Biol.
Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz
2004 J jnl
Compact optimization can outperform separation: A case study in structural proteomics.
4OR
Robert D. Carr, Giuseppe Lancia
2004 J jnl
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
INFORMS J. Comput.
Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi
2004 J jnl
Integer Programming Models for Computational Biology Problems.
J. Comput. Sci. Technol.
Giuseppe Lancia
2004 J jnl
Opportunities for Combinatorial Optimization in Computational Biology.
INFORMS J. Comput.
Harvey J. Greenberg, William E. Hart, Giuseppe Lancia
2003 J jnl
Haplotyping as Perfect Phylogeny: A Direct Approach.
J. Comput. Biol.
Vineet Bafna, Dan Gusfield, Giuseppe Lancia, Shibu Yooseph
2003 — conf
Protein Structure Comparison: Algorithms and Applications.
Mathematical Methods for Protein Structure Analysis and Design
Giuseppe Lancia, Sorin Istrail
2002 J jnl
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem.
Briefings Bioinform.
Ross Lippert, Russell Schwartz, Giuseppe Lancia, Sorin Istrail
2002 J jnl
Compact vs. exponential-size LP relaxations.
Oper. Res. Lett.
Robert D. Carr, Giuseppe Lancia
2002 J jnl
Exact algorithms for minimum routing cost trees.
Networks
Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
2002 — conf
Optimal and Near - Optimal Solutions for 3D Structure Comparisons.
3DPVT
Alberto Caprara, Giuseppe Lancia
2002 C conf
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem.
WABI
Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia
2002 B conf
Structural alignment of large-size proteins via lagrangian relaxation.
RECOMB
Alberto Caprara, Giuseppe Lancia
2001 B conf
101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.
RECOMB
Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail
2001 A conf
SNPs Problems, Complexity, and Algorithms.
ESA
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz
2001 J jnl
Sorting Permutations by Reversals Through Branch-and-Price.
INFORMS J. Comput.
Alberto Caprara, Giuseppe Lancia, See-Kiong Ng
2000 A* conf
Algorithmic strategies in combinatorial chemistry.
SODA
Deborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz
2000 A* conf
Fast practical solution of sorting by reversals.
SODA
Alberto Caprara, Giuseppe Lancia, See-Kiong Ng
2000 J jnl
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan.
Eur. J. Oper. Res.
Giuseppe Lancia
1999 J jnl
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput.
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1999 B conf
GESTALT: Genomic Steiner Alignments.
CPM
Giuseppe Lancia, R. Ravi
1998 A* conf
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1998 — conf
A column-generation based branch-and-bound algorithm for sorting by reversals.
Mathematical Support for Molecular Biology
Alberto Caprara, Giuseppe Lancia, See-Kiong Ng
1998 J jnl
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques.
Discret. Appl. Math.
Giuseppe Lancia, Mark Perlin
1998 J jnl
Job Shop Scheduling With Deadlines.
J. Comb. Optim.
Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos
1997 B conf
Banishing Bias from Consensus Sequences.
CPM
Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi